Submission #3729976

---

Source Code Expand

import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.string;

void main() {
    auto N = readln.chomp.to!int;
    auto S = readln.chomp;
    auto T = readln.chomp;

    if (S.front == T.front && S.map!(s => s == S.front).all && T.map!(t => t == T.front).all) {
        S.front.repeat.take(N).writeln;
        return;
    }

    if (S == T) {
        string ans = "";
        while (ans.length < N) ans ~= S;
        ans.writeln;
        return;
    }

    for (int i = 0, j = 0; ; i = (i + 1) % S.length.to!int, j = (j + 1) % T.length.to!int) {
        if (S[i] < T[j]) {
            break;
        } else if (S[i] > T[j]) {
            swap(S, T);
            break;
        }
    }

    int X = (N - 1) / S.length.to!int + 1;
    X = X * S.length.to!int;
    while (X > N || (N - X) % T.length != 0) {
        X -= S.length.to!int;
    }

    string ans = "";
    while (ans.length < X) ans ~= S;
    while (ans.length < N) ans ~= T;

    ans.writeln;
}

Submission Info

Judge Result