Cf515b drazil and his happy friends

CF515B Drazil and His Happy Friends

The question ： Yes n A boy and m A girl , The first t Day invitation t%n Two boys and t%m Dinner with a girl , Some people are optimistic , Eating with optimistic people can make you optimistic , Ask if everyone can become optimistic in a few days .

solution ： Just direct violence , When I first thought of it, I always WA, Later I thought of , If the people behind are optimistic , Cycle only n*m Can't update to the person in front this time , So choose to cycle multiple times , In the future, problems with small data must be circulated to the end 0.0

Code ：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 110;
int n, m, nn, mm;
int a[N], b[N];
int tu[N][N];
int va[N], vb[N];
int main() {
    
	int x;
	scanf("%d%d", &n, &m);
	scanf("%d", &nn); while(nn--) scanf("%d", &x), a[x] = 1;
	scanf("%d", &mm); while(mm--) scanf("%d", &x), b[x] = 1;
	int t = 0;
	for(int t = 0; t <= n*m*2; ++t)  // This is it ！！
		if(a[t%n] || b[t%m]) a[t%n] = b[t%m] = 1;
	int f = 1;
	for(int i = 0; i < n; ++i) if(!a[i]) {
     f = 0; break; }
	for(int i = 0; i < m; ++i) if(!b[i]) {
     f = 0; break; }
	if(f) puts("Yes");
	else puts("No");
	return 0;
}