Cod sursa(job #654245)
Utilizator | Data | 29 decembrie 2011 22:38:57 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int i,n,a[805],j,t,s;
int main()
{
f>>n;
for(i=1; i<=n; i++)f>>a[i];
sort(a+1,a+n+1);
for(i=1; i<=n-2; i++)
for(j=i+1; j<=n-1; j++)
for(t=j+1; t<=n; t++)
if (a[i]+a[j]>=a[t]) s++;
g<<s;
f.close();
g.close();
return 0;
}