2015年11月27日

virtual judge(专题一 简单搜索 E)

摘要: DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 a... 阅读全文

posted @ 2015-11-27 23:48 vCoders 阅读(265) 评论(0) 推荐(0)

virtual judge(专题一 简单搜索 C)

摘要: DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 ≤N≤ 100,000) on... 阅读全文

posted @ 2015-11-27 22:46 vCoders 阅读(457) 评论(0) 推荐(0)

virtual judge(专题一 简单搜索 B)

摘要: DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled... 阅读全文

posted @ 2015-11-27 20:54 vCoders 阅读(318) 评论(0) 推荐(0)

virtual judge(专题一 简单搜索 A)

摘要: 问题描述:Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数,n k... 阅读全文

posted @ 2015-11-27 20:52 vCoders 阅读(948) 评论(0) 推荐(0)

HDU1548(楼梯问题bfs)

摘要: #include"cstdio"#include"queue"#include"cstring"using namespace std;const int MAXN=205;typedef pair P;int N,A,B;int K[MAXN];int vis[MAXN];int bfs(){ ... 阅读全文

posted @ 2015-11-27 11:37 vCoders 阅读(424) 评论(0) 推荐(0)

POJ2785(upper_bound)

摘要: #include"cstdio"#include"algorithm"using namespace std;const int MAXN=4005;int A[MAXN],B[MAXN],C[MAXN],D[MAXN];int CD[MAXN*MAXN];int n;int main(){ ... 阅读全文

posted @ 2015-11-27 09:38 vCoders 阅读(163) 评论(0) 推荐(0)

导航