Pagini recente » Borderou de evaluare (job #718022) | Borderou de evaluare (job #2372035) | Borderou de evaluare (job #1236492) | Borderou de evaluare (job #3210056) | Borderou de evaluare (job #2025062)
Borderou de evaluare (job #2025062)
Raport evaluator
Compilare:
user.c:2:55: warning: return type defaults to ‘int’ [enabled by default]
FILE *IN,*OUT;short N,p,l;unsigned char a[212],b[212];main(){IN=fopen("nunta.in","r");OUT=fopen("nunta.out","w");fscanf(IN,"%hd",&N);b[0]=2,b[2]=1;while(N){N--;a[0]=l=b[0];b[0]=2;while(b[0]<=l){p=b[b[0]];b[b[0]]+=a[b[0]];a[b[0]]=p;b[b[0]]+=b[b[0]-1]/10;b[b[0]-1]%=10;if(b[0]==l&&b[b[0]]>9)l++;b[0]++;}b[0]=l;}while(b[0]>1)fprintf(OUT,"%d",b[b[0]]),b[0]--;}
^
user.c: In function ‘main’:
user.c:2:120: warning: ignoring return value of ‘fscanf’, declared with attribute warn_unused_result [-Wunused-result]
FILE *IN,*OUT;short N,p,l;unsigned char a[212],b[212];main(){IN=fopen("nunta.in","r");OUT=fopen("nunta.out","w");fscanf(IN,"%hd",&N);b[0]=2,b[2]=1;while(N){N--;a[0]=l=b[0];b[0]=2;while(b[0]<=l){p=b[b[0]];b[b[0]]+=a[b[0]];a[b[0]]=p;b[b[0]]+=b[b[0]-1]/10;b[b[0]-1]%=10;if(b[0]==l&&b[b[0]]>9)l++;b[0]++;}b[0]=l;}while(b[0]>1)fprintf(OUT,"%d",b[b[0]]),b[0]--;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | Depăşit | Memory limit exceeded. | 0 |
2 | 0ms | 256kb | OK | 10 |
3 | 0ms | 256kb | OK | 10 |
4 | 0ms | Depăşit | Memory limit exceeded. | 0 |
5 | 0ms | Depăşit | Memory limit exceeded. | 0 |
6 | 0ms | 252kb | OK | 10 |
7 | 0ms | 252kb | OK | 10 |
8 | 0ms | Depăşit | Memory limit exceeded. | 0 |
9 | 0ms | 256kb | OK | 10 |
10 | 0ms | 256kb | OK | 10 |
Punctaj total | 60 |