Cod sursa(job #574841)
Utilizator | FMI - GabrielG GaborGabriel | Data | 7 aprilie 2011 16:46:32 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 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,vs[1000005],i,j,k;;
void vector_sume()
{
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
vs[++nn]=v[i]+v[j];
if(j<n)
{
k=j+1;
while(k<=n)
if(v[k++]<=vs[nn]) general++;
}
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
vector_sume();
g<<general<<'\n';
f.close();
g.close();
return 0;
}