Submission #2528232
Source Code Expand
#include <iostream> using namespace std; int goshin(int x){ int y = 0,i = 1; while(true){ y += x%5 * i; x = x/5; i *= 10; if(x == 0) break; } return y; } int Ans(int x,int y,int z[],int n){ int ju = 10; //cout << x << endl; if(y < 5){ for(int i = y-5;i<y-5+n;i++){ z[i] = x%ju; x /= 10; if(z[i] == 1 || z[i] == 3) z[i] = 1; else z[i] = 0; } } else{ for(int i = y-5;i<y;i++){ z[i] = x%ju; x /= 10; if(z[i] == 1 || z[i] == 3) z[i] = 1; else z[i] = 0; } } } int main(){ int n,nnn; cin >> n; nnn = n; int a[5] = {1,5,25,125,625}; int begin = 0,ans,ANS[n]; bool flag = false; while(true){ cout << "?"; for(int i = 0;i<begin;i++) cout << " 0"; if(n > 4){ for(int i = 0;i<5;i++){ cout << " " << a[i]; } } else{ for(int i = 0;i<n;i++){ if(i == n-1) cout << " " << a[i] << endl; else cout << " " << a[i]; } } if(n == 5) cout << endl; if(n >= 4){ for(int i = 0;i < n-5;i++){ if(i == n-6) cout << " 0" << endl; else cout << " 0"; } } cin >> ans; if(n > 4) ans = ans - 8*781; else if (n == 4) ans = ans - 8*156; else if (n == 3) ans = ans - 8*31; else if (n == 2) ans = ans - 8*6; else ans = ans - 8; begin += 5; n -= 5; //cout << ans << endl; int Five = goshin(ans); //cout << Five << endl; Ans(Five,begin,ANS,n); //break する文章 if (n <= 0) flag = true; if(flag) break; } cout << "!"; for(int i = 0;i<nnn;i++){ if(i == nnn-1) cout << " " << ANS[i] << endl; else cout << " " << ANS[i]; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Coin Authentication |
User | nezu |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 2117 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 724 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | 724 KB |
subtask_1_1.txt | AC | 3 ms | 724 KB |
subtask_1_10.txt | AC | 3 ms | 596 KB |
subtask_1_11.txt | AC | 3 ms | 588 KB |
subtask_1_12.txt | AC | 3 ms | 720 KB |
subtask_1_13.txt | AC | 3 ms | 596 KB |
subtask_1_14.txt | AC | 3 ms | 716 KB |
subtask_1_15.txt | AC | 3 ms | 648 KB |
subtask_1_16.txt | AC | 3 ms | 592 KB |
subtask_1_17.txt | AC | 3 ms | 592 KB |
subtask_1_18.txt | AC | 3 ms | 592 KB |
subtask_1_19.txt | AC | 3 ms | 592 KB |
subtask_1_2.txt | AC | 3 ms | 720 KB |
subtask_1_20.txt | AC | 3 ms | 592 KB |
subtask_1_21.txt | AC | 3 ms | 596 KB |
subtask_1_22.txt | AC | 3 ms | 720 KB |
subtask_1_23.txt | AC | 3 ms | 720 KB |
subtask_1_24.txt | AC | 3 ms | 720 KB |
subtask_1_25.txt | AC | 3 ms | 720 KB |
subtask_1_26.txt | AC | 3 ms | 596 KB |
subtask_1_27.txt | AC | 3 ms | 720 KB |
subtask_1_28.txt | AC | 3 ms | 720 KB |
subtask_1_29.txt | AC | 3 ms | 724 KB |
subtask_1_3.txt | AC | 3 ms | 720 KB |
subtask_1_4.txt | AC | 3 ms | 724 KB |
subtask_1_5.txt | AC | 3 ms | 720 KB |
subtask_1_6.txt | AC | 3 ms | 592 KB |
subtask_1_7.txt | AC | 3 ms | 592 KB |
subtask_1_8.txt | AC | 3 ms | 720 KB |
subtask_1_9.txt | AC | 3 ms | 720 KB |