Cod sursa(job #1427036)
| Utilizator | Data | 1 mai 2015 13:08:15 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
/*int calcul()
{
int i,j,k,nr=0;
for(i=0;i<n-2;i++)
{
for(j=i+1,k=i+2;j<n-1;j++)
{
while(k<n && v[i]+v[j]>=v[k]) k++;
nr+=k-j-1;
}
}
return nr;
}*/
int main()
{
int n,i,j,k,nr=0;
in>>n;
int v[n];
for(i=0;i<n;i++) in>>v[i];
sort(v,v+n);
for(i=0;i<n-2;i++)
{
for(j=i+1,k=i+2;j<n-1;j++)
{
while(k<n && v[i]+v[j]>=v[k]) k++;
nr+=k-j-1;
}
}
out<<nr;
return 0;
}
