yanghui07216的博客

1712: 编程语言时间限制: 1 Sec  内存限制: 128 MB提交: 16  解决: 11[提交][状态][讨论版]题目描述小明宿舍有6个人，都是学习计算机的，每个人都会一定数量的编程语言（比如：c、c++、java、C#、php、js等等）。姑且把他们六人叫做：老大、老二、老三、老四、老五和小明他们直接学习的语言错综复杂，有以下一些关系，

1708: A - B时间限制: 1 Sec  内存限制: 128 MB提交: 81  解决: 32[提交][状态][讨论版]题目描述做惯了A+B的我们，要不要来点新鲜的？那么来个A-B吧？输入第一行输入一个N，代表有N组测试数据，接下来N行，每行输入两个整数A和B，注意是：整数、整数、整数，重要的话一定要说三遍！（题目保证A和B均在

1710: 最后一个1时间限制: 1 Sec  内存限制: 128 MB提交: 59  解决: 35[提交][状态][讨论版]题目描述对于一个十进制的数字x，将他转化为2进制，他的2进制将由0和1组成，求里面的最后一个1在第几位输入第一行输入T，代表T组数据，接下来T行，每行输入一个X。00输出输入x的2进

空心三角形Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 30632    Accepted Submission(s): 8458Problem Description把一个字符三角形掏空，就能节省材料成本

矩形A + BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5222    Accepted Submission(s): 4061Problem Description给你一个高为n ，宽为m列的网格，计

Can you solve this equation?Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 113   Accepted Submission(s) : 69Problem DescriptionNo

18岁生日Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23434    Accepted Submission(s): 7503Problem DescriptionGardon的18岁生日就要到了，他当

1700: 做不出来踢协会！！！时间限制: 1 Sec  内存限制: 128 MB提交: 289  解决: 33[提交][状态][讨论版]题目描述这是今天最水的一道题，如果没写出来的，呵呵，踢协会。给你两个整数a和b。输出较大的数，若两个数相等输出任一个都可以。这么水啊。。。输入输入有多组测试数据。每组数据有a和b两个整数。小提示：数据保证不会有前导

A Curious MattTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 970    Accepted Submission(s): 506Problem DescriptionThere is a

Little Zu Chongzhi's TrianglesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 738    Accepted Submission(s): 397Problem Descriptio

悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6958    Accepted Submission(s): 4405Problem Description对于四川

进制转换Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32285    Accepted Submission(s): 17934Problem Description输入一个十进制数N，将它转换成R进制数

THE DRUNK JAILERTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25129 Accepted: 15772DescriptionA certain prison contains a long hall of n cells, each rig

汉诺塔IIITime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11942    Accepted Submission(s): 5451Problem Description约19世纪末，在欧州的商店中出售一种智力玩具

汉诺塔IVTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4989    Accepted Submission(s): 3631Problem Description还记得汉诺塔III吗？他的规则是这样的：不允许直

Sum UpTime Limit: 2 Seconds      Memory Limit: 65536 KB Vivid has stored a piece of private information, which consisted of a serial of integers in a secret number format. All the stored num

三角形Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5828    Accepted Submission(s): 3953Problem Description用N个三角形最多可以把平面分成几个区域?

汉诺塔VIITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1261    Accepted Submission(s): 838Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,

汉诺塔IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6234    Accepted Submission(s): 3047Problem Description经典的汉诺塔问题经常作为一个递归的经典例题存在。

Tian Ji -- The Horse RacingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12344 Accepted: 3807DescriptionHere is a famous story in Chinese history. T

Baskets of Gold CoinsTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1860    Accepted Submission(s): 1106Problem DescriptionYou

Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5473 Accepted: 3171DescriptionPeople are different. Some secretly read magazines ful

汉诺塔VTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3407    Accepted Submission(s): 1994Problem Description用1,2,...,n表示n个盘子，称为1号盘，2号

Strange fuctionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4717    Accepted Submission(s): 3383Problem DescriptionNow, here is a

FriendTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2200    Accepted Submission(s): 1103Problem DescriptionFriend number are d

测试你是否和LTC水平一样高Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15141    Accepted Submission(s): 4982Problem Description大家提到LTC都佩服

盐水的故事Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15432    Accepted Submission(s): 3751Problem Description挂盐水的时候，如果滴起来有规律，先是滴

阶乘因式分解（二）时间限制：3000 ms  |  内存限制：65535 KB难度：3描述 给定两个数n，m,其中m是一个素数。将n（0注：^为求幂符号。 输入第一行是一个整数s（0随后的s行, 每行有两个整数n，m。 输出输出m的个数样例输入3100 516 21000000000 13样例输出24

阶乘之和时间限制：3000 ms  |  内存限制：65535 KB难度：3描述 给你一个非负数整数n，判断n是不是一些数（这些数不允许重复使用，且为正数）的阶乘之和，如9=1！+2!+3!，如果是，则输出Yes，否则输出No；输入第一行有一个整数0每组测试数据有一个正整数n输出如果符合条件，输出Yes，否则输出No;样例输入2910样例输出

The Monster and the SquirrelTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionAri the monster always wakes up very e

Harmonic Number (II) DescriptionI was trying to solve problem '1234 - Harmonic Number', I wrote the following codelong long H( int n ) {    long long res = 0;    for( int i = 1; i  n;

数学题Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1294DescriptionGiven two integers: n and m and n is divisible by 2m, you h

Answering QueriesTime Limit: 3000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionThe problem you need to solve here is pretty simple. You are

A*B Problem时间限制：1000 ms  |           内存限制：65535 KB难度：2描述 设计一个程序求出A*B，然后将其结果每一位相加得到C，如果C的位数大于等于2，继续将C的各位数相加，直到结果是个一位数k。例如：6*8=48；4+8=12；1+2=3；输出3即可。输入第一行输入一个数N(0随后的N行每行给出两个非

Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5278    Accepted Submission(s): 2952Problem DescriptionThe digit

An easy problemTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8060    Accepted Submission(s): 1959Problem DescriptionWhen Teddy was

时钟Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1732    Accepted Submission(s): 438Problem Description从a点b分到s点t分时针和分针重合多少次?

C. LineDescriptionA line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 incl

1005 - RooksPDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBA rook is a piece used in the game of chess which is played on a b

1的个数时间限制：1000 ms  |  内存限制：65535 KB难度：3描述给你两个数a和b,你的任务是计算出1在a和b之间出现的次数,比如说，如果a=1024,b=1032，那么a和b之间的数就是：1024 1025 1026 1027 1028 1029 1030 1031 1032则有10个1出现在这些数中。输入输入不会超过500行