제출 #167923

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167923		Thuleanx	새로운 문제 (POI11_sej)	C++14	100 / 100	236 ms	6148 KiB

sej

#include <bits/stdc++.h>
using namespace std;

unordered_set<long long> vis;
vector<int> primes;
long long ans;

void brute_force(long long v, bool save) {
	if (save)
		ans = min(ans, v);
	vis.insert(v);
	for (long long p : primes)
		if (v%p==0 && !vis.count(v / p))
			brute_force(v/p, save);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n; long long m; cin>>m>>n;
	long long a[n];
	for (int i = 0; i < n; i++) {
		cin>>a[i];
		a[i] = __gcd(a[i], m);
	}
	for (long long p = 2, x = a[n-1]; p*p <= x; p++) {
		if (x%p == 0) {
			primes.push_back(p);
			while (x%p == 0)
				x /= p;
		}
		if ((p+1)*(p+1)>x && x>1)
			primes.push_back(x);
	}
	ans = m;
	for (int i = 0; i < n; i++)
		brute_force(__gcd(a[i], a[n-1]), i == n-1);
	cout << m/ans << endl;

	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7
• Subtask 11: 7 / 7
• Subtask 12: 7 / 7
• Subtask 13: 8 / 8
• Subtask 14: 8 / 8