素数间隔很小,在大概<1000的范围内.
匹配.一些边,使得二分图的两岸两两匹配.即一条边,就是匹配了一对人.
最大匹配,最多边.
所谓匈牙利算法,就是给每一个点找配对,如果他找到一个点,而这个点刚好没有被配对,那么就可以直接配上,但是他很不讲道理,如果配不上,就要要然这个点回退,看他原配能不能再配上,那么他的原配,也要重复这个过程.
/* Farewell. */
#include <iostream>
#include <vector>
#include <cstdio>
#include <stack>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <set>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define MT make_tuple
#define PB push_back
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
typedef pair<LL,LL> pll;
typedef pair<double,double > pdd;
typedef pair<double,int > pdi;
const int INF = 0x7fffffff;
const LL INFF = 0x7f7f7f7fffffffff;
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
const int MAXM = 5e3+17;
const int MOD = 998244353;
const int MAXN = 1e3+17;
LL uN,vN; //u,v数目
int G[MAXN][MAXN];//编号是0~n-1的
int linker[MAXN];
bool used[MAXN];
bool dfs(int u)
{
for(int v = 0 ;v < vN;v++)
if(G[u][v]&&!used[v])
{
used[v]=true;
if(linker[v]==-1||dfs(linker[v]))
{
linker[v]=u;
return true;
}
}
return false;
}
int hungary()
{
int res=0;
int u;
memset(linker,-1,sizeof(linker));
for(u=0;u<uN;u++)
{
memset(used,0,sizeof(used));
if(dfs(u)) res++;
}
return res;
}
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#endif
int t,x=1;
cin>>t;
while(t--)
{
printf("Case #%d: ",x++ );
int n,s;
cin>>s>>n;
if(s<n) swap(s,n);
if(n>300) puts("No");
else
{
memset(G,0,sizeof(G));
uN = vN = n;
for (LL i = s+1,p = 0; i <= n+s; ++i,++p)
for (LL j = 1,q = 0; j <= n; ++j,++q)
if(i%j==0)
{
G[p][q]= 1;
}
if(hungary()==n)
puts("Yes");
else
puts("No");
}
}
return 0;
}