Cod sursa(job #1044406)
Utilizator | Corujan Darius corujandarius | Data | 29 noiembrie 2013 19:52:48 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int main()
{
int i,j,a[810],z,n,s=0;
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(z=j+1;z<=n;z++)
if(a[i]+a[j]>=a[z])
s++;
else break;
fout<<s;
fin.close();
fout.close();
return 0;
}