__MEET

2019年9月29日

摘要： Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of 阅读全文

posted @ 2019-09-29 23:11 __MEET 阅读(194) 评论(0) 推荐(0) 编辑

HDU 1018:Big Number （位数递推公式）

摘要： Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of 阅读全文

posted @ 2019-09-29 23:10 __MEET 阅读(197) 评论(0) 推荐(0) 编辑

2019年9月28日

D2. Remove the Substring (hard version) （KMP-next数组 ) （ Codeforces Round #579 (Div. 3) ）

摘要： The only difference between easy and hard versions is the length of the string. You are given a string ss and a string tt, both consisting only of low 阅读全文

posted @ 2019-09-28 20:09 __MEET 阅读(119) 评论(0) 推荐(0) 编辑

2019年9月27日

D. Marcin and Training Camp ( Codeforces Round #588 (Div. 2) )

摘要： Marcin is a coach in his university. There are nn students who want to attend a training camp. Marcin is a smart coach, so he wants to send only the s 阅读全文

posted @ 2019-09-27 20:25 __MEET 阅读(209) 评论(0) 推荐(0) 编辑

2019年9月26日

A. 2048 Game （模拟） Educational Codeforces Round 73 (Rated for Div. 2)

摘要： You are playing a variation of game 2048. Initially you have a multiset ss of nn integers. Every integer in this multiset is a power of two. You may p 阅读全文

posted @ 2019-09-26 14:57 __MEET 阅读(200) 评论(0) 推荐(0) 编辑

2019年9月25日

整数划分（DP）

摘要：将正整数n表示成一系列正整数之和：n=n1+n2+…+nk，其中n1≥n2≥…≥nk≥1，k≥1 #include<bits/stdc++.h> using namespace std; int dp[15][15]; int main() { int n,m,i,j,t; dp[1][1]=1; 阅读全文

posted @ 2019-09-25 23:21 __MEET 阅读(434) 评论(0) 推荐(0) 编辑

C. Substring Game in the Lesson （博弈（盲猜AC））（ Codeforces Round #586 (Div. 1 + Div. 2) ）

摘要： Mike and Ann are sitting in the classroom. The lesson is boring, so they decided to play an interesting game. Fortunately, all they need to play this 阅读全文

posted @ 2019-09-25 22:13 __MEET 阅读(252) 评论(0) 推荐(0) 编辑

B. Multiplication Table (模拟）（ Codeforces Round #586 (Div. 1 + Div. 2) ）

摘要： Sasha grew up and went to first grade. To celebrate this event her mother bought her a multiplication table MM with nn rows and nn columns such that M 阅读全文

posted @ 2019-09-25 19:46 __MEET 阅读(264) 评论(0) 推荐(0) 编辑

A. Cards （模拟）（Codeforces Round #586 (Div. 1 + Div. 2)）

摘要： When Serezha was three years old, he was given a set of cards with letters for his birthday. They were arranged into words in the way which formed the 阅读全文

posted @ 2019-09-25 19:45 __MEET 阅读(379) 评论(0) 推荐(0) 编辑

红与黑《BFS》

摘要：有一间长方形的房子，地上铺了红色、黑色两种颜色的正方形瓷砖。你站在其中一块黑色的瓷砖上，只能向相邻的黑色瓷砖移动。请写一个程序，计算你总共能够到达多少块黑色的瓷砖。Input包括多个数据集合。每个数据集合的第一行是两个整数W和H，分别表示x方向和y方向瓷砖的数量。W和H都不超过20。在接下来的H行中阅读全文

posted @ 2019-09-25 17:44 __MEET 阅读(254) 评论(0) 推荐(0) 编辑

稍有姿色，稍有才华，都是蛮尴尬的事情。会在无数个时刻，你站在一级台阶上，自以为窥见了天光