Cod sursa(job #821657)
Utilizator | Data | 22 noiembrie 2012 16:15:53 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int a[1000],n,i,j,k,nr;
int main()
{
ifstream f("ntri.in");
ofstream g("ntri.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
for(k=j+1;k<=n&&a[i]+a[j]>a[k];k++)
nr++;
g<<nr;
return 0;
}