Difference between revisions of "2019 Multi-University,Nowcoder Day 10"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
|||
Line 24: | Line 24: | ||
Solved by Weaver_zhu. 00:57:31 (+1) | Solved by Weaver_zhu. 00:57:31 (+1) | ||
+ | |||
+ | 增量法CRT模板题,要高精度 | ||
== Problem E == | == Problem E == |
Revision as of 01:21, 3 September 2019
Problem A
Upsolved by Kilo_5723. (-1)
Problem B
Solved by Xiejiadong. 00:22:29 (+1)
题意:给出一个斐波那契字符串,求某一位开始的十个字符分别是什么。
题解:只需要输出十个字符串,直接暴力。
考虑从最后往前做,需要判断来自前半段还是后半段,递归下去。
可以发现当 $n=60$ 的时候,长度就远大于题面了,所以超过 $60$ 的,一定属于前半段。
这样一直递归到初始条件输出即可。
Problem C
Unsolved.
Problem D
Solved by Weaver_zhu. 00:57:31 (+1)
增量法CRT模板题,要高精度
Problem E
Solved by Kilo_5723. 00:25:09 (+1)
Problem F
Solved by Kilo_5723. 01:21:05 (+)
Problem G
Unsolved.
Problem H
Solved by Xiejiadong. 00:52:41 (+1)
题意:判断六元烷烃属于哪一种。
题解:大部分的直接通过度数判断即可,就是 $2$ 型和 $3$ 型的度数是完全同构的,拿度数 $3$ 的那个点,再做一次判断即可。
Problem I
Unsolved.
Problem J
Unsolved. (-11)