Cod sursa(job #1610818)
Utilizator | Data | 23 februarie 2016 19:08:57 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,k,v[801],sol;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>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]) sol++;
else break;
g<<sol;
g.close();
return 0;
}