A_ice

K - Get the Containers Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1076 Description A conveyor belt has a number of vessels

Can you solve this equation? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16573    Accepted Submission(s): 7357 Problem Description

Cable master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3795    Accepted Submission(s): 1460 Problem Description Inhabitants of th

Can you find it? Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 23726    Accepted Submission(s): 6002 Problem Description Give you th

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 6113    Accepted Submission(s): 2967 Problem Description The annual Ga

Pie Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9241    Accepted Submission(s): 3345 Problem Description My birthday is coming up a

Task schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2757    Accepted Submission(s): 938 Problem Description 有一台机器，并且给你这台机器的工作

[1651] Red packet 时间限制: 1000 ms　内存限制: 65535 K 问题描述 New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just like Alipay and Wechat. Wine93 has m yuan, he decides to

D. Multiplication Table time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bizon the Champion isn't just charmi

C. Hamburgers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarpus loves hamburgers very much. He espe

A. Mafia time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day n friends gathered together to play "Mafia

1919: D Time Limit: 1 Sec  Memory Limit: 128 MB Submit: 241  Solved: 69 Description 晴天想把一个包含n个整数的序列a分成连续的若干段，且和最大的一段的值最小，但他有强迫症，分的段数不能超过m段，然后他就不会分了。。。他想问你这个分出来的和最大的一段的和最小值是多少？ Input

题目：http://lightoj.com/login_main.php?url=volume_showproblem.php?problem=1138 这是个二分TAT…… 分的是5的个数。因为末尾有0就是乘以10，10是由2*5得出来的。在N!里面2比5多得多，所以只用算5的个数就可以了。 5的个数的算法具体看代码吧，我觉得比较奇妙。 #include #include

5-9 集合相似度   (25分) 给定两个整数集合，它们的相似度定义为：N_c / N_t \times 100\%N​c​​/N​t​​×100%。其中N_cN​c​​是两个集合都有的不相等整数的个数，N_tN​t​​是两个集合一共有的不相等整数的个数。你的任务就是计算任意一对给定集合的相似度。 输入格式： 输入第一行给出一个正整数NN（\le 50≤50），是集