DLX
文章平均质量分 87
JacquesdeH
.
展开
-
HUST 1017 Exact Cover [DLX]
Exact cover Time Limit: 15000MS Memory Limit: 131072KB 64bit IO Format: %lld & %lluDescription There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selection o原创 2016-10-09 15:10:21 · 285 阅读 · 0 评论 -
POJ 3074 Sudoku [DLX] [SDLX]
Sudoku Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluDescription In the game of Sudoku, you are given a large 9 × 9 grid divided into smaller 3 × 3 subgrids. For exa原创 2016-10-10 07:51:06 · 358 阅读 · 0 评论 -
FZU 1686 神龙的难题 [DLX] [RepeatCover]
神龙的难题 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription 这是个剑与魔法的世界.英雄和魔物同在,动荡和安定并存.但总的来说,库尔特王国是个安宁的国家,人民安居乐业,魔物也比较少.但是.总有一些魔物不时会进入城市附近,干扰人民的生活.就要有一些人出来守护居民原创 2016-10-10 14:15:00 · 219 阅读 · 0 评论 -
HDU 5046 Airport [DLX] [RepeatCover]
Airport Time Limit: 1500MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uDescription The country of jiuye composed by N cites. Each city can be viewed as a point in a two- dimensiona原创 2016-10-10 15:41:27 · 268 阅读 · 0 评论 -
NOIP模拟题 2016.11.12 [Catalan数] [贪心] [动态规划] [DLX] [数独]
T1: 题意:有2N个数,排成两列,要求每一列中的数递增,并且同一位置右边的数比左边的大。ans(1…4)=1,2,5,14很明显的Catlan数。。 怎么推出来的我也不知道。 F[n] = F[n-1] * (4n-2) / (n+1),预处理逆元。#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib>原创 2016-11-12 14:15:31 · 895 阅读 · 0 评论