Cod sursa(job #2208780)
Utilizator | Data | 31 mai 2018 15:20:05 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,v[1000],j,k,sol;
int main()
{
f>>n;
for(i=1;i<=n;++i) f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;++i)
for(j=i+1;j<n;++j)
for(k=j+1;k<=n && v[i]+v[j]>=v[k];++k)
sol++;
g<<sol<<'\n';
return 0;
}