Cod sursa(job #730374)
Utilizator | Data | 6 aprilie 2012 11:08:10 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int v[513],i,j,k,n,q;
int main ()
{
fstream fin("nrtri.in");
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin.close();
sort(v+1,v+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k])
q++;
else break;
ofstream fout("nrtri.out");
fout<<q;
fout.close();
return 0;
}