Cod sursa(job #2624450)
Utilizator | Data | 4 iunie 2020 20:52:35 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int n, v[801], s=0;
f>>n;
for(int i=0; i<n; i++)
f>>v[i];
sort(v,v+n);
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])
s++;
else break;
g<<s;
return 0;
}