Cod sursa(job #2612339)
| Utilizator | Data | 8 mai 2020 21:10:58 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n, v[805];
fin>>n;
for (int i=0; i<n; i++) {
fin>>v[i];
}
sort(v,v+n);
int rez=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[i]+v[j] >= v[k])
rez++;
else
break;
}
}
}
fout<<rez;
fin.close();
fout.close();
return 0;
}
