#include <stdio.h> #include <stdlib.h> #define max 100 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ void Bubble_sort(int *p,int n) { int i,j,temp; ; i<n ; i++) { ; j<n-i-…
[前言] 很久没有纯粹的写写小代码,偶然想起要回炉再来,就去HDU随便选了个最基础的题,也不记得曾经AC过:最后吃惊的发现,思路完全不一样了,代码风格啥的也有不小的变化.希望是成长了一点点吧.后面定期去做做题.保持青春的活力! 1.青年回炉 Problem : 1008 ( Elevator ) Run ID Submit Time Judge Status Pro.ID Exe.Time Exe.Memory Code Len. Language Author 9098607 2013-0…
Shape of HDU Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5369 Accepted Submission(s): 2445 Problem Description 话说上回讲到海东集团推选老总的事情,最终的结果是XHD以微弱优势当选,从此以后,"徐队"的称呼逐渐被"徐总"所取代,海东…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2211 杀人游戏 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3624 Accepted Submission(s): 1182 Problem Description 不知道你是否玩过杀人游戏,这里的杀人游戏可没有法官,警察之类的人…
http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2§ionid=1&problemid=2 #include <stdio.h> #include <stdlib.h> #include <math.h> /* run this program using the console pauser or add your own getch, system("pause…
http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2§ionid=1&problemid=1 #include <stdio.h> #include <stdlib.h> /* run this program using the console pauser or add your own getch, system("pause") or input loop */…
A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62478 Accepted Submission(s): 35144 Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I…
Balloon Comes!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16847 Accepted Submission(s): 6150 Problem DescriptionThe contest starts now! How excited it is to see balloons floating around.…
题目概述:Jugs In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly 4 gallons. This problem gen…
题目概述:Anagrams by Stack How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT: [ i i i i o o o o i o i i o o i o ] where i stands for Push and o stands for Pop. Your progr…
题目概述:Crashing Balloon On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labeled balloons, with the numbers 1 to 100. After the referee shouts &q…
题目概述:Fire Net Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse is a small castle that has four openings through whic…
数据测试了好几个都没问题,可以就是WA不让过,检测了2个小时还是没发现有什么问题T_T!!求高手看看代码,小弟在此谢谢各位哦! #include <stdio.h> #include <stdlib.h> #define max 1000 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ int main(int…
//make up a table of prime factors #include <stdio.h> #include <stdlib.h> #define MAX 32769 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ int main(int argc, char *argv[]) { int P…
/*打表把素数能组合的数先设置成相应的位数*/ /* if n equals two and n is No.1 position of prime factors so four position of prime factors is no.1,as well*/ /* although two can combined six but three also can combined six */ /* and three position of prime factors is two…
