Cod sursa(job #1334288)
| Utilizator | Data | 4 februarie 2015 10:29:11 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n;
int a[802];
int main()
{
fin >> n;
for ( int i = 1; i <= n; ++i )
fin >> a[i];
sort( a + 1, a + n + 1 );
int nr = 0;
for ( int i = 1; i <= n - 2; ++i )
for ( int j = i + 1; j <= n - 1; ++j )
{
int k = j + 1;
while( a[i] + a[j] >= a[k] && k <= n )
++k;
nr += k - j - 1;
}
fout << nr;
fin.close();
fout.close();
return 0;
}
