Stone
表示看错题了，一直在纠结第一个样例。就是普通的巴什博弈。每次取的必须满足1 <= Y-X <= k。直到有一个人
所出的数字>=N的时候就输了。好吧：
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int QuickMod(int a,int b,int n)
{
int r = 1;
while(b)
{
if(b&1)
r = (r*a)%n;
a = (a*a)%n;
b >>= 1;
}
return r;
}
int n, k;
int main()
{
while(scanf("%d%d", &n, &k) && n && k)
{
n--;
if(n % (k+1) == 0)
printf("Jiang\n");
else
printf("Tang\n");
}
return 0;
}
Cut the Cake
按照题目的要求，大数求GCD，JAVA被搞掉了：
import java.util.Scanner;
import java.math.BigInteger;
import java.io.*;
public class Main {
public static void main(String[] args){
Scanner cin = new Scanner(System.in);
BigInteger a, b, c, m;
int T = cin.nextInt();
while(T-- > 0){
b = cin.nextBigInteger();
a= cin.nextBigInteger();
int tm = a.intValue();
c = a;
m = b.pow(tm - 1);
BigInteger temp = c.gcd(m);
c = c.divide(temp);
m = m.divide(temp);
System.out.println(c + "/" + m);
}
}
}