Cod sursa(job #2757785)
| Utilizator | Data | 6 iunie 2021 15:05:14 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[801];
int main()
{
ifstream cin ("nrtri.in");
ofstream cout ("nrtri.out");
int n, s, cnt=0;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
}
sort(v+1, v+n+1);
for(int i=1; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
s=v[i]+v[j];
for(int k=j+1; k<=n; k++)
{
if(s>=v[k])
cnt++;
else
break;
}
}
}
cout<<cnt;
return 0;
}
