Submission #342333

#	Time	Username	Problem	Language	Result	Execution time	Memory
342333		VodkaInTheJar	Sažetak (COCI17_sazetak)	C++14	96 / 160	56 ms	65540 KiB

sazetak

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

const int maxn = 5e6 + 3; 
const int maxm = 13;

int n, m; 
int k[maxm];
void read()
{
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	cin >> k[i];
}

pair <long long, long long> extended_euclid(int a, int b)
{
	if (b == 0)
	return {1, 0};
	
	int r = a % b, q = a / b; 
	auto res = extended_euclid(b, r);
	
	return {res.second, res.first - 1ll * res.second * q};
}

bitset <1000000003> bs; 

void solve()
{
	int ans = 0;
	for (int i = 1; i <= m; i++)
	if ((n - 1) % k[i] == 0)
	{
		ans++;
		break;
	}
	
	n++;
	set <long long> s;
	vector <pair <long long, long long> > v;
	for (int i = 1; i <= m; i++)
	for (int j = 1; j <= m; j++)
	if (__gcd(k[i], k[j]) == 1)
	{
		long long period = 1ll * k[i] * k[j];
		auto sol = extended_euclid(k[j], k[i]);
		
		long long num = sol.second * k[i];
		num %= period;
		if (num < 0)
		num += period;
		
		if (num > n-2)
		continue;
		
		v.push_back({period, num});
	}
	
	if (v.empty())
	{
		cout << ans << endl;
		return;
	}
	
	for (auto i: v)
	for (long long j = i.second; j <= n-2; j += i.first)
	{
		if (!bs[j])
		{
			bs[j] = true;
			ans++;
		}
	}
	
	cout << ans << endl; 
}

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

	read();
	solve();
}

• Subtask 1: 96 / 160