Cod sursa(job #574857)
Utilizator | Data | 7 aprilie 2011 17:05:40 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream.h>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,v[100005],nn=0,general=0,i,j,k;
void vector_sume()
{
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
{
k=j+1;
while(k<=n)
if(v[k++] <= (v[i]+v[j]))
general++;
}
g<<general<<'\n';
f.close();
g.close();
return 0;
}