Cod sursa(job #739687)
| Utilizator | Data | 23 aprilie 2012 18:19:58 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[801];
int N;
int rez;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int i,j,k;
f>>N;
for(i = 1; i <= N; i++) {
f>>v[i];
}
sort(v + 1, v + N + 1);
for(i = 1; i <= N; i++) {
for(j = i + 1; j <= N; j++) {
for(k = j + 1; k <= N; k++) {
if(v[i] + v[j] >= v[k]) {
rez++;
}
}
}
}
g<<rez;
}