Cod sursa(job #1256489)
| Utilizator | Data | 6 noiembrie 2014 13:07:04 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector < int > v;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int a,nr,n;
int main()
{f>>n;
for(int i=0;i<n;i++){
f>>a;
v.push_back(a);
}
sort(v.begin(),v.end());
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
for(int w=j+1;w<n;w++){
if(v[i]+v[j]>=v[w]){nr++;}
}
}
}
g<<nr;
return 0;
}
