Submission #3425811
Source Code Expand
#include <iostream> #include <bitset> #include <fstream> #include <string> #include <cstring> #include <cmath> #include <cstdlib> #include <ctime> #include <vector> #include <algorithm> #include <numeric> #include <map> #include <set> #include <stack> #include <queue> #include <deque> #include <functional> #include <cctype> #include <list> #include <limits> //#include <boost/multiprecision/cpp_int.hpp> const double EPS = (1e-10); using namespace std; using Int = long long; //using namespace boost::multiprecision; const Int MOD = 1000000007; Int mod_pow(Int x, Int n) { Int res = 1; while(n > 0) { if(n & 1) res = (res * x) % MOD; //ビット演算(最下位ビットが1のとき) x = (x * x) % MOD; n >>= 1; //右シフト(n = n >> 1) } return res; } int ans[55]; int main(){ //cin.tie(0); int N; cin >> N; for (int i = 0; i < N; i += 5){ cout << "? "; for (int j = 0; j < N; j++){ if (i <= j && j < i + 5){ cout << mod_pow(10, j-i); }else{ cout << "0"; } if (j == N-1) cout << endl; else cout << " "; } int res; cin >> res; switch (res%10){ case 0: ans[i] = 10; break; case 1: ans[i] = 11; break; case 2: ans[i] = 12; break; case 8: ans[i] = 8; break; case 9: ans[i] = 9; break; } res/= 10; for (int j = i+1; j < N && j < i + 5; j++){ switch (((res%10+10) - ans[j-1]/10)%10){ case 0: ans[j] = 10; break; case 1: ans[j] = 11; break; case 2: ans[j] = 12; break; case 8: ans[j] = 8; break; case 9: ans[j] = 9; break; } res /= 10; } } cout << "! "; for (int i = 0; i < N; i++){ cout << ans[i]%2; if (i == N-1) cout << endl; else cout << " "; } }
Submission Info
Submission Time | |
---|---|
Task | E - Coin Authentication |
User | Morifo |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 2471 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 724 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt |
All | sample_01.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 3 ms | 596 KB |
subtask_1_1.txt | AC | 3 ms | 724 KB |
subtask_1_10.txt | WA | 3 ms | 720 KB |
subtask_1_11.txt | WA | 3 ms | 720 KB |
subtask_1_12.txt | AC | 3 ms | 596 KB |
subtask_1_13.txt | AC | 3 ms | 720 KB |
subtask_1_14.txt | WA | 3 ms | 724 KB |
subtask_1_15.txt | WA | 3 ms | 724 KB |
subtask_1_16.txt | WA | 3 ms | 720 KB |
subtask_1_17.txt | WA | 3 ms | 724 KB |
subtask_1_18.txt | WA | 3 ms | 596 KB |
subtask_1_19.txt | WA | 3 ms | 724 KB |
subtask_1_2.txt | AC | 3 ms | 724 KB |
subtask_1_20.txt | WA | 3 ms | 724 KB |
subtask_1_21.txt | WA | 3 ms | 724 KB |
subtask_1_22.txt | WA | 3 ms | 724 KB |
subtask_1_23.txt | WA | 3 ms | 596 KB |
subtask_1_24.txt | WA | 3 ms | 724 KB |
subtask_1_25.txt | WA | 3 ms | 720 KB |
subtask_1_26.txt | WA | 3 ms | 724 KB |
subtask_1_27.txt | WA | 3 ms | 596 KB |
subtask_1_28.txt | AC | 3 ms | 720 KB |
subtask_1_29.txt | AC | 3 ms | 596 KB |
subtask_1_3.txt | AC | 3 ms | 724 KB |
subtask_1_4.txt | AC | 3 ms | 596 KB |
subtask_1_5.txt | WA | 3 ms | 724 KB |
subtask_1_6.txt | AC | 3 ms | 720 KB |
subtask_1_7.txt | AC | 3 ms | 716 KB |
subtask_1_8.txt | WA | 3 ms | 724 KB |
subtask_1_9.txt | AC | 3 ms | 724 KB |