#590882 (C++14) No.1312 Snake Eyes

提出ソース

結果

問題	No.1312 Snake Eyes
ユーザー	torisasami4
提出日時	2020-12-09 01:07:31
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	494 ms / 2,000 ms
コード長	6,115 bytes
コンパイル時間	1,889 ms
コンパイル使用メモリ	176,636 KB
実行使用メモリ	34,316 KB
最終ジャッジ日時	2023-08-20 11:13:19
合計ジャッジ時間	7,007 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	11 ms 34,088 KB
testcase_01	AC	12 ms 34,100 KB
testcase_02	AC	11 ms 34,316 KB
testcase_03	AC	11 ms 34,148 KB
testcase_04	AC	11 ms 34,096 KB
testcase_05	AC	11 ms 34,036 KB
testcase_06	AC	12 ms 33,984 KB
testcase_07	AC	12 ms 34,220 KB
testcase_08	AC	10 ms 34,016 KB
testcase_09	AC	11 ms 33,984 KB
testcase_10	AC	11 ms 33,980 KB
testcase_11	AC	11 ms 33,992 KB
testcase_12	AC	11 ms 34,160 KB
testcase_13	AC	10 ms 34,092 KB
testcase_14	AC	12 ms 34,148 KB
testcase_15	AC	12 ms 34,084 KB
testcase_16	AC	11 ms 34,196 KB
testcase_17	AC	12 ms 34,040 KB
testcase_18	AC	11 ms 33,988 KB
testcase_19	AC	12 ms 34,160 KB
testcase_20	AC	10 ms 34,044 KB
testcase_21	AC	11 ms 34,292 KB
testcase_22	AC	12 ms 34,096 KB
testcase_23	AC	12 ms 34,040 KB
testcase_24	AC	11 ms 34,104 KB
testcase_25	AC	11 ms 34,276 KB
testcase_26	AC	11 ms 34,296 KB
testcase_27	AC	11 ms 33,984 KB
testcase_28	AC	11 ms 34,216 KB
testcase_29	AC	11 ms 34,288 KB
testcase_30	AC	10 ms 34,256 KB
testcase_31	AC	11 ms 34,096 KB
testcase_32	AC	11 ms 34,160 KB
testcase_33	AC	12 ms 34,216 KB
testcase_34	AC	11 ms 33,984 KB
testcase_35	AC	12 ms 34,220 KB
testcase_36	AC	11 ms 34,156 KB
testcase_37	AC	11 ms 34,192 KB
testcase_38	AC	12 ms 34,092 KB
testcase_39	AC	13 ms 34,252 KB
testcase_40	AC	12 ms 34,040 KB
testcase_41	AC	13 ms 34,036 KB
testcase_42	AC	12 ms 34,096 KB
testcase_43	AC	12 ms 34,232 KB
testcase_44	AC	12 ms 34,288 KB
testcase_45	AC	12 ms 34,152 KB
testcase_46	AC	11 ms 33,988 KB
testcase_47	AC	12 ms 34,304 KB
testcase_48	AC	82 ms 34,216 KB
testcase_49	AC	54 ms 34,044 KB
testcase_50	AC	32 ms 34,152 KB
testcase_51	AC	24 ms 34,040 KB
testcase_52	AC	44 ms 34,216 KB
testcase_53	AC	49 ms 34,100 KB
testcase_54	AC	36 ms 34,144 KB
testcase_55	AC	27 ms 33,984 KB
testcase_56	AC	43 ms 33,984 KB
testcase_57	AC	28 ms 34,088 KB
testcase_58	AC	51 ms 34,220 KB
testcase_59	AC	24 ms 34,220 KB
testcase_60	AC	24 ms 34,104 KB
testcase_61	AC	48 ms 34,216 KB
testcase_62	AC	30 ms 34,100 KB
testcase_63	AC	12 ms 34,144 KB
testcase_64	AC	12 ms 34,220 KB
testcase_65	AC	14 ms 34,092 KB
testcase_66	AC	11 ms 34,212 KB
testcase_67	AC	12 ms 34,036 KB
testcase_68	AC	13 ms 34,216 KB
testcase_69	AC	12 ms 33,980 KB
testcase_70	AC	50 ms 34,076 KB
testcase_71	AC	28 ms 34,040 KB
testcase_72	AC	12 ms 34,220 KB
testcase_73	AC	12 ms 34,088 KB
testcase_74	AC	11 ms 34,096 KB
testcase_75	AC	12 ms 34,216 KB
testcase_76	AC	494 ms 33,992 KB
testcase_77	AC	33 ms 33,984 KB
testcase_78	AC	34 ms 34,220 KB
testcase_79	AC	32 ms 34,220 KB
testcase_80	AC	33 ms 34,292 KB
testcase_81	AC	40 ms 34,164 KB
testcase_82	AC	80 ms 34,104 KB
testcase_83	AC	84 ms 34,248 KB
testcase_84	AC	33 ms 34,292 KB
testcase_85	AC	44 ms 33,980 KB
testcase_86	AC	74 ms 34,100 KB
testcase_87	AC	24 ms 34,208 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = n - 1; i >= 0; i--)
template <class T>
using rque = priority_queue<T, vector<T>, greater<T>>;
const ll mod = 998244353;

ll gcd(ll a, ll b)
{
	ll c = a % b;
	while (c != 0)
	{
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}

long long extGCD(long long a, long long b, long long &x, long long &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	long long d = extGCD(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

struct UnionFind
{
	vector<ll> data;

	UnionFind(int sz)
	{
		data.assign(sz, -1);
	}

	bool unite(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y)
			return (false);
		if (data[x] > data[y])
			swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return (true);
	}

	int find(int k)
	{
		if (data[k] < 0)
			return (k);
		return (data[k] = find(data[k]));
	}

	ll size(int k)
	{
		return (-data[find(k)]);
	}
};

ll M = 1000000007;

vector<ll> fac(2000011, 0);  //n!(mod M)
vector<ll> ifac(2000011); //k!^{M-2} (mod M)

ll mpow(ll x, ll n)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % M;
		x = x * x % M;
		n = n >> 1;
	}
	return ans;
}
ll mpow2(ll x, ll n, ll mod)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % mod;
		x = x * x % mod;
		n = n >> 1;
	}
	return ans;
}
void setcomb()
{
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 2000010; i++)
	{
		fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
	}
	ifac[2000010] = mpow(fac[2000010], M - 2);
	for (ll i = 2000010; i > 0; i--)
	{
		ifac[i - 1] = ifac[i] * i % M;
	}
}
ll comb(ll a, ll b)
{
	if(fac[0] == 0)
		setcomb();
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	ll tmp = ifac[a - b] * ifac[b] % M;
	return tmp * fac[a] % M;
}
ll perm(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return fac[a] * ifac[a - b] % M;
}
long long modinv(long long a)
{
	long long b = M, u = 1, v = 0;
	while (b)
	{
		long long t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= M;
	if (u < 0)
		u += M;
	return u;
}
ll modinv2(ll a, ll mod)
{
	ll b = mod, u = 1, v = 0;
	while (b)
	{
		ll t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= mod;
	if (u < 0)
		u += mod;
	return u;
}

template <int mod>
struct ModInt
{
	int x;

	ModInt() : x(0) {}

	ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

	ModInt &operator+=(const ModInt &p)
	{
		if ((x += p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator-=(const ModInt &p)
	{
		if ((x += mod - p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator*=(const ModInt &p)
	{
		x = (int)(1LL * x * p.x % mod);
		return *this;
	}

	ModInt &operator/=(const ModInt &p)
	{
		*this *= p.inverse();
		return *this;
	}

	ModInt operator-() const { return ModInt(-x); }

	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

	bool operator==(const ModInt &p) const { return x == p.x; }

	bool operator!=(const ModInt &p) const { return x != p.x; }

	ModInt inverse() const
	{
		int a = x, b = mod, u = 1, v = 0, t;
		while (b > 0)
		{
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}

	ModInt pow(int64_t n) const
	{
		ModInt ret(1), mul(x);
		while (n > 0)
		{
			if (n & 1)
				ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}

	friend ostream &operator<<(ostream &os, const ModInt &p)
	{
		return os << p.x;
	}

	friend istream &operator>>(istream &is, ModInt &a)
	{
		int64_t t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}

	static int get_mod() { return mod; }
};

using mint = ModInt<mod>;

typedef vector<vector<mint>> Matrix;

Matrix mul(Matrix a, Matrix b)
{
	assert(a[0].size() == b.size());
	int i, j, k;
	int n = a.size(), m = b[0].size(), l = a[0].size();
	Matrix c(n, vector<mint>(m));
	for (i = 0; i < n; i++)
		for (k = 0; k < l; k++)
			for (j = 0; j < m; j++)
				c[i][j] += a[i][k] * b[k][j];
	return c;
}

Matrix mat_pow(Matrix x, ll n)
{
	ll k = x.size();
	Matrix ans(k, vector<mint>(k, 0));
	for (int i = 0; i < k; i++)
		ans[i][i] = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = mul(ans, x);
		x = mul(x, x);
		n = n >> 1;
	}
	return ans;
}

int main(){
	ll n;
	cin>>n;
	ll ans = n + 1;
	for (ll i = 1; i * i <= n; i++){
		if(n%i==0){
			ll t = i;
			if(n/t<n){
				for (ll j = 1; j * j <= t - 1; j++){
					if((t-1)%j==0){
						ll p;
						int flag;
						ll ct;
						p = j;						
						flag = 1;
						ct = t;
						if(p > n / t){
							while (ct>0){
								if(ct%p!=1){
									flag = 0;
									break;
								}
								ct /= p;
							}
							if(flag)
								ans = min(ans, p);
						}
						p = (t - 1) / j;
						flag = 1;
						ct = t;
						if(p > n / t){
							while (ct>0){
								if(ct%p!=1){
									flag = 0;
									break;
								}
								ct /= p;
							}
							if(flag)
								ans = min(ans, p);
						}
					}
				}
			}
			t = n / i;
			if(n/t<n){
				for (ll j = 1; j * j <= t - 1; j++){
					if((t-1)%j==0){
						ll p;
						int flag;
						ll ct;
						p = j;						
						flag = 1;
						ct = t;
						if(p > n / t){
							while (ct>0){
								if(ct%p!=1){
									flag = 0;
									break;
								}
								ct /= p;
							}
							if(flag)
								ans = min(ans, p);
						}
						p = (t - 1) / j;
						flag = 1;
						ct = t;
						if(p > n / t){
							while (ct>0){
								if(ct%p!=1){
									flag = 0;
									break;
								}
								ct /= p;
							}
							if(flag)
								ans = min(ans, p);
							// if(p == 10)
							// 	cout << t << endl;
						}
					}
				}
			}
		}
	}
	cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード