搜索
关注
分享
扫一扫
文章平均质量分 75
搜索
lp_opai
我没有时间写一封简短的信，所以我写了一封长的。
展开
-
hdu 1016(经典搜素)
# include# include# includeusing namespace std;int vis[25];int num[25];int n,cot;int prime(int sum){ int i; if(sum==2) return false; for(i=2;i*i<=sum;i++) { if(原创 2014-07-23 15:06:43 · 766 阅读 · 0 评论 -
hdu 1258 Sum It Up(dfs)
# include # include using namespace std;int flag,t,n,a[10010],cot[10010],vis[100010];void dfs(int x,int sum,int count){ int i; if(sum>t) return ; else if(sum==t) { for(i=0;i<count;i++)原创 2014-07-23 18:18:49 · 818 阅读 · 0 评论 -
poj 3400 Dropping the stones
//next_permutation全排列# include # include # include using namespace std;struct node{ int w; int v;};struct node a[10010];int max1(int x,int y){ return x>y?x:y;}int main(){ int i,n,d,fl原创 2014-08-04 20:43:44 · 921 阅读 · 0 评论 -
hdu 3152 Obstacle Course (bfs)
//从0 0到n-1 n-1位置 最小消耗，走到i,j位置需要消耗a[i][j]//可以走四个方向#include #include #include #include #include # define inf 999999999using namespace std;int n;int dp[150][150];int a[150][150];int dir[4][2]原创 2014-10-07 19:32:43 · 735 阅读 · 0 评论 -
hdu 4474 Yet Another Multiple Problem (bfs)
///给你一个数n，再给你m个k 求 各位都不为这m个数的n的最小倍数# include# include# include# include# include # includeusing namespace std;int vis[100010],map[11],tt[11],n;int k,x;struct node{ int mod; string原创 2014-10-24 18:53:11 · 709 阅读 · 0 评论 -
hdu 1364 Illusive Chase (dfs)
# include # include # include # include using namespace std;struct node{ int x1; int x2; char x[5];};struct node a[100010];int map[110][110];int n,m,k;bool judge (int xx1,int yy原创 2014-10-01 20:30:30 · 1201 阅读 · 1 评论 -
poj 3170 Knights of Ni (bfs)
///从2开始先到4再到3的最小步数///vis开三维判断到4之前和到4之后是否访问过该点# include # include # include # include using namespace std;int xx[4]={0,0,1,-1};int yy[4]={1,-1,0,0};struct node{ int x; int y; int原创 2015-07-13 09:48:06 · 767 阅读 · 0 评论