王小平

题目链接 描述给定两个数m,n,其中m是一个素数。将n（0<=n<=10000）的阶乘分解质因数，求其中有多少个m。输入 第一行是一个整数s（0<s<=100)，表示测试数据的组数 随后的s行, 每行有两个整数n，m。 输出 输出m的个数。 样例输入2100 516 2样例输出2415解题思路: 在一个数n的范围内，用n/m来表示这个范围有几个m的倍

题目链接N letters have just arrived at the post office positioned at x = 0, and the i-th letter should be posted to position x = ai. BaoBao, our beloved postman, will start his work from the post office ...

题目链接There are n points on a horizontal line, labelled with 1 through n from left to right.The distance between the i-th point and the (i+1)-th point is ai.For each integer k ranged from 1 to n, you...

题目链接You are given k sequences of integers. The length of the i-th sequence equals to ni.You have to choose exactly two sequences i and j (i≠j) such that you can remove exactly one element in each of...

题目链接Vasya has two arrays A and B of lengths n and m, respectively.He can perform the following operation arbitrary number of times (possibly zero): he takes some consecutive subsegment of the array ...

题目链接题目描述Now given two integers x and y, you can reverse every consecutive three bits in arbitrary number’s binary form (any leading zero can be taken into account) using one coin. Reversing (1,2,3) ...

题目链接Let’s call an array of non-negative integers a1,a2,…,an a k-extension for some non-negative integer k if for all possible pairs of indices 1≤i,j≤n the inequality k⋅|i−j|≤min(ai,aj) is satisfied. ...

题目链接Bob has a string s consisting of lowercase English letters. He defines s′ to be the string after removing all “a” characters from s (keeping all other characters in the same order). He then gener...

题目链接BaoBao is brewing a magical potion. To brew this potion, n types of ingredients, whose rank ranges from 1 to n, is needed. More precisely, for all 1 <= i <= n, BaoBao needs at least ai pi...

题目链接Alyona has recently bought a miniature fridge that can be represented as a matrix with h rows and 2 columns. Initially there is only one shelf at the bottom of the fridge, but Alyona can install ...

题目链接 Problem DescriptionThere are n kinds of goods in the company, with each of them has a inventory of and direct unit benefit . Now you find due to price changes, for any goods sold on day i, if...

题目链接 Problem Description输入n个整数，输出由这些整数组成的n行矩阵。 Input第一行输入一个正整数N（N&lt;=20），表示后面要输入的整数个数。 下面依次输入N个整数。 Output以输入的整数为基础，输出有规律的n行数据。 Sample Input5 3 6 2 5 8 Sample Output3 6 2 5 8 8 3 6 2...

题目链接 Problem Description 多项式描述如下： 1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 …… 先请你求出多项式前n项的和。 Input 第一行输入一个数T代表测试数据个数（T<=1000）。接下来T行每行1个数代表n(0<=n< 2^31)。 Output 对于每个输入样例，输出多项式和的结果(结果精确到小数点后两位)。每行输出一个结果

题目链接 Problem Description 有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。 其中，蜂房的结构如下所示。 Input 输入数据的第一行是一个整数N, 表示测试实例的个数，然后是N 行数据，每行包含两个整数a和b(0&lt;a&lt;b&lt;50) Output 对于每个测试实例，请输出蜜蜂从蜂房a爬到...

Problem Description 下面是512汶川大地震部分受灾学校伤亡情况（惨痛！！）1、 四川省都江堰市 聚源中学 伤亡情况：遇难学生人数（含失踪）320 详细说明： 一栋教学楼被震垮，该楼18个班420多名学生被埋，截至目前仅有不到100名获救。 2、 四川省绵阳市 北川县北川中学 伤亡情况：遇难学生人数（含失踪）1200多人 详细说明：学校教室损毁情况严重，六至七层高...

题目链接You’re given an array a of length n. You can perform the following operations on it:choose an index i (1≤i≤n), an integer x (0≤x≤106), and replace aj with aj+x for all (1≤j≤i), which means add x...

题目链接While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.Given two st...

题目链接Recently you have received two positive integer numbers x and y. You forgot them, but you remembered a shuffled list containing all divisors of x (including 1 and x) and all divisors of y (includ...