Afişează mesaje
Pagini: [1]
1  infoarena - concursuri, probleme, evaluator, articole / Arhiva educationala / Răspuns: 028 Sortare prin comparare : Iunie 26, 2010, 09:45:40
Cod:
#include<stdio.h>
long n,j,i,aux,v[50001];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;i++)
scanf("%ld",&v[i]);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[j]<v[i])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for(i=1;i<=n;i++)
printf("%ld ",v[i]);
return 0;
}

 Read This! Imi da TLE-uri cam pe jumatate din teste!Nu inteleg de ce.... sad wink
2  infoarena - concursuri, probleme, evaluator, articole / Arhiva de probleme / Răspuns: 484 Numere 5 : Iunie 22, 2010, 14:54:56
 Brick wall Brick wall
Cod:
#include<stdio.h>
int main()
{int n,i,j;
freopen("numere5.in","r",stdin);
freopen("numere5.out","w",stdout);
scanf("%d",&n);
n=n*n;
char v[500001];
for(i=1;i<=n;i++)
{scanf("%d",&j);
if(j<=500000)
v[j]='1';}
if(500000<n)
n=500000;
for(i=1;i<=n;i++)
if(v[i]!='1')
{printf("%d ",i);
i=n+1;}
for(j=n;j>=1;j--)
if(v[j]!='1')
{
printf("%d",j);
j=0;
}
return 0;}

ce e gresit la sursa asta???imi da la 2 teste memory limit exeeded

Editat de admin: Foloseste tagul "code" atunci cand postezi surse.
Pagini: [1]
Powered by SMF 1.1.19 | SMF © 2006-2013, Simple Machines