kalilili的专栏

题目表述：给定整数a1，a2，、、、an，判断是否可以从中选出若干数，使他们的和恰好为K；限制条件：1-10^8-10^8c++代码实现如下：#includeusing namespace std;int a[25];int main(){ bool dfs(int i,int sum,int k,int n); int n,k; cin>

wyh2000 and pupilTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 755    Accepted Submission(s): 251Problem DescriptionYoung theoret

Problem DescriptionSoda has a bipartite graph with n vertices and m undirected edges. Now he wants to make the graph become a complete bipartite graph with most edges by adding some extra edge

E. Ann and Half-Palindrometime limit per test1.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputTomorrow Ann takes the hardest

Problem 2185 树的路径覆盖Accept: 37    Submit: 118Time Limit: 2000 mSec    Memory Limit : 32768 KB Problem Description給一棵树, 用最少的路径去覆盖所有的边, 求(1)允许边被重复覆盖, (2)不允许边被重复覆盖. Input第一行是组数

D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno

思路：记录每行每列每个宫已经出现的数字即可，数据比较弱另外POJ 3074 3076 必须用剪枝策略，但实现较麻烦，还是以后学了DLX再来做吧//Accepted 160K 0MS #include#include#include#includeusing namespace std;const int N =15;char sudo[N][N];bool visr[N][

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12490 Accepted: 5265DescriptionOn Planet MM-21, after their Olympic games this year, curlin

题目描述：给定一系列枝条，判断他们是否可以收尾相连接成一个正方形。样例输入：第一行是样例个数N，以下各n行是的第一个数M是这个样例的枝条数，然后后面跟着各个枝条的长度。限制条件：4每个枝条的长度between 1 and 10,000。样例i/o：Sample Input34 1 1 1 15 10 20 30 40 508 1 7 2 6 4 4

Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4397 Accepted: 2519DescriptionYou have just been put in charge of developing a new sh

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32422 Accepted: 11040DescriptionBackground The knight is getting bored of seeing t

Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12678 Accepted: 6498DescriptionWhen a radio station is broadcasting over a very la

题目描述有一个矩形的由 X 和 . 组成的图像，已知它的长和宽。现在给你一个坐标（保证坐标上是X），求其整个连块的周长。（连块就是连着的X，斜着有相同顶点也算）。输入长，宽，坐标X，坐标Y，接着是图。多组数据，4个0结束。样例输入7 7 4 4XXXXXXXXX...XXX..X..XX..X...X..X..XX.....XXXX

问题类型：需要进行n个数的全排列再进行其他操作O(2^n)c++代码实现：#includeusing namespace std;int perm[11],pos,n;bool mapp[11]={0};void perm1(int pos,int n){ if(pos==n+1) { for(int k=1;k<=n;k++)

题目描述：有一个大小为N*M的园子，雨后积水。八连通的积水被认为是一个水洼，求园子共有多少水洼。八连通示意图（相对W的连通部分用*标记）*  *  ** W **  *  *限制条件N,M10 12W........WW..    WWW.....WWW....WW...WW..........WW......

大致题意：8*8的棋盘，已知八个皇后的位置，问最少移动多少次，可以让八个皇后不互相攻击。（同行，同列，同斜线视为互相攻击）思路：易知八皇后不攻击一共有92种，dfs出这92种，然后对于每种状压求出最少需要移动多少次复杂度： O( 92 * n * 2 ^ n) (n = 8)//package ok;import java.math.*;import java.io