Cod sursa(job #2658693)
Utilizator | Data | 14 octombrie 2020 20:09:23 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,k,sum,a[801];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a[i];
}
sort(a+1,+a+n+1);
for(i=1; i<=n-2; i++)
{k=i+2;
for(j=i+1; j<=n-1; j++)
{
while(a[i]+a[j]>=a[k] && k<=n)
k++;
if (k>j)
sum+=k-j-1;
}
}
fout<<sum<<'\n';
return 0;
}