分析
由裴蜀定理知:
对于一个二元一次不定方程,形如
a
x
+
b
y
=
c
ax+by=c
ax+by=c
其c最小为
gcd
(
a
,
b
)
\gcd(a,b)
gcd(a,b)
根据题意知:若t为可操作位置需要满足
t
=
a
x
+
b
y
t=ax+by
t=ax+by
现在就是要判断有几个可行解t
我们知道最小解为
gcd
(
a
,
b
)
\gcd(a,b)
gcd(a,b)
故有
t
gcd
(
a
,
b
)
\frac{t}{\gcd(a,b)}
gcd(a,b)t个可行解
然后判断奇偶就行
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T>
void out(T x) { cout << x << endl; }
ll fast_pow(ll a, ll b, ll p) {ll c = 1; while(b) { if(b & 1) c = c * a % p; a = a * a % p; b >>= 1;} return c;}
ll exgcd(ll a, ll b, ll &x, ll &y) { if(!b) {x = 1; y = 0; return a; } ll gcd = exgcd(b, a % b, y, x); y-= a / b * x; return gcd; }
int main()
{
ios::sync_with_stdio(false);
int t, td = 0;
cin >> t;
while(t --)
{
td ++;
int n, a, b;
cin >> n >> a >> b;
int gcd = __gcd(a, b);
cout << "Case #" << td << ": ";
if((n / gcd) & 1)
cout << "Yuwgna" << endl;
else
cout << "Iaka" << endl;
}
}