青蛙的约会问题

解题如下：

/；

 代码如下：

#include<iostream>
#include<vector>

using namespace std;

int exced(int m, int n, int &x, int &y)
{
	if (n == 0)
	{
		x = 1;
		y = 0;
		return m;
	}
	int r = exced(n, m%n, x, y);
	int t = y;
	y = x - y*(m / n);
	x = t;
	return r;
}
void main()
{
	int x1 = 0;
	int y1 = 0;
	int x, y, m, n, l;
	cin >> x >> y >> m >> n >> l;
	int k = exced(n - m, l, x1, y1);
	if (k % (y - x) != 0)
	{
		cout << "no" << endl;
	}
	else
	{
		x1 = x1*((x - y) / k);
		int s = l / k;
		cout << (x1 %s + s) % s;
	}
	system("pause");

}