Cod sursa(job #1741229)
Utilizator | Data | 13 august 2016 13:14:47 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,y,nr,a[802];
int main()
{
fin >> n;
for (i=1;i<=n;i++)
fin >> a[i];
sort (a+1,a+n+1);
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;
}