結果
問題 | No.747 循環小数N桁目 Hard |
ユーザー |
![]() |
提出日時 | 2021-04-08 13:09:08 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 2,117 bytes |
コンパイル時間 | 1,989 ms |
コンパイル使用メモリ | 192,636 KB |
最終ジャッジ日時 | 2025-01-20 13:05:41 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 120 |
ソースコード
#include <bits/stdc++.h>//#include<boost/multiprecision/cpp_int.hpp>//#include<boost/multiprecision/cpp_dec_float.hpp>//#include <atcoder/all>#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define popcount __builtin_popcount#define popcountll __builtin_popcountll#define fi first#define se secondusing ll = long long;constexpr ll mod = 1e9 + 7;constexpr ll mod_998244353 = 998244353;constexpr ll INF = 1LL << 60;// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")//using lll=boost::multiprecision::cpp_int;//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁template <class T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <class T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}template <typename T>T mypow(T x, T n, const T &p = -1){ //x^nをmodで割った余りif (p != -1){x =(x%p+p)%p;}T ret = 1;while (n > 0){if (n & 1){if (p != -1)ret = (ret * x) % p;elseret *= x;}if (p != -1)x = (x * x) % p;elsex *= x;n >>= 1;}return ret;}using namespace std;//using namespace atcoder;void solve(){string n,k;cin>>n>>k;ll num=0;int ans[]={4,2,8,5,7,1};for(int i=0;i<n.size();++i){num*=10;num+=n[i]-'0';num%=6;}int val;if(num==0||num==1||num==3||num==4)val=ans[num];else if(num==2){if((k.back()-'0')%2==1)val=ans[2];else val=ans[4];}else{if((k.back()-'0')%2==1)val=ans[5];else val=ans[1];}cout<<val<<"\n";}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);solve();return 0;}