原文:CF1181B

题面 主要思想 很明显,题面就是让你将一串数割开,使得隔开后的两数总和最小。 稍微分析一下后我们会想到:对于这里隔开后的两个数,他们的总位数一定,显然他们的位数越相近,总和就有机会越小。所以我们尝试从这串数的正中央着手割开,使用高精度进行操作。 我们从这串数的最中央开始分割,先尝试向左移动,找到该过程中第一个符合题意要求的方案,记录结果。然后再尝试向右移动,再找到该过程中第一个符合题意要求的方案, ...

2020-01-22 21:17 0 813 推荐指数:

查看详情

CF291-B

B. Han Solo and Lazer Gun time limit per test 1 second memory limit per test 256 megabytes input ...

Mon Feb 16 01:01:00 CST 2015 0 4295
CF-839B

B. Game of the Rows time limit per test 1 second memory limit per test 256 megabytes ...

Mon Aug 14 00:11:00 CST 2017 0 1515
CF335B

...

Mon Aug 05 05:56:00 CST 2013 0 3119
CF286-B

B. Mr. Kitayuta's Colorful Graph time limit per test 1 second memory limit per test 256 megabytes ...

Fri Feb 13 02:47:00 CST 2015 0 2209
CF916B

B. Jamie and Binary Sequence (changed after round) time limit per test 2 seconds memory limit per test 256 ...

Wed Jan 24 01:15:00 CST 2018 0 1302
CF-796B

B. Find The Bone time limit per test 2 seconds memory limit per test 256 megabytes ...

Wed May 03 05:15:00 CST 2017 0 1995
CF696B Puzzles

Description Barney lives in country USC (United States of Charzeh). USC has n cities numbered fr ...

Mon Oct 08 18:24:00 CST 2018 0 857
CF 965 B. Battleship

Arkady is playing Battleship. The rules of this game aren't really important.There is a field of n&a ...

Mon Apr 30 22:07:00 CST 2018 0 1298
 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM