![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM书中的题目
文章平均质量分 66
tsiac
这个作者很懒,什么都没留下…
展开
-
ACM程序设计书中的题目练习后感
习题已经做完几天了,一直不知道怎么写这个总结,因为自己做的很不好,很多同学能够解决 三分之二的题目,自己只能做一小半,想了想,体会也有很多,最重要的一点就是:自己知道的、掌握的还是太少了。很多题目无从下手,老师讲的并不能很好的掌握,再加上从寒假开始自己就有些懈怠,所以题目解决的情况不尽人意。从现在开始好好学吧,我还有目标原创 2017-03-23 20:44:22 · 243 阅读 · 0 评论 -
ACM书中的题目 O-15
O-15include#include<bits/stdc++.h> using namespace std; const int t=1001; int main() { int i,m,n,j,k; int a[t]={0},max; vector<string>v; string s; while(cin>>n)原创 2017-03-19 20:21:25 · 156 阅读 · 0 评论 -
ACM书中的题目 N-14
N-14Description The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfig原创 2017-03-19 20:15:41 · 241 阅读 · 0 评论 -
ACM书中的题目 Z-26
Z-26Description When a Little White meets another Little White:Little White A: (Surprised) ! Little White B: ? Little White A: You Little White know “SHDC”? So unbelievable! Little White B: You are原创 2017-03-19 19:31:42 · 132 阅读 · 0 评论 -
ACM书中的题目 M-13
M-13Description As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each原创 2017-03-18 10:30:03 · 170 阅读 · 0 评论 -
ACM书中的题目 L-12
L-12Input SpecificationThe input contains several test cases. The first line contains an integer specifying the number of test cases. Each test case consists of a single line of text which contains at原创 2017-03-18 09:45:03 · 179 阅读 · 0 评论 -
ACM书中的题目 k-11
K-11题目: K - 11 Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatus Description Little Bob likes playing with his box of bricks. He puts the bricks one upon anot原创 2017-03-17 17:53:19 · 180 阅读 · 0 评论 -
ACM书中的题目 j-10
J-10题目: J - 10 Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatus Description You may have heard of the book ‘2001 - A Space Odyssey’ by Arthur C. Clarke, or t原创 2017-03-17 17:45:15 · 328 阅读 · 0 评论 -
ACM书中的题目 U-21
U-21Description Mike is very lucky, as he has two beautiful numbers, 3 and 5. But he is so greedy that he wants infinite beautiful numbers. So he declares that any positive number which is dividable b原创 2017-03-19 20:40:53 · 189 阅读 · 0 评论 -
ACM书中的题目 Y-25
Y-25Description The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by “verb原创 2017-03-19 20:45:36 · 179 阅读 · 0 评论 -
ACM书中的题目 T-20
Description Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than, equal原创 2017-03-19 20:34:38 · 186 阅读 · 0 评论