Cod sursa(job #372141)
| Utilizator | Data | 8 decembrie 2009 22:37:20 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
#include <algorithm.h>
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[801],i,j,ok,k,ko;
int main()
{ f>>n;
for(i=1;i<=n;i++)f>>v[i];
sort(v+1,v+n+1);
reverse(v+1,v+n+1);
for(i=1;i<n-1;i++)for(j=i+1;j<n;j++) { ko=v[i]-v[j];
k=j+1;
while(v[k++]>=ko&&k-1<=n)ok++;
}
g<<ok;
f.close();
g.close();
return 0;
}
