wang_128的博客

233 Matrix                                                                           Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)                          

Fibonacci Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16092   Accepted: 11309 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn =

Training little cats Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 14605   Accepted: 3612 Description Facer's pet cat just gave birth to a brood of littl

A Boring Question                                                                       Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)                        

Blocks Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7054   Accepted: 3410 Description Panda has received an assignment of painting a line of blocks. Sin

#include #include #include #include #include using namespace std; struct Matrix { long long int v[41][41]; Matrix() { memset(v,0,sizeof v); } }m,p; Matrix sum(Matrix a,

Matrix Power Series Time Limit: 3000MS   Memory Limit: 131072K Total Submissions: 24205   Accepted: 10057 Description Given a n × n matrix A and a positive integer k,

cjj's string game                                                                     Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)                          

Array Challenge                                                                       Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 153428/153428 K (Java/Others)                        

number number number                                                                     Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)                        

Covering                                                                       Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Firepersons Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 1153   Accepted: 512 Description The Association for Courtly Manners, an international organiza

Quad Tiling Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4495   Accepted: 2050 Description Tired of the Tri Tiling game finally, Michael turns to a more

Funny Function                                                                  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

#include #include #include #include #include using namespace std; struct node { int m[3][3]; node() { memset(m,0,sizeof m); } }x,y,z,k; int mod; node mul(node p,node q)

题目分析：有种错误的方法是这样的：利用已知的两个方程联立，求解出a和b，进而求出答案。这种方法之所以错，是因为这种方法有局限性。联立之后会得到一个二元一次方程，只有当该方程有实数解确切的说是当某个数据满足该方程有实数解时，这种方法得到的结果才有可能正确。显然，题中数据不可能这么片面。正确的方法是这样的： 令a+b=A，ab=B，S(n)=an+bn。则S(n)=an+bn=(a+b)(an-

#include #include #include #include #include using namespace std; #define ll long long ll f[20],mod; struct Matrix { ll v[20][20]; Matrix() { memset(v,0,sizeof v); } }m

#include #include #include #include #include using namespace std; #define ll long long ll a[55]; struct Matrix { ll v[55][55]; Matrix() { memset(v,0,sizeof v); } }k,l;

#include #include #include #include #include using namespace std; #define ll long long ll mod; struct Matrix { ll v[550]; Matrix() { memset(v,0,sizeof v); } }p,l; Mat

Kiki & Little Kiki 2                                                                           Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

女神的正多面体 Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Submit Statistic Next Problem Problem Description       EOF女神灰常喜欢整齐的东西，例如多面体中最喜欢的就是正多面体。正多面体的定义为：

Just Pour the Water Time Limit: 2 Seconds      Memory Limit: 65536 KB Shirly is a very clever girl. Now she has two containers (A and B), each with some water. Every minute, she pours half of

解题思路：怎么都没想到题目描述里的233是有用的，可以发现a[1]=23+1+f[1]，a[2]=233+2+f[2]，a[3]=2333+3+f[3]，所以令： a[x]=g[x]+h[x]+f[x]那么： h[x]=h[x−1]+1，g[x]=g[x−1]*10+3 得到一系列递推式：f[x]=A*f[x-1]+B*f[x−2]，h[x]=h[x-1]+1，g[x]=g[x-1]*10+3,

Happy Necklace                                                                         Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)                          

 Jzzhu and Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu has invented a kind of sequences, they meet the following property:You ar...