結果
| 問題 | No.8042 本棚 |
| コンテスト | |
| ユーザー |
👑 tails
|
| 提出日時 | 2019-04-02 00:44:32 |
| 言語 | C11(gcc12 gnu拡張) (gcc 12.4.0) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 93 bytes |
| 記録 | |
| コンパイル時間 | 111 ms |
| コンパイル使用メモリ | 28,740 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2026-03-10 23:39:03 |
| 合計ジャッジ時間 | 2,100 ms |
|
ジャッジサーバーID (参考情報) |
judge3_0 / judge2_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^~~~~~
main.c:1:1: warning: type defaults to ‘int’ in declaration of ‘strcmp’ [-Wimplicit-int]
main.c:1:10: warning: data definition has no type or storage class
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^
main.c:1:10: warning: type defaults to ‘int’ in declaration of ‘s’ [-Wimplicit-int]
main.c:1:19: warning: data definition has no type or storage class
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^
main.c:1:19: warning: type defaults to ‘int’ in declaration of ‘i’ [-Wimplicit-int]
main.c:1:21: warning: return type defaults to ‘int’ [-Wimplicit-int]
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^~~~
main.c: In function ‘main’:
main.c:1:21: warning: type of ‘j’ defaults to ‘int’ [-Wimplicit-int]
main.c:1:34: warning: implicit declaration of function ‘gets’ [-Wimplicit-function-declaration]
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^~~~
main.c:1:54: warning: implicit declaration of function ‘qsort’ [-Wimplicit-function-declaration]
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^~~~~
main.c:1:80: warning: implicit declaration of function ‘puts’ [-Wimplicit-function-declaration]
1 | strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
| ^~~~
main.c:1:1: note: inclu
ソースコード
strcmp();s[51][9];i;main(j){for(;gets(s[i]);)i++;for(qsort(s,i,36,strcmp);j<i;)puts(s[j++]);}
tails