Cod sursa(job #2624043)
Utilizator | Data | 4 iunie 2020 13:54:17 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,v[100],i,j,k,nr;
int main()
{
fin>>n;
for(i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
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;
fout<<nr;
return 0;
}