Cod sursa(job #2338650)
Utilizator | Data | 7 februarie 2019 17:55:10 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("nrtri.in");
ofstream out ("nrtri.out");
int v[801],n;
int main()
{
int contor=0,i,j,m;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
for(m=j+1;m<=n;m++)
{
if(v[m]<=v[i]+v[j])
contor++;
else
break;
}
out<<contor;
return 0;
}