LYHVOYAGE的专栏

题目链接：http://codeforces.com/problemset/problem/236/BEasy Number Challengetime limit per test2 secondsmemory limit per test256 megabytesLet's denote d(n) as the number of divis

Parenthese sequence                                                                    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Descriptio

Devu and Partitioning of the Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu being a small kid, l

Match for BonusTime Limit: 2 Seconds      Memory Limit: 65536 KBRoy played a game with his roommates the other day. His roommates wrote 2 strings of characters, and gave each character a b

Killing MonstersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 906    Accepted Submission(s): 444Problem DescriptionKingdom R

Fast Matrix Calculation                                                                  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Descript

Room and Moor                                                                         Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Problem Descriptio

Miaomiao's Geometry                                                                             Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Problem Des

Pretty PoemTime Limit: 2 Seconds      Memory Limit: 65536 KBPoetry is a form of literature that uses aesthetic and rhythmic qualities of language. There are many famous poets in the contempora

Matrix multiplication                                                                          Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem De

Inversion                                                                            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Description

A:Rewards：题目链接：http://codeforces.com/problemset/problem/448/A题意：Bizon有a1个一等奖奖杯，a2个二等奖奖杯，a3个三等奖奖杯，b1个一等奖奖牌，b2个二等奖奖牌，b3个三等奖奖牌，和一个有n个架子的橱柜。现在Bizon想把这些奖牌和奖杯放在橱柜里，但是要遵循下面的规则：一个架子上不能同时放奖杯和奖牌；一个架子上的奖杯数量不

Problem HMorning WalkTime Limit3 SecondsKamalis a Motashotaguy. He has got a new job in Chittagong. So, he has moved to Chittagong fromDinajpur. He was getting fatter i

Magic Formulastime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeople in the Tomskaya region like magic for

Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland is m

Fixing Typostime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMany modern text editors automatically check th

Dividing StonesTime limit:7sSource limit:50000BMemory limit:256MBThere are N stones, which can be divided into some piles arbitrarily. Let the v

Nice boat                                                                          Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Description

Hang Up the SystemTime Limit: 2 Seconds      Memory Limit: 32768 KBYou're going to design a multi-task operating system for an embedded system. Because the resources are limited on this mini c

Magical Forest                                                                      Time Limit: 24000/12000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Problem Description

Grade                                                                    Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionTed is

B. Lorrytime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputA group of tourists is going to kayak and catamaran

Om Nom and Dark Parktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOm Nom is the main character of a game

Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9465 Accepted: 4699DescriptionIt's almost summer time, and that means that it's almost

Your Ways You live in a small well-planned rectangular town in Phuket. The size of the central area of the town is H kilometers x W kilometers. The central area is divided into HW unit blocks, e

CodeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionWLD likes playing with codes.One day he is writing a function.Howerver,his c

BUY LOW, BUY LOWERTime Limit: 1000MS Memory Limit: 30000K   DescriptionThe advice to "buy low" is half the formula to success in the bovine stock market.To be con

Team FormationTime Limit: 3 Seconds      Memory Limit: 131072 KBFor an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of h

题目链接：http://codeforces.com/problemset/problem/237/CPrimes on Intervaltime limit per test1 secondmemory limit per test256 megabytesYou've decided to carry out a

Gibonacci numberTime Limit: 2 Seconds      Memory Limit: 65536 KBIn mathematical terms, the normal sequence F(n) of Fibonacci numbers is defined by the recurrence relationF(n)=F(n-1)+F(n-2)

题目链接：http://acm.fzu.edu.cn/contest/problem.php?cid=140&sortid=3Problem DescriptionYtaaa作为一名特工执行了无数困难的任务，这一次ytaaa收到命令，需要炸毁敌人的一个工厂，为此ytaaa需要制造一批炸弹以供使用。 Ytaaa使用的这种新型炸弹由若干个炸药组成，每个炸药都有它的威力值，而炸弹的威力值为组

Rotate                                                                          Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Big StringTime Limit: 2 Seconds      Memory Limit: 65536 KBWe will construct an infinitely long string from two short strings: A = "^__^" (four characters), and B = "T.T" (three characters). R

数单词时间限制：1000 ms  |  内存限制：65535 KB难度：4描述为了能够顺利通过英语四六级考试，现在大家每天早上都会早起读英语。LYH本来以为自己在6月份的考试中可以通过六级，可是没想到，成绩出来以后，居然没有通过。所以他不得不付出更多的时间来学习英语。要想通过六级，最基本的要求就是词汇量。为了能够更快的记住一些陌生单词，LYH有时会找一些

方案数量时间限制：1000 ms  |  内存限制：65535 KB难度：2描述给出一个N*M的棋盘，左下角坐标是（0，0），右上角坐标是（N，M），规定每次只能向上或者向右走，问从左下角走到右上角，一共有多少种方案。上图是一个4*3的棋盘。输入多组测试数据。每组输入两个整数N，M（0≤N，M≤30）。输入0,0时表示结束，不做任

题目链接：http://codeforces.com/problemset/problem/321/A题意：在一个二维平面中，开始时在（0,0）点，目标点是（a，b），问能不能通过重复操作题目中的指令，从原点移动到目标点。分析：假设一次完成所有的命令后，移动到了（xx，yy），并且从（Xi，Yi）重复操作k次指令到达目标点，则可以列出方程 Xi + k * xx = a && Yi + k

YY's MinionsTime Limit: 2 Seconds      Memory Limit: 65536 KBDespite YY's so much homework, she would like to take some time to play with her minions first.YY lines her minions up to an N*M 

Beautiful PeopleTime Limit: 5 Seconds      Memory Limit: 32768 KB      Special JudgeThe most prestigious sports club in one city has exactly N members. Each of its members is strong and beauti

Ever DreamTime Limit: 2 Seconds      Memory Limit: 65536 KB"Ever Dream" played by Nightwish is my favorite metal music. The lyric (see Sample Input) of this song is much more like a poem. E

如上图，判断线段AB和线段CD相交。分析：如果线段AB和线段CD相交，只能是图中的两种相交情况。可以用向量叉乘来判断。如果（向量AB叉乘向量AC）*（向量AB叉乘向量AD）设A(X1,Y1), B(X2, Y2), C(X3, Y3), D(X4, Y4)，三角形ABC的面积为：2A =  = X1*Y2 + X3*Y1 + X2*Y3 - X3*Y2 - X1*Y3 - X2*Y1。