码迷,mamicode.com
首页 >  
搜索关键字:positive    ( 2430个结果
UVA - 11388 GCD LCM
II U C   ONLINE   C ON TEST   2 008 Problem D: GCD LCM Input: standard input Output: standard output   The GCD of two positive integers is the largest integer ...
分类:其他好文   时间:2014-08-17 21:24:53    阅读次数:189
UVA - 11859 Division Game
Division game is a 2-player game.In this game, there is a matrix of positive integers with N rows and M columns.Players make their moves in turns. In each step, the current player selects arow. If the...
分类:其他好文   时间:2014-08-17 15:40:52    阅读次数:191
POJ 1692 Crossed Matchings(DP)
Description There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one i...
分类:其他好文   时间:2014-08-16 23:52:01    阅读次数:560
poj 3373
Changing Digits Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 2960   Accepted: 952 Description Given two positive integers n and k, you are asked to genera...
分类:其他好文   时间:2014-08-16 15:12:30    阅读次数:198
To the Max
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located...
分类:其他好文   时间:2014-08-14 23:39:56    阅读次数:234
ZOJ 1074 To the Max (DP)
Problem Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of a rectangle...
分类:其他好文   时间:2014-08-14 01:35:57    阅读次数:228
POJ 2738 Two Ends(记忆化)
Description In the two-player game "Two Ends", an even number of cards is laid out in a row. On each card, face up, is written a positive integer. Players take turns removing a card from either end...
分类:其他好文   时间:2014-08-13 01:18:05    阅读次数:209
[leetcode]First Missing Positive
First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Yo...
分类:其他好文   时间:2014-08-09 23:13:29    阅读次数:253
POJ 3263 Tallest Cow(线段树)
Description FJ's N (1 ≤ N ≤ 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You are told only the height H (1 ≤ H ≤...
分类:其他好文   时间:2014-08-07 23:19:25    阅读次数:346
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!