Cod sursa(job #3197892)
Utilizator | Iusin Dabu Iustagan | Data | 27 ianuarie 2024 17:09:49 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
long long int v[801];
int main()
{
int n,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-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])
cnt+=1;
else
break;
}
cout<<cnt;
}