解题报告
爱吃老谈酸菜的DV
选择适合自己的。
展开
-
Codeforces Round #620 (Div. 2):Shortest and Longest LIS
DiscriptionGildong recently learned how to find the longest increasing subsequence (LIS) in O(nlogn) time for a sequence of length n. He wants to test himself if he can implement it correctly, but he...原创 2020-02-16 22:30:37 · 202 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2):Air Conditioner
DiscriptionGildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.Gildong tries so hard to satisfy the customers that...原创 2020-02-16 21:59:21 · 800 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2):B. Longest Palindrome
DiscriptionReturning back to problem solving, Gildong is now studying about palindromes. He learned that a palindrome is a string that is the same as its reverse. For example, strings “pop”, “noon”, ...原创 2020-02-16 21:26:24 · 648 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2):A. Two Rabbits
DiscriptionBeing tired of participating in too many Codeforces rounds, Gildong decided to take some rest in a park. He sat down on a bench, and soon he found two rabbits hopping around. One of the ra...原创 2020-02-16 20:42:38 · 286 阅读 · 0 评论 -
Codeforces Round #619 (Div. 2):C. Ayoub's function
DiscriptionAyoub thinks that he is a very smart person, so he created a function f(s), where s is a binary string (a string which contains only symbols “0” and “1”). The function f(s) is equal to the...原创 2020-02-14 15:35:23 · 168 阅读 · 0 评论 -
Codeforces Round #619 (Div. 2):B. Motarack's Birthday
DiscriptionDark is going to attend Motarack’s birthday. Dark decided that the gift he is going to give to Motarack is an array a of n non-negative integers.Dark created that array 1000 years ago, so...原创 2020-02-14 15:20:58 · 339 阅读 · 0 评论 -
Codeforces Round #619 (Div. 2):A. Three Strings
DiscriptionYou are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is ai, the i-th letter of b is bi, the i-th letter ...原创 2020-02-14 14:47:30 · 299 阅读 · 0 评论 -
Codeforces Round #618 (Div. 2):C. Anu Has a Function
DiscriptionAnu has created her own function f: f(x,y)=(x|y)−y where | denotes the bitwise OR operation. For example, f(11,6)=(11|6)−6=15−6=9. It can be proved that for any nonnegative numbers x and y...原创 2020-02-13 20:39:31 · 256 阅读 · 0 评论 -
Educational Codeforces Round 82 (Rated for Div. 2):D. Fill The Bag
DiscriptionYou have a bag of size n. Also you have m boxes. The size of i-th box is ai, where each ai is an integer non-negative power of two.You can divide boxes into two parts of equal size. Your ...原创 2020-02-13 20:25:38 · 186 阅读 · 0 评论 -
Educational Codeforces Round 82 (Rated for Div. 2):C. Perfect Keyboard
DiscriptionPolycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where all 26 lowercase Latin letters will b...原创 2020-02-13 18:09:28 · 167 阅读 · 0 评论 -
Educational Codeforces Round 82 (Rated for Div. 2):B. National Project
DiscriptionYour company was appointed to lay new asphalt on the highway of length nn. You know that every day you can either repair one unit of the highway (lay new asphalt over one unit of the highw...原创 2020-02-13 15:44:01 · 287 阅读 · 0 评论 -
Educational Codeforces Round 82 (Rated for Div. 2):A. Erasing Zeroes
DiscriptionYou are given a string ss. Each character is either 0 or 1.You want all 1’s in the string to form a contiguous subsegment. For example, if the string is 0, 1, 00111 or 01111100, then all 1...原创 2020-02-13 15:11:04 · 163 阅读 · 0 评论 -
poj2800 Joseph's Problem
DiscriptionJoseph likes taking part in programming contests. His favorite problem is, of course, Joseph’s problem.It is stated as follows.There are n persons numbered from 0 to n - 1 standing in a ...原创 2020-02-11 22:58:06 · 157 阅读 · 0 评论 -
UVA - 1404 Prime k-tuple【筛素数】
discription{p1, . . . , pk : p1 < p2 < . . . < pk} is called a prime k-tuple of distance s if p1, p2, . . . , pk are consecutiveprime numbers and pk − p1 = s. For example, with k = 4, s = 8...原创 2020-02-11 21:02:11 · 231 阅读 · 0 评论 -
Uva 10061 进制问题【公式推导】
DiscriptionGiven a decimal integer number you will have to find out how many trailing zeros will be there in itsfactorial in a given number system and also you will have to find how many digits will...原创 2020-02-08 22:45:53 · 266 阅读 · 2 评论 -
POJ 2689【筛法求素数+区间筛素数】
DiscriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas thathas captured the interest of number theoreticians for thousands of years is the questio...原创 2020-02-08 20:49:51 · 179 阅读 · 0 评论 -
Codeforces Round #617 (Div. 3):C. Yet Another Walking Robot
DiscriptionThere is a robot on a coordinate plane. Initially, the robot is located at the point (0,0). Its path is described as a string s of length n consisting of characters ‘L’, ‘R’, ‘U’, ‘D’.Eac...原创 2020-02-05 20:50:03 · 184 阅读 · 0 评论 -
POJ - 1320:Street Numbers【佩尔方程】
DriscriptionA computer programmer lives in a street with houses numbered consecutively (from 1) down one sideof the street. Every evening she walks her dog by leaving her house and randomly turning ...原创 2020-02-04 18:26:04 · 215 阅读 · 0 评论 -
UVA10090 Marbles【扩展的欧几里得】
DiscriptionI have some (say, n) marbles (small glass balls) and I am going to buy some boxes to store them. Theboxes are of two types:T ype 1: each box costs c1 Taka and can hold exactly n1 marbles...转载 2020-02-02 18:07:57 · 197 阅读 · 0 评论 -
UVA - 10951 Polynomial GCD 【最大公共多项式】
DisctiptionGiven a decimal integer number you will have to find out how many trailing zeros will be there in itsfactorial in a given number system and also you will have to find how many digits will...原创 2020-02-02 16:50:44 · 238 阅读 · 0 评论 -
SDAU数论练习五-F【贪心】
DiscriptionOn one of the Caribbean Islands there are N tourists and you want to move them from this island to another one.There are only two boats on this island, the first one can hold n1 tourists ...原创 2020-01-31 16:22:53 · 337 阅读 · 0 评论 -
Codeforces 7C Line【扩展的欧几里得】
DiscriptionA line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from - 5·1018 to 5·1018 inclusive, or to fin...原创 2020-01-31 15:23:30 · 289 阅读 · 0 评论 -
Restoring Number【找规律,有坑】
DiscriptionPavel had two positive integers a and b. He found their sum s and greatest common divisor g, and forgot a and b after that. Help him to restore the original numbers.InputA single line co...原创 2020-01-29 21:47:41 · 248 阅读 · 0 评论 -
POJ -3641Pseudoprime numbers【筛素数+快速幂+欧拉函数降幂】
DisciptionFermat’s theorem states that for any prime number p and for any integer a > 1, a^p = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not...原创 2020-01-27 19:46:03 · 201 阅读 · 0 评论 -
SDAU数论练习四-I(我也不知道题号是啥,没搜到)【打表预处理】
DiscriptionI will show you the most popular board game in the Shanghai Ingress Resistance Team.It all started several months ago.We found out the home address of the enlightened agent Icount2three ...原创 2020-01-22 21:53:46 · 211 阅读 · 0 评论 -
hdu6441 Find Integer
Discriptionpeople in USSS love math very much, and there is a famous math problem .give you two integers n,a,you are required to find 2 integers b,c such that a^n + b^n= c^n.Inputone line contain...原创 2020-01-21 15:44:12 · 166 阅读 · 0 评论 -
K - GCD Again【欧拉函数】
DiscriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to become a “Big Cattle”.Now you will find that ...原创 2020-01-15 20:56:25 · 329 阅读 · 0 评论 -
C - GCD【化简+欧拉定理】
DiscriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6.(a,b) can be easily fo...原创 2020-01-15 20:47:40 · 353 阅读 · 0 评论 -
H - Description has only two Sentences【推导+欧拉定理】
Discriptiona n = X*a n-1 + Y and Y mod (X-1) = 0.Your task is to calculate the smallest positive integer k that a k mod a 0 = 0.InputEach line will contain only three integers X, Y, a 0 ( 1 < X...原创 2020-01-15 16:08:27 · 214 阅读 · 0 评论 -
G - Calculation【欧拉公式降幂】
DiscriptionAssume that f(0) = 1 and 0^0=1, f(n) = (n%10)^f(n/10) for all n bigger than zero. Please calculate f(n)%m. (2 ≤ n , m ≤ 10^9, x^y means the y th power of x).InputThe first line contains ...原创 2020-01-15 15:38:04 · 283 阅读 · 0 评论 -
B - HeHe【规律+积性函数+筛法求素数】
DiscriptionIn the equation X^2≡X(mod N) where x∈[0,N-1], we define He[N] as the number of solutions.And furthermore, define HeHe[N]=He[1]*……*He[N]Now here is the problem, write a program, output He...原创 2020-01-14 10:35:13 · 227 阅读 · 0 评论 -
I - How many integers can you find【容斥定理】
DiscriptionNow you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, and...原创 2020-01-13 19:45:46 · 104 阅读 · 0 评论 -
HDU - 2619 Love you Ten thousand years【原根】
DiscriptionLove you Ten thousand years------Earth’s rotation is a day that is the representative of a day I love you. True love, there is no limit and no defects. Earth’s revolution once a year, it i...原创 2019-12-21 17:15:44 · 138 阅读 · 0 评论 -
HDU1788 【中国剩余定理】
Discription我知道部分同学最近在看中国剩余定理,就这个定理本身,还是比较简单的:假设m1,m2,…,mk两两互素,则下面同余方程组:x≡a1(mod m1)x≡a2(mod m2)…x≡ak(mod mk)在0<=<m1m2…mk内有唯一解。记Mi=M/mi(1<=i<=k),因为(Mi,mi)=1,故有二个整数pi,qi满足Mipi+miqi=1...原创 2019-12-21 16:59:24 · 648 阅读 · 0 评论 -
HDU 2136【筛法打表】
DiscriptionEverybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime factor.The position of prime 2 is 1, prime 3 is 2, and prim...原创 2019-12-21 16:55:07 · 106 阅读 · 0 评论 -
HDU 12151:七夕节
描述七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:“你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!”人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2,3,4,6.你想知道你的另一半吗?Input输入数据的第一行是一个数字T(1<=T<=500000...原创 2019-12-21 16:50:31 · 142 阅读 · 0 评论 -
HDU1825【唯一分解定理+积性函数】
DiscriptionAs we all know, the next Olympic Games will be held in Beijing in 2008. So the year 2008 seems a little special somehow. You are looking forward to it, too, aren’t you? Unfortunately there...原创 2019-12-21 16:47:00 · 144 阅读 · 0 评论 -
HDU1792A New Change Problem【打表找规律】
DescriptionNow given two kinds of coins A and B,which satisfy that GCD(A,B)=1.Here you can assume that there are enough coins for both kinds.Please calculate the maximal value that you cannot pay and...原创 2019-12-21 16:33:00 · 275 阅读 · 0 评论 -
HDU 2197:本原串
描述由0和1组成的串中,不能表示为由几个相同的较小的串连接成的串,称为本原串,有多少个长为n(n<=100000000)的本原串?答案mod2008.例如,100100不是本原串,因为他是由两个100组成,而1101是本原串。Input输入包括多个数据,每个数据一行,包括一个整数n,代表串的长度。Output对于每个测试数据,输出一行,代表有多少个符合要求本原串,答案mod20...原创 2019-12-21 16:23:16 · 152 阅读 · 0 评论 -
HDU 2104:丢手绢【判断是否互质】
DiscriptionThe Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.Now I int...原创 2019-12-21 16:12:41 · 141 阅读 · 0 评论