Cod sursa(job #717288)
Utilizator | Data | 19 martie 2012 19:59:59 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[802],n;
long long nr;
int main (){
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+1+n);
for(int i=1;i<=n-2;i++)
for(int j=i+1;j<=n-1;j++)
for(int k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k])
nr++;
g<<nr<<"\n";
return 0;
}