hanyanwei123的博客

An ant’s story Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2168 Accepted Submission(s): 1072 Problem Description Long long ago, ther...

转：https://blog.youkuaiyun.com/menxiaoyuan/article/details/50451719 了解了如何去找循环节 What day is that day? 题解： Description It’s Saturday today, what day is i...

F[0] = 0,F[1] = 1; n =0,1; F[i] = F[i-1]+F[i-2] i>=2; 斐波那契数列的每个数都取模后会出现循环，循环节的大小由MOD决定； #include<iostream> #include<stdio.h> #include<string.h> using namespa...