Cod sursa(job #2670701)
Utilizator | Data | 10 noiembrie 2020 15:56:09 | |
---|---|---|---|
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,k,nr,a[801];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
sort(a+1,a+n+1);
for(int i=1;i<=n-2;i++)
{
k=i+2;
for(int j=i+1;j<=n-1;j++)
{
while(a[i]+a[j]>=a[k] && k<=n)
k++;
if (k>j)
nr+=k-j-1;
}
}
fout << nr <<'\n';
return 0;
}