Cod sursa(job #751153)
| Utilizator | Data | 24 mai 2012 17:56:01 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000],cnt;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,k;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{ for(j=i+1;j<=n-1;j++)
{ for(k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k]) cnt++;
}
}
g<<cnt;
f.close();
g.close();
return 0;
}