결과 (전체)

판정 세부 내용

케이스 #	소요시간	메모리	판정
001	0ms	454.656kB	OK
002	0ms	454.656kB	OK
003	0ms	454.656kB	OK
004	0ms	450.56kB	OK
005	0ms	454.656kB	OK
006	3ms	454.656kB	OK
007	5ms	450.56kB	OK
008	3ms	454.656kB	OK
009	4ms	458.752kB	OK
010	4ms	450.56kB	OK
011	25ms	454.656kB	OK
012	15ms	454.656kB	OK
013	10ms	454.656kB	OK
014	17ms	450.56kB	OK
015	18ms	454.656kB	OK
016	15ms	458.752kB	OK
017	14ms	454.656kB	OK
018	14ms	454.656kB	OK
019	16ms	450.56kB	OK
020	16ms	454.656kB	OK

컴파일 결과

	1:1: warning: data definition has no type or storage class
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:1: warning: type defaults to 'int' in declaration of 'i' [-Wimplicit-int]
	1:3: warning: type defaults to 'int' in declaration of 'p' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:5: warning: type defaults to 'int' in declaration of 't' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:7: warning: type defaults to 'int' in declaration of 'w' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:11: warning: type defaults to 'int' in declaration of 'd' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:19: warning: type defaults to 'int' in declaration of 'l' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:27: warning: type defaults to 'int' in declaration of 'r' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:35: warning: return type defaults to 'int' [-Wimplicit-int]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	In function 'main':
	1:35: warning: type of 'k' defaults to 'int' [-Wimplicit-int]
	1:35: warning: type of 'n' defaults to 'int' [-Wimplicit-int]
	1:53: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:53: warning: incompatible implicit declaration of built-in function 'scanf'
	1:53: note: include '<stdio.h>' or provide a declaration of 'scanf'
	1:178: warning: suggest parentheses around comparison in operand of '\|' [-Wparentheses]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:296: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
	(r[i]=p,0))scanf("%d%d",&p,d+i); for(; w<n; t++) { for(; !(l[w]>r[w+1]\|r[w]<l[w+1]);)w++; for(i=0; i++<n;)d[i]?l[i]--,r[i]--,d[i]=!!l[i]:(l[i]++,r[i]++,d[i]=r[i]/k); } printf("%d",t-(n>1));}
	1:296: warning: incompatible implicit declaration of built-in function 'printf'
	1:296: note: include '<stdio.h>' or provide a declaration of 'printf'

소스 정적 분석 결과

1: (style) Boolean result is used in bitwise operation. Clarify expression with parentheses.

LOGIN