Cod sursa(job #736005)
| Utilizator |  Dancu Laurentiu aka laue |
Data | 17 aprilie 2012 17:59:05 |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int v[801],n,i,nr,k,j;
int main()
{
ifstream f("nrtri.in");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
sort(v+1,v+n+1);
for(i=1;i<n;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k])
nr++;
else break;
ofstream g("nrtri.out");
g<<nr;
g.close();
return 0;
}