Cod sursa(job #1527165)
Utilizator | Data | 17 noiembrie 2015 21:36:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int v[800],i,n,j,k,g;
int main()
{
in>>n;
for(i=0; i<n; i++)
in>>v[i];
sort(v,v+n);
for(i=0; i<n-2; i++)
for(j=i+1; j<n-1; j++)
for(g=j+1; g<n; g++)
if(v[i]+v[j]>=v[g])
k++;
else
break;
out<<k;
return 0;
}