結果
問題 | No.757 チャンパーノウン定数 (2) |
ユーザー | ミドリムシ |
提出日時 | 2018-12-05 15:38:52 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 3,786 bytes |
コンパイル時間 | 657 ms |
コンパイル使用メモリ | 72,772 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-19 04:25:01 |
合計ジャッジ時間 | 2,199 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,944 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 1 ms
6,944 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 24 ms
6,940 KB |
testcase_29 | AC | 19 ms
6,944 KB |
testcase_30 | AC | 3 ms
6,940 KB |
testcase_31 | AC | 3 ms
6,940 KB |
testcase_32 | AC | 1 ms
6,944 KB |
testcase_33 | AC | 7 ms
6,940 KB |
testcase_34 | AC | 10 ms
6,940 KB |
testcase_35 | AC | 3 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 18 ms
6,944 KB |
testcase_38 | AC | 22 ms
6,944 KB |
testcase_39 | AC | 25 ms
6,944 KB |
testcase_40 | AC | 24 ms
6,940 KB |
testcase_41 | AC | 22 ms
6,940 KB |
testcase_42 | AC | 38 ms
6,944 KB |
testcase_43 | AC | 21 ms
6,940 KB |
testcase_44 | AC | 21 ms
6,940 KB |
testcase_45 | AC | 24 ms
6,940 KB |
testcase_46 | AC | 26 ms
6,940 KB |
testcase_47 | AC | 22 ms
6,940 KB |
testcase_48 | AC | 30 ms
6,940 KB |
testcase_49 | AC | 23 ms
6,940 KB |
testcase_50 | AC | 1 ms
6,940 KB |
testcase_51 | AC | 1 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 2 ms
6,944 KB |
ソースコード
#include <iostream> #include <algorithm> #include <vector> #include <map> using namespace std; template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; } template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; } template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; } template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; } long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; } template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } } template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; } #define mod long(1e9 + 7) #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl(long(n)) #define fcout cout << fixed << setprecision(10) #define highest(x) (63 - __builtin_clzl(x)) int B; bool subtract(vector<int>& a, int b, int digit){ int b_tmp = b, digit_tmp = digit; vector<int> history; while(b_tmp){ if(digit_tmp >= a.size()){ for(int i = digit; i < a.size(); i++){ a[i] = history[i - digit]; } return false; } history.push_back(a[digit_tmp]); a[digit_tmp] -= b_tmp % B; b_tmp /= B; if(a[digit_tmp] < 0){ a[digit_tmp] += B; b_tmp++; } digit_tmp++; } return true; } void add(vector<int>& a, int b, int digit){ int b_tmp = b, digit_tmp = digit; while(b_tmp){ a[digit_tmp] += b_tmp % B; b_tmp /= B; if(a[digit_tmp] >= B){ a[digit_tmp] -= B; b_tmp++; } digit_tmp++; } } pair<vector<int>, int> divide(vector<int> a, int b){ int surplus = 0; vector<int> ans; for(int i = int(a.size()) - 1; i >= 0; i--){ surplus = surplus * B + a[i]; ans.push_back(surplus / b); surplus %= b; } reverse(all(ans)); return {ans, surplus}; } int main(){ cin >> B; string D_str; cin >> D_str; D_str = "0000000000000000" + D_str; reverse(all(D_str)); vector<int> D; for(auto i: D_str){ D.push_back(i - '0'); } subtract(D, 1, 0); int digit = 1; while(true){ if(!subtract(D, digit * (B - 1), digit - 1)){ break; } digit++; } auto divided = divide(D, digit); add(divided.first, 1, digit - 1); cout << divided.first[digit - divided.second - 1] << endl; }