Rrrrya

A：棋盘问题（dfs暴力枚举每一行的摆放情况，同时存储每一列的摆放情况）B：Dungeon Master（bfs三维最短路）C：Catch That Cow（bfs暴力枚举三种操作）D：Filptile（dfs状态压缩枚举第一行的情况，可以推出之后所有行的情况）E：Find The Multiple（dfs暴力跑19位数即可）F：Prime Path（bfs枚举每一位数可能变化的情况）G：Shuffle‘m Up（根据题意模拟即可）H：Pots（bfs暴力枚举6种操作）I：Fire Gam.

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint gcd(int a, int b) {return b==0 ? a:gcd(b,

#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint n, k;long long cnt = INF;int vis[1000010];struct node{ int x; long long st;

#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <map>using namespace std;#define INF 0x3f3f3fint s[10][10];int vis[10][10];int xx[] = {1,-1,0,0};int yy[] = {0,0,1,-1};struct node{

#include <iostream>#include <cstdio>#include <cstring>#include <queue>using namespace std;#define INF 0x3f3f3fint l, r, c;char s[35][35];int mp[35][35][35];int vis[35][35][35];int sx, sy, sz, ex, ey, ez;int xx[] = {-1,1,0

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int n, k;char s[10][10];int mp[10][10];int vis[10];int cnt;void dfs(int c, int num){ //cout << c << " " << num << endl; i