Infinite String Comparision

链接：https://ac.nowcoder.com/acm/contest/5666/F
来源：牛客网

题目描述
For a string $x$, Bobo defines $x^{\infty }=xxx\dots$, which is $x$ repeats for infinite times, resulting in a string of infinite length.

Bobo has two strings aa and bb. Find out the result comparing $a^{\infty }$ and $b^{\infty }$ in lexicographical order.

You can refer the wiki page for further information of Lexicographical Order.

输入描述:
The input consists of several test cases terminated by end-of-file.

The first line of each test case contains a string $a$, and the second line contains $a$ string $b$.

• $1\le |a|,|b|\le 10^5$

• $a$, $b$ consists of lower case letters.

• The total length of input strings does not exceed $2\times 10^6$.

输出描述:
For each test case, print “=” (without quotes) if $a^{\infty }=b^{\infty }$. Otherwise, print “<” if $a^{\infty }<b^{\infty }$, or “>” if $a^{\infty }>b^{\infty }$.

示例1

输入
aa
b
zzz
zz
aba
abaa
输出
<
=
>

设$s_1=a+b$，$s_2=b+a$，则
$s_1^{\infty }=ababab\dots$
$s_2^{\infty }=bababa\dots$
显然$s_1^{\infty }$和$s_2^{\infty }$都包含子序列$a^{\infty }$和$b^{\infty }$，且$s_1$，$s_2$的字典序大小关系与$s_1^{\infty }$，$s_2^{\infty }$的字典序大小关系相同。
令$s_1^{\infty }$，$s_2^{\infty }$长度相等，则可以把序列看做是数字，字典序大小看做是数字大小的比较。
比较大小应当是各位的数乘上对应位的权值，不妨设$s_1^{\infty }$中$a^{\infty }$对应的权值总和为$su{m}_1$；$b^{\infty }$对应的权值总和为$su{m}_2$，则$s_1^{\infty }$中$a^{\infty }$对应的权值总和为$su{m}_2$；$b^{\infty }$对应的权值总和为$su{m}_1$。
$\begin{array}{rl}{s}_1^{\infty }-s_2^{\infty }& =(su{m}_1\cdot a^{\infty }+su{m}_2\cdot b^{\infty })-(su{m}_2\cdot a^{\infty }+su{m}_1\cdot b^{\infty })\\ & =(su{m}_1-su{m}_2)\cdot (a^{\infty }-b^{\infty })\end{array}$
显然$su{m}_1-su{m}_2>0$
因此$a^{\infty }$，$b^{\infty }$的字典序大小关系与$s_1^{\infty }$，$s_2^{\infty }$的字典序大小关系相同。
即$a^{\infty }$，$b^{\infty }$的字典序大小关系与$s_1$，$s_2$的字典序大小关系相同。
因此直接比较$s_1$，$s_2$的字典序大小关系即可。复杂度为$O(n)$。

#include<bits/stdc++.h>

#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) for(register int i=a;i<=b;++i)
#define repd(i, a, b) for(register int i=a;i>=b;--i)
#define reps(s) for(register int i=head[s];i;i=Next[i])
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int,int>
#define mii unordered_map<int,int>
#define msi unordered_map<string,int>
#define lowbit(x) ((x)&(-(x)))
#define ce(i, r) i==r?'\n':' '
#define pb push_back
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;

inline int qr() {
    int f = 0, fu = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-')fu = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        f = (f << 3) + (f << 1) + c - 48;
        c = getchar();
    }
    return f * fu;
}

string a, b;
string s1, s2;

int main() {
    while (cin >> a, cin >> b) {
        s1 = a + b, s2 = b + a;
        if (s1 > s2)puts(">");
        else if (s1 < s2)puts("<");
        else puts("=");
    }
    return 0;
}