Difference between revisions of "XVIII Open Cup named after E.V. Pankratiev. Grand Prix of Eurasia"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Xiejiadong. 0:09 (+) == Problem B == Solved by Xiejiadong. 0:26 (+) == Problem C == Unsolved. == Problem D == Solved by Kilo_5723. 2:48 (+) =...") |
Xiejiadong (talk | contribs) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 2: | Line 2: | ||
Solved by Xiejiadong. 0:09 (+) | Solved by Xiejiadong. 0:09 (+) | ||
+ | |||
+ | 二进制转十六进制,签到题。 | ||
== Problem B == | == Problem B == | ||
Solved by Xiejiadong. 0:26 (+) | Solved by Xiejiadong. 0:26 (+) | ||
+ | |||
+ | 字符串比较签到题。 | ||
+ | |||
+ | 由于只给出保证了字符串的总长度,所以需要压到一维,然后标记一下开始和结束的位置。 | ||
== Problem C == | == Problem C == | ||
Line 46: | Line 52: | ||
Solved by Xiejiadong. 3:20 (+2) | Solved by Xiejiadong. 3:20 (+2) | ||
+ | |||
+ | 题意:尽可能多的提取 UTF-8 编码的字符,并且解码。 | ||
+ | |||
+ | 题解:可以发现 UTF-8 编码决定了每一个字节只能属于其中一种类型,所以可以直接暴力。 | ||
+ | |||
+ | 对于每一个位作为开头,判断是否可以作为 UTF-8 编码。 | ||
+ | |||
+ | 对于每一个可行的编码段,记录下来。判断是否连续,对于连续的长度 $\ge 3$ 的段进行输出。 | ||
+ | |||
+ | 不知道第一次的做法哪里有问题。重构了一遍就过了。 |
Latest revision as of 13:32, 9 October 2019
Problem A
Solved by Xiejiadong. 0:09 (+)
二进制转十六进制,签到题。
Problem B
Solved by Xiejiadong. 0:26 (+)
字符串比较签到题。
由于只给出保证了字符串的总长度,所以需要压到一维,然后标记一下开始和结束的位置。
Problem C
Unsolved.
Problem D
Solved by Kilo_5723. 2:48 (+)
Problem E
Unsolved.
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Solved by Weaver_zhu. 1:22 (+3)
Problem I
Unsolved.
Problem J
Solved by Kilo_5723. 2:34 (+9)
Problem K
Unsolved.
Problem L
Solved by Xiejiadong. 3:20 (+2)
题意:尽可能多的提取 UTF-8 编码的字符,并且解码。
题解:可以发现 UTF-8 编码决定了每一个字节只能属于其中一种类型,所以可以直接暴力。
对于每一个位作为开头,判断是否可以作为 UTF-8 编码。
对于每一个可行的编码段,记录下来。判断是否连续,对于连续的长度 $\ge 3$ 的段进行输出。
不知道第一次的做法哪里有问题。重构了一遍就过了。