結果
問題 | No.81 すべて足すだけの簡単なお仕事です。 |
ユーザー | fantasiabaetica |
提出日時 | 2018-07-04 21:58:04 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,988 bytes |
コンパイル時間 | 724 ms |
コンパイル使用メモリ | 71,388 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-01 02:17:08 |
合計ジャッジ時間 | 1,648 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
ソースコード
#include <iostream> #include <string> #define ll long long using namespace std; int main(){ int N; cin >> N; ll sum_ll = 0; ll sum_double = 0; string a; for (int i = 0; i < N; i++) { cin >> a; int minus = a.find("-"); // 正の数の場合 if (minus == string::npos){ int comma = a.find("."); // 小数の場合 if (comma == string::npos) { sum_ll += stoll(a); // 整数の場合 } else { sum_ll += stoll(a.substr(0, comma)); string a_double = a.substr(comma + 1); for (int j = a_double.length(); j < 10; j++) { a_double += "0"; } sum_double += stoll(a_double); } // 負の数の場合 } else { a = a.substr(1); int comma = a.find("."); // 小数の場合 if (comma == string::npos) { sum_ll -= stoll(a); // 整数の場合 } else { sum_ll -= stoll(a.substr(0, comma)); string a_double = a.substr(comma + 1); for (int j = a_double.length(); j < 10; j++) { a_double += "0"; } sum_double -= stoll(a_double); } } } cout << sum_ll << endl; cout << sum_double << endl; // 整数部分、小数部分について、0以上か以下で4パターンに場合分け string sum_double_str = to_string(sum_double); if (sum_ll == 0 && sum_double >= 0 ){ int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ sum_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_double_str = sum_double_str.substr(sum_double_str_len - 10); } } else if (sum_ll == 0 && sum_double >= 0 ){ sum_double_str = sum_double_str.substr(1); int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ ll sum_double_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_ll -= sum_double_ll; // 小数部分 sum_double_str = sum_double_str.substr(sum_double_str_len - 10); if (sum_double_str != "0000000000") { sum_ll -= 1; sum_double_str = to_string(10000000000 - stoll(sum_double_str)); } } else { sum_ll -= 1; sum_double_str = to_string(10000000000 - sum_double); } } else if (sum_ll > 0 && sum_double >= 0 ){ int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ ll sum_double_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_ll += sum_double_ll; sum_double_str = sum_double_str.substr(sum_double_str_len - 10); } } else if (sum_ll > 0 && sum_double < 0) { sum_double_str = sum_double_str.substr(1); int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ ll sum_double_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_ll -= sum_double_ll; // 小数部分 sum_double_str = sum_double_str.substr(sum_double_str_len - 10); if (sum_double_str != "0000000000") { sum_ll -= 1; sum_double_str = to_string(10000000000 - stoll(sum_double_str)); } } else { sum_ll -= 1; sum_double_str = to_string(10000000000 - sum_double); } } else if (sum_ll < 0 && sum_double >= 0 ) { int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ ll sum_double_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_ll += sum_double_ll; sum_double_str = sum_double_str.substr(sum_double_str_len - 10); if (sum_double_str != "0000000000") { sum_ll += 1; sum_double_str = to_string(10000000000 - stoll(sum_double_str)); } } else { if (sum_double_str != "0") { sum_ll += 1; sum_double_str = to_string(10000000000 - sum_double); } } } else if (sum_ll < 0 && sum_double < 0 ) { sum_double_str = sum_double_str.substr(1); int sum_double_str_len = sum_double_str.length(); if (sum_double_str_len > 10){ ll sum_double_ll = stoll(sum_double_str.substr(0, sum_double_str_len - 10)); sum_ll -= sum_double_ll; sum_double_str = sum_double_str.substr(sum_double_str_len - 10); } } for (int j = sum_double_str.length(); j < 10; j++) { sum_double_str = "0" + sum_double_str; } cout << sum_ll << "." << sum_double_str << endl; return 0; }