nare123的博客

B. Remainders Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Pari and Arya are playing a game ca

Problem Description There is a function f(n)=(a+√b)^n+(a−√b)^n. a and b are integers (1≤a,b≤1,000,000). Maybe the function looks complex but it is actually an integer.The question is to calculate

G. Snake Rana time limit per test4.0 s memory limit per test256 MB inputstandard input outputstandard output Old Macdonald wants to build a new hen house for his hens. He buys a new rectangular ar

GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12106 Accepted Submission(s): 4576Problem Description Given 5 integers: a, b, c, d, k, y

CircleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 565 Accepted Submission(s): 190Problem Description Satiya August is in charge of

PowModTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1221 Accepted Submission(s): 428Problem Description Declare: k=∑（m，i=1）φ(i∗n) mod

Colorful TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1741 Accepted Submission(s): 722Problem Description There is a tree with n n

Clever Y Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8920 Accepted: 2222 DescriptionLittle Y finds there is a very interesting formula in mathematics:XY mod Z = KGiven X, Y,

No more tricks, Mr NanguoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 445 Accepted Submission(s): 294Problem Description Now Sailormoon

Funny FunctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 142 Accepted Submission(s): 53Problem Description Function Fx,ysatisfies

高斯消元模板

There are some positive integer numbers, and you want to divide them into two nonempty sets (every integer should be in and only in one set) and get a value descripted below:Assume that set AA has n1n1

Mathematician QSCTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 326    Accepted Submission(s): 172Problem DescriptionQSC drea

A. Pineapple Incidenttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTed has a pineapple. This pineapple is

C. Vacationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n days of vacations! So he decided to

D. Road to Post Officetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has a car and he wants to get

M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2833    Accepted Submission(s): 849Problem DescriptionM斐波那契数列F[n]是一种整数数列，

首先先解决这样一个问题，b和m已知求满足下面条件的x， xk≡b(modm)xk≡b(modm)x^k\equiv b\pmod m 这个问题若是没有限制条件的话会变得很棘手，那么假设条件变得更强让gcd(b,m)=1;便会想到利用欧拉函数求出ϕ(m)ϕ(m)\phi(m)，之后解下面的不定方程。xkxkx k - yyy...

E. ZS and The Birthday Paradoxtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has recently fo

C. Pythagorean Triples time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Katya studies in a fifth grade. Recently her class studied right tri

We are given a sequence of n decimal digits. The sequence needs to be partitioned into one or morecontiguous subsequences such that each subsequence, when interpreted as a decimal number, is divisib

SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19576 Accepted: 4930DescriptionConsider two natural numbers A and B. Let S be the sum of all natur

　轮状病毒有很多变种，所有轮状病毒的变种都是从一个轮状基产生的。一个N轮状基由圆环上N个不同的基原子 和圆心处一个核原子构成的，2个原子之间的边表示这2个原子之间的信息通道。如下图所示 　　N轮状病毒的产生规律是在一个N轮状基中删去若干条边，使得各原子之间有唯一的信息通道，例如共有16个不 同的3轮状病毒，如下图所示 　　现给定n(N<=100)，编程计算有多少个不同的n轮状...