ACM
beyondjhf_2008
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
用STL解决Let the Balloon Rise这道题的妙处
[size=medium]Sample Input 5 green red blue red red 3 pink orange pink 0 Sample Output red pink code as following #include #include #include using namespace std; int main() {...原创 2009-04-18 21:18:08 · 243 阅读 · 0 评论 -
Number Sequence
[size=medium]A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n). Input Th...原创 2009-04-18 21:43:14 · 145 阅读 · 0 评论 -
FatMouse's Trade
[size=medium]学了一阵子的CUDA,突然有点感概,突然感觉C语言、计算机组成原理、编译原理、微机原理等课程是多么重要,大学浪费了。。现在绝大部分的并行程序设计都是基于C扩展的。谭浩强的那本C学得再久感觉还是没学透,所以今天又上杭电ACM做了一道题,就当复习C语言了。。整个程序编了20分钟,调了一个多小时,C指针真难!!! FatMouse' Trade Time Limit: ...2009-04-19 19:40:04 · 215 阅读 · 0 评论 -
ACM大数的阶乘问题
[size=medium]题目的大概意思是求数阶乘的位数: Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption...原创 2009-04-22 22:11:22 · 347 阅读 · 0 评论 -
ACM 3n+1的问题
[size=medium]Problem Description Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing...2009-04-22 22:35:20 · 167 阅读 · 0 评论 -
求体积(非常简单的ACM题)
[size=medium]再简单的题也会有价值。。double型的变量记得输入格式是%lf而不是%f Problem Description 根据输入的半径值,计算球的体积。 Input 输入数据有多组,每组占一行,每行包括一个实数,表示球的半径。 Output 输出对应的球的体积,对于每组输入数据,输出一行,计算结果保留三位小数。 Sample Inp...2009-04-22 23:56:34 · 1121 阅读 · 0 评论 -
ACM题:a hard puzzle 求数a的b(可以很大)次方的最低位
[size=medium]A hard puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5314 Accepted Submission(s): 1832 Problem Description lcy...2009-04-23 15:52:32 · 493 阅读 · 0 评论 -
ACM题:ASCII码排序(2000)
[size=medium]ASCII码排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10683 Accepted Submission(s): 4586 Problem Description 输入三个字符后...2009-04-23 16:09:35 · 297 阅读 · 0 评论
分享