Cod sursa(job #630393)
Utilizator | Data | 5 noiembrie 2011 14:59:43 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
ifstream f("nrtri.in");
ofstream g("nrtri.out");
using namespace std;
int main()
{
int n,v[805],i,j,k;
f>>n;
for (int i=0; i<n; ++i)
f>>v+i;
long long nr=0;
for ( i=0; i<n-2; ++i)
for ( j=i+1; j<n-1; ++j)
for( k=j+1; k<n; ++k)
if (v[i]+v[j]>=v[k] && v[i]+v[k]>=v[j] && v[j]+v[k]>=v[i])
nr++;
g<<nr;
return 0;
}