Cod sursa(job #2514893)
Utilizator | Data | 27 decembrie 2019 11:47:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include<algorithm>
using namespace std;
int main()
{ ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[1000],j,i,z,n,cnt=0,o=0;
cin>>n;
for(i=0;i<n;i++)
cin>>v[i];
sort(v,v+n);
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++){
o=0;
for(z=j+1;z<n && o==0;z++){
if(v[i]+v[j]>=v[z])
cnt++;
else
o=-1;}}
cout<<cnt;
return 0;
}