codeforces#292B_Drazil and His Happy Friends-暴力水题

题意：

隔壁老王有n个男朋友和m个女朋友，老王希望他们都开心，于是开始了他的脑残计划：第i天请编号为i%n的男朋友和编号为i%m的女朋友吃饭，这一天一起吃饭两个人如果有一个人开心，那么两个人都会永远开心。请问老王是否能让他的所有朋友都永远开心。

如果n,m足够大好像会涉及到公约数的问题，，，然而只有100..暴力跑个1e6就过了

#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>using namespace std;int peo[205];int girls[105];int boys[105]; int main(){int i,j;int n,m,g,b;scanf("%d%d",&n,&m);scanf("%d",&b);int tmp;for (i=1;i<=b;i++){scanf("%d",&tmp);boys[tmp]=1;}scanf("%d",&g);for (i=1;i<=g;i++){scanf("%d",&tmp);girls[tmp]=1;}int d=1;int cun=1000000;while(cun--){int t1=d%n;int t2=d%m;if (boys[t1]||girls[t2])boys[t1]=girls[t2]=1;d++;}int flag=0;for (i=0;i<n;i++){if (boys[i]==0){ flag=1;break;}}for (i=0;i<m;i++){if (girls[i]==0){ flag=1;break;}}if (flag)printf("No\n");elseprintf("Yes\n");return 0;}