其他
Kiwi21
这个作者很懒,什么都没留下…
展开
-
LightOJ 1140 How Many Zeroes?
题意就是问从n到m之间有多少个0。数位dp枚举每一位dp[i][j]表示到i为有j个0的有多少 #include #include #include #include #include #include #include using namespace std; typedef long long LL; LL dp[22][22]; int dig[20]; LL F(int pos,int原创 2015-12-04 21:12:16 · 267 阅读 · 0 评论 -
hihocoder #1141 : 二分·归并排序之逆序对
#include #include #include #include #include #include #include #include #include using namespace std; typedef long long LL; #define N 100005 #define inf 1999999999 #define mod 1000000007 int a[N],b[N]原创 2015-12-14 17:04:01 · 355 阅读 · 0 评论 -
POJ 2392 Space Elevator
#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define LL long long #define inf 1<<31 #define mod 1000000007 #define N 40100 in原创 2015-11-20 15:39:40 · 252 阅读 · 0 评论 -
hdu 3018 Ant Trip
问至少从几个点出发可以遍历所有的边且每条边仅访问一次。 先看看给定的图是几个联通块组成的,遍历的起点和终点肯定是度为奇数的点(除非这联通块是环)也就是遍历只能是u->v1->v2->v3->。。。。->vn(或者u->v1->v2->v3->。。。。->u),所以要统计每个联通块的度为奇数 的点的个数和度为偶数的点的个数,则ans=奇数 的点的个数/2+都是偶数的联通块的个数。 #includ原创 2015-11-24 18:04:30 · 278 阅读 · 0 评论 -
hdu 5495 LCS
#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define LL long long #define inf 199999999 #define N 100010 int a[N],b[N],c[N];原创 2015-10-04 16:33:29 · 281 阅读 · 0 评论 -
hdu 5496 Beauty of Sequence
点击打开链接 #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define LL long long #define inf 199999999 #define N 100010 #define mod原创 2015-10-04 16:27:01 · 456 阅读 · 0 评论 -
Codeforces Round #298 (Div. 2) D. Handshakes 二分
D. Handshakes time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output On February, 30th n students came in the Cente原创 2015-07-27 17:06:48 · 304 阅读 · 0 评论 -
poj 1598 Excuses, Excuses!
#include #include char str1[25][100],str2[25][100],ch[100],str3[25][100]; int m,n,ans[25]; int judge(char c) { if(c>='a'&&c<='z') return 1; return 0; } void init() { int i,j; for(i=0;i<n;i++) sc原创 2014-08-10 17:44:46 · 352 阅读 · 0 评论 -
hdu 2095 find your present (2)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=2095 这题。。。。原创 2014-04-29 11:51:18 · 399 阅读 · 0 评论 -
Goldbach`s Conjecture
Description Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states: Every even integer, greater than 2, can be expressed as the sum of t原创 2014-05-29 21:25:22 · 753 阅读 · 0 评论 -
hdu 4858 项目管理
点击打开链接原创 2014-07-21 17:15:27 · 447 阅读 · 0 评论 -
Longest k-Good Segment
The array a with n integers is given. Let's call the sequence of one or more consecutive elements in a segment. Also let's call the segment k-good if it contains no more than k different values.Find a原创 2016-01-27 00:59:19 · 375 阅读 · 0 评论