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

提出ソース

結果

問題	No.747 循環小数N桁目 Hard
ユーザー	heno239
提出日時	2020-08-30 12:36:33
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	6 ms / 2,000 ms
コード長	3,536 bytes
コンパイル時間	1,323 ms
コンパイル使用メモリ	112,436 KB
実行使用メモリ	12,052 KB
最終ジャッジ日時	2023-08-09 11:34:11
合計ジャッジ時間	7,303 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 11,696 KB
testcase_01	AC	4 ms 11,624 KB
testcase_02	AC	4 ms 11,584 KB
testcase_03	AC	5 ms 11,576 KB
testcase_04	AC	5 ms 11,548 KB
testcase_05	AC	5 ms 11,624 KB
testcase_06	AC	5 ms 11,748 KB
testcase_07	AC	4 ms 11,580 KB
testcase_08	AC	4 ms 11,616 KB
testcase_09	AC	5 ms 11,584 KB
testcase_10	AC	5 ms 11,536 KB
testcase_11	AC	5 ms 11,580 KB
testcase_12	AC	4 ms 11,524 KB
testcase_13	AC	4 ms 11,744 KB
testcase_14	AC	5 ms 11,540 KB
testcase_15	AC	4 ms 11,576 KB
testcase_16	AC	5 ms 11,760 KB
testcase_17	AC	4 ms 11,584 KB
testcase_18	AC	5 ms 11,536 KB
testcase_19	AC	5 ms 11,580 KB
testcase_20	AC	5 ms 11,628 KB
testcase_21	AC	5 ms 11,620 KB
testcase_22	AC	4 ms 11,620 KB
testcase_23	AC	4 ms 11,540 KB
testcase_24	AC	5 ms 11,532 KB
testcase_25	AC	5 ms 11,688 KB
testcase_26	AC	4 ms 11,576 KB
testcase_27	AC	5 ms 11,752 KB
testcase_28	AC	4 ms 11,532 KB
testcase_29	AC	4 ms 11,548 KB
testcase_30	AC	4 ms 11,872 KB
testcase_31	AC	5 ms 11,584 KB
testcase_32	AC	5 ms 11,580 KB
testcase_33	AC	5 ms 11,876 KB
testcase_34	AC	5 ms 11,648 KB
testcase_35	AC	5 ms 11,884 KB
testcase_36	AC	5 ms 11,684 KB
testcase_37	AC	5 ms 11,740 KB
testcase_38	AC	5 ms 11,716 KB
testcase_39	AC	5 ms 11,656 KB
testcase_40	AC	5 ms 11,672 KB
testcase_41	AC	5 ms 11,696 KB
testcase_42	AC	4 ms 11,684 KB
testcase_43	AC	5 ms 11,656 KB
testcase_44	AC	5 ms 11,628 KB
testcase_45	AC	5 ms 11,960 KB
testcase_46	AC	5 ms 11,724 KB
testcase_47	AC	5 ms 11,648 KB
testcase_48	AC	5 ms 11,688 KB
testcase_49	AC	5 ms 11,676 KB
testcase_50	AC	5 ms 11,672 KB
testcase_51	AC	5 ms 11,712 KB
testcase_52	AC	5 ms 11,592 KB
testcase_53	AC	6 ms 11,720 KB
testcase_54	AC	5 ms 11,708 KB
testcase_55	AC	5 ms 12,036 KB
testcase_56	AC	5 ms 11,712 KB
testcase_57	AC	5 ms 11,692 KB
testcase_58	AC	5 ms 11,820 KB
testcase_59	AC	5 ms 11,692 KB
testcase_60	AC	5 ms 12,052 KB
testcase_61	AC	5 ms 11,736 KB
testcase_62	AC	5 ms 12,016 KB
testcase_63	AC	5 ms 11,704 KB
testcase_64	AC	5 ms 11,684 KB
testcase_65	AC	5 ms 11,568 KB
testcase_66	AC	5 ms 11,640 KB
testcase_67	AC	5 ms 11,684 KB
testcase_68	AC	5 ms 11,708 KB
testcase_69	AC	5 ms 11,804 KB
testcase_70	AC	5 ms 11,660 KB
testcase_71	AC	5 ms 11,680 KB
testcase_72	AC	5 ms 11,620 KB
testcase_73	AC	5 ms 11,668 KB
testcase_74	AC	5 ms 11,824 KB
testcase_75	AC	5 ms 11,632 KB
testcase_76	AC	5 ms 11,856 KB
testcase_77	AC	5 ms 11,720 KB
testcase_78	AC	4 ms 11,668 KB
testcase_79	AC	5 ms 11,716 KB
testcase_80	AC	5 ms 11,688 KB
testcase_81	AC	5 ms 11,632 KB
testcase_82	AC	5 ms 11,672 KB
testcase_83	AC	5 ms 11,604 KB
testcase_84	AC	5 ms 11,668 KB
testcase_85	AC	5 ms 11,864 KB
testcase_86	AC	5 ms 11,860 KB
testcase_87	AC	5 ms 11,696 KB
testcase_88	AC	5 ms 11,684 KB
testcase_89	AC	4 ms 11,788 KB
testcase_90	AC	5 ms 11,876 KB
testcase_91	AC	5 ms 11,752 KB
testcase_92	AC	5 ms 11,704 KB
testcase_93	AC	5 ms 11,640 KB
testcase_94	AC	5 ms 11,692 KB
testcase_95	AC	5 ms 11,812 KB
testcase_96	AC	5 ms 11,664 KB
testcase_97	AC	6 ms 11,764 KB
testcase_98	AC	5 ms 11,992 KB
testcase_99	AC	5 ms 11,808 KB
testcase_100	AC	5 ms 11,656 KB
testcase_101	AC	5 ms 11,704 KB
testcase_102	AC	5 ms 11,652 KB
testcase_103	AC	5 ms 11,648 KB
testcase_104	AC	5 ms 11,664 KB
testcase_105	AC	5 ms 11,668 KB
testcase_106	AC	5 ms 11,696 KB
testcase_107	AC	5 ms 11,644 KB
testcase_108	AC	5 ms 11,700 KB
testcase_109	AC	5 ms 11,808 KB
testcase_110	AC	5 ms 11,720 KB
testcase_111	AC	5 ms 11,732 KB
testcase_112	AC	5 ms 11,708 KB
testcase_113	AC	5 ms 11,944 KB
testcase_114	AC	5 ms 11,872 KB
testcase_115	AC	5 ms 11,664 KB
testcase_116	AC	5 ms 11,712 KB
testcase_117	AC	5 ms 11,756 KB
testcase_118	AC	5 ms 11,756 KB
testcase_119	AC	5 ms 11,668 KB
testcase_120	AC	5 ms 11,704 KB
testcase_121	AC	5 ms 11,664 KB
testcase_122	AC	5 ms 11,668 KB
testcase_123	AC	5 ms 11,696 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};

string s27 = "428571";
void solve() {
	string a, b; cin >> a >> b;
	int c = 0;
	rep(i, a.size()) {
		c = (10 * c + a[i] - '0') % 6;
	}
	if ((b.back() - '0') % 2==0)c = c * c % 6;
	cout << s27[c] << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード