Cod sursa(job #2131639)
| Utilizator | Data | 14 februarie 2018 20:20:09 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n, a[805];
int main()
{
int i, j, k, cnt = 0;
fin >> n;
for( i = 1 ; i <= n ; i++)
fin >> a[i];
sort( a + 1 , a + n + 1);
for( i = 1 ; i <= n ; i++)
for( j = i + 1 ; j <= n ; j++)
for(k = j + 1 ; a[k] <= a[i] + a[j] && k <= n; k++)
cnt++;
fout << cnt;
return 0;
}
