The 2019 ICPC Asia Nanjing Regional Contest
source link: http://www.shuizilong.com/house/archives/the-2019-icpc-asia-nanjing-regional-contest/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
https://codeforces.com/gym/103466
Problem A. A Hard Problem
Problem B. Chessboard
开始以为是培养皿问题。。。
后来发现只能连续的整行 or 整列。。(话说我小时候抄书的时候就喜欢用这种扫描方式。。。)
简单组合数讨论一下即可。
Problem C. Digital Path
Problem D. Holes
看起来是挺标准的期望 DP。。。居然是这套题里最难得题?
Problem E. Observation
不会。
https://blog.csdn.net/xym_CSDN/article/details/102906128
Problem F. Paper Grading
https://blog.csdn.net/qq_43202683/article/details/104100136
Problem G. Poker Game
Problem H. Prince and Princess
Problem I. Space Station
Problem J. Spy
Problem K. Triangle
Posted by
xiaodao
Category: 日常
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK