ACM习题
文章平均质量分 79
liyingjie01
这个作者很懒,什么都没留下…
展开
-
山东省第一届ACM习题
Phone NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述We know that if a phone number A is another phone number B’s prefix, B is not able to be called. For an e原创 2016-04-02 09:05:31 · 295 阅读 · 0 评论 -
山东省第二届ACM大学生程序设计竞赛:The Android University ACM Team Selection Contest
The Android University ACM Team Selection ContestTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Now it's 20000 A.D., and the androids also participate in the ACM Inter-national Co原创 2016-04-13 12:14:51 · 319 阅读 · 0 评论 -
2012年"浪潮杯"山东省第三届ACM大学生程序设计竞赛:n a^o7 !
n a^o7 ! Time Limit: 1000MS Memory limit: 65536K 题目描述All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happiness. If you w原创 2016-04-13 13:49:23 · 662 阅读 · 0 评论 -
2012年"浪潮杯"山东省第三届ACM大学生程序设计竞赛:The Best Seat in ACM Contest
The Best Seat in ACM Contest Time Limit: 1000MS Memory limit: 65536K 题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends AC原创 2016-04-13 16:30:28 · 321 阅读 · 0 评论 -
第五届ACM大学生程序设计竞赛:Full Binary Tree
Full Binary TreeTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述In computer science, a binary tree is a tree data structure in which each node has at most two children原创 2016-04-20 16:02:45 · 406 阅读 · 0 评论 -
第五届ACM大学生程序设计竞赛:Hearthstone II
Hearthstone IITime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The new season has begun, you have n competitions and m well prepared decks during the new season. Each c原创 2016-04-20 17:08:32 · 436 阅读 · 0 评论 -
第五届ACM大学生程序设计竞赛:angry_birds_again_and_again
angry_birds_again_and_againTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The problems called "Angry Birds" and "Angry Birds Again and Again" has been solved by many原创 2016-04-20 18:44:13 · 370 阅读 · 0 评论 -
Prime Ring Problem
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39988 Accepted Submission(s): 17643Problem DescriptionA rin原创 2016-04-21 15:32:19 · 242 阅读 · 0 评论 -
约瑟夫环
1073 约瑟夫环基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注N个人坐成一个圆环(编号为1 - N),从第1个人开始报数,数到K的人出列,后面的人重新从1开始报数。问最后剩下的人的编号。例如:N = 3,K = 2。2号先出列,然后是1号,最后剩下的是3号。Input原创 2016-08-06 18:32:03 · 297 阅读 · 0 评论 -
2013年山东省第四届ACM大学生程序设计竞赛:Rescue The Princess
Rescue The PrincessTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princes原创 2016-04-09 12:34:11 · 310 阅读 · 0 评论 -
山东省第二届ACM大学生程序设计竞赛:Binomial Coeffcients
Binomial CoeffcientsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述输入输出示例输入31 110 2954 723示例输出1453557658提示来源山东省第二届ACM大学生程序设计竞赛#include #inc原创 2016-04-09 10:41:18 · 376 阅读 · 0 评论 -
山东省第二届ACM大学生程序设计竞赛:Identifiers
IdentifiersTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Identifier is an important concept in the C programming language. Identifiers provide names for several language elements原创 2016-04-09 10:22:30 · 293 阅读 · 0 评论 -
2015年ACM:人见人爱的A^B
Problem Description求A^B的最后三位数表示的整数。说明:A^B的含义是“A的B次方”Input输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1Output对于每个测试实例,请输出A^B的最后三位表示的整数,每个输出占一行。Sample Input2 312 66789 100000 0原创 2015-05-26 13:16:22 · 672 阅读 · 0 评论 -
2015年ACM:吃糖果
Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。Input第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一原创 2015-05-26 11:11:41 · 841 阅读 · 0 评论 -
2015年acm:斐波那契
Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer原创 2015-05-25 19:00:59 · 457 阅读 · 0 评论 -
2015年acm:the area
Problem DescriptionIgnatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now g原创 2015-05-25 18:42:20 · 396 阅读 · 0 评论 -
2015年ACM课堂练习:rightmost digit
#include using namespace std;int main(){ int T,num,M; cin>>T; M=T; int a[T]; for(;T>0;T--) { cin>>num; int i=num%10; if(num%4==1)原创 2015-05-24 16:58:48 · 377 阅读 · 0 评论 -
2010年山东省第一届ACM大学生程序设计竞赛:Hello World!
Hello World!Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述We know that Ivan gives Saya three problems to solve (Problem F), and this is the first problem.“We need a programmer原创 2016-04-06 19:29:21 · 341 阅读 · 0 评论 -
2010年山东省第一届ACM大学生程序设计竞赛:shopping
ShoppingTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Saya and Kudo go shopping together.You can assume the street as a straight line, while the shops are some points on the li原创 2016-04-06 19:51:49 · 390 阅读 · 0 评论 -
2010年山东省第一届ACM大学生程序设计竞赛:Balloons
BalloonsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly ball原创 2016-04-07 19:55:37 · 267 阅读 · 0 评论 -
子段求和
1081 子段求和基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注给出一个长度为N的数组,进行Q次查询,查询从第i个元素开始长度为l的子段所有元素之和。例如,1 3 7 9 -1,查询第2个元素开始长度为3的子段和,1 {3 7 9} -1。3 + 7 + 9 = 19,输出19。原创 2016-08-06 20:16:55 · 821 阅读 · 0 评论