Cod sursa(job #1231162)
Utilizator | Data | 19 septembrie 2014 19:17:33 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,a[801],i,q,j,s;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
sort(a+1,a+1+n);
for(i=n;i>=3;i--)
{
for(j=i-1;j>=2;j--)
for(q=j-1;q>=1;q--)
{
if(a[i]>=a[j]+a[q]) s++;
}
}
g<<s-1;
return 0;
}