Cod sursa(job #2512602)
| Utilizator | Data | 21 decembrie 2019 12:13:37 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long int lat[801];
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
long long int nr,x,y,z,i1,i2,i3,i,k=0;
int main()
{
fin>>nr;
for(i=1;i<=nr;i++)fin>>lat[i];
sort(lat+1, lat+1+nr);
for(i1=1;i1<=nr;i1++){
x=lat[i1];
y=lat[i1+1];
for(i2=i1+2;i2<=nr;i2++){
z=lat[i2];
if(x+y>=z) k++;
}
}
fout<<k;
return 0;
}
