Cod sursa(job #1742960)
| Utilizator | Data | 17 august 2016 13:06:41 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n,i,a[800],y,j,nr=0;
fin >>n;
for (i=1;i<=n;++i){
fin>>a[i];
}
sort(a,a+n);
for (i=1;i<=n-2;i++){
for (j=i+1;j<=n-1;j++){
for (y=j+1;y<=n;y++){
if (a[i]+a[j]>=a[y])
nr++;
else
break;
}
}
}
fout << nr;
return 0;
}
