- 博客(16)
- 收藏
- 关注
RSS订阅原创 JOJ 1240 The Decoder
Write a complete program that will correctly decode a set of characters into a valid message. Your program should read a given file of a simple coded set of characters and print the exact message that
2011-10-26 18:47:04
441
原创 HDU 1028 Ignatius and the Princess III
Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an eq
2011-10-26 18:42:47
416
原创 HDU 1360 Spell checker
Problem DescriptionThe boss of a firm that you are employed with is dissatisfied with the text processor Word. He wants you to write a bet
2011-10-18 18:24:38
545
原创 HDU 1124 Factorial
Problem DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas
2011-10-16 18:59:06
288
原创 辗转相除法求 最大公约数和最小公倍数
#includeint main(){ int m,n,r,p,gcd,lcm; scanf("%d%d",&m,&n); if(m p=m*n; r=m%n; while(r!=0) { m=n; n=r;
2011-10-13 19:24:00
525
原创 HDU 1017 A Mathematical Curiosity
Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple te
2011-10-13 19:22:39
393
原创 HDU 1236 排名
Problem Description今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑 每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的 考生，并将他们的成绩按降序打印。 Input
2011-10-13 19:03:06
307
原创 杨辉三角
杨辉三角 11 11 2 11 3 3 11 4 6 4 11 5 10 10 5 1每组测试实例的输入只含一个正整数n（1对应每个输入，输出相应层数的杨辉三角，每层整数间用一个空格隔开。 #include using namespac
2011-10-13 19:00:08
283
原创 计算A^B的最后x位数
输入3个整数A,B和x,其中,0输出A^B结果的最后x位表示的整数#include #include using namespace std;int main(){ long long a,b,x,add=1,i,l; // VC++6
2011-10-13 18:58:59
716
原创 HDU 1013 Digital Roots
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a singl
2011-10-13 18:54:08
250
原创 HDU 1332 LC-Display
Problem DescriptionA friend of you has just bought a new computer. Until now, the most powerful computer he ever used has been a pocket ca
2011-10-12 21:04:21
805
原创 JOJ 2580 Welcome to JL2009
Answer#include#include using namespace std;int main(){ int n,w,h,i,j,len; string str; bool f=0; while (cin>>n) {
2011-10-12 19:52:38
327
原创 HDU 1406 完数
Problem Description完数的定义：如果一个大于1的正整数的所有因子之和等于它的本身，则称这个数是完数，比如6，28都是完数：6=1+2+3；28=1+2+4+7+14。本题的任务是判断两个正整数之间完数的个数。 Input输入数据包含多行，第一
2011-10-12 19:08:31
356
原创 HDU 1035 Robot Motion
Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is
2011-10-11 21:55:45
330
原创 HDU 1019 Least Common Multiple
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by
2011-10-10 18:14:47
322
原创 HDU 1048 The Hardest Problem Ever
Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself ali
2011-10-10 18:05:03
788
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人