Cod sursa(job #715430)
| Utilizator | Data | 17 martie 2012 11:12:10 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int a[803];
int main()
{
int n,i,j,k,sol=0;
fin>>n;
for(i=0;i<n;i++)
fin>>a[i];
sort(a,a+n);
for(i=0;i<n-2;i++)
{
for(j=i+1;j<n-1;j++)
{
for(k=j+1;k<n;k++)
if(a[i]+a[j]>=a[k])
{
sol++;
}
else
{
k=n;
}
}
}
fout<<sol;
fin.close();
fout.close();
return 0;
}
