题目链接:点击打开链接
思路:
考虑到数据量有1e5组, 那么单次操作必然为log或者是个公式题。
由于每次均分, 我们其实均分完之后只看一块即可, 可以证明一下, 无论什么情况只看一块都不会出错。
递归解决即可。
细节参见代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <ctime>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
typedef long double ld;
const double eps = 1e-6;
const double PI = acos(-1);
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 1e7 + 10;
int T,n,m;
bool ok;
int res(int v) {
int m = sqrt(v+0.5);
for(int i = 2; i <= m; i++) {
if(v % i == 0) {
return i;
}
}
return v;
}
void solve(int r, int c, int id) {
if(id == 1) {
if(r == 1) {
ok = true; return ;
}
else {
int cur = res(r);
solve(r/cur, c, id^1);
}
}
else {
if(c == 1) {
ok = false; return ;
}
else {
int cur = res(c);
solve(r, c/cur, id^1);
}
}
}
int main() {
freopen("funny.out","w",stdout);
freopen("funny.in","r",stdin);
while(~scanf("%d%d",&n, &m)) {
if(!n && !m) return 0;
solve(n, m, 1);
printf("%d %d - ", n, m);
if(!ok) printf("Vera\n");
else printf("Harry\n");
}
return 0;
}