Submission #2943150

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<P>edge[1005][1005];
bool used[1005][1005];
int n,m;
void dfs(int x,int y){
	if(used[x][y]) return;
	used[x][y] = 1;
	rep(i,edge[x][y].size()){
		int to = edge[x][y][i].fi;
		int to2 = edge[x][y][i].sc;
		dfs(to,to2);
	}
}
int main(){
	cin>>n>>m;
	repn(i,999) repn(j,999){
		int x = i,y = j;
		if(x<y){
			int z = 0;
			while(x){
				z = z*10+x%10;
				x /= 10;
			}
			x = z;
		}
		else{
			int z = 0;
			while(y){
				z = z*10+y%10;
				y /= 10;
			}
			y = z;
		}
		if(x<y){
			y -= x;
		}
		else{
			x -= y;
		}
		if(x == 0 || y == 0){
			edge[0][0].pb(mp(i,j));
		}
		else{
			edge[x][y].pb(mp(i,j));
		}
	}
	dfs(0,0);
	int ans = 0;
	repn(i,n) repn(j,m){
		if(!used[i][j]) ans++;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result