摘要: 题目描述:Checker Challenge 1000(ms) 10000(kb) 20 / 90 Examine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that 阅读全文
posted @ 2018-03-04 18:28 小小小的程序猿 阅读(190) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Divide Tree As we all know that we can consider a tree as a graph. Now give you a tree with nodes having its weight. We define the weight of a tr 阅读全文
posted @ 2018-03-04 18:27 小小小的程序猿 阅读(839) 评论(0) 推荐(0) 编辑
摘要: 解题思路:Find Gold Someone locked you in the grid house. You can’t escape, until you find the enough gold. But somewhere is on the fire, so you can’t stan 阅读全文
posted @ 2018-03-04 18:25 小小小的程序猿 阅读(156) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Fire Net Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing 阅读全文
posted @ 2018-03-04 18:22 小小小的程序猿 阅读(256) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Maximum Tape Utilization Ratio Tags: 贪婪策略 设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是li ,1 < = i < = n。 程序存储问题要求确定这n 个程序在磁带上的一个存储方案,使得能够在磁带上存储尽可 阅读全文
posted @ 2018-03-04 18:19 小小小的程序猿 阅读(960) 评论(0) 推荐(1) 编辑
摘要: 题目描述:单词接龙 问题描述:单词接龙是一个与我们经常玩的成语接龙相类似的游戏,现在我们己知一组单词,且给定一个开头的字母,要求出以这个字母开头的最长的“龙”(每个单词都最多在“龙" 中出现两次),在两个单词相连时,其重合部分合为一部分,例如beast和astonish,如果接成一条龙则变为beas 阅读全文
posted @ 2018-03-04 18:12 小小小的程序猿 阅读(352) 评论(0) 推荐(0) 编辑
摘要: 题目描述:AK吧!少年 AK is an ACM competition finished all of the problems. AC This problem is one of the steps,so fight to AK。There are a number of graphics"_ 阅读全文
posted @ 2018-03-04 18:05 小小小的程序猿 阅读(676) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Alice and Bob One day, Alice asks Bob to play a game called “K-in-a-row”. There is a game board whose size is N*M. Alice plays first, and they al 阅读全文
posted @ 2018-03-04 18:03 小小小的程序猿 阅读(242) 评论(0) 推荐(0) 编辑
摘要: 题目描述:Satellite Photographs Farmer John purchased satellite photos of W x H pixels of his farm (1 <= W <= 80, 1 <= H <= 1000) and wishes to determine t 阅读全文
posted @ 2018-03-04 17:59 小小小的程序猿 阅读(200) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Subset Sum Tags: 回溯 子集和问题的一个实例为〈 S,t 〉。其中,S={x1 ,x2 ,…, xn }是一个正整数的集合,c是一个正整数。子集和问题判定是否存在S的一个子集S1,使得x1+x2+...+xk=S, 其中x1,x2...xk属于集合S1。 对于给定的正整数 阅读全文
posted @ 2018-03-04 17:57 小小小的程序猿 阅读(352) 评论(0) 推荐(0) 编辑
window.onload = function(){ $("#live2dcanvas").attr("style","position: fixed; opacity: 0.7; left: 70px; bottom: 0px; z-index: 1; pointer-events: none;") }