Pagini recente »
Borderou de evaluare (job #544603)
|
Borderou de evaluare (job #238337)
|
Clasament 7bb
|
Borderou de evaluare (job #389571)
|
Borderou de evaluare (job #720113)
Borderou de evaluare (job #720113)
Raport evaluator
Compilare:
main.c: In function 'main':
main.c:3:170: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
3 | FILE*fin;FILE*fout;int v[100001];int main(){fin = fopen("ciocolata.in","r");fout = fopen("ciocolata.out","w");int a,c,n,i,max=0,dusc,dif,j,min = 2000000;long long si,sm;fscanf(fin,"%d%d",&c,&n);if(c == 1){for(i = 0; i < n ;i++){fscanf(fin,"%d",&a);v[a]++;if(v[a] > max){max = v[a];dusc = a;}}fprintf(fout,"%d",dusc);}else if(c == 2){for(i = 0; i < n;i++)fscanf(fin,"%d",&v[i]);si = 0;sm = 0;j = n;for(i = 0; i < n ;i++){si += v[i];while(sm <= si && j >= i){sm+=v[j];j--;}j++;sm -= v[j];dif = si-sm;if(dif < min && sm != 0){min = dif;}}fprintf(fout,"%d",min);}return 0;}
| ^~~~~~~~~~~~~~~~~~~~~~~~
main.c:3:229: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
3 | FILE*fin;FILE*fout;int v[100001];int main(){fin = fopen("ciocolata.in","r");fout = fopen("ciocolata.out","w");int a,c,n,i,max=0,dusc,dif,j,min = 2000000;long long si,sm;fscanf(fin,"%d%d",&c,&n);if(c == 1){for(i = 0; i < n ;i++){fscanf(fin,"%d",&a);v[a]++;if(v[a] > max){max = v[a];dusc = a;}}fprintf(fout,"%d",dusc);}else if(c == 2){for(i = 0; i < n;i++)fscanf(fin,"%d",&v[i]);si = 0;sm = 0;j = n;for(i = 0; i < n ;i++){si += v[i];while(sm <= si && j >= i){sm+=v[j];j--;}j++;sm -= v[j];dif = si-sm;if(dif < min && sm != 0){min = dif;}}fprintf(fout,"%d",min);}return 0;}
| ^~~~~~~~~~~~~~~~~~~
main.c:3:355: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
3 | FILE*fin;FILE*fout;int v[100001];int main(){fin = fopen("ciocolata.in","r");fout = fopen("ciocolata.out","w");int a,c,n,i,max=0,dusc,dif,j,min = 2000000;long long si,sm;fscanf(fin,"%d%d",&c,&n);if(c == 1){for(i = 0; i < n ;i++){fscanf(fin,"%d",&a);v[a]++;if(v[a] > max){max = v[a];dusc = a;}}fprintf(fout,"%d",dusc);}else if(c == 2){for(i = 0; i < n;i++)fscanf(fin,"%d",&v[i]);si = 0;sm = 0;j = n;for(i = 0; i < n ;i++){si += v[i];while(sm <= si && j >= i){sm+=v[j];j--;}j++;sm -= v[j];dif = si-sm;if(dif < min && sm != 0){min = dif;}}fprintf(fout,"%d",min);}return 0;}
| ^~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/stdio.h:906,
from main.c:1:
In function 'fprintf',
inlined from 'main' at main.c:3:293:
/usr/include/bits/stdio2.h:79:10: warning: 'dusc' may be used uninitialized [-Wmaybe-uninitialized]
79 | return __fprintf_chk (__stream, __USE_FORTIFY_LEVEL - 1, __fmt,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
80 | __va_arg_pack ());
| ~~~~~~~~~~~~~~~~~
main.c: In function 'main':
main.c:3:129: note: 'dusc' was declared here
3 | FILE*fin;FILE*fout;int v[100001];int main(){fin = fopen("ciocolata.in","r");fout = fopen("ciocolata.out","w");int a,c,n,i,max=0,dusc,dif,j,min = 2000000;long long si,sm;fscanf(fin,"%d%d",&c,&n);if(c == 1){for(i = 0; i < n ;i++){fscanf(fin,"%d",&a);v[a]++;if(v[a] > max){max = v[a];dusc = a;}}fprintf(fout,"%d",dusc);}else if(c == 2){for(i = 0; i < n;i++)fscanf(fin,"%d",&v[i]);si = 0;sm = 0;j = n;for(i = 0; i < n ;i++){si += v[i];while(sm <= si && j >= i){sm+=v[j];j--;}j++;sm -= v[j];dif = si-sm;if(dif < min && sm != 0){min = dif;}}fprintf(fout,"%d",min);}return 0;}
| ^~~~
Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
1
|
1 ms
|
245 kb
|
OK
|
5
|
2
|
1 ms
|
245 kb
|
OK
|
5
|
3
|
1 ms
|
245 kb
|
OK
|
5
|
4
|
19 ms
|
245 kb
|
OK
|
5
|
5
|
59 ms
|
245 kb
|
OK
|
5
|
6
|
59 ms
|
249 kb
|
OK
|
5
|
7
|
1 ms
|
245 kb
|
OK
|
3
|
8
|
1 ms
|
245 kb
|
OK
|
3
|
9
|
1 ms
|
245 kb
|
OK
|
4
|
10
|
1 ms
|
245 kb
|
OK
|
4
|
11
|
1 ms
|
245 kb
|
OK
|
4
|
12
|
1 ms
|
245 kb
|
OK
|
4
|
13
|
1 ms
|
245 kb
|
OK
|
4
|
14
|
1 ms
|
245 kb
|
OK
|
4
|
15
|
2 ms
|
245 kb
|
OK
|
5
|
16
|
19 ms
|
245 kb
|
OK
|
5
|
17
|
9 ms
|
249 kb
|
OK
|
5
|
18
|
19 ms
|
249 kb
|
OK
|
5
|
19
|
39 ms
|
512 kb
|
OK
|
5
|
20
|
59 ms
|
507 kb
|
OK
|
5
|
21
|
59 ms
|
512 kb
|
OK
|
5
|
22
|
1 ms
|
245 kb
|
OK
|
2
|
23
|
2 ms
|
245 kb
|
OK
|
3
|
Punctaj total
|
100
|