Mai intai trebuie sa te autentifici.
Cod sursa(job #413490)
| Utilizator | Data | 8 martie 2010 17:41:57 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
#define NMax 80100
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int V[NMax],i,n,rez,j,k;
bool cmp(int i, int j)
{
return j>i;
}
int main()
{
fin>>n;
for(i=0;i<n;i++)
fin>>V[i];
sort(V,V+n,cmp);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
k=j+1;
while(V[i]+V[j]>=V[k] && k<n)
k++;
if(V[i]+V[j]>=V[j+1])
rez+=k-j-1;
}
fout<<rez;
return 0;
}
