結果
問題 | No.281 門松と魔法(1) |
ユーザー | NTstu |
提出日時 | 2016-06-14 18:58:53 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 782 bytes |
コンパイル時間 | 181 ms |
コンパイル使用メモリ | 30,464 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-06 19:56:27 |
合計ジャッジ時間 | 1,583 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 0 ms
6,816 KB |
testcase_01 | AC | 0 ms
6,820 KB |
testcase_02 | WA | - |
testcase_03 | AC | 1 ms
6,816 KB |
testcase_04 | AC | 1 ms
6,820 KB |
testcase_05 | AC | 1 ms
6,816 KB |
testcase_06 | AC | 0 ms
6,816 KB |
testcase_07 | AC | 1 ms
6,820 KB |
testcase_08 | AC | 0 ms
6,816 KB |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | AC | 0 ms
6,820 KB |
testcase_11 | AC | 1 ms
6,816 KB |
testcase_12 | AC | 1 ms
6,820 KB |
testcase_13 | AC | 1 ms
6,816 KB |
testcase_14 | AC | 1 ms
6,816 KB |
testcase_15 | AC | 0 ms
6,820 KB |
testcase_16 | AC | 0 ms
6,816 KB |
testcase_17 | AC | 1 ms
6,816 KB |
testcase_18 | AC | 1 ms
6,816 KB |
testcase_19 | AC | 1 ms
6,816 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 0 ms
6,816 KB |
testcase_23 | AC | 1 ms
6,820 KB |
testcase_24 | AC | 1 ms
6,816 KB |
testcase_25 | WA | - |
testcase_26 | AC | 0 ms
6,820 KB |
testcase_27 | AC | 1 ms
6,820 KB |
testcase_28 | AC | 1 ms
6,816 KB |
testcase_29 | AC | 1 ms
6,820 KB |
testcase_30 | WA | - |
testcase_31 | AC | 1 ms
6,816 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 1 ms
6,816 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 0 ms
6,820 KB |
testcase_44 | AC | 1 ms
6,820 KB |
testcase_45 | AC | 1 ms
6,816 KB |
testcase_46 | AC | 1 ms
6,820 KB |
testcase_47 | AC | 1 ms
6,816 KB |
testcase_48 | AC | 1 ms
6,820 KB |
testcase_49 | AC | 1 ms
6,816 KB |
testcase_50 | AC | 1 ms
6,820 KB |
testcase_51 | WA | - |
testcase_52 | AC | 1 ms
6,820 KB |
testcase_53 | AC | 1 ms
6,816 KB |
testcase_54 | AC | 1 ms
6,820 KB |
testcase_55 | AC | 0 ms
6,820 KB |
testcase_56 | WA | - |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:16:13: warning: ‘char* gets(char*)’ is deprecated [-Wdeprecated-declarations] 16 | gets(str); | ~~~~^~~~~ In file included from /usr/include/stdio.h:894, from main.cpp:1: /usr/include/x86_64-linux-gnu/bits/stdio2.h:240:1: note: declared here 240 | gets (char *__str) | ^~~~ main.cpp:18:13: warning: ‘char* gets(char*)’ is deprecated [-Wdeprecated-declarations] 18 | gets(str); | ~~~~^~~~~ In file included from /usr/include/stdio.h:894, from main.cpp:1: /usr/include/x86_64-linux-gnu/bits/stdio2.h:240:1: note: declared here 240 | gets (char *__str) | ^~~~ main.cpp:20:13: warning: ‘char* gets(char*)’ is deprecated [-Wdeprecated-declarations] 20 | gets(str); | ~~~~^~~~~ In file included from /usr/include/stdio.h:894, from main.cpp:1: /usr/include/x86_64-linux-gnu/bits/stdio2.h:240:1: note: declared here 240 | gets (char *__str) | ^~~~ main.cpp:22:13: warning: ‘char* gets(char*)’ is deprecated [-Wdeprecated-declarations] 22 | gets(str); | ~~~~^~~~~ In file included from /usr/include/stdio.h:894, from main.cpp:1: /usr/include/x86_64-linux-gnu/bits/stdio2.h:240:1: note: declared here 240 | gets (char *__str) | ^~~~ main.cpp:16:13: warning: ignoring return value of ‘char* gets(char*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 16 | gets(str); | ~~~~^~~~~ main.cpp:18:13: warning: ignoring return value of ‘char* gets(char*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 18 | gets(str); | ~~~~^~~~~ main.cpp:20:13: warning: ignoring return value of ‘char* gets(char*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 20 | gets(str); | ~~~~^~~~~ main.cpp:22:13: warning: ignor
ソースコード
#include <stdio.h> #include <stdlib.h> #include <math.h> int main() { int d = 0; long int left = 0; long int center = 0; long int right = 0; char str[20]; long int count = 0; gets(str); d = atoi(str); gets(str); left = atoi(str); gets(str); center = atoi(str); gets(str); right = atoi(str); if(d == 0){ count = -1; printf("%ld", count); return 0; } if (!((center < left && center < right) || (center > left && center > right))) { long int lc = left - center; long int rc = right - center; long int l = abs(lc) / d; long int r = abs(rc) / d; if (l > r && right != 0) count = r + 1; else count = l + 1; } if ((left == 0 && center == 0) || (right == 0 && center == 0)) count = -1; printf("%ld", count); return 0; }