hdu 2132... 被基本问题考住了。。

【hdu 2132... 被基本问题考住了。。】的更多相关文章

hdu 2132... 被基本问题考住了。。

Problem Description We once did a lot of recursional problem . I think some of them is easy for you and some if hard for you.Now there is a very easy problem . I think you can AC it. We can define sum(n) as follow: if i can be divided exactly by 3…

HDU 2132 An easy problem

http://acm.hdu.edu.cn/showproblem.php?pid=2132 Problem Description We once did a lot of recursional problem . I think some of them is easy for you and some if hard for you.Now there is a very easy problem . I think you can AC it. We can define sum(n…

HDU 1042 N! 參考代码

HDU 1042 N! 题意:给定整数N(0 ≤ N ≤ 10000), 求 N! (题目链接) #include <iostream> using namespace std; //每一个数组元素存放5位数 const int MAX=100000; //%MAX后结果为[0,99999] const int N=10001; //7132+1 int a[N]={0}; void prtBig(int n) { for(int i=0; i<n;i++) { if(i==0) //最…

HDOJ(HDU) 2132 An easy problem

Problem Description We once did a lot of recursional problem . I think some of them is easy for you and some if hard for you. Now there is a very easy problem . I think you can AC it. We can define sum(n) as follow: if i can be divided exactly by 3 s…

【hdu多校联考第二场】Odd Shops

Description 这道题的题意是这道难读,大概就是给你n个商店,每个商店的重量为i的商品用ai表示,对于任意商店的a数列都是相同的,重量的范围为[1,10] 求购买方案总数为奇数的重量一共有多少种,答案取膜998244353 Input Format 多组数据,每组数据第一行一个整数n表示一共有n个商店,第二行10个整数表示数列a Output Format 对于每组数据输出一行表示答案 Sample Input 1 1 2 3 4 5 6 7 8 9 10 2 1 0 0 0 0 0 0…

hdu 4612 Warm up（缩点+树上最长链）

本来就是自己负责图论,结果水了= = 题目其实很裸,就是求桥的数量,只是要新加上一条边罢了.做法:先缩点.再在树上搜最长链(第一场多校的hdu 4607Park Visit就考了最长链,小样,套个马甲以为就认不出你了),加边后求桥数就可以了. 犯了一大三小四个错误-_- 竟然真的去套模板求桥数了..竟然没注意到树边都是桥,用树边减链边就可以了. 然后,重新建图的Build()把n传进去了. 再然后,发现读数据从0~m-1,Build()里竟然是1~m. 再再然后,原来存边的su[],sv[]数组…

SPFA

SPFA算法用来求单源最短路.可以处理任何有解的情况. 先建一个数组\(dist_x = 起点到x的最短路长度\),当\(x=起点\)时为0,当x和起点不通时为INF(本题中为\(2^31-1\)). 明确一下松弛的概念.考虑节点\(u\)以及它的邻居\(v\),从起点跑到v有好多跑法,有的跑法经过\(u\),有的不经过,那么经过\(u\)的跑法的距离就是\(dist_u + u到v的距离\).所谓松弛操作,就是看一看\(dist_v\)和\(dist_u + u到v的距离\)哪个大一点,如果前…