xtulollipop

Problem Description Now you are given two definitions as follows.f(x)=∑xk=0(−1)k22x−2kCk2x−k+1,f0(x)=f(x),fn(x)=f(fn−1(x))(n≥1)f(x)=∑^x_{k=0}(−1)^k2^{2x−2k}C^k_{2x−k+1},f_0(x)=f(x),f_n(x)=f(f_{n−1}(x)

令F(x)=∑wk=1(Ak+sin(k)sin(x+k)+Bk+cos(k)cos(x+k)) F(x)=∑^w_{k=1}(\frac {A}{k+sin(k)}sin(x+k)+\frac{B}{k+cos(k)}cos(x+k)) 求F(x)=0的前n小的正根的和。 n<=3e6,A<=1e3,B<=1e3n<=3e6,A<=1e3,B<=1e3 其中w是定值,为1e4 保留到小数

如果一个01字符串满足不存在010这样的子串，那么称它为非010串。 求长度为n的非010串的个数。(对1e9+7取模) Input一个数n，表示长度。(n<1e15)Output长度为n的非010串的个数。(对1e9+7取模)Input示例3Output示例7解释: 000 001 011 100 101 110 111对于这样的一个式子我们可以很快的写出dp的做法#includ

Product Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1003 Accepted Submission(s): 231Problem Description Given a number sequence A1,A

给出起点，终点，和n个柱子，小球最多可以在中间弹跳b次。（不算起点，终点），问最小的初速度。 解法：枚举落地次数。 解法类似于http://blog.youkuaiyun.com/xtulollipop/article/details/52789712。。 先判断最小速度能不能到达。不能大话他肯定与某个柱子相切。枚举柱子，找到一个能让所有柱子都不相撞的函数。。取最小值。。#include<bits/std

Problem Description Little frog Georgie likes to jump. Recently he have discovered the new playground that seems the perfect place to jump. Recently the new jumping exercise has become very popular.

Problem Description Alex has invented a new game for fun. There are n integers at a board and he performs the following moves repeatedly:He chooses three numbers a, b and c written at the board and e

Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta have a sequence. Because the sequence is

Problem Description hannnnah_j is a teacher in WL High school who teaches biology.One day, she wants to test m students, thus she arranges n different seats around a round table.In order to prevent ch

Description WLD likes playing with a sequence . One day he is playing with a sequence of integers. For every index i, WLD wants to find the smallest index ( if exists ), that , and mod =

Description Pick two numbers from a sequence to maximize the value of their greatest common divisor.Input Multiple test cases. In the first line there is an integer , indicating the number of

Problem Description Easy question! Calculate how many primes between [1…n]!Input Each line contain one integer n(1 <= n <= 1e11).Process to end of file.Output For each case, output the number of pri

Problem Description Mr. Frog recently studied how to add two fractions up, and he came up with an evil idea to trouble you by asking you to calculate the result of the formula below: As a talent, can

Problem Description QSC dream of becoming a mathematician, he believes that everything in this world has a mathematical law.Through unremitting efforts, one day he finally found the QSC sequence, it i

Description给出正整数n和k，计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值，其中k mod i表示k除以i的余数。例如j(5, 3)=3 mod 1 + 3 mod 2 + 3 mod 3 + 3 mod 4 + 3 mod 5=0+1+0+3+3=7Input输入仅一行，包含两个整数n, k。Output输出仅一行，即j(n,

Description Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? Note, gcd(x, y, z) means the great

Description我们知道，从区间[L,H]（L和H为整数）中选取N个整数，总共有(H-L+1)^N种方案。小z很好奇这样选出的数的最大公约数的规律，他决定对每种方案选出的N个整数都求一次最大公约数，以便进一步研究。然而他很快发现工作量太大了，于是向你寻求帮助。你的任务很简单，小z会告诉你一个整数K，你需要回答他最大公约数刚好为K的选取方案有多少个。由于方案数较大，你只需要输出其除以100000

Problem Description A frog has just learned some number theory, and can’t wait to show his ability to his girlfriend.Now the frog is sitting on a grid map of infinite rows and columns. Rows are number

Description Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).Input The only line contains the two

Description Yellowstar likes integers so much that he listed all positive integers in ascending order,but he hates those numbers which can be written as a^b (a, b are positive integers,2<=b<=r),so he

Problem Description There are m stones lying on a circle, and n frogs are jumping over them. The stones are numbered from 0 to m−1 and the frogs are numbered from 1 to n. The i-th frog can jump over

DescriptionAyrat has number n, represented as it’s prime factorization pi of size m, i.e. n = p1·p2·…·pm. Ayrat got secret information that that the product of all divisors of n taken modulo 109 + 7 is

Description给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的 数对(x,y)有多少对.Input一个整数NOutput如题Sample Input4Sample Output4Hinthint对于样例(2,2),(2,4),(3,3),(4,2)1<=N<=10^7GCD（px,py）==p; 有GCD（x,y）==1,在1-n/p的情况数。即1-n/p的欧拉和。p为质数。

DescriptionLimak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on the table

gnatius bought a land last week, but he didn’t know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now given all the intersectant

Description Once again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby highway bridge which he can use to escape from his enem

Problem Description There are n balls on a smooth horizontal straight track. The track can be considered to be a number line. The balls can be considered to be particles with the same mass.At the begi

Description As we all known , the Fibonacci series : F(0) = 1, F(1) = 1, F(N) = F(N - 1) + F(N - 2) (N >= 2).Now we define another kind of Fibonacci : A(0) = 1 , A(1) = 1 , A(N) = X * A(N - 1) + Y * A

Description Harry is a Junior middle student. He is very interested in the story told by his mathematics teacher about the Yang Hui triangle in the class yesterday. After class he wrote the following

Description 有N对双胞胎，他们的年龄分别是1，2，3，……，N岁，他们手拉手排成一队到野外去玩，要经过一根独木桥，为了安全起见，要求年龄大的和年龄小的排在一起，好让年龄大的保护年龄小的，然后从头到尾，每个人报告自己的年龄，就得到了一个年龄的序列。比如有4对双胞胎，他们报出来的年龄序列是：41312432。突然，他们中间最聪明的小明发现了一个有趣的现象，原来，这个年龄序列有一个规律，两个

MCA山中人才辈出，洞悉外界战火纷纷，山中各路豪杰决定出山拯救百姓于水火，曾以题数扫全场的威士忌，曾经高数九十九的天外来客，曾以一剑铸十年的亦纷菲，歃血为盟，盘踞全国各个要塞（简称全国赛）遇敌杀敌，遇佛杀佛，终于击退辽军，暂时平定外患，三人位置也处于稳态。可惜辽誓不甘心，辽国征南大将军<耶律javac++>欲找出三人所在逐个击破，现在他发现威士忌的位置s,天外来客的位置u，不过很难探查到亦纷菲v所在

DescriptionTwilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dic

Today Pari and Arya are playing a game called Remainders.Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1, c2, …, cn a

Problem Description Teacher BoBo is a geography teacher in the school.One day in his class,he marked N points in the map,the i-th point is at (Xi,Yi).He wonders,whether there is a tetrad (A,B,C,D)(A<

Problem Description There are two sequences h1∼hn and c1∼cn. h1∼hn is a permutation of 1∼n. particularly, h0=hn+1=0.We define the expression [condition] is 1 when condition is True,is 0 when condition

Problem Description There is a river on the Cartesian coordinate system,the river is flowing along the x-axis direction.Rower Bo is placed at (0,a) at first.He wants to get to origin (0,0) by boat.Boa

On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the e

Problem Description 度熊手上有一本字典存储了大量的单词，有一次，他把所有单词组成了一个很长很长的字符串。现在麻烦来了，他忘记了原来的字符串都是什么，神奇的是他竟然记得原来那些字符串的哈希值。一个字符串的哈希值，由以下公式计算得到：H(s)=∏i≤len(s)i=1(Si−28) (mod 9973) //我也是没办法。。h(S)是字符串的每个字符-28的乘积再mod9973;

Problem Description 有一个无限大的矩形，初始时你在左上角（即第一行第一列），每次你都可以选择一个右下方格子，并瞬移过去（如从下图中的红色格子能直接瞬移到蓝色格子），求到第n行第m列的格子有几种方案，答案对1000000007取模。Input 多组测试数据。两个整数n,m(2≤n,m≤100000)Output 一个整数表示答案Sample Input4 5Sample Ou

Problem Description As we all known, xiaoxin is a brilliant coder. He knew palindromic strings when he was only a six grade student at elementry school.This summer he was working at Tencent as an inte