07 2012 档案
摘要：最大因子数Time Limit : 10000/5000ms (Java/Other)Memory Limit : 65535/65535K (Java/Other)Total Submission(s) : 39Accepted Submission(s) : 17Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description定义f(n)为整数n的因子数，如f(9) = 3（分别是1,3,9）.定义g(n)=k,整数k是满足f(k) = max{f(i)|0<i<=n}的最小整数,现在给出n让你求g(n).I
阅读全文
摘要：前进Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2223Accepted Submission(s): 1788Problem Description轻松通过墓碑，进入古墓后，才发现里面别有洞天。突然，Yifenfei发现自己周围是黑压压的一群蝙蝠，个个扇动翅膀正准备一起向他发起进攻！形势十分危急！好在此时的yifenfei已经不是以前那个经常被lemon抢走MM的菜鸟了！面对众多蝙蝠的嗜血狂攻，只见yifenfei使出轻灵的剑法，刷，刷，
阅读全文
摘要：彼岸Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1887Accepted Submission(s): 1027Problem Description突破蝙蝠的包围，yifenfei来到一处悬崖面前，悬崖彼岸就是前进的方向，好在现在的yifenfei已经学过御剑术，可御剑轻松飞过悬崖。现在的问题是：悬崖中间飞着很多红，黄，蓝三种颜色的珠子，假设我们把悬崖看成一条长度为n的线段，线段上的每一单位长度空间都可能飞过红，黄，蓝三种珠子，而yife
阅读全文
摘要：前m大的数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5195Accepted Submission(s): 1856Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉她就可以了。给定一个包含N(N<=3000)个正整数的序列，每个数不超过5000，对它
阅读全文
摘要：寻梦Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2390Accepted Submission(s): 1871Problem Description每个人的童年都可能梦想过自己成为一个英雄，尤其是喜欢武侠的男生，Yifenfei也不例外。童年的他常常梦想自己能成为一个绝世英雄，手拿一把灿灿发亮的宝剑，手挽一位长发飘逸的秀丽气质MM ^_^ ，散步于清幽的泉边小道，微风吹过，飘落两片枫叶。。。。。。正由于成天陶醉于这种脱世的意境之中，导致此
阅读全文
摘要：命运Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4192Accepted Submission(s): 1482Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei为了去救MM，义无返顾地跳进了迷宫。让我们一起帮帮执
阅读全文
摘要：乘法游戏时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte总提交:8 测试通过:1描述乘法游戏是在一行牌上进行的。每一张牌包括了一个正整数。在每一个移动中，玩家拿出一张牌，得分是用它的数字乘以它左边和右边的数，所以不允许拿第1张和最后1张牌。最后一次移动后，这里只剩下两张牌。 你的目标是使得分的和最小。 例如，如果数是10 1 50 20 5，依次拿1、20、50，总分是10*1*50+50*20*5+10*50*5=8000 而拿50、20、1，总分是1*50*20+1*20*5+10*1*5=1150。 ...
阅读全文
摘要：CoinTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 662Accepted Submission(s): 329Problem DescriptionMoon has many coins, but only contains two value types which is 5 cents and 7 cents, Some day he find that he can get any value which greater than
阅读全文
摘要：Problem Description随着物理学的发展，科学家们发现了越来越多的粒子。有一天，筱莜在做实验的时候发现了一种麻烦的粒子，因为这些粒子必须成对产生或消失。面对这些粒子，筱莜开始头痛，怎么放置这些粒子才能让他们都消失呢？经过很多天的努力，筱莜终于设计出了一个实验装置，它是一个的立方体，编号A,B,C,……H,如图所示，每个顶点上都有一定数量的“麻烦”子，不同顶点初始的“麻烦”子数量可能不同。每次可以选择两个相邻的顶点，让他们同时产生或者消失。例如：每个照相机里的初始粒子数为1，0，1，0，3，1，0，0，那么一个合法的操作顺序为：EF-,EA-,AD+,AE-,DC-(EF-表示点E
阅读全文
摘要：信息安全111班暑期学习工作任务：（一）、暑假期间需要完成暑期社会实践报告，还有就是思政部的征文活动，要求每位同学都要上交，具体细节见群共享文件。（二）、Java老师上学期已经说了在本部有一个他办的实验室，具体上名称是：“信息工程学院创新实验室”。实验室的性质是非营利学习型实验室。实验室要求每位学生认真学习并互相帮助。Java老师下学期会在信息安全和网络三个班招人，大概在网络两个班招3~4个Java开发方向的。在信息安全招1~2个C语言安全编程方面的。具体也不一定，我们班也可以去Java那边的。具体现在情况我和大家说一下，就是Java那边已经开展得比较成熟了，因为时间的问题，而C语言安全编程这
阅读全文
摘要：要成为JAVA程序员,用三个月的时间.要成为J2EE高手,用一年的时间.要成为JAVA技术应用专家,用三年的时间,其中两年去学习C/C++现在我再次想说这样的话,如果你从来没有学过C/C++,那么我说一个JAVA技术,你可能永远也不可能真正的理解它的真正的意义:方法参数中JAVA的对象是如何传递的?真实的情况是传递"引用的值",如果你不了解C/C++,你是无法理解这句话的.你只能看别人的书上说什么你就记得什么,而实际如何,你根本不懂.这就是为什么要理解底层架构,协议.不了解你可能在一个公司混得很好,一个学习三个月JSP的人混一个工作是完全可以的,整天做一些ctrl+c,ct
阅读全文
摘要：Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15735Accepted Submission(s): 6954Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data,
阅读全文
摘要：对8102及以后的版本都合适：win8 下安装 .net framework 3.5.1：1. 打开 win8 安装盘，提取 sources\sxs 文件夹到 d:\sources\sxs （或别的盘也行，举个例子）；2. 打开 c:\windows\system32 文件夹，找到 cmd.exe，右击，选择"Run as administrator"；3. 在命令行执行以下命令：dism.exe /online /enable-feature /featurename:NetFX3 /Source:X:\sources\sxs大概一两分钟就执行完了，执行结果如下：Depl
阅读全文
摘要：发布时间：2006.12.27 03:11来源：赛迪网技术社区作者：puyuangyDNA杂志籍印度全国软件和服务企业协会(Nasscom) 与孟买警方开展互联网安全周活动之时，回顾了历史上的十大黑客事件——即使是那些被认为固若金汤的系统在黑客攻击面前总显得不堪一击。20世纪90年代早期Kevin Mitnick，一位在世界范围内举重若轻的黑客。世界上最强大的科技和电信公司——诺基亚(Nokia)，富士通(Fujitsu)，摩托罗拉(Motorola)，和 Sun Microsystems等的电脑系统都曾被他光顾过。1995年他被FBI逮捕，于2000年获得假释。他从来不把自己的这种入侵行为称
阅读全文
摘要：World Cup NoiseTime Limit:1000MSMemory Limit:30000KTotal Submissions:13155Accepted:6512DescriptionBackground"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is real, th
阅读全文
摘要：要坚持，要加油。每天都要写一定的代码量。逼迫自己。我要加油。为了一个已经多年的梦想。加油！！！！！！！！！
阅读全文
摘要：次方求模时间限制：1000ms | 内存限制：65535KB难度：3描述求a的b次方对c取余的值输入第一行输入一个整数n表示测试数据的组数（n<100）每组测试只有一行，其中有三个正整数a,b,c(1=<a,b,c<=1000000000)输出输出a的b次方对c取余之后的结果样例输入32 3 53 100 1011 12345 12345样例输出3110481来源[张云聪]原创上传者张云聪 1 // Project name : 102 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : W
阅读全文
摘要：GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1314Accepted Submission(s): 487Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to
阅读全文
摘要：When I said go I never meant awayYou ought to know the freaky games we playCould you forgive and learn how to forgetHear me as I'm calling out your nameFirefly come back to meMake the night as bright as dayI'll be looking out for youTell me that your lonely tooFirefly come lead me onFollow y
阅读全文
摘要：1 // Project name : 航线设置 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Sun Jul 15 16:33:54 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 #include <string>10 #include <cmath>11 #include <algorithm>12 using namespace std;13 14 #define MAXN 1
阅读全文
摘要：The sum problemTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9020Accepted Submission(s): 2759Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.InputInp
阅读全文
摘要：1 // Project name : 游船费问题 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Sat Jul 14 15:21:28 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 #include <string>10 #include <cmath>11 #include <algorithm>12 using namespace std;13 14 #define MAXN
阅读全文
摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12318Accepted Submission(s): 4787Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such
阅读全文
摘要：Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1121Accepted Submission(s): 479Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said
阅读全文
摘要：Farey SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:9180Accepted:3501DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few areF2 = {1/2
阅读全文
摘要：RelativesTime Limit:1000MSMemory Limit:65536KTotal Submissions:8841Accepted:4134DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy a
阅读全文
摘要：除法表达式Time Limit(Common/Java):1000MS/10000MS Memory Limit:65536KByteTotal Submit: 279 Accepted: 68Description给出如下除法表达式E：X1/X2/X3/..../Xk其中Xi是正整数并且Xi<=2000000000(1<=i<=k,k<=10000)。除法表达式应当按照从左到右的顺序求结果，例如表达式1/2/1/2的值是1/4。现在让你可以在表达E中嵌入括号以改变计算顺序，例如表达式(1/2)/(1/2)的值是1。现在给你一个除法表达式E，要求告诉是否能够通过加括号（
阅读全文
摘要：Number StepsTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionStarting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1),
阅读全文
摘要：Ignatius and the Princess IVTime Limit:1000MSMemory Limit:32767KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. Ther
阅读全文
摘要：B -As Easy As A+BTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThese days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nigh
阅读全文
摘要：Triangle WaveIn this problem you are to generate a triangular wave form according to a specified pair of Amplitude and Frequency.Input and OutputThe input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This lin
阅读全文
摘要：Kindergarten Counting GameEverybody sit down in a circle. Ok. Listen to me carefully.``Woooooo, you scwewy wabbit!''Now, could someone tell me how many words I just said?Input and OutputInput to your program will consist of a series of lines, each line containing multiple words (at least one
阅读全文
摘要：The DecoderWrite 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 the characters contain. The code key for this simple coding is a one for one character s
阅读全文
摘要：Back to High School PhysicsInput:standard inputOutput:standard outputA particle has initial velocity and constant acceleration. If its velocity after certain time is v then what will its displacement be in twice of that time?InputThe input will contain two integers in each line. Each line makes one
阅读全文
摘要：Hashmat the brave warriorInput:standard inputOutput:standard outputHashmat is a brave warrior who with his group of young soldiers moves from one place to another to fight against his opponents. Before fighting he just calculates one thing, the difference between his soldier number and the opponent&
阅读全文
摘要：I -ITime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or
阅读全文
摘要：J -JTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionHOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。Input第一行有一个整数T，接下来T组数据，每组数据占2行，第一行是一个整数N（0<N<=1000000)，第二行是N个数，表示N
阅读全文
摘要：E -ETime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thu
阅读全文
摘要：F -FTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets.The following n lines each represent a data set. Each data set will be formatted accordi
阅读全文
摘要：H -HTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候，却是非常累的！所以现在他们想要寻找最短的从商店到赛场的路线，你可以帮助他们吗？Input输入包括多组数据。每组数据第一行是两个整数N、M（N<=100，M<=10000），N表示成都的大街上有几个路口，标号为1的路口是商店所在地，标号为N的路口是赛场所在地，M则表
阅读全文
摘要：G -GTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIgor K. always used to trust his favorite Kashpirovsky Antivirus. That is why he didn't hesitate to download the link one of his groupmates sent him via QIP Infinium. The link was said to contain &q
阅读全文
摘要：D -DTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2forn≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formula for the Fi
阅读全文
摘要：C -CTime Limit:10000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that sati
阅读全文
摘要：A -ATime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 100 )；随后的 N行对应村庄间道路的成本，每行给出一对正整数
阅读全文
摘要：B -BTime Limit:1000MSMemory Limit:1000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionRecently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin is placed in the top right
阅读全文
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3934Accepted Submission(s): 1492Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because the
阅读全文
摘要：今天课程主要是图论的一些入门的知识，上午图的基本知识概念，还有遍历，下午讲了桥，求桥。http://poj.org/problem?id=3352这个题目你可以做一下。。还有就是学长给我们一个地址，是华东交大11届比赛的地址，比赛时间10日，你自己看一下时间。到时候你也去吧。记得把名字中注明自己的学校名字。如果要密码的话是：123456网址：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=9184#overview
阅读全文
摘要：Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7713Accepted Submission(s): 4935Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minut
阅读全文
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7951Accepted Submission(s): 1893Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar
阅读全文
摘要：真的是好水的题目啊，吓到了。。。Problem 1746 A Water Problem Accept: 169Submit: 351Time Limit: 1000 mSecMemory Limit : 32768 KB Problem DescriptionThis is a easy problem,I don't went to say any more. InputThere will be several test cases. OutputFor each test case, output only contain one line. Sample Input.....
阅读全文
摘要：变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 6113Accepted Submission(s): 2223Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一
阅读全文
摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5289Accepted Submission(s): 1968Problem Description有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确
阅读全文
摘要：Eddy's mistakesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4754Accepted Submission(s): 2697Problem DescriptionEddy usually writes articles ,but he likes mixing the English letter uses, for example "computer science" is written fre
阅读全文
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18122Accepted Submission(s): 6946Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line
阅读全文
摘要：摈弃 Windows 低效率的工作方式，发掘 Linux 身上的 UNIX 气质我已经半年没有使用 Windows 的方式工作了。Linux 高效的完成了我所有的工作。GNU/Linux 不是每个人都想用的。如果你只需要处理一般的事务，打游戏，那么你不需要了解下面这些了。我不是一个狂热的自由软件份子，虽然我很喜欢自由软件。这篇文章也不是用来推行自由软件运动的，虽然我觉得自由软件运动是非常好的。这篇文章也不是用来比较 Linux 和 Windows 内核效率，文件系统，网络服务的。我现在是作为一个用户而不是一个开发者来说话的，我们的讨论是基于操作，应用层面的。是为了告诉大学里还不了解，或者不 理
阅读全文
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3554Accepted Submission(s): 2182Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi
阅读全文
摘要：Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2355Accepted Submission(s): 1348Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digi
阅读全文
摘要：Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4628Accepted Submission(s): 2347Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of
阅读全文
摘要：整除的尾数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13580Accepted Submission(s): 5665Problem Description一个整数，只知道前几位，不知道末二位，被另一个整数除尽了，那么该数的末二位该是什么呢？Input输入数据有若干组，每组数据包含二个整数a，b（0<a<10000, 10<b<100），若遇到0 0则处理结束。Output对应每组数据，将满足条件的所有尾数在一行内
阅读全文
摘要：AC MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7077Accepted Submission(s): 3165Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.It's really
阅读全文
摘要：A Simple TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2422Accepted Submission(s): 1354Problem DescriptionGiven a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.Tas
阅读全文
摘要：DoublesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2176Accepted Submission(s): 1509Problem DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and
阅读全文
摘要：The SnailTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 726Accepted Submission(s): 544Problem DescriptionA snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foo
阅读全文
摘要：A + B Problem TooTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7145Accepted Submission(s): 5393Problem DescriptionThis problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For ex.
阅读全文
摘要：最简单的计算机Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2666Accepted Submission(s): 1532Problem Description一个名叫是PigHeadThree的研究组织设计了一台实验用的计算机，命名为PpMm。PpMm只能执行简单的六种命令A，B，C，D，E，F；只有二个内存M1，M2；三个寄存器R1，R2，R3。六种命令的含义如下：命令A：将内存M1的数据装到寄存器R1中；命令B：将内存M2的数据装到寄
阅读全文
摘要：Reverse NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2924Accepted Submission(s): 1348Problem DescriptionWelcome to 2006'4 computer college programming contest!Specially, I give my best regards to all freshmen! You are the future of HDU
阅读全文
摘要：这个暑假已经开始了，我没有能回婺源了，ACM集训的日子，马上就要开始了，非常期待疯狂刷题的日子，也有一些惧怕，惧怕自己的实力。听着一些歌，看着一些人的日志，还是有一些过往慢慢涌上来，这个暑假，我们要见面，不知道真的如我们所说的情节那般安排得很好的见面。我们连见面都很困难。去年暑假，我遇见了鸟儿在天上飞着，我看见了那些清澈见底的水，还有整日一个人在河边玩耍的孩子。那个时光里面有很多我想表达的，不舍与思念占据了我整个夏天，想不出什么言语来表达，于是大部分时间都是选择沉默。志愿填报的时候，选择了自己最喜欢的专业，不想看到自己如在天上飞翔的鱼，即使旁人认为很美好，可是，一旦自己没有兴趣，再好的专业也相
阅读全文
摘要：1 // Project name : 1235 ( 统计同成绩学生人数 ) 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Thu Jul 5 17:20:47 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 using namespace std;10 11 int main()12 {13 int n;14 while (scanf("%d", &n) != EOF &&
阅读全文
摘要：现在要开始了，在景老师的安全软件实验室里面学习，首先是希望和大家一起成长，我相信我们的实力，一定能够很好地完成老师所安排的事情，我一定要好好努力，不能辜负。最重要的是acm那边的成绩，我害怕时间不够，大二上学期还有很多事情，我有自己的一些事情，比如关于操作系统的一些事情。还有算法研究，我想成为大神。现在终于开始了，要开始疯狂了。。以前都没有怎么写东西，希望这次写出来的东西能够有点像个样。。写出像样的代码。每次的日志都是乱糟糟的。没有很好的思绪。。这个习惯很不好。。可能是因为很久没有写日志的原因吧。。
阅读全文
