Cod sursa(job #1059459)
Utilizator | Data | 16 decembrie 2013 18:40:44 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[1005];
int nrtri(int v[],int n){
int nr=0;
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++;
else
break;
}
}
}
return nr;
}
int main()
{
int n;
f>>n;
for(int i=0;i<n;++i)
f >>v[i];
sort(v,v+n);
g <<nrtri(v,n);
return 0;
}