Cod sursa(job #1145291)
Utilizator | Data | 18 martie 2014 08:38:58 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,v[801],nrt,j=3;
int main(){
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<n-1;++i){
j=i+2;
while(v[j]<=v[i]+v[i+1] && j<=n){
nrt++;
j++;
}
}
g<<nrt<<'\n';
g.close();
return 0;
}