我多么希望明天有太阳，来灼烧我腐烂的梦想

Balloon Comes!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14856    Accepted Submission(s): 5349Problem DescriptionThe contest

Big NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17349    Accepted Submission(s): 7775Problem DescriptionIn many applicat

微软招聘信息（主要针对已经有工作经验的）Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 47226    Accepted Submission(s): 16846

密码Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19397    Accepted Submission(s): 7735Problem Description网上流传一句话:"常在网上飘啊，哪能不挨刀啊

A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17718    Accepted Submission(s): 5515Problem DescriptionGi

Octorber 21stTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2296    Accepted Submission(s): 1431Problem DescriptionHDU's 50th bir

How many days?Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4211    Accepted Submission(s): 2466Problem Description8600的手机每天消费1元，每

Problem DescriptionHappy new year to everybody!Now, I want you to guess a minimum number x betwwn 1000 and 9999 to let (1) x % a = 0;(2) (x+1) % b = 0;(3) (x+2) % c = 0;and a, b, c are int

近期做杭电题，就从网上搜了相关的题目分类的日志，具体正确与否，不清楚！来源：http://hi.baidu.com/%D5%D4%B7%F6%B7%E7/blog/item/f97e4680830cbbc09123d929.html=======================================================================Math_基础

Find your present!Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2140    Accepted Submission(s): 1394Problem DescriptionIn the ne

A CTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3121    Accepted Submission(s): 2017Problem DescriptionAre you excited when you

FlowersTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2140    Accepted Submission(s): 1432Problem DescriptionAs you know, Gardon

Problem Description给你两个集合，要求{A} + {B}.注:同一个集合中不会有两个相同的元素. Input每组输入数据分为三行,第一行有两个数字n,m(0 Output针对每组数据输出一行数据,表示合并后的集合,要求从小到大输出,每个元素之间有一个空格隔开. Sample Input1 212 31 2

1002A + B Problem IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 133596    Accepted Submission(s): 25445Problem DescriptionI

第一题是 elavator 简单题，注意循环，然后把题目翻译过来就好。第二题 是求两个数的最小公倍数 ，最小公倍数可以转化为求最大公约数，因此想到了辗转相除法，用一个循环就可以了。第三题是 Rightmost Dight  这道题注意算法 要不容易超时的。问题是求最后一位数是多少，所以只要研究最后一位数的变化规律是什么就可以了。当然 代码有点长。swith case 嘛。第四题是人

Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It nee

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4373    Accepted Submission(s): 1737Problem Description集训进行了将近2个礼拜，这段时间以恢复性训练为主，我一直在密切

Optimal ParkingTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1215    Accepted Submission(s): 1033Problem DescriptionWhen shopping

MilkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11183    Accepted Submission(s): 2685Problem DescriptionIgnatius drinks milk e

Digital RootsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32429    Accepted Submission(s): 9933Problem DescriptionThe digital r

QuicksumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1778    Accepted Submission(s): 1363Problem DescriptionA checksum is an al

Fighting for HDUTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5438    Accepted Submission(s): 2830Problem Description在上一回，我们让你猜测

百步穿杨Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5409    Accepted Submission(s): 2058Problem Description时维九月,序属三秋,辽军大举进攻MCA山,战场

#include#include#includeusing namespace std;typedef struct node{ string id; int grd;}N;N ss[1010];int cmp(N a,N b){ if(a.grd!=b.grd) return a.grd>b.grd; return a.id //retur

直接做不太方便，在网上新学一招。atoi这个函数原来做进制转换的时候就接触过。如果第一个非空格字符不存在或者不是数字也不是正负号则返回零，否则开始做类型转换，之后检测到非数字(包括结束符 \0) 字符时停止转换，返回整型数。（百度百科）简而言之是一个把字符型数字转化成整型的函数。strtok函数，感觉这个比较新鲜。下面从百度百科摘点介绍：原型　　char *strtok(char

Max FactorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3109    Accepted Submission(s): 989Problem DescriptionTo improve the organ

Text Reverse Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 2Problem DescriptionIgnatius likes to write word

B. Code Parsing Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 524288/262144K (Java/Other)Total Submission(s) : 1   Accepted Submission(s) : 1Problem DescriptionLittle Vitaly loves d

小明A+BTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22207    Accepted Submission(s): 10425Problem Description小明今年3岁了, 现在他已经能够认识10

还是A+BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14396    Accepted Submission(s): 6990Problem Description读入两个小于10000的正整数A和B，计算

火星A+BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9756    Accepted Submission(s): 3221Problem Description读入两个不超过25位的火星正整数A和B，计算

大明A+BTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6828    Accepted Submission(s): 2411Problem Description话说，经过了漫长的一个多月，小明已经成长了许

人见人爱A+BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20531    Accepted Submission(s): 13487Problem DescriptionHDOJ上面已经有10来道A+B的题

又一版 A+BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11981    Accepted Submission(s): 4487Problem Description输入两个不超过整型定义的非负10进制整

细心的人不难发现，这个坑爹的蓝桥杯的OJ做的如此之粗糙与恶劣，还设置了坑爹的VIP，想钱之疯魔程度，简直是不忍直视啊。题目上面说1~N-1, 后面给的样例就变成的从1~N里面筛选，这种赤裸裸的扇自己脸的行为，我只能呵呵了。       小规模吐槽完毕，接下来进入正题：       这个题的意思就是要我们在1~N的范围内找三个数，使他们的最小公倍数在这个范围内的组合是最大的。那么你的第一印象

快速幂int pow(int a,int b){ int v=1; while(b) {  if(b&1)   v*=a;  a*=a;  b=b>>1;  } return v;}  快速幂取模 int pow_mod(int a,int b,int c){ int v=1; while(b) {  if

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 112493    Accepted Submission(s): 25982Problem DescriptionGiven a sequence

免费馅饼Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19479    Accepted Submission(s): 6514Problem Description都说天上不会掉馅饼，但有一天gameboy正

龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8884    Accepted Submission(s): 3417Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打

#includeusing namespace std;int c[1000][1000];int cc(int m,int n){ if(c[m][n]) return c[m][n];//如果计算过 则直接输出 //状态转移方程 c(m,n)=c(m-1,n-1)+c(m-1,n) if(m==n || n==0)  return 1; if(n==1)  re