{"problem":{"name":"Send More Money","description":{"content":"Given strings $S_1,S_2,S_3$ consisting of lowercase English letters, solve the alphametic $S_1+S_2=S_3$. Formally, determine whether there is a triple of **positive** integers $N_1, N_2, N_3$ satisfyi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":5000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc198_d"},"statements":[{"statement_type":"Markdown","content":"Given strings $S_1,S_2,S_3$ consisting of lowercase English letters, solve the alphametic $S_1+S_2=S_3$.\nFormally, determine whether there is a triple of **positive** integers $N_1, N_2, N_3$ satisfying all of the three conditions below, and find one such triple if it exists.  \nHere, $N'_1, N'_2, N'_3$ are strings representing $N_1, N_2, N_3$ (without leading zeros) in base ten, respectively.\n\n*   $N'_i$ and $S_i$ have the same number of characters.\n*   $N_1+N_2=N_3$.\n*   The $x$\\-th character of $S_i$ and the $y$\\-th character of $S_j$ is the same if and only if the $x$\\-th character of $N'_i$ and the $y$\\-th character of $N'_j$ are the same.\n\n## Constraints\n\n*   Each of $S_1$, $S_2$, $S_3$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S_1$\n$S_2$\n$S_3$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc198_d","tags":[],"sample_group":[["a\nb\nc","1\n2\n3\n\nOutputs such as $(N_1, N_2, N_3) = (4,5,9)$ will also be accepted, but $(1,1,2)$ will not since it violates the third condition (both `a` and `b` correspond to `1`)."],["x\nx\ny","1\n1\n2\n\nOutputs such as $(N_1, N_2, N_3) = (3,3,6)$ will also be accepted, but $(1,2,3)$ will not since it violates the third condition (both $1$ and $2$ correspond to `x`)."],["p\nq\np","UNSOLVABLE"],["abcd\nefgh\nijkl","UNSOLVABLE"],["send\nmore\nmoney","9567\n1085\n10652"]],"created_at":"2026-03-03 11:01:13"}}