Algorithm
文章平均质量分 50
yurio7r
ipy8pyp
展开
-
Archer
CF上的一道题,就是求赢的概率。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){原创 2015-06-03 21:55:01 · 1007 阅读 · 0 评论 -
ZOJ 3758 Singles' Day
先化成十进制数,然后再判断是否是素数就行了。开始写了一个函数用来判断是否是素数,结果就超时了,然后写在里面判断就过了。还有要用long long,因为数据很大的,不然会wa#include #include #include #include #include #include #include #include #include #include #include #inc原创 2015-08-26 22:56:43 · 512 阅读 · 0 评论 -
uva 1394
简单的dp问题,百度百科有对约瑟夫环的解释!理解了就行#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #in原创 2015-08-13 17:35:03 · 423 阅读 · 0 评论 -
Gerald is into Art(CF)
我这道题就是暴力的。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int arr[1001];int main()原创 2015-07-23 10:56:26 · 517 阅读 · 0 评论 -
cf559A
题意:求六边形里面三角形的个数。 先补成大的正三角形,然后减去小的三个正三角形。#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeu原创 2015-07-24 10:14:50 · 1061 阅读 · 0 评论 -
弱校联萌十一大决战之强力热身 B题
frog has n integers a1,a2,…,an, and she wants to add them pairwise. Unfortunately, frog is somehow afraid of carries (进位). She defines \emph{hardness} h(x,y) for adding x and y the number of carries原创 2015-10-02 19:55:06 · 1423 阅读 · 0 评论 -
弱校联萌十一大决战之强力热身 A题
A. Easy MathGiven n integers a1,a2,…,an, check if the sum of th原创 2015-10-01 22:31:28 · 700 阅读 · 0 评论 -
kmp算法的next数组讲解
我们在一个母字符串中查找一个子字符串有很多方法。KMP是一种最常见的改进算法,它可以在匹配过程中失配的情况下,有效地多往后面跳几个字符,加快匹配速度。当然我们可以看到这个算法针对的是子串有对称属性,如果有对称属性,那么就需要向前查找是否有可以再次匹配的内容。 在KMP算法中有个数组,叫做前缀数组,也有的叫next数组,每一个子串有一个固定的next数组,它记录着字符串匹配过程中失配情况转载 2015-10-11 22:52:21 · 794 阅读 · 0 评论 -
一维多项式求值
//describe: 计算一维多项式的值//arr是存的系数,n代表一共有多少项,x就是输入啦#include using namespace std;double cal(double x,int n,double arr[]){ double tmp=arr[n-1]; for(int i=n-2;i>=0;--i) { tmp=tmp*x+arr[i];原创 2015-11-14 12:53:50 · 568 阅读 · 0 评论 -
博弈论知识汇总(算法)
原文地址:http://www.wutianqi.com/?p=1081以下是我从网上收集的关于组合博弈的资料汇总:有一种很有意思的游戏,就是有物体若干堆,可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干,规定最后取光物体者取胜。这是我国民间很古老的一个游戏,别看这游戏极其简单,却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。(一)巴什博奕转载 2016-03-03 23:24:43 · 3354 阅读 · 0 评论 -
POJ3979
题目意思很明了,然后就是按照自己想的把代码写下来咯。#include#include#include#include#include#include#includeusing namespace std;int gcd(int a,int b){ return b==0?a:gcd(b,a%b);}int main(){ int t1,t2,t3,t4;原创 2015-07-17 22:32:26 · 730 阅读 · 0 评论 -
POJ3749
感觉这道题的难点主要还是在输入吧。我用的是getline。#include#include#include#include#include#include#includeusing namespace std;int main(){ string s1,s2,s; while (cin>>s1&&s1!="ENDOFINPUT") {原创 2015-07-17 22:36:08 · 612 阅读 · 0 评论 -
Squares
DescriptionVasya has found a piece of paper with a coordinate system written on it. There are n distinct squares drawn in this coordinate system. Let's number the squares with integers from 1 to n原创 2015-06-03 13:21:27 · 882 阅读 · 0 评论 -
Sereja and Array
CF上的一道题。模拟,按照它的意思做就行了。#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAX=100020;int arr原创 2015-06-03 21:40:52 · 560 阅读 · 0 评论 -
数塔问题
#include#include#include#include#include#include#include#include#include#includeconst int MAX=102;using namespace std;int main(){ int arr[MAX][MAX]={0}; int dp[MAX][MAX]; int t; cin>>原创 2015-05-23 19:49:38 · 876 阅读 · 0 评论 -
POJ1979题解
Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 25024 Accepted: 13511DescriptionThere is a rectangular room, covered with square tiles. Each原创 2015-05-19 13:43:28 · 742 阅读 · 0 评论 -
Aizu 0005
GCD AND LCMDescriptionWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 InputInput consists of several data sets. Eac原创 2015-06-06 23:39:44 · 669 阅读 · 0 评论 -
POJ 3616 (milking time)
DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1转载 2015-06-07 11:26:40 · 453 阅读 · 0 评论 -
POJ2376
Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12969 Accepted: 3348DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning cho原创 2015-06-07 17:15:41 · 596 阅读 · 0 评论 -
小数化成最简式分数
这道题是好久以前写的了。#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAX = 20;int gcd(int x, int y)原创 2015-06-08 20:19:21 · 1345 阅读 · 0 评论 -
POJ1328
就是找至少需要多少个圆可以把所有点覆盖完,圆心坐标必须在x轴上,所以当一个海岛坐标的y值大于d时,可以直接打印-1,这种情况不能覆盖完所有的点;其它情况,就是找出海岛对应的在x轴上的坐标点,然后再进行判断即可。#include#include#include#include#include#include#include#include#include#include#incl原创 2015-06-09 13:47:54 · 366 阅读 · 0 评论 -
POJ2431
题目的意思就是最少加几次油可以到达终点,不行就打印-1.#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;const i原创 2015-07-12 13:08:19 · 469 阅读 · 0 评论 -
最长回文子串
原文地址:https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/01.05.md题目描述给定一个字符串,求它的最长回文子串的长度。分析与解法最容易想到的办法是枚举所有的子串,分别判断其是否为回文。这个思路初看起来是正确的,但却做了很多无用功,如果一个长的子串转载 2016-03-04 12:46:00 · 366 阅读 · 0 评论