![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Codeforces
文章平均质量分 67
普通网友
这个作者很懒,什么都没留下…
展开
-
Codeforces 414A
1 #include 2 #include 3 #include 4 using namespace std; 5 int main(){ 6 int n,k; 7 while(~scanf("%d%d",&n,&k)){ 8 if(n == 1 && k > 0 || k 2) printf("-1\n"); 9原创 2014-04-30 18:38:53 · 471 阅读 · 0 评论 -
Codeforces 283A
A. Cows and Sequencetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBessie and the cows are playing with sequences a原创 2014-04-30 18:37:16 · 353 阅读 · 0 评论 -
Codeforces 14D
C - Two PathsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 14DDescriptionAs you know, Bob's brother lives in Flatland. I原创 2014-04-30 18:37:31 · 443 阅读 · 0 评论 -
Codeforce A. Milking cows
A. Milking cowstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub helps his grandfather at the farm. Today he must原创 2014-04-30 18:37:08 · 404 阅读 · 0 评论 -
CodeForces 370A Rook, Bishop and King
这题看似很简单,实际上有不少细节,WAd原创 2014-07-16 17:55:12 · 550 阅读 · 0 评论 -
CodeForces 287B Pipeline
思路:二分答案,若满足当前原创 2014-07-16 18:02:00 · 648 阅读 · 0 评论 -
CodeForces 368B Sereja and Suffixes
题意:给你一个序列,问你从l位置到结尾you原创 2014-07-16 17:52:26 · 415 阅读 · 0 评论 -
codeforces 401D (数位DP)
思路:很明显的数位DP,设dp[i][j] 表示原创 2014-08-07 21:14:41 · 544 阅读 · 0 评论 -
codeforces 260 div2 B题
打表发现规律,对4取模为0的结果为4,否则为0,原创 2014-08-09 07:57:27 · 460 阅读 · 0 评论 -
codeforces 260 div2 C题
C题就是个dp,把原数据排序去重之后得到原创 2014-08-09 07:59:43 · 699 阅读 · 0 评论 -
Codeforces 279C
C. Ladder time limit per test 2 seconds memory limit per test 256 megabytes原创 2014-04-30 18:38:04 · 487 阅读 · 0 评论 -
Codeforces 302D
D. Yaroslav and Timetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYaroslav is playing a game called "Time". The ga原创 2014-04-30 18:37:29 · 342 阅读 · 0 评论 -
Codeforces 242(DIV 2) A题
A. Squatstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha has many hamsters and he makes them work out. Today, n原创 2014-04-30 18:39:43 · 439 阅读 · 0 评论 -
Codeforces 370B
Lately, a national version of a bingo game has become very popular in Berland. There are n players playing the game, each player has a card with numbers. The numbers on each card are distinct, but dis原创 2014-04-30 18:36:24 · 399 阅读 · 0 评论 -
Codeforces 202(DIV2)A
A. Difference Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou want to arrange n integers a1, a2, ..., an in s原创 2014-04-30 18:35:01 · 412 阅读 · 0 评论 -
Codeforces 237C
C. Primes on Intervaltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've decided to carry out a survey in the the原创 2014-04-30 18:37:22 · 402 阅读 · 0 评论 -
Codeforce 340D
D. Bubble Sort Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub recently has learned Bubble Sort, an algori原创 2014-04-30 18:37:20 · 393 阅读 · 0 评论 -
Codeforces 201(DIV2)B
B. Fixed Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of length n is an integer sequence such原创 2014-04-30 18:34:59 · 393 阅读 · 0 评论 -
Codeforces 242(DIV 2) C题
C. Magic Formulastime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeople in the Tomskaya region like magic formulas v原创 2014-04-30 18:39:47 · 451 阅读 · 0 评论 -
Codeforces 242(DIV 2) B题
B. Megacitytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe administration of the Tomsk Region firmly believes th原创 2014-04-30 18:39:45 · 494 阅读 · 0 评论 -
Codeforces 115A
A. Partytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA company has n employees numbered from 1 to n. Each employe原创 2014-04-30 18:37:24 · 562 阅读 · 0 评论 -
codedorces 260 div2 A题
水题,扫描一遍原创 2014-08-09 07:54:07 · 458 阅读 · 0 评论