![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
基础算法
明天去哪
博观而约取,厚积而薄发.每天坚持写代码
展开
-
poj 2506一直不过,自认为代码正确
#include#include#include#include#include#includeusing namespace std;char a[350][150];const int maxx=150;char * Add(char *s1,char *s2){ int a[maxx+10]={0},b[maxx+10]={0};原创 2014-08-03 16:54:50 · 436 阅读 · 0 评论 -
递推与递归
递归算法与递推十分相似。与递推一样,每一个递归 定义都有其边界 条件,但不同的是,递推是自边界条件出发,通过递归式求f(n)的值,从边界到求解的全过程十分清楚,二递归则是从函数自身出发来达到边界条件的。原创 2015-03-13 21:55:48 · 538 阅读 · 0 评论 -
zoj 1403 Safecracker 枚举
SafecrackerTime Limit: 2 Seconds Memory Limit: 65536 KB=== Op tech briefing, 2002/11/02 06:42 CST ==="The item is locked in a Klein safe behind a painting in the second-floor library. K原创 2015-03-13 21:49:01 · 584 阅读 · 0 评论 -
hdu 5182 PM2.5
PM2.5Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 551 Accepted Submission(s): 308Problem DescriptionNowadays we use conten原创 2015-03-14 10:39:15 · 1238 阅读 · 1 评论 -
整数拆分(划分)问题 递归
m表示最大加数不大于的数f(n,m)表示n的拆分数,n的划分中,最大加数不大于m f(n,m)= 1, n =1 or m=1; f(n,n) n 1+f(n,m-1) n=m f(n,m-1)+原创 2014-08-03 14:58:31 · 1021 阅读 · 0 评论 -
hdu 5186 zhx's submissions
zhx's submissionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 648 Accepted Submission(s): 167Problem DescriptionAs one of原创 2015-03-15 08:57:14 · 429 阅读 · 0 评论 -
hdu 4990 Reading comprehension
Reading comprehensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 318 Accepted Submission(s): 151Problem DescriptionRead t原创 2014-09-09 09:11:43 · 493 阅读 · 0 评论 -
hdu1002,大数加法,朴素版
#include#include#includeusing namespace std;const int maxx=1010;char * add(char *s1,char *s2){ int a[maxx+10]={0},b[maxx+10]={0}; int l1=strlen(s1); int l2=strlen(s2);原创 2014-06-30 13:04:30 · 514 阅读 · 0 评论 -
poj2897模拟
#include#include#include#include#include#include#include#include#include#includeconst int MAX=0xfffffff;using namespace std;int main( ){ int t; while(scanf("%d",&t)原创 2014-08-11 14:08:46 · 439 阅读 · 0 评论 -
HNU2014暑假赛七
Quite Good NumbersTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 76, Accepted users: 56Problem 12876 : No special judgementProblem descr原创 2014-08-09 21:50:33 · 394 阅读 · 0 评论 -
HNU暑假赛七B
Primordial ValuesTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 72, Accepted users: 68Problem 12877 : No special judgementProblem descri原创 2014-08-09 21:57:18 · 438 阅读 · 0 评论 -
poj 1068
简单的模拟题,写过之后不知道为什么codeblocks不能运行,直接tijiao原创 2014-08-04 01:55:40 · 342 阅读 · 0 评论 -
全排列实现
#include#include#include#includeusing namespace std;typedef long long LL;int a[10000];void perm(int a[],int l,int r){ if(l==r) { for(int i=1;i print原创 2015-07-25 18:52:08 · 431 阅读 · 0 评论