暴力枚举如何优化?(60pts)
查看原帖
暴力枚举如何优化?(60pts)
1044048
Algorithm_ZRF楼主2023/11/22 20:48
#include <iostream>
using namespace std;
int x,y,cnt;
inline int gcd(int a, int b) {
	while (b != 0) {
		int tmp = a;
		a = b;
		b = tmp % b;
	}
	return a;
}

inline int lcm(int a,int b,int gcd) {
	int lcm = a;
	a = (a * b) / gcd;
	return a;
}

signed main() {
	cin >> x >> y;
	for(int i = 1; i <= y; ++i) {
		for(int j = 1; j <= y; ++j) {
			if(gcd(i,j) == x && lcm(i,j,gcd(i,j)) == y) {
				cnt++;
			}
		}
	}
	cout << cnt;
	return 0;
}

#6 #7 #9 #10 TLE

2023/11/22 20:48
加载中...