构造
clover_hxy
The secret oppotunities are hidden inside every failure....
展开
-
codeforces 460D Little Victor and Set(构造)
D. Little Victor and Settime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Victor adores the sets theor原创 2016-05-26 20:56:18 · 420 阅读 · 0 评论 -
codeforces 297C Splitting the Uniqueness
C. Splitting the Uniquenesstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears like unique arrays —原创 2016-05-26 21:24:49 · 433 阅读 · 0 评论 -
codeforces 297D Color the Carpet(构造)
#include#include#include#include#include#define N 2003using namespace std;int m,n,k;int a[N][N],b[N][N],cnta,cntb;int ans[N][N];int main(){ scanf("%d%d%d",&n,&m,&k); for (int i=1;i<=n+n-1原创 2016-05-26 22:07:45 · 334 阅读 · 0 评论 -
codeforces 226D The table(贪心+构造)
D. The tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHarry Potter has a difficult homework. Given a原创 2016-05-27 07:40:43 · 537 阅读 · 0 评论 -
codeforces 432E Square Tiling(构造)
E. Square Tilingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have an n × m rectangle table, its cell原创 2016-05-27 19:12:43 · 441 阅读 · 0 评论 -
codeforces 515D Drazil and Tiles(构造)
D. Drazil and Tilestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDrazil created a following problem abou原创 2016-05-27 20:13:16 · 414 阅读 · 0 评论 -
codeforces 746 D. Green and Black Tea (构造)
D. Green and Black Teatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInnokentiy likes tea very much and to原创 2016-12-19 08:13:06 · 603 阅读 · 3 评论