Cod sursa(job #372691)
Utilizator | Data | 11 decembrie 2009 12:27:22 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<algorithm>
#define maxn 805
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int a[maxn],i,n,j,step,k,p;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n;++i,k=0)
for(j=i+1;j<n;++j)
{
while(k<n&&a[i]+a[j]>=a[k+1])
++k;
p+=k-j;
}
g<<p<<"\n";
f.close();
g.close();
return 0;
}