메뉴 건너뛰기

결과 (전체)

96nh1 잠수함 식별 / tlsdydaud1

시간메모리제출올바른 답비율
1초64MB4011
27.5%
이번 횟수이번 판정시도한 사람성공한 사람비율
1 올바른 답 118
72.7%
판정 세부 내용
케이스 # 소요시간 메모리 판정
0010ms450.56kBOK
0020ms454.656kBOK
0030ms454.656kBOK
0040ms450.56kBOK
0050ms458.752kBOK
0060ms458.752kBOK
0070ms450.56kBOK
0080ms450.56kBOK
0090ms454.656kBOK
0100ms454.656kBOK

컴파일 결과
1:1: warning: data definition has no type or storage class
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
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]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
1:17: warning: return type defaults to 'int' [-Wimplicit-int]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
In function 'main':
1:17: warning: type of 'j' defaults to 'int' [-Wimplicit-int]
1:33: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
1:33: warning: incompatible implicit declaration of built-in function 'scanf'
1:33: note: include '<stdio.h>' or provide a declaration of 'scanf'
1:156: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
1:248: warning: the omitted middle operand in ?: will always be 'true', suggest explicit middle operand [-Wparentheses]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
1:268: warning: implicit declaration of function 'puts' [-Wimplicit-function-declaration]
(p=1),i+=2; else { for(j=i+1; s[j]==48;)j++; j>i+2&s[j]?:(p=1); for(i=j; s[i]%2;)i++; i-=s[i+1]==48; i>j?:(p=1); } puts(p?"NOISE":"SUBMARINE");}
소스 정적 분석 결과
1: (style) Boolean result is used in bitwise operation. Clarify expression with parentheses.
1: (warning) scanf() without field width limits can crash with huge input data.
1: (style) Clarify calculation precedence for '%' and '?'.
위로