Cod sursa(job #854568)
Utilizator | Data | 13 ianuarie 2013 19:02:10 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,x,a[801],i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n-1 && i<n-1;i++)
for(j=i+1;j<n && j<n;j++)
for(k=j+1;j<=n && k<=n;k++)
if(a[k]-a[j]<=a[i])
x++;
else
break;
g<<x;
return 0;
}