Cod sursa(job #1064090)
Utilizator | Data | 21 decembrie 2013 14:51:54 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,a[801],k;
int main()
{ int i,j,c;
f>>n;
k=0;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
for(c=j+1;c<=n;c++)
if(a[i]+a[j]>=a[c])
k++;
g<<k;
return 0;
}