Submission #3435186

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#define INF (long)1e9
const int MOD = 1e9 + 7;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
using namespace std;
typedef long long ll;
int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int a, b, c;
	cin >> a >> b >> c;
	int cnt = 0;
	int tmp = a;
	while(1)
	{
		if(a % b == c)
		{
			cout << "YES" << endl;
			return 0;
		}
		a += tmp;
		if(cnt >= 1000000)
			break;
		cnt++;
	}
	cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result