#292911 (C++17) No.747 循環小数N桁目 Hard

• 問題: No.747 循環小数N桁目 Hard
• ユーザー: 👑 tatyam
• 提出日時: 2018-10-19 22:08:43
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 4,596 bytes
• コンパイル時間: 1,927 ms
• コンパイル使用メモリ: 200,512 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-12 01:04:43
• 合計ジャッジ時間: 5,892 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	1 ms; 4,380 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	2 ms; 4,376 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	2 ms; 4,376 KB
testcase_11	AC	1 ms; 4,376 KB
testcase_12	AC	2 ms; 4,384 KB
testcase_13	AC	2 ms; 4,380 KB
testcase_14	AC	2 ms; 4,376 KB
testcase_15	AC	2 ms; 4,376 KB
testcase_16	AC	2 ms; 4,376 KB
testcase_17	AC	2 ms; 4,380 KB
testcase_18	AC	1 ms; 4,376 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	2 ms; 4,376 KB
testcase_22	AC	1 ms; 4,380 KB
testcase_23	AC	2 ms; 4,380 KB
testcase_24	AC	2 ms; 4,376 KB
testcase_25	AC	2 ms; 4,376 KB
testcase_26	AC	1 ms; 4,380 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	1 ms; 4,380 KB
testcase_29	AC	2 ms; 4,376 KB
testcase_30	AC	1 ms; 4,380 KB
testcase_31	AC	1 ms; 4,380 KB
testcase_32	AC	1 ms; 4,380 KB
testcase_33	AC	2 ms; 4,380 KB
testcase_34	AC	2 ms; 4,380 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	2 ms; 4,376 KB
testcase_37	AC	2 ms; 4,380 KB
testcase_38	AC	2 ms; 4,380 KB
testcase_39	AC	2 ms; 4,376 KB
testcase_40	AC	2 ms; 4,380 KB
testcase_41	AC	2 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	1 ms; 4,380 KB
testcase_44	AC	2 ms; 4,380 KB
testcase_45	AC	2 ms; 4,376 KB
testcase_46	AC	2 ms; 4,380 KB
testcase_47	AC	2 ms; 4,376 KB
testcase_48	AC	2 ms; 4,376 KB
testcase_49	AC	2 ms; 4,380 KB
testcase_50	AC	1 ms; 4,376 KB
testcase_51	AC	2 ms; 4,380 KB
testcase_52	AC	2 ms; 4,384 KB
testcase_53	AC	2 ms; 4,380 KB
testcase_54	AC	2 ms; 4,380 KB
testcase_55	AC	2 ms; 4,380 KB
testcase_56	AC	2 ms; 4,380 KB
testcase_57	AC	2 ms; 4,380 KB
testcase_58	AC	3 ms; 4,380 KB
testcase_59	AC	2 ms; 4,380 KB
testcase_60	AC	2 ms; 4,376 KB
testcase_61	AC	2 ms; 4,380 KB
testcase_62	AC	2 ms; 4,380 KB
testcase_63	AC	2 ms; 4,380 KB
testcase_64	AC	2 ms; 4,380 KB
testcase_65	AC	2 ms; 4,380 KB
testcase_66	AC	2 ms; 4,380 KB
testcase_67	AC	2 ms; 4,376 KB
testcase_68	AC	2 ms; 4,380 KB
testcase_69	AC	1 ms; 4,380 KB
testcase_70	AC	2 ms; 4,380 KB
testcase_71	AC	2 ms; 4,384 KB
testcase_72	AC	2 ms; 4,380 KB
testcase_73	AC	2 ms; 4,380 KB
testcase_74	AC	1 ms; 4,384 KB
testcase_75	AC	1 ms; 4,380 KB
testcase_76	AC	2 ms; 4,380 KB
testcase_77	AC	2 ms; 4,380 KB
testcase_78	AC	2 ms; 4,376 KB
testcase_79	AC	2 ms; 4,376 KB
testcase_80	AC	2 ms; 4,380 KB
testcase_81	AC	2 ms; 4,376 KB
testcase_82	AC	2 ms; 4,380 KB
testcase_83	AC	2 ms; 4,380 KB
testcase_84	AC	2 ms; 4,380 KB
testcase_85	AC	2 ms; 4,380 KB
testcase_86	AC	2 ms; 4,376 KB
testcase_87	AC	2 ms; 4,380 KB
testcase_88	AC	1 ms; 4,376 KB
testcase_89	AC	1 ms; 4,376 KB
testcase_90	AC	2 ms; 4,376 KB
testcase_91	AC	2 ms; 4,384 KB
testcase_92	AC	2 ms; 4,384 KB
testcase_93	AC	2 ms; 4,380 KB
testcase_94	AC	2 ms; 4,380 KB
testcase_95	AC	2 ms; 4,380 KB
testcase_96	AC	2 ms; 4,380 KB
testcase_97	AC	2 ms; 4,380 KB
testcase_98	AC	2 ms; 4,380 KB
testcase_99	AC	2 ms; 4,380 KB
testcase_100	AC	2 ms; 4,384 KB
testcase_101	AC	2 ms; 4,376 KB
testcase_102	AC	2 ms; 4,380 KB
testcase_103	AC	2 ms; 4,376 KB
testcase_104	AC	2 ms; 4,380 KB
testcase_105	AC	2 ms; 4,380 KB
testcase_106	AC	2 ms; 4,380 KB
testcase_107	AC	2 ms; 4,376 KB
testcase_108	AC	2 ms; 4,380 KB
testcase_109	AC	2 ms; 4,384 KB
testcase_110	AC	2 ms; 4,380 KB
testcase_111	AC	2 ms; 4,376 KB
testcase_112	AC	2 ms; 4,380 KB
testcase_113	AC	2 ms; 4,380 KB
testcase_114	AC	2 ms; 4,376 KB
testcase_115	AC	2 ms; 4,380 KB
testcase_116	AC	3 ms; 4,384 KB
testcase_117	AC	2 ms; 4,376 KB
testcase_118	AC	2 ms; 4,380 KB
testcase_119	AC	2 ms; 4,376 KB
testcase_120	AC	2 ms; 4,380 KB
testcase_121	AC	2 ms; 4,376 KB
testcase_122	AC	2 ms; 4,380 KB
testcase_123	AC	2 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using pq_int=priority_queue<int,vector<int>,greater<int>>;
const ll LINF=0x3fffffffffffffff;
const ll MOD=1000000007;
const ll MODD=0x3b800001;
const int INF=0x3fffffff;
const double DINF=numeric_limits<double>::infinity();
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) _rep2(i,n)
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) _rrep2(i,n)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)
#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
#define each(i,a) for(auto&& i:a)
#define sum(...) accumulate(range(__VA_ARGS__),0LL)
#define _range(i) (i).begin(),(i).end()
#define _range2(i,k) (i).begin(),(i).begin()+k
#define _range3(i,a,b) (i).begin()+a,(i).begin()+b
#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)
#define Yes(i) out(i?"Yes":"No")
#define YES(i) out(i?"YES":"NO")
//#define START auto start=system_clock::now()
//#define END auto end=system_clock::now();cerr<<duration_cast<milliseconds>(end-start).count()<<" ms\n"
#define elif else if
#define unless(a) if(!(a))
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(15);};
template<class T>
inline constexpr T gcd (T a,T b) {if(a==b)return a;else return gcd(b,(a-1)%b+1);}
template<class T>
inline constexpr T min(vector<T>& v){return *min_element(range(v));}
inline char min(string& v){return *min_element(range(v));}
template<class T>
inline constexpr T max(vector<T>& v){return *max_element(range(v));}
inline char max(string& v){return *max_element(range(v));}
template<typename T>
inline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}
template<typename T>
inline bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}
inline void in() {}
template<class T>
istream& operator >> (istream& is, vector<T>& vec);
template<class T,size_t size>
istream& operator >> (istream& is, array<T,size>& vec);
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p);
template<class T>
ostream& operator << (ostream& os, vector<T>& vec);
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p);
template<class T>
istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}
template<class T>
ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}
template<class T>
ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}
template <class Head, class... Tail>
inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}
template <class T>
inline void out(T t){cout<<t<<'\n';}
inline void out(){cout<<'\n';}
template <class Head, class... Tail>
inline void out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);}
template <class T>
inline void err(T t){cerr<<t<<'\n';}
inline void err(){cerr<<'\n';}
template <class Head, class... Tail>
inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}





signed main(){
    string s="428571";
    STR(n,k);
    int a=0;
    each(i,n){
        a+=i-'0';
    }
    a%=3;
    if(((n.back()-'0')&1)^(a&1))a+=3;
    int b=0;
    each(i,k){
        b+=i-'0';
    }
    b%=3;
    if(((k.back()-'0')&1)^(b&1))b+=3;
    if(a==5&&b%2==0)return puts("2")&0;
    if(a==2&&b%2==0)return puts("7")&0;
    out(s[a]);
}