結果
問題 |
No.437 cwwゲーム
|
ユーザー |
![]() |
提出日時 | 2016-11-02 18:51:16 |
言語 | C90 (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 227 bytes |
コンパイル時間 | 120 ms |
コンパイル使用メモリ | 21,120 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-26 03:11:47 |
合計ジャッジ時間 | 1,409 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
コンパイルメッセージ
main.c:1:11: warning: return type defaults to ‘int’ [-Wimplicit-int] 1 | char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=++j];)for(;u>>j&s[i]!=s[j]&&s[++k];)u>>k&s[j]==s[k]&&(a=fmax(a,100*s[i]+11*s[j]-5328+f(u^1<<i^1<<j^1<<k)));return a;}x;main(){gets(s);x=!printf("%d",f(-1));} | ^ main.c: In function ‘f’: main.c:1:11: warning: type of ‘u’ defaults to ‘int’ [-Wimplicit-int] main.c:1:127: warning: implicit declaration of function ‘fmax’ [-Wimplicit-function-declaration] 1 | char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=++j];)for(;u>>j&s[i]!=s[j]&&s[++k];)u>>k&s[j]==s[k]&&(a=fmax(a,100*s[i]+11*s[j]-5328+f(u^1<<i^1<<j^1<<k)));return a;}x;main(){gets(s);x=!printf("%d",f(-1));} | ^~~~ main.c:1:1: note: include ‘<math.h>’ or provide a declaration of ‘fmax’ +++ |+#include <math.h> 1 | char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=++j];)for(;u>>j&s[i]!=s[j]&&s[++k];)u>>k&s[j]==s[k]&&(a=fmax(a,100*s[i]+11*s[j]-5328+f(u^1<<i^1<<j^1<<k)));return a;}x;main(){gets(s);x=!printf("%d",f(-1));} main.c:1:127: warning: incompatible implicit declaration of built-in function ‘fmax’ [-Wbuiltin-declaration-mismatch] 1 | char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=++j];)for(;u>>j&s[i]!=s[j]&&s[++k];)u>>k&s[j]==s[k]&&(a=fmax(a,100*s[i]+11*s[j]-5328+f(u^1<<i^1<<j^1<<k)));return a;}x;main(){gets(s);x=!printf("%d",f(-1));} | ^~~~ main.c:1:127: note: include ‘<math.h>’ or provide a declaration of ‘fmax’ main.c: At top level: main.c:1:188: warning: data definition has no type or storage class 1 | char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=
ソースコード
char s[9];f(u){int i=0,j,k,a=0;for(;s[j=i];++i)for(;u>>i&s[i]>48&&s[k=++j];)for(;u>>j&s[i]!=s[j]&&s[++k];)u>>k&s[j]==s[k]&&(a=fmax(a,100*s[i]+11*s[j]-5328+f(u^1<<i^1<<j^1<<k)));return a;}x;main(){gets(s);x=!printf("%d",f(-1));}