【思维题】
云淡风轻<<
这个作者很懒,什么都没留下…
展开
-
HDU 1110 盒子嵌套 (数学思维)
Description:There is a large room in the Pyramid called Room-of-No-Return. Its floor is covered by rectangular tiles of equal size. The name of the room was chosen because of the very high number of ...原创 2019-03-29 21:28:27 · 252 阅读 · 0 评论 -
ZOJ 2313(思路+大数)
DescriptionYou must have heard that the Chinese culture is quite different from that of Europe or Russia. So some Chinese habits seem quite unusual or even weird to us.So it is known that there is o...原创 2019-04-07 23:19:57 · 208 阅读 · 0 评论 -
HDU 4811(思维题)
DescriptionJenny likes balls. He has some balls and he wants to arrange them in a row on the table.Each of those balls can be one of three possible colors: red, yellow, or blue. More precisely, Jenn...原创 2019-04-08 17:14:27 · 525 阅读 · 0 评论 -
HCU 4440
Rectanglefrog has a piece of paper divided into n rows and m columns. Today, she would like to draw a rectangle whose perimeter is not greater than k.There are 8 (out of 9) ways when n = m = 2, k = ...原创 2019-04-24 08:48:18 · 327 阅读 · 0 评论 -
Codeforces Global Round 4
B WOWfactor这道题的话就是问你wow出现的次数有多少我的思路就是首先先对字符串进行处理,正着和倒着各计算一次i这个位置前面k出现的次数和i这个位置后面出现的次数,然后判断i是否为o,如果是,就把o前面w出现的次数乘于o后面w出现的次数,然后相加就是答案,因为数比较大,记得开long long#include<iostream>#include<stdio.h&g...原创 2019-07-26 10:24:32 · 84 阅读 · 0 评论 -
Educational Codeforces Round 69 (Rated for Div. 2)
A这个题的话,题意理解了也就能A了,给你一个数n然后接下来有n个数,每个数代表的是长度为n的木棍,然后最后问你用这些木棍最多能搭成一个有几层阶梯的梯子#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>#include<set>#de...原创 2019-07-27 16:54:40 · 49 阅读 · 0 评论 -
Codeforces Round #568 (Div. 2) D. Extra Element
outputstandard outputA sequence a1,a2,…,ak is called an arithmetic progression if for each i from 1 to k elements satisfy the condition ai=a1+c⋅(i−1) for some fixed c.For example, these five sequenc...原创 2019-08-10 17:00:34 · 58 阅读 · 0 评论 -
Codeforces Round #563 (Div. 2) D
Given two integers n and x, construct an array that satisfies the following conditions:for any element ai in the array, 1≤ai<2n;there is no non-empty subsegment with bitwise XOR equal to 0 or x,...原创 2019-08-15 17:00:47 · 94 阅读 · 0 评论 -
Codeforces Round #589 (Div. 2) C Primes and Multiplication
Let’s introduce some definitions that will be needed later.Let prime(x) be the set of prime divisors of x. For example, prime(140)={2,5,7}, prime(169)={13}.Let g(x,p) be the maximum possible integer...原创 2019-10-08 21:04:16 · 86 阅读 · 0 评论