“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛 I.丢史蒂芬妮

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<cmath>
#include<set>
#include<stack>
#define ll long long
#define pb push_back
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
#define cls(name,x) memset(name,x,sizeof(name))
#define pos first
#define index second
#define mp make_pair
using namespace std;
const int inf=1e9+10;
const ll llinf=1e16+10;
const int maxn=5e2+10;
const int maxm=1e2+10;
const int mod=1e9+7;
int n,m;
int dp[maxn][maxn];
void init()
{
    int fac[maxn];
    int k=0;
    bool prime[maxn];
    cls(prime,0);
    for(int i=2;i<maxn;i++)
    {
        if(prime[i]==0)
        {
            for(int j=2;i*j<maxn;j++)
                prime[i*j]=1;
            fac[k++]=i;
        }
    }
    cls(dp,0);
    for(int i=0;i<maxn;i++)
        for(int j=0;j<maxn;j++)
        {
            for(int t=0;fac[t]<=i;t++)
                if(dp[i-fac[t]][j]==0)
                    dp[i][j]=1;
            for(int t=0;fac[t]<=j;t++)
                if(dp[i][j-fac[t]]==0)
                    dp[i][j]=1;
            for(int t=0;fac[t]<=j&&fac[t]<=i;t++)
                if(dp[i-fac[t]][j-fac[t]]==0)
                    dp[i][j]=1;
        }
}
int main()
{
    //freopen("in.txt","r",stdin);
    int ncas;
    scanf("%d",&ncas);
    init();
    while(ncas--)
    {
        scanf("%d %d",&n,&m);
        printf("%s\n",dp[n-1][m-1]==0?"Shiro":"Sora");
    }
    return 0;
}