打表 + 预处理
文章平均质量分 67
楚江枫
不忘初心,方得始终
展开
-
【zzulioj 1902 985的因子对难题】
985的因子对难题Description985有n个正整数,他想知道存在多少个不同的因子对(a[i], a[j])使得 1 <= i, j <= n && i != j && a[j] % a[i] == 0,其中i和j是元素的下标。 特别地,他认为(a[i],a[j])与(a[j],a[i])是一样的因子对。 Input第一行输入一个整数t,代表有t组测试数据。 每组数据占两行,第一行输入原创 2016-08-19 09:37:01 · 399 阅读 · 0 评论 -
【51nod 区间的价值 】+ 思维
区间的价值 System Message (命题人) 基准时间限制:1 秒 空间限制:131072 KB 分值: 160 我们定义“区间的价值”为一段区间的最大值*最小值。 一个区间左端点在L,右端点在R,那么该区间的长度为(R-L+1)。 现在聪明的杰西想要知道,对于长度为k的区间,最大价值的区间价值是多少。 当然,由于这个问题过于简单。 我们肯定得加强一下。 我们想要知道的是,对原创 2017-07-23 12:06:31 · 383 阅读 · 0 评论 -
【51nod 扔盘子】+ 预处理
扔盘子 李陶冶 (命题人) 基准时间限制:1 秒 空间限制:131072 KB 分值: 10 有一口井,井的高度为N,每隔1个单位它的宽度有变化。现在从井口往下面扔圆盘,如果圆盘的宽度大于井在某个高度的宽度,则圆盘被卡住(恰好等于的话会下去)。 盘子有几种命运:1、掉到井底。2、被卡住。3、落到别的盘子上方。 盘子的高度也是单位高度。给定井的宽度和每个盘子的宽度,求最终落到井内的盘子数量。原创 2017-07-22 10:53:35 · 432 阅读 · 0 评论 -
【uestc 1425 D Farey Sequence Length】+ 打表
D Farey Sequence Length Given a positive integer, N, the sequence of all fractions a / b with (0 < a b), (1 < b N) and a and b relatively prime, listed in increasing order, is called the Farey原创 2017-03-04 11:26:23 · 423 阅读 · 0 评论 -
【Uestc 1423 Running Steps】+ 排列组合
B Running Steps The coach wants his team members to run up the stadium steps taking either one or two steps with each stride so that: a) The number of two step strides taken by each leg is the sam原创 2017-03-03 18:37:07 · 415 阅读 · 0 评论 -
【Codeforces 629 C Famil Door and Brackets 】+ dp
C. Famil Door and Brackets time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAs Famil Door’s birthday is coming, some of his friends (原创 2016-12-23 00:00:39 · 651 阅读 · 0 评论 -
【codeforces 367A Sereja and Algorithm】+ 预处理
A. Sereja and Algorithm time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Sereja loves all sorts of algorithms. He has recently come up with原创 2016-10-06 11:11:17 · 375 阅读 · 0 评论 -
【codeforces 368B Sereja and Suffixes】+ 预处理
B. Sereja and Suffixes time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Sereja has an array a, consisting of n integers a1, a2, …, an. The b原创 2016-10-06 11:08:54 · 471 阅读 · 0 评论 -
【Lightoj 1067】+ 逆元 + 预处理
Given n different objects, you want to take k of them. How many ways to can do it?For example, say there are 4 items; you want to take 2 of them. So, you can do it 6 ways.Take 1, 2 Take 1, 3 Take 1,原创 2016-10-02 18:06:11 · 460 阅读 · 0 评论 -
【LightOJ 1064 】Throwing Dice + dp
Throwing Dice n common cubic dice are thrown. What is the probability that the sum of all thrown dice is at least x?Input Input starts with an integer T (≤ 200), denoting the number of test cases.Eac原创 2016-10-02 09:30:42 · 618 阅读 · 0 评论 -
【LightOJ 1189 + 打表】
Description Given an integer n, you have to find whether it can be expressed as summation of factorials. For given n, you have to report a solution such thatn = x1! + x2! + … + xn! (xi < xj for all i原创 2016-10-01 14:06:26 · 319 阅读 · 0 评论 -
【 Codeforces 237C Primes on Interval】+ 二分
A - Primes on Interval Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description You’ve decided to carry out a survey in the theory of prime numbers. Le原创 2016-10-16 15:35:58 · 418 阅读 · 0 评论 -
【HDU 1128 Self Numbers】+ 打表预处理
Self NumbersTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7520 Accepted Submission(s): 3310Problem Description In 1949 the Indian mathe原创 2016-10-22 12:13:06 · 459 阅读 · 0 评论 -
【UVA 10200】
Euler is a well-known matematician, and, among many other things, he discovered that the formula n 2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ 41.原创 2016-08-13 18:13:55 · 335 阅读 · 0 评论 -
【HDU 6069 Counting Divisors】 + 素数筛 & 思维
Counting DivisorsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1372 Accepted Submission(s): 494Problem Description In mathematics, the原创 2017-08-04 10:12:44 · 393 阅读 · 0 评论