规律
狠人王
怀着一颗热情的心,追随自己的梦想!
展开
-
【Atcoder】B - Uneven Numbers
Time Limit: 2 sec / Memory Limit: 1024 MB Score : 200 points Problem Statement Given is an integer N . Find the number of positive integers less than or equal to N that have an odd number of digits (i...原创 2019-08-04 21:50:28 · 196 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛A题(打表)(规律)
Description Alice, a student of grade 666, is thinking about an Olympian Math problem, but she feels so despair that she cries. And her classmate, Bob, has no idea about the problem. Thus he wants you...原创 2019-08-08 15:29:30 · 218 阅读 · 0 评论 -
【codeforce】C. Maximum Median(规律)
Description You are given an array a of n integers, where n is odd. You can make the following operation with it: Choose one of the elements of the array (for example ai) and increase it by 1 (that is...原创 2019-08-09 14:56:57 · 622 阅读 · 0 评论 -
【codeforce】A. Tokitsukaze and Enhancement(水题)(规律)
Tokitsukaze is one of the characters in the game “Kantai Collection”. In this game, every character has a common attribute — health points, shortened to HP. In general, different values of HP are grou...原创 2019-08-10 09:31:53 · 170 阅读 · 0 评论 -
【codeforce】A. BowWow and the Timetable(数学,二进制)
In the city of Saint Petersburg, a day lasts for21002100minutes. From the main station of Saint Petersburg, a train departs after11minute,44minutes,1616minutes, and so on; in other words, the t...原创 2019-08-21 10:00:35 · 187 阅读 · 0 评论 -
【codeforce】A. Nicholas and Permutation
Nicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a permutation of size n. Nicholas want the minimum element (integer 1) and the maximum element (int...原创 2019-08-12 14:09:10 · 124 阅读 · 0 评论 -
【codeforce】1200C - Round Corridor
Amugae is in a very large round corridor. The corridor consists of two areas. The inner area is equally divided by n sectors, and the outer area is equally divided by m sectors. A wall exists between ...原创 2019-08-12 14:35:57 · 235 阅读 · 0 评论 -
【51nod】2651 区间和的和
输入一个长度为n的数组a,a包括(n+1)n/2个区间。每个区间所有数的和,被称为区间和,求所有(n+1)n/2个区间和的和。由于数值较大,输出mod 1e9+7的结果。 例如: 3个数1 2 3,共有6个子区间,包含的数字如下: {1} {2} {3} {1 2} {2 3} {1 2 3},这些区间求和为1 2 3 3 5 6,这6个数字再求和为20. 收起 输入 第一行一个整...原创 2019-09-09 19:30:39 · 850 阅读 · 0 评论