L-75的专栏

Accepted NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3696 Accepted Submission(s): 1465Problem DescriptionI have N precious stone

Price ListTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 737    Accepted Submission(s): 420Problem DescriptionThere are n sho

Binomial CoeffcientsTime Limit: 1000MS Memory limit: 65536K题目描述 输入 输出 示例输入31 110 2954 723示例输出1453557658分析：该题目就是求组合数，C(n,m)，根据杨辉三角，打

IdentifiersTime Limit: 1000MS Memory limit: 65536K题目描述 Identifier is an important concept in the C programming language. Identifiers provide names for several language elements,

下沙小面的(1)Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201    Accepted Submission(s): 464Problem DescriptionLele 在下沙高校中有很多同学，所

Contest Print ServerTime Limit: 1000MS Memory limit: 65536K题目描述    In ACM/ICPC on-site contests ,3 students share 1 computer,so you can print your source code any time. Here you need to wr

又见GCDTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14796    Accepted Submission(s): 6190Problem Description有三个正整数a,b,c(0

月之数Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8786    Accepted Submission(s): 5152Problem Description当寒月还在读大一的时候，他在一本武林秘籍中（

a/b + c/dTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11885    Accepted Submission(s): 6326Problem Description给你2个分数，求他们的和，并要

A. Bus to Udaylandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon are tr

B. Chris and Magic Squaretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon

标题：史丰收速算史丰收速算法的革命性贡献是：从高位算起，预测进位。不需要九九表，彻底颠覆了传统手算!速算的核心基础是：1位数乘以多位数的乘法。其中，乘以7是最复杂的，就以它为例。因为，1/7 是个循环小数：0.142857...，如果多位数超过 142857...，就要进1同理，2/7, 3/7, ... 6/7 也都是类似的循环小数，多位数超过 n/7，就要进n下面的程序模拟了史丰收速算法中乘以7

题目标题：前缀判断如下的代码判断 needle_start指向的串是否为haystack_start指向的串的前缀，如不是，则返回NULL。比如：”abcd1234” 就包含了 “abc” 为前缀char* prefix(char* haystack_start, char* needle_start){ char* haystack = haystack_start; char*

题目标题: 排它平方数    小明正看着 203879 这个数字发呆。    原来，203879 * 203879 = 41566646641    这有什么神奇呢？仔细观察，203879 是个6位数，并且它的每个数位上的数字都是不同的，并且它平方后的所有数位上都不出现组成它自身的数字。    具有这样特点的6位数还有一个，请你找出它！ 

迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18533 Accepted: 10970Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

Self NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23405 Accepted: 13142DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered

Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45332 Accepted: 14324DescriptionSally Jones has a dozen Voyageur silver dollars. How

小李的店里专卖其它店中下架的样品电视机，可称为：样品电视专卖店。其标价都是4位数字（即千元不等）。小李为了标价清晰、方便，使用了预制的类似数码管的标价签，只要用颜色笔涂数字就可以了。      这种价牌有个特点，对一些数字，倒过来看也是合理的数字。如：1 2 5 6 8 9 0 都可以。这样一来，如果牌子挂倒了，有可能完全变成了另一个价格，比如：1958 倒着挂就是：8561，差了

HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3373 Accepted: 2326DescriptionThe cows play the child's game of hopscotch in a non-traditiona

奇偶位互换Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6514    Accepted Submission(s): 4944Problem Description给定一个长度为偶数位的0,1字符串，请编程实

A hard puzzleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35063    Accepted Submission(s): 12599Problem Descriptionlcy gives a ha

EncodingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36115    Accepted Submission(s): 16002Problem DescriptionGiven a string co

kiki's gameTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)Total Submission(s): 8550    Accepted Submission(s): 5099Problem DescriptionRecently kiki ha

今年暑假不ACTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36126    Accepted Submission(s): 19313Problem Description“今年暑假不AC？”“是的。”“

搭眼一看就是一个水题，上来用int和double，果断WA了两次。这是一个大数问题，可能会是一个位数很长的小数。所以要用字符数组来存储。看的很多解析，说要处理很多方面，但是这个题的测试不太完善，例如00001的形式它是没有出现的，所以只需要删除小数点后面的0，以及必要的时候删除小数点处理就行了。代码，参考如下：http://blog.youkuaiyun.com/libin56842/arti

An easy problemTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17042    Accepted Submission(s): 11448Problem Descriptionwe define f(

Switch GameTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13176    Accepted Submission(s): 8013Problem DescriptionThere are many la

BitsetTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16057    Accepted Submission(s): 12199Problem DescriptionGive you a number on

PictureTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20540    Accepted Submission(s): 10535Problem DescriptionGive you the width a

ProbabilityTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5634    Accepted Submission(s): 2811Problem DescriptionMickey is intere

u Calculate eTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38088    Accepted Submission(s): 17259Problem DescriptionA simple mathe

ElevatorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58340    Accepted Submission(s): 31975Problem DescriptionThe highest build

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36781    Accepted Submission(s): 16202Problem DescriptionA ring is

标题：李白打酒    话说大诗人李白，一生好饮。幸好他从不开车。    一天，他提着酒壶，从家里出来，酒壶中有酒2斗。他边走边唱：    无事街上走，提壶去打酒。    逢店加一倍，遇花喝一斗。    这一路上，他一共遇到店5次，遇到花10次，已知最后一次遇到的是花，他正好把酒喝光了。     请你计算李白遇到店和花的次序，可以把遇店记为a，遇花记为b。

Higher MathTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2972    Accepted Submission(s): 1580Problem DescriptionYou are building

问题描述某涉密单位下发了某种票据，并要在年终全部收回。每张票据有唯一的ID号。全年所有票据的ID号是连续的，但ID的开始数码是随机选定的。因为工作人员疏忽，在录入ID号的时候发生了一处错误，造成了某个ID断号，另外一个ID重号。你的任务是通过编程，找出断号的ID和重号的ID。假设断号不可能发生在最大和最小号。输入格式要求程序首先输入一个整数N(N接着读入

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

简易版之最短距离Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14911    Accepted Submission(s): 6583Problem Description寒假的时候，ACBOY要去拜访很

Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22663    Accepted Submission(s): 8903Problem DescriptionComputer si

DescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two days (the second and third days of service), the