算法
文章平均质量分 58
winehownine
一个小小的程序员
展开
-
HDU1312 深搜 red and black
hdu1312 Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of原创 2017-02-27 17:33:15 · 322 阅读 · 0 评论 -
uva10474
#include #include using namespace std; int mm[10001]; int nn[10001]; int main() { int m,n,i,pos,cas=1; while(cin>>m>>n&&m!=0&&n!=0) { for(i=0;i { ci原创 2017-06-05 16:54:49 · 241 阅读 · 0 评论 -
POJ3278
#include #include #include #include using namespace std; int ans[100001],vis[100001]; queue que; int bfs(int sp,int ep) { que.push(sp); int i=0,fnp,snp; ans[sp]=0; vis[sp]=原创 2017-06-05 16:55:53 · 203 阅读 · 0 评论 -
hzau training20170121 a
#include #include #include using namespace std; int a[100005]; int n,c; bool judge_num(int x) { int temp=a[0]; int d=1,i; for(i=1;i { if(a[i]-temp>=x) {原创 2017-06-05 16:57:49 · 188 阅读 · 0 评论 -
hzau training 20170121 b
#include #include #include using namespace std; int a[505],b[505],c[505]; int ab[505*505]; int la,lb,lc; int times,temp; bool judge_num(int l,int r,int x) { int mid; while(l {原创 2017-06-05 16:58:35 · 216 阅读 · 0 评论 -
hzau 20170121 c
#include using namespace std; int a,b,c=1; void get_ans() { c=1; a = a % 10; while(b>0) { if(b % 2 == 1) c= (c * a) % 10; b = b/2; a = (a * a) % 10; } } int ma原创 2017-06-05 16:59:49 · 196 阅读 · 0 评论