随笔分类 -  FZU

http://acm.fzu.edu.cn/
FZU 2150 Fire Game（点火游戏）
摘要：FZU 2150 Fire Game（点火游戏） Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description - 题目描述 Fat brother and Maze are playing a kind of special ( 阅读全文
posted @ 2017-02-11 23:30 Simon_X 阅读(420) 评论(0) 推荐(0)
FZU 2105 Digits Count（位数计算）
摘要：Description 题目描述 Given N integers A={A[0],A[1],...,A[N-1]}. Here we have some operations: Operation 1: AND opn L R Here opn, L and R are integers. For 阅读全文
posted @ 2016-02-19 22:32 Simon_X 阅读(423) 评论(0) 推荐(0)
FZU 2218 Simple String Problem（简单字符串问题）
摘要：Description 题目描述 Recently, you have found your interest in string theory. Here is an interesting question about strings. You are given a string S of l 阅读全文
posted @ 2016-02-18 11:06 Simon_X 阅读(380) 评论(0) 推荐(0)
FZU 2221 RunningMan（跑男）
摘要：Problem Description 题目描述 ZB loves watching RunningMan! There's a game in RunningMan called 100 vs 100. There are two teams, each of many people. There 阅读全文
posted @ 2016-02-05 19:42 Simon_X 阅读(391) 评论(0) 推荐(0)
FZU 2216 The Longest Straight（最长直道）
摘要：Description 题目描述 ZB is playing a card game where the goal is to make straights. Each card in the deck has a number between 1 and M(including 1 and M). 阅读全文
posted @ 2016-01-23 17:19 Simon_X 阅读(289) 评论(0) 推荐(0)
FZU 2212 Super Mobile Charger（超级充电宝）
摘要：【Description】 【题目描述】 While HIT ACM Group finished their contest in Shanghai and is heading back Harbin, their train was delayed due to the heavy snow. 阅读全文
posted @ 2016-01-19 22:39 Simon_X 阅读(456) 评论(0) 推荐(0)
FZU 2219 StarCraft（星际争霸）
摘要：Description 题目描述 ZB loves playing StarCraft and he likes Zerg most! One day, when ZB was playing SC2, he came up with an idea: He wants to change the 阅读全文
posted @ 2016-01-19 19:55 Simon_X 阅读(844) 评论(0) 推荐(0)
FZU 2213 Common Tangents（公切线）
摘要：Description 题目描述 Two different circles can have at most four common tangents. The picture below is an illustration of two circles with four common tan 阅读全文
posted @ 2016-01-16 16:14 Simon_X 阅读(408) 评论(0) 推荐(0)
FZU 2215 Simple Polynomial Problem（简单多项式问题）
摘要：Description 题目描述 You are given an polynomial of x consisting of only addition marks, multiplication marks, brackets, single digit numbers, and of cour 阅读全文
posted @ 2016-01-15 19:01 Simon_X 阅读(380) 评论(0) 推荐(0)
FZU 2214 Knapsack problem（背包问题）
摘要：Description 题目描述 Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the tot 阅读全文
posted @ 2016-01-13 18:26 Simon_X 阅读(317) 评论(0) 推荐(0)