Submission #1869808

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int maxn = 2e5 + 20;

int n;
string s, t, nums[maxn], numt[maxn], ans;

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> s >> t;
	if (s > t)
		swap (s, t);
	int ss = s.size(), tt = t.size();

	for (int i = 1; i * ss <= n; i++)
		nums[i] = nums[i-1] + s;
	for (int i = 1; i * tt <= n; i++)
		numt[i] = numt[i-1] + t;
	ans = "#";
	for (int i = 0; i * ss <= n; i++)
		if ( (n - i * ss) % tt == 0)
			if (ans == "#")
				ans = nums[i] + numt[ (n - i*ss) / tt ];
			else
				ans = min (ans, (nums[i] + numt[ (n - i*ss) / tt ] ));
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result