제출 #200461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200461		Sorting	새로운 문제 (POI11_sej)	C++14	21 / 100	7 ms	632 KiB

sej

#include <bits/stdc++.h>

using namespace std;

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

	int n, k;
	cin >> n >> k;

	vector<int> m(k);
	for(int i = 0; i < k; ++i)
		cin >> m[i];

	vector<long long > divisors;
	divisors.push_back(1);
	divisors.push_back(n);
	for(long long d = 2; d * d <= n; ++d){
		if(n % d == 0){
			divisors.push_back(d);
			if(n / d != d)
				divisors.push_back(n / d);
		}
	}

	sort(divisors.begin(), divisors.end());
	for(long long d: divisors){
		if(m[k - 1] % d != 0)
			continue;

		bool ok = true;
		for(int i = 0; i < k - 1; ++i){
			if(m[i] % d == 0){
				ok = false;
				break;
			}
		}

		if(ok){
			cout << n / d << "\n";
			return 0;
		}
	}

	cout << "0\n";
}

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