2019年10月_旺崽

原创 HHUOJ 1408 在披萨店里的思考

HHUOJ 1408 在披萨店里的思考题目描述今天小明来到一家披萨店吃披萨，由于实在太饿了，他决定点一个超大的披萨。不过这家店很奇怪，制作的披萨都是矩形的。于是爱思考的小明想知道这个披萨能否完全放置于自己所在的圆桌之内，也就是披萨是否一定会有部分悬空于桌边之外。请你编程帮他解决。输入输入包含多组测试数据。每组输入数据一开始为一个整数r（1<=r<=1000），表示圆桌面的半径，...

2019-10-29 21:19:15 2742

原创 Codeforces Round #595 (Div. 3) C2. Good Numbers (hard version)

C2. Good Numbers (hard version) The only difference between easy and hard versions is the maximum value of n. You are given a positive integer number n. You really love good numbers so you want to fin...

2019-10-23 16:17:12 3078

原创 Codeforces Round #595 (Div. 3) B2. Books Exchange (hard version)

B2. Books Exchange (hard version) The only difference between easy and hard versions is constraints. There are n kids, each of them is reading a unique book. At the end of any day, the i-th kid will g...

2019-10-23 16:01:53 2951

原创 HHUOJ 1049 撸猫狂魔

HHUOJ 1049 撸猫狂魔题目描述 zyyyyy是一个二刺猿。虽然他没有九十八亿，但是他坚信可爱即正义，所以他特别喜欢撸猫。今天他为了让猫乖乖的被撸带了很多很多猫粮，猫粮被摆成网格图，于是一大群白猫为了吃猫粮也成了网格图。等它们吃的开心了zyyyyy就开始撸她们。当他撸某只猫的时候，这只猫所在的行和列的猫虽然在吃东西但还是会被吓得变色（白猫变黑猫，黑猫变白猫），而这只猫因为惊吓过度就变了...

2019-10-22 21:10:07 2751

原创牛客挑战赛33 B.鸽天的放鸽序列

题目描述擅长放鸽子的鸽天要确定自己的放鸽序列。放鸽序列是一个长度为n的01序列，表示接下来n天的是否放鸽。众所周知，鸽天是很喜欢鸽的，所以它想得到放鸽天数最多的序列并计数。放鸽序列有一个奇怪的要求，由于这个要求太奇怪了，所以接下来是一句话题意：定义一个长为n的01序列A1,A2……An的权值为F(n)=∑i=1n((∑j=1iAj)mod(2)) F(n) =\sum_{i=1}^...

2019-10-19 10:05:54 2685

原创 HHUOJ 1031 The Smartest Guy in HHU

HHUOJ 1031 The Smartest Guy in HHU 题目描述 Alice and Bob are all very smart guys in HHU and one day they asked Calvin to tell who is smarter. However later that day Alice came to Calvin Neo, gave him som...

2019-10-16 17:17:18 2762

原创 HHUOJ 1029 HHU tower

题目描述 there is a tower in the universe’s center - Hohai University, people call it HHU tower. HHU tower has 3 pillars(柱子). there is N plates(盘子) through these pillars which are labeled from 1 to N. HHU...

2019-10-10 19:07:22 2834

原创 HHUOJ 1014 火眼金睛

HHUOJ 1014 火眼金睛题目描述河海大学举办合唱比赛,比赛时,所有演唱人员需要从高到低依次排队. 为了确保演唱时的队形的整齐,导演不希望出现前后两名同学的身高差距太多,因此他希望在正式海选之前,就能知道某个参赛队在队员身高上是否能满足要求. 现在他给到你每个参赛队每个队员的身高,希望你能设计一个程序帮他计算出站好队形之后,前后两名同学身高差的最大值. 输入第一行n,表示有n个数(N&l...

2019-10-09 16:20:26 2825

原创 Codeforces Round #590 (Div. 3) C. Pipes

C. Pipes You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1,1) and the bottom right — (2,n). There are six types of pipes:...

2019-10-08 20:18:20 2663

原创 Codeforces Round #590 (Div. 3) B2. Social Network (hard version)

B2. Social Network (hard version) The only difference between easy and hard versions are constraints on n and k. You are messaging in one of the popular social networks via your smartphone. Your smart...

2019-10-02 10:32:17 3093 5

旺崽的博客