常用技巧,思维
文章平均质量分 75
liluoyu_1016
这个作者很懒,什么都没留下…
展开
-
HihoCoder - 1543 SCI表示法
每一个正整数 N 都能表示成若干个连续正整数的和,例如10可以表示成1+2+3+4,15可以表示成4+5+6,8可以表示成8本身。我们称这种表示方法为SCI(Sum of Consecutive Integers)表示法。 小Hi发现一个整数可能有很多种SCI表示,例如15可以表示成1+2+3+4+5,4+5+6,7+8以及15本身。小Hi想知道N的所有SCI表示中,最多能包含多少个连续正整原创 2017-08-02 10:38:51 · 189 阅读 · 0 评论 -
Aggressive cows POJ - 2456 二分 最大值最小化
Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000).His C (2 <= C <= N) cows原创 2017-08-04 09:28:15 · 193 阅读 · 0 评论 -
poj 3320 尺取
题目链接 http://poj.org/problem?id=3320题意输入n个数,求最短的连续子序列(子序列包含所有的元素)的长度题解 #include#include#includeusing namespace std;const int M=1000008;int a[M];int t;void solve(){ setcmp;原创 2017-07-15 17:02:15 · 218 阅读 · 0 评论 -
Sum of Consecutive Prime Numbers POJ - 2739 素数打表—埃氏筛法
Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two repre原创 2018-01-26 16:18:10 · 181 阅读 · 0 评论 -
矩阵 快速幂
1. 快速幂 O(logn)#include#includeusing namespace std;typedef long long ll;ll mod_pow(ll x,ll n){ ll ret=1; while(n>0) { if(n&1) ret=ret*x; x=x*x; n>原创 2017-08-09 11:24:52 · 155 阅读 · 0 评论 -
欧拉函数
1.求小于n与n互质的个数int euler(int n){ int ret=1,i; for( i=2;i*i<=n;i++) { if(n%i==0) { ret*=i-1; n/=i; } while(n%i==0)原创 2017-08-02 16:01:52 · 251 阅读 · 0 评论 -
机器人走方格 V2 51Nod - 1119 组合数学+逆元
M * N的方格,一个机器人从左上走到右下,只能向右或向下走。有多少种不同的走法?由于方法数量可能很大,只需要输出Mod 10^9 + 7的结果。 Input第1行,2个数M,N,中间用空格隔开。(2 <= m,n <= 1000000)Output输出走法的数量 Mod 10^9 + 7。Sample Input2 3Sample Output...原创 2018-01-29 19:21:59 · 178 阅读 · 0 评论 -
HDU 5965 扫雷 递推
扫雷游戏是晨晨和小璐特别喜欢的智力游戏,她俩最近沉迷其中无法自拔。 该游戏的界面是一个矩阵,矩阵中有些格子中有一个地雷,其余格子中没有地雷。 游戏中,格子可能处于己知和未知的状态。如果一个己知的格子中没有地雷,那么该 格子上会写有一个一位数,表示与这个格子八连通相邻的格子中地雷总的数量。现在,晨晨和小璐在一个3行N列(均从1开始用连续正整数编号)的矩阵中进 行游戏,在这个矩阵中,第2行原创 2017-10-06 19:50:22 · 241 阅读 · 0 评论 -
codeforces 939 A Love Triangle
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There aren planes on Earth, numbered from 1 to n, and the plane with number i l原创 2018-03-10 17:27:02 · 156 阅读 · 0 评论 -
Tempter of the Bone HDU - 1010 dfs+剪枝
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone原创 2018-03-13 17:42:40 · 157 阅读 · 0 评论 -
To Add or Not to Add CodeForces - 231C 尺取
A piece of paper contains an array of n integersa1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.However, before looking for such number, you ar原创 2018-03-24 20:33:29 · 193 阅读 · 0 评论 -
Detachment HDU - 5976 前缀+逆元+贪心
In a highly developed alien society, the habitats are almost infinite dimensional space. In the history of this planet,there is an old puzzle. You have a line segment with x units’ length representi...原创 2018-05-18 21:06:49 · 218 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第四场) G
链接:https://www.nowcoder.com/acm/contest/142/G来源:牛客网 题目描述The mode of an integer sequence is the value that appears most often. Chiaki has n integers a1,a2,...,an. She woud like to delete exactly ...原创 2018-08-01 09:41:38 · 133 阅读 · 0 评论 -
bzoj 2818 Gcd 线性筛欧拉+想法
Description给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对. Input一个整数NOutput如题Sample Input4 Sample Output4HINT hint对于样例(2,2),(2,4),(3,3),(4,2) 1<=N<=10^7 思路:假...原创 2018-08-18 17:21:44 · 150 阅读 · 0 评论 -
hdu 6396 Swordsman 读入优化+思维
roblem DescriptionLawson is a magic swordsman with k kinds of magic attributes v1,v2,v3,…,vk. Now Lawson is faced with n monsters and the i-th monster also has k kinds of defensive attributes ai,1,a...原创 2018-08-17 11:27:13 · 223 阅读 · 0 评论 -
51 nod 1267 4个数和为0
给出N个整数,你来判断一下是否能够选出4个数,他们的和为0,可以则输出"Yes",否则输出"No"。Input 第1行,1个数N,N为数组的长度(4 第2 - N + 1行:Ai(-10^9 iOutput 如果可以选出4个数,使得他们的和为0,则输出"Yes",否则输出"No"。 Sample Input 5-11-524Sample Output Yes原创 2017-07-25 19:18:27 · 202 阅读 · 0 评论 -
CodeForces - 698A Vacations 贪心 dp
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of thisn days: whether that gym opened and whether a contest was原创 2017-07-27 20:36:16 · 299 阅读 · 0 评论 -
An express train to reveries CodeForces - 814B
Sengoku still remembers the mysterious "colourful meteoroids" she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that a原创 2017-08-24 19:49:02 · 282 阅读 · 0 评论 -
I - New Year and Rating CodeForces - 750C 模拟
Every Codeforces user has rating, described with one integer, possibly negative or zero. Users are divided into two divisions. The first division is for users with rating1900 or higher. Those with r原创 2017-08-22 20:36:58 · 232 阅读 · 0 评论 -
Attack on Titans ZOJ - 3747 dp
Over centuries ago, mankind faced a new enemy, the Titans. The difference of power between mankind and their newfound enemy was overwhelming. Soon, mankind was driven to the brink of extinction. Lucki原创 2017-09-05 17:15:29 · 248 阅读 · 0 评论 -
Harmonic Number LightOJ - 1234 调和级数
In mathematics, the nth harmonic number is the sum of the reciprocals of the firstn natural numbers:In this problem, you are given n, you have to find Hn.Input Input starts with an integ原创 2017-10-07 19:47:49 · 353 阅读 · 0 评论 -
Is Derek lying? HDU - 6045 思维
Derek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer camp,there will原创 2017-10-08 17:39:37 · 212 阅读 · 0 评论 -
codeforces 869B The Eternal Immortality
Even if the world is full of counterfeits, I still regard it as wonderful.Pile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix d原创 2017-10-21 10:39:42 · 195 阅读 · 0 评论 -
Fibonacci Again HDU - 1021
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).Input Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).O原创 2017-11-04 09:44:50 · 176 阅读 · 0 评论 -
Coins POJ - 3210
Snoopy has three coins. One day he tossed them on a table then and tried to flip some of them so that they had either all heads or all tails facing up. After several attempts, he found that regardless原创 2018-01-22 10:44:31 · 220 阅读 · 0 评论 -
To the Max POJ - 1050
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of原创 2018-02-01 11:16:30 · 210 阅读 · 0 评论 -
Fliptile POJ - 3279 开关问题
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate anM × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 1原创 2018-01-27 17:14:50 · 308 阅读 · 0 评论 -
Doing Homework again HDU - 1789 贪心
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th原创 2017-12-30 18:12:38 · 235 阅读 · 1 评论 -
Radar Installation POJ - 1328 贪心
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the原创 2017-08-03 00:12:02 · 329 阅读 · 0 评论 -
hdu 2021 发工资咯:)贪心
发工资咯:)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62693 Accepted Submission(s): 33861Problem Description作为杭电的老师,最盼望的日子就是每月的8号原创 2017-07-15 11:15:35 · 321 阅读 · 0 评论 -
poj 3258 River Hopscotch (二分与贪心)
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a ro原创 2017-07-18 20:16:07 · 297 阅读 · 0 评论 -
hdu 6395 Sequence 分块+矩阵快速幂
Problem DescriptionLet us define a sequence as below ⎧⎩⎨⎪⎪⎪⎪⎪⎪F1F2Fn===ABC⋅Fn−2+D⋅Fn−1+⌊Pn⌋ Your job is simple, for each task, you should output Fn module 109+7. InputThe first li...原创 2018-08-17 15:02:21 · 196 阅读 · 0 评论