Foam_-CSDN博客

原创杭电2149

Public Sale Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5690 Accepted Submission(s): 3316 Problem Description 虽然不想，但是现实总归是现实

2015-07-25 10:26:19 619

原创杭电2139

Calculate the formula Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7770 Accepted Submission(s): 2393 Problem Description You

2015-07-25 10:20:37 519

转载三十分钟掌握STL

三十分钟掌握STL 这是本小人书。原名是《using stl》，不知道是谁写的。不过我倒觉得很有趣，所以化了两个晚上把它翻译出来。我没有对翻译出来的内容校验过。如果你没法在三十分钟内觉得有所收获，那么赶紧扔了它。文中我省略了很多东西。心疼那，浪费我两个晚上。译者：kary contact:karymay@163.net STL概述 STL的一个重要特点是数据结构和算法的分离。尽

2015-07-21 11:33:11 451

原创杭电2097

Sky数 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16372 Accepted Submission(s): 9408 Problem Description Sky从小喜欢奇特的东西，而且天生对数字

2015-05-20 19:48:40 850

原创杭电2053

Switch Game Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12567 Accepted Submission(s): 7634 Problem Description There are many la

2015-04-25 14:00:01 630

原创杭电5053

the Sum of Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1594 Accepted Submission(s): 621 Problem Description A range is

2015-04-23 20:52:19 513

原创杭电5054

Alice and Bob Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 537 Accepted Submission(s): 402 Problem Description Bob and Alice

2015-04-23 20:20:04 472

原创杭电5112

A Curious Matt Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 647 Accepted Submission(s): 337 Problem Description There is a

2015-04-23 19:53:31 474

原创杭电5122

K.Bro Sorting Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 520 Accepted Submission(s): 285 Problem Description Matt’s

2015-04-20 15:58:43 548

原创杭电2032

杨辉三角 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 42258 Accepted Submission(s): 17697 Problem Description 还记得中学时候学过的杨辉三角吗？具体的定义这里

2015-04-17 09:05:17 606

原创杭电2304

Electrical Outlets Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2144 Accepted Submission(s): 1892 Problem Description Roy has jus

2015-04-17 08:43:03 465

原创杭电2504

又见GCD Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12292 Accepted Submission(s): 5227 Problem Description 有三个正整数a,b,c(0 Input

2015-04-16 19:34:20 567

原创杭电1722

Cake Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2544 Accepted Submission(s): 1317 Problem Description 一次生日Party可能有p人或者q人参加,现准备有一个

2015-04-16 19:13:09 644

原创杭电1019

Least Common Multiple Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34414 Accepted Submission(s): 12957 Problem Description The least

2015-02-11 20:09:54 530

原创杭电5142

Problem Description A boy named NPY is learning FFT algorithm now.In that algorithm,he needs to do an operation called "reverse". For example,if the given number is 10.Its binary representaion is

2015-02-01 21:07:10 481

原创杭电5146题

Problem Description Today we have a number sequence A includes n elements. Nero thinks a number sequence A is good only if the sum of its elements with odd index equals to the sum of its elements

2015-01-31 21:06:36 519

转载中国剩余定理（笔记）

什么是中国剩余定理呢?先看一则民间的传说故事——“韩信点兵”。楚汉相争，一次战役中，汉军原有1500人死伤四五百人。 ……………… 他命令士兵3人一排，结果多出2名；命令5人一排，多出3名；命令7人一排，多出2名。韩信便马上说出我军有1073名勇士。 ……………… 对于这个问题，可将其描述为一个数学问题，就是：一个数除以3余2，除以5余3，除以7余2，求这个数是多少？先列出除以3

2015-01-27 22:00:47 654

转载递归函数优化(笔记)

例如:(斐波拉切数列的函数)： int fib(int n) { if (n <= 1) return n; return fib(n - 1) + fib(n - 2); } 通过记忆化搜索或者动态规划的想法，进行优化： int memo[MAX_N + 1] int fib(int n) { if (n <= 1) return n; if (memo[

2015-01-24 23:38:57 584

转载著名的Eratosthenes求素数方法（程序员的数学思维修炼）

选择已经筛选过的素数对后面的数进行筛选，可快速筛选出后面的素数。 [cpp] view plaincopy int i,j; int prime[MAXNUM+1]; //定义保存素数的数组 for(i=2;i//初始化数组 prime[i]=1; //标志为1表示对应的数是素数 for(i=2;i*i//循环

2015-01-24 14:12:51 905

Foam_的专栏