Cod sursa(job #842176)
Utilizator | Constantinescu Emil emyll96 | Data | 26 decembrie 2012 13:25:27 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
#include<algorithm>
using namespace std; int v[999],n,i,q,k,j; int main() { ifstream fin("nrtri.in"); fin>>n; for(i=1;i<=n;i++) fin>>v[i]; 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; return 0; }