Submission #1870227

---

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;
int ans = 0, ss = s.size(), tt = t.size(), boz;

bool cmp (string s, string t)
{
	return s + t > t + s;
}
	
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> n >> s >> t;
	ss = s.size(), tt = t.size();
	if (ss > tt)
		swap (s, t), swap (ss, tt);
	if (cmp (s, t))
		swap (s, t);
 
	for (int i = 0; i * ss <= n; i++)
		if ( (n - i * ss) % tt == 0)
			ans = i, boz = (boz == -1 ? i : boz);
	string res1, res2;
	
	for (int i = 0; i < ans; i++)
		res1 += s;
	n -= ss * ans;
	for (int i = 0; i * tt < n; i++)
		res1 += t;

	n += ss * ans;
	for (int i = 0; i < boz; i++)
		res2 += s;
	n -= ss * boz;
	for (int i = 0; i * tt < n; i++)
		res2 += t;
	
	cout << (res1 < res2 ? res1 : res2) << endl;
 
	return 0;
}

Submission Info

Judge Result