結果
問題 | No.1217 せしすせそ |
ユーザー |
|
提出日時 | 2021-10-21 13:59:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 60 ms / 2,000 ms |
コード長 | 1,756 bytes |
コンパイル時間 | 180 ms |
コンパイル使用メモリ | 82,248 KB |
実行使用メモリ | 65,764 KB |
最終ジャッジ日時 | 2024-09-21 09:24:12 |
合計ジャッジ時間 | 1,712 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 |
ソースコード
from sys import setrecursionlimit, stdinfrom collections import defaultdict, dequefrom itertools import permutations, combinations, productfrom functools import lru_cachefrom random import sample, choice, randint, randomfrom heapq import heappush, heappopfrom math import factorial, gcd, expfrom copy import copy, deepcopyfrom time import timesetrecursionlimit(10 ** 6)readline = stdin.readline# @lru_cache(maxsize=None)INF = 10 ** 18MOD = 1000000007# MOD = 998244353DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]def I(): return int(readline())def S(): return readline()[:-1]def LI(): return list(map(int, readline().split()))def SPI(): return map(int, readline().split())def SPII(): return map(lambda x: int(x)-1, readline().split())def FIE(x): return [readline()[:-1] for _ in [0] * x]def NODE(x): return [[] for _ in [0] * x]def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx]def imax(A, idx=-1, m=-(1<<18)):for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a]return idxdef imin(A, idx=-1, m=1<<18):for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a]return idxdef cmin(dp, i, x):if x < dp[i]: dp[i] = xdef cmax(dp, i, x):if x > dp[i]: dp[i] = xdef gen(x, *args):ret = [x] * args[-1]for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]return retdef puts(E):for e in E: print(e)def pprint(E):print()puts(E)####################################################################s = S()for i, e in enumerate(s):g = chr(ord('a')+i)if g == e: continueprint('{}to{}'.format(g, e))