Cod sursa(job #2623053)
Utilizator | Data | 2 iunie 2020 15:36:28 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, v[801], i, j, k, nr = 0;
int main()
{
f>>n;
for(i=0;i<n;i++)
f>>v[i];
sort(v,v+n);
for(i=0;i<n;i++)
cout<<v[i]<<" ";
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
for(k=j+1;k<n;k++)
if((v[i] + v[j]) >= v[k])
nr ++;
else
break;
g<<nr;
}