码迷,mamicode.com
首页 >  
搜索关键字:positive    ( 2430个结果
POJ3061 Subsequence
Subsequence Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8843   Accepted: 3506 Description A sequence of N positive integers (10 < N < 100 000), each of...
分类:其他好文   时间:2014-11-06 14:54:15    阅读次数:195
H - Happy 2006
H - Happy 2006 Time Limit:3000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u Submit   Status Description Two positive integers are said to be relatively prime to each o...
分类:移动开发   时间:2014-11-06 09:26:50    阅读次数:157
[ACM] SDUT 2886 Weighted Median (省赛最悲剧的一道题)
Weighted Median Time Limit: 2000ms   Memory limit: 65536K  有疑问?点这里^_^ 题目描述 For n elements x1,?x2,?...,?xn with positive integer weights w1,?w2,?...,?wn. The weighted median is the...
分类:其他好文   时间:2014-11-04 22:51:14    阅读次数:290
HDU 1006 Digital Roots
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit the...
分类:其他好文   时间:2014-11-03 22:07:53    阅读次数:149
hdu 4497 GCD and LCM(唯一分解+容斥原理)
GCD and LCM Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 78 Accepted Submission(s): 43 Problem Description Given two positive integ...
分类:其他好文   时间:2014-11-02 09:30:22    阅读次数:185
ZOJ 3633 Alice's present(线段树)
As a doll master, Alice owns a wide range of dolls, and each of them has a number tip on it's back, the tip can be treated as a positive integer. (the number can be repeated). One day, Alice hears t...
分类:其他好文   时间:2014-11-01 06:19:48    阅读次数:244
Problem 005——Digit Generator
1583 - Digit GeneratorFor a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we...
分类:其他好文   时间:2014-10-30 22:18:18    阅读次数:234
poj1426--Find The Multiple(广搜,智商题)
Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 18527   Accepted: 7490   Special Judge Description Given a positive integer n, write a prog...
分类:其他好文   时间:2014-10-30 15:21:23    阅读次数:245
poj 2773(容斥原理)
容斥原理入门题吧。Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9798Accepted:3341DescriptionTwo positive integers are said to be relatively p...
分类:其他好文   时间:2014-10-30 00:09:40    阅读次数:201
POJ3233(矩阵二分再二分)
题目很有简单: Description Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak. Output S mod m 范围:n (n ≤ 30), k (k ≤ 109) and m (m 4).  显然,暴力是不能解决问题,这题目很有意思...
分类:其他好文   时间:2014-10-29 19:29:27    阅读次数:176
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!