Codeforces Round #786 (Div. 3)
Monday, May 2, 2022 at 22:35UTC+8
上次浪费了大量时间写博客,这次不会了。
好恐怖,这次居然有6到8道题
“有预期难度”
其实就算没有预期难度爆零也是肯定的啦!
让我们一起勇敢地去爆零吧!
So, the dictionary looks like that:
You are given a word ss from the Berland language. Your task is to find its index in the dictionary.
Input
The first line contains one integer tt (1≤t≤6501≤t≤650) — the number of test cases.
Each test case consists of one line containing ss — a string consisting of exactly two different lowercase Latin letters (i. e. a correct word of the Berland la
编程竞赛反思与经验分享

最低0.47元/天 解锁文章
827

被折叠的 条评论
为什么被折叠?



