代码改变世界

传送门 Array ChallengeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 153428/153428 K (Java/Others)Total Submission(s): 203    Accepted Submission(s): 91Problem Description There’s an array that

传送门开关问题Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7731Accepted: 3034Description有N个相同的开关，每个开关都与某些开关有着联系，每当你打开或者关闭某个开关的时候，其他的与此开关相关联的开关也会相应地发生变化，即这些相联系的开关的状态如果原来为开就变为关，如果为关就变为开。你的目标是经过若干次开关

传送门EXTENDED LIGHTS OUTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9297Accepted: 6040DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the

传送门 Mathematician QSCTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 208    Accepted Submission(s): 101Problem Description QSC dream of becom

传送门Flip GameTime Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)Submit StatusFlip game is played on a rectangular 4×44×4 field with two-s

传送门 Zhu and 772002Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 48    Accepted Submission(s): 16Problem Description Zhu and 772002 are both g

传送门 The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1471    Accepted Submission(s): 636Problem Description Chang’e （嫦娥）

高斯消元就是来接方程组的。（可以跟矩阵联系在一起）#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>using namespace std;const int MAXN = 1e2+5;int equ, var;///equ个方程 var个变量int a[MA

传送门 Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4338    Accepted Submission(s): 1736Problem Description Given two

传送门 LanternsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1582    Accepted Submission(s): 621Problem Description Alice has received a beautifu

/**2016 - 09 - 08 晚上Author: ITAKMotto:今日的我要超越昨日的我，明日的我要胜过今日的我，以创作出更好的代码为目标，不断地超越自己。**/#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <vector>

传送门Page RankTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 346    Accepted Submission(s): 105Problem Description Evaluation and rank of web

传送门 Funny FunctionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 724    Accepted Submission(s): 343Problem Description Function Fx,yF_{x,y}sati

So Easy!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4213    Accepted Submission(s): 1369Problem Description　　A sequence Sn i

传送门 题目描述： Input共1行，4个整数数p, q, r, n中间用空格分隔(1 <= p, q, r, n<=1000000000)。Output对于每一个数据，在一行中输出答案。Input示例2 2 1 1Output示例3解题思路：令 f(n)=∑ni=0ai∗bn−if(n)=\sum_{i=0}^na_i*b_{n-i}，将其展开有： f(n)=a0∗bn+a1∗bn−1+..

传送门Bad WiringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 925    Accepted Submission(s): 301Problem Description The ninja Ryu has infiltrated

传送门 给出三个N*N的矩阵A, B, C，问A * B是否等于C？ Input 第1行，1个数N。(0 <= N <= 500) 第2 - N + 1行：每行N个数，对应矩阵A的元素。（0 <= M[i] <= 16) 第N + 2 - 2N + 1行：每行N个数，对应矩阵B的元素。（0 <= M[i] <= 16) 第2N + 2 - 3N + 1行：每行N个数，对应矩阵C的元素。

传送门 嘟嘟最近发现了一个数列，将其命名为嘟嘟数列，其中第 n 项的值 dudu ( n ) = a0a_0 × b0b_0 + a1a_1 × b1b_1 + … + an−1a_{n-1} × bn−1b_{n-1} .已知 a0a_0 和 b0b_0 ，aia_i = ai−1a_{i-1} × AX + AY ， bib_i = bi−

传送门题目描述：众所周知，有一个神秘的组织——战忽局，在暗中保护着我们。在局中任职的官员都有着极强的忽悠技巧，不只能用预言，还能用往事忽悠人。如今某外星间谍已经获得了战忽局曾经参与的n次事件的资料，局座发现了这件事，于是决定再次用忽悠来保证战忽局的安全。局座将发表m次演讲，每一天他都会从n事件中等概率地挑选一件混淆众人，由于局座每天很忙，不能把之前将的事件都记录下来，因此他可能会重复选择某一件事。现

传送门 Recursive sequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 98    Accepted Submission(s): 46Problem DescriptionFarmer John likes to pl

传送门Training little catsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 13373Accepted: 3298DescriptionFacer’s pet cat just gave birth to a brood of little cats. Having considered the health of

传送门SETITime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 1882Accepted: 1165DescriptionFor some years, quite a lot of work has been put into listening to electromagnetic radio signals received fr

传送门时间限制:10000ms 单点时限:1000ms 内存限制:256MB描述在图像处理的技术中，经常会用到算子与图像进行卷积运算，从而达到平滑图像或是查找边界的效果。假设原图为 H×WH × W 的矩阵 AA，算子矩阵为 D×DD × D 的矩阵 OpOp ，则处理后的矩阵 BB 大小为 (H−D+1)×(W−D+1)(H-D+1) × (W-D+1)。其中：B[i][j]=∑(A[i−1+

传送门Consider recurrent functions of the following form: f(n) = a1f(n − 1) + a2f(n − 2) + a3f(n − 3) + … + adf(n − d), for n > d, where a1, a2, … , ad are arbitrary constants. A famous example is the

传送门Cracking’ RSA Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Submit Statistic Next Problem Problem Description The following problem is somehow related to the f

点击此处即可传送hdu 1250Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(

点击此处即可传送hdu 1021Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44439 Accepted Submission(s): 21214Problem DescriptionThere

点击此处即可传送hdu 1568 **Fibonacci**Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeSt

点击此处即可传送到hdu 3117 **Fibonacci Numbers**Problem DescriptionThe Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, e

今天下午刚起来眼睛就比较涨，，而且还有点恶心，唉，结果一直不在状态，而且这个题太坑了。。。。 点击此处即可传送 Hit 2255Maybe ACMers of HIT are always fond of fibonacci numbers, because it is so beautiful. Don't you think so? At the same time, fishcanfly a

点击打开链接Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 19189 Accepted: 8099DescriptionGiven a n × n matrix A and a positive

构造矩阵 + 矩阵的快速幂 + 基础数论

高斯消元 + 构造矩阵

高斯消元

传送门Widget FactoryTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 5663Accepted: 1961DescriptionThe widget factory produces several different kinds of widgets. Each widget is carefully built by

传送门 Boring GameTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 827    Accepted Submission(s): 80Problem Description Zero likes to play a boring

传送门The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Every handle can be in one of two

传送门The Water BowlsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5946Accepted: 2346DescriptionThe cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-

传送门 Description There’s an N X M board which filled with black and white chesses. In each move, the player can flip one of these N X M chesses, meanwhile some chesses

传送门问 (1+2√)n(1+\sqrt 2) ^n 能否分解成 m−−√+(√m−1)\sqrt m +\sqrt(m-1)的形式 如果可以 输出 m MOD (109+7)m\ MOD\ (10^9+7) 否则 输出 nonoInput一行，一个数 nn。 （n<=1018）（n<=10^{18}）Output一行，如果不存在 mm 输出 nono，否则输出 m MOD 109+7 m\ M