Submission #2216615
Source Code Expand
#include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <cstring> #include <map> #include <queue> #include <cmath> #include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3 using namespace std; #define MOD 1000000007 #define ll long long #define ld long double #define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++) #define rep(i,n) FOR(i,0,n) #define pb push_back #define mp make_pair #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end()) #define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;} template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();} bool like[10]; int main(){ cin.tie(0); ios::sync_with_stdio(false); rep(i,10) like[i] = true; ll N, K ; cin >> N >> K ; string NN = to_string(N); rep(i,K){ ll inp; cin >> inp; like[inp] = false; } vector<ll> num; rep(i,10){ if(like[i]) num.pb(i); } ll cnt = num.size()*NN.size()-1; cnt = max(cnt,(ll)0); while(1){ cnt ++ ; ll tmp = cnt; vector<ll> res; do{ res.pb(tmp%num.size()); tmp/=num.size(); }while(tmp != 0); reverse(all(res)); ll ans = 0; rep(i,res.size()){ ans*=10; ans += num[res[i]]; } if(ans >= N) {cout << ans << endl; return 0;} } //cout << fixed << setprecision(16) << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | ukohank517 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1588 Byte |
Status | WA |
Exec Time | 2105 ms |
Memory | 1050832 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_X_01.txt, subtask1_X_02.txt, subtask1_X_03.txt, subtask1_X_04.txt, subtask1_X_05.txt, subtask1_X_06.txt, subtask1_X_07.txt, subtask1_X_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 6 ms | 764 KB |
subtask0_sample_02.txt | AC | 2 ms | 256 KB |
subtask1_X_01.txt | AC | 1 ms | 256 KB |
subtask1_X_02.txt | TLE | 2105 ms | 1050064 KB |
subtask1_X_03.txt | AC | 1 ms | 256 KB |
subtask1_X_04.txt | WA | 1 ms | 256 KB |
subtask1_X_05.txt | TLE | 2105 ms | 1050832 KB |
subtask1_X_06.txt | AC | 1 ms | 256 KB |
subtask1_X_07.txt | AC | 1 ms | 256 KB |
subtask1_X_08.txt | TLE | 2105 ms | 1049168 KB |