algzjh的博客

模运算比较慢#include<bits/stdc++.h>using namespace std;typedef long long LL;int bit[20];LL dp[20][105][105];int gcd(int a,int b) {return b==0?a:gcd(b,a%b);}int lcm(int a,int b) {return a/gc...

1980: 不堪重负的树Submit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 21 Solved: 7 Description 小X非常喜欢树，然后他生成了一个大森林给自己玩。 玩着玩着，小X陷入了沉思。一棵树由N个节点组成，编号为i的节点有一个价值Wi。 假设从树根出

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9938 Accepted Submission(s): 4764Problem Description Ignatius has just come b

Feed the rabbitDescription There are n holes in a line，the distance between the hole labeled i and i+1 is di。There are also m rabbits, the rabbit labeled i comes to hole ki in time ti. Now you have p

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16168 Accepted Submission(s): 8597Problem Description A group of researche

Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31033 Accepted Submission(s): 10942Problem Description Now I think you hav

Strategic gameTime Limit: 2000MS Memory Limit: 10000K Total Submissions: 8433 Accepted: 3945 DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot

C. Star skytime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output The Cartesian coordinate system is set in the sky. There you can see n stars, th

给自己出题的小XSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 126 Solved: 43 Description 小X学习了dfs，为了练习搜索，开始给自己出题玩。 玩着玩着，一会把自己难住了，一会又被自己难倒了，真是有趣诶！ 小X出的题： 现在有N个不同的

Boxes of Chocolates AgainLittle Pippy has got again a big bunch of boxes of chocolates on her 7-th birthday. Her parents are anxious about the health of her teeth, so they have allowed her to take onl

不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 45207 Accepted Submission(s): 16914Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。 杭州交

Palindrome FunctionTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others) Total Submission(s): 431 Accepted Submission(s): 230Problem Description As we all know,a pa

#include<bits/stdc++.h>using namespace std;const int MAXN=2520+5;typedef long long LL;int Hash[MAXN],bit[20];LL dp[20][50][MAXN];int gcd(int a,int b) {return b==0?a:gcd(b,a%b);}int lcm(i...

import math#the distance between two node in the time seriesdef calcdist(x,y): # if the node is a list if type(x) == 'list': length = len(x) sum = 0 for i in range(l...

传送门：CF983B/*区间dp，异或的性质*/#include<iostream>#include<cstdio>#include<vector>#include<algorithm>#include<cstring>#include<string>#include<cmath>usin

Your fancy debugger will not help you in this matter. There are many ways in which code can produce different behavior between debug and release builds, and when this happens, one may have to resor

1、划分数 有nn个无区别的物品，将它们划分成不超过mm组，求出划分方法数模MM的余数。 dp[i][j]dp[i][j]表示jj的ii划分的总数 考虑nn的mm划分ai(∑i=1mai=n)a_i(\sum\limits_{i=1}^{m}a_i=n)，如果对于每个ii都有ai>0a_i>0，那么ai−1{a_i-1}就对应了n−mn-m的mm划分。另外，如果存在ai=0a_i=0，那么这就

Almost Sorted ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 3138 Accepted Submission(s): 791Problem Description We are all familia

Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3405    Accepted Submission(s): 2164Problem DescriptionHzz loves ae

ChessAccepts: 1805 Submissions: 5738 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description車是中国象棋中的一种棋子，它能攻击同一行或同一列中没有其他棋子阻隔的棋子。一天，小度在棋盘上摆起了许多車……他想知道，在

D. Round Subsettime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Let’s call the roundness of the number the number of zeros to which it ends.

AGTCTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 13042 Accepted: 4917 DescriptionLet x and y be two strings over some finite alphabet A. We would like to transform x into y

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 61285 Accepted Submission(s): 25542Problem Description Many years ago , in Te

F(1833): Lab Submit Status Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 35 Solved: 12 Description Susan, your friend, is working in a biology lab. She is working in a very s

计算直线的交点数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9596    Accepted Submission(s): 4377Problem Description平面上有n条直线，且无三线共点，问

BalanceTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13676Accepted: 8590DescriptionGigel has a strange "balance" and he wants to poise it. Actually,

题意：n首歌，每首歌有其长度，还剩t秒，不包括678秒的《劲歌金曲》输出唱的总曲目和时间总长度紫书P274页题目传送门：UVA12563听学长讲，可以转化为0-1背包#include#include#include#includeusing namespace std;const int MAX = 10000;int main(){

Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 47349Accepted: 21056DescriptionA numeric sequence of ai is ordered if a1 a

Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 48076Accepted: 19816DescriptionA subsequence of a given sequence is the given sequenc

D -数字三角Crawling in process...Crawling failedTime Limit:0MS    Memory Limit:0KB     64bit IO Format:%lld & %lluSubmitStatus Practice SCU 1114 uDebugDescription

题意：n匹马比赛的所有可能结果总数题目传送门：UVA12034动态规划，dp[i][j]表示i匹马j个排名递推关系：dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%Mod*j%Mod;与前面的马同时到达+单独到达~注意取模的运算规则#include #include #include using namespace std;

题意：一个栈中只能放U和L，3个U会爆炸，给出UL的总数，求会爆炸的个数。题目传送门：UVA580动态规划题，关键是赋予dp[i][j]一个特定的含义~~~dp[i][0]表示第i位由L结尾的安全总数dp[i][1],dp[i][2]分别表示第i位有一个U和两个U结尾的安全总数最后运用补集思想求出危险总数。递推关系：dp[i][0]=dp[i-1][0]+d

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office

The TriangleTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 48823 Accepted: 29496 Description7 3 8 8 1 0 2 7 4 4 4 5 2 6 5(Figure 1) Figure 1 shows a n

Optimal Binary Search TreeGiven a set S = (e1, e2, …, en) of n distinct elements such that e1 < e2 < … < en and considering a binary search tree (see the previous problem) of the elements of S, it is

1899: Yuelu ScenesSubmit Page Summary Time Limit: 1 Sec Memory Limit: 256 Mb Submitted: 4 Solved: 3 Description An artist begins with a roll of ribbon, one inch wide. She clips it

Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 244466 Accepted Submission(s): 57714Problem Description Given a sequence a[1],a[2],a

示例题目：HDU1159 参考资料：《挑战程序设计竞赛》Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 38171 Accepted Submission(s): 17503Problem De

示例题目：POJ2533 参考书籍：《挑战程序设计竞赛》第一种方法：O(n^2) dp[i]：以a[i]结尾的最长上升子序列的长度只包含a[i]的序列 由a[j]追加a[i]得到（满足j< i并且a[j]< a[i]）状态转移方程： dp[i]=max{dp[i],dp[j]+1}#include<iostream>#include<cstring>#include<cmath>#

Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7674 Accepted Submission(s): 2484Problem Description