Cod sursa(job #2301943)
| Utilizator | Data | 13 decembrie 2018 17:53:07 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[800];
int main()
{
int n,a,cnt=0;
cin >> n;
for(int i=0; i<n; i++)
{
cin >> a;
v[i]=a;
}
sort(v,v+n);
for(int m=0; m<n; m++)
{
for(int k=m+1; k<n; k++)
{
for(int p=k+1; p<n; p++)
{
if(v[p]<=v[m]+v[k])
cnt++;
}
}
}
cout << cnt;
return 0;
}
