poj 1915 http://poj.org/problem?id=1915

【poj 1915 http://poj.org/problem?id=1915】的更多相关文章

poj 1915 http://poj.org/problem?id=1915

/**< */#include <stdio.h> #include <string.h> #include <stdlib.h> #include <queue> #include <ctype.h> #define N 310 using namespace std; ][] = {{-, -}, {-, }, {-, -}, {-, }, {, -}, {, }, {, -}, {, }}; int vis[N][N], l, ex,…

poj 1651 http://poj.org/problem?id=1651

http://poj.org/problem?id=1651Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6188 Accepted: 3777 Description The multiplication puzzle is played with a row of cards, each containing a single positive integer.…

poj-3056 http://poj.org/problem?id=3056

http://poj.org/problem?id=3056 The Bavarian Beer Party Time Limit: 6000MS Memory Limit: 65536K Total Submissions: 995 Accepted: 359 Description The professors of the Bayerische Mathematiker Verein have their annual party in the local Biergarten.…

poj 1679 http://poj.org/problem?id=1679

http://poj.org/problem?id=1679 The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23339 Accepted: 8284 Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree…

POJ3278http://poj.org/problem?id=3278

http://poj.org/problem?id=3278 题目大意: m,n两个数m可+1, -1, *2变成n,需要经过几步 #include<stdio.h> #include<stdlib.h> #include<math.h> #include<string.h> #include<queue> #define max(a, b)(a > b ? a : b) #define N 100010 using namespace s…

OpenJudge/Poj 1207 The 3n + 1 problem

1.链接地址: http://bailian.openjudge.cn/practice/1207/ http://poj.org/problem?id=1207 2.题目: 总时间限制: 1000ms 内存限制: 65536kB 描述 Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In…