Cod sursa(job #842144)
Utilizator | Data | 26 decembrie 2012 12:53:17 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<stdio.h>
FILE*A,*B;
long long unsigned j,n,v[810],k,aux,i,sol=0;
int main()
{
A=fopen("ntri.in","r");
B=fopen("ntri.out","w");
fscanf(A,"%llu",&n);
for(i=1;i<=n;i++)fscanf(A,"%llu",&v[i]);
for(i=1;i<=n-1;i++)
{
for(j=1+i;j<=n;j++){if(v[i]>=v[j]){aux=v[i];v[i]=v[j];v[j]=aux;}}
}
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
for(k=j+1;k<=n;k++)
{
if(v[i]+v[j]<v[k])k=n+1;
else sol++;
}
}
}
fprintf(B,"%llu",sol);fclose(A);fclose(B);
}