Cod sursa(job #1523275)
| Utilizator | Data | 12 noiembrie 2015 15:55:28 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int n;
in >>n;
int v[1000];
for(int i = 0 ; i <n ; i++)
in>> v[i];
sort(v,v+n);
int nr = 0;
for(int i = 0 ; i < n-2 ; i++)
for(int j = i+1 ; j <n-1 ; j ++)
for(int k = j+1 ; k < n ; k ++)
if( v[k]<= v[i]+v[j])
nr++;
out<<nr;
return 0;
}
