寻找&星空の孩子

SPOJ4491. Primes in GCD Table Problem code: PGCD Johnny has created a table which encodes the results of some operation -- a function of two arguments. But instead of a boring mu

Chinese remainder theorem againTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1788Appoint description: System Crawler  (2015-04-

C LooooopsDescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A and while variable is not equal to B, repe

X问题Problem Description求在小于等于N的正整数中有多少个X满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)。

Hello KikiTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3579Appoint description: System Crawler  (2015-04-29)Description

Modular Inverse，zoj3609，欧几里德，The 9th Zhejiang Provincial Collegiate Programming Contest，The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).

Cylinder CandyTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeEdward the confectioner is making a new batch of chocolate covered candy. Each candy center is shaped as a cylinde

**青蛙的约会**Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 94174 Accepted: 17412 Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要

RomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3218 Accepted Submission(s): 1274Problem Description The Sky is Sprite. The Birds

BiorhythmsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 117973 Accepted: 37026 DescriptionSome people believe that there are three cycles in a person’s life that start the day

扩展欧几里德求逆元模板:#include<iostream>#define __int64 long longusing namespace std;//举例 3x+4y=1 ax+by=1//得到一组解x0=-1，y0=1 通解为x=-1+4k,y=1-3kinline __int64 extend_gcd(__int64 a,__int64 b,__int64 &x,__int64

BellTime Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4767Appoint description: System Crawler  (2015-03-15)DescriptionWhat? M

Power of MatrixTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice UVA 11149Appoint description: System Crawler  (2015-03-15)Description 

233 MatrixTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1190    Accepted Submission(s): 700Problem DescriptionIn our daily life we ofte

Strange Way to Express IntegersTime Limit:1000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2891Appoint description: System Crawler  (2015-04

BellTime Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4767 DescriptionWhat? MMM is learning Combinatorics!? Looks like she

CRB and CandiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 358    Accepted Submission(s): 160Problem Description CRB has N d

2818: GcdDescription给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.

Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是败者。如果你胜，你第1次怎样取子?

CoinsProblem Description:Duoxida buys a bottle of MaiDong from a vending machine and the machine give her n coins back. She places them in a line randomly showing head face or tail face on. And Duoxida wants to know how many situations that m continuou

H - 邂逅明下Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u每行有三个数字n，p，q，表示一堆硬币一共有n枚，从这个硬币堆里取硬币，一次最少取p枚，最多q枚，如果剩下少于p枚就要一次取完。两人轮流取，直到堆里的硬币取完，最后一次取硬币的算输。对于每一行的三个数字，给出先取的人是否有必胜策略，如果有回答WIN，否则回答LOST。

Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是败者。如果你胜，你第1次怎样取子?

VLATTICE - Visible Lattice Pointsno tags Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0

CO-PRIME时间限制：1000 ms  |  内存限制：65535 KB难度：3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your task is to find how many pa

J - Palindrome NumbersTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice UVALive 2889   WA了一版面，我也是醉了，就因为一个编译环境不同。。。。。。 说多了都是泪。 题

Codeforces Round #307 (Div. 2) ，D. GukiZ and Binary Operations，

Add AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intelligent techniqu

Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne

K - Integer GameTime Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice UVA 11489    题意：在n中取数字，使剩下的数是3的倍数，不能取则失败。思路：如果能使当前数为3的倍数，数字和必是3的倍数。

Problem EContemplation! AlgebraInput: Standard InputOutput: Standard OutputTime Limit: 1 Second Given the value of a+b and ab you will have to find the value of an+bn InputThe input file

Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1919    Accepted Submission(s): 738Problem DescriptionAs we all k

M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1672    Accepted Submission(s): 482Problem DescriptionM斐波那契数列F[n]是一种整数数列，它的定义如下：F[0

POJ1006: 中国剩余定理的完美演绎问题描述     人自出生起就有体力，情感和智力三个生理周期，分别为23，28和33天。一个周期内有一天为峰值，在这一天，人在对应的方面（体力，情感或智力）表现最好。通常这三个周期的峰值不会是同一天。现在给出三个日期，分别对应于体力，情感，智力出现峰值的日期。然后再给出一个起始日期，要求从这一天开始，算出最少再过多少天后三个峰值同时出

参考博客1：据说，矩阵快速幂在递推式优化上相当神奇，而且效率很高。。。　　两矩阵相乘，朴素算法的复杂度是O(N^3)。如果求一次矩阵的M次幂，按朴素的写法就是O(N^3*M)。既然是求幂，不免想到快速幂取模的算法，这里有快速幂取模的介绍，a^b %m 的复杂度可以降到O(logb)。如果矩阵相乘是不是也可以实现O(N^3 * logM)的时间复杂度呢？答案是肯定的。

对于一般的具有常系数线性递推关系的递推数列，若需要很快算出某一项的精确值，一般的方法是求出特征方程的解然后解出这个递推关系的通项公式。可是随着递推关系阶数的升高，解特征方程的难度也逐渐增大，甚至在递推关系阶数大于 5 之后，特征方程的次数随之超过 5，根本没有代数解法。本文利用矩阵乘法，提出了一个在 O(k^3 ⌈logn⌈) 的时间复杂度内算出 k 阶常系数线性递推数列第 n 项的精确值的算法，并利用转移矩阵和特征方程的联系，把这个算法的时间复杂度优化到了 O(k^2 ⌈logn⌉).

hdu 1568 (log取对数 / Fib数通项公式)2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeStar决定要考考他，于是每问他一个数字，他就要把答案说出来，不过有的数字太长了。所以

UVA12493 - Stars（求1-N与N互质的个数）欧拉函数 bnuoj26358

I Interesting Integerssource: xkcd.com/587Undoubtedly you know of the Fibonacci numbers. Starting withF1 = 1 and F2 = 1, every next number is the sum of the twoprevious ones. This results in the sequence 1, 1, 2, 3, 5, 8, 13, . . ..Now let us consider

Root-------------------2015 Multi-University Training Contest 7Problem DescriptionGiven a number sum(1≤sum≤100000000),we have m queries which contains a pair (xi,yi) and would like to know the smallest nonnegative integer ki satisfying xkii=yi mod p whe

1503: 点到圆弧的距离Time Limit: 1 Sec  Memory Limit: 128 MB  Special JudgeSubmit: 325  Solved: 70[Submit][Status][Web Board]Description输入一个点P和一条圆弧（圆周的一部分），你的任务是计算P到圆弧的最短距离。换句话说，你需要在圆弧上找一个点，到P