Cod sursa(job #2497250)
| Utilizator | Data | 22 noiembrie 2019 12:02:37 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[801];
int main() {
int n, i, j, k, cont=0, sum, lat;
f>>n;
for (i=1; i<=n; i++){
f>>v[i];
}
sort (v+1, v+n+1);
for (i=1; i<=n-2; i++){
for (j=i+1; j<=n-1; j++){
for (k=j+1; k<=n; k++) {
sum=v[i]+v[j];
lat=v[k];
if (sum>=lat){
cont++;
}
else{
break;
}
}
}
}
g<<cont;
return 0;
}
