Cod sursa(job #1927934)
Utilizator | Data | 15 martie 2017 18:44:02 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in"); ofstream g("nrtri.out");
int n,a[10001],j,i,l,nr;
int main() {
f>>n;
for(i = 1; i <= n; ++i) {
f>>a[i];
}
sort(a+1,a+n+1);
nr = 0;
for(i = 1; i <= n; ++i) {
for(j = i+1; j <= n; ++j) {
for(l = j+1; l <= n && a[i] + a[j] >= a[l]; ++l) {
++nr;
}
}
}
g<<nr;
return 0;
}