https://blog.youkuaiyun.com/RedPolyazh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/RedPolya/article/details/76249630https://blog.youkuaiyun.com/RedPolya/article/details/76249630RedPolyaFri, 28 Jul 2017 14:28:12 +0800=3F_{1,i} = F_{1,i-1} + 2F_{1,i-2} | i>=3 Fi,j=∑j+N−1k=jFi−1,kF_{i,j} = \sum_{k=j}^{j+N-1}F_{i-1,k} 给定N,M，求Fm,1F_{m,1}首先昨天先写了几个，发现Fi,j=Fi,j−1+2]]>https://blog.youkuaiyun.com/RedPolya/article/details/76228149https://blog.youkuaiyun.com/RedPolya/article/details/76228149RedPolyaFri, 28 Jul 2017 09:31:52 +0800https://blog.youkuaiyun.com/RedPolya/article/details/76147366https://blog.youkuaiyun.com/RedPolya/article/details/76147366RedPolyaWed, 26 Jul 2017 15:15:41 +0800https://blog.youkuaiyun.com/RedPolya/article/details/75156840https://blog.youkuaiyun.com/RedPolya/article/details/75156840RedPolyaSat, 15 Jul 2017 14:02:21 +0800 #define maxn 105 using namespace std; int a[maxn][maxn]; int main(){ cin.tie(0),cout.tie(0); int n,m; while(cin>>n>>m){]]>https://blog.youkuaiyun.com/RedPolya/article/details/73435473https://blog.youkuaiyun.com/RedPolya/article/details/73435473RedPolyaSun, 18 Jun 2017 17:36:38 +0800 #include #include using namespace std;bool check(int hour,int min){ int t1=hour/10; int t2=hour%10; int t3=min/10; int t4=min%10; if(t1]]>https://blog.youkuaiyun.com/RedPolya/article/details/73176553https://blog.youkuaiyun.com/RedPolya/article/details/73176553RedPolyaTue, 13 Jun 2017 14:10:46 +0800https://blog.youkuaiyun.com/RedPolya/article/details/71435905https://blog.youkuaiyun.com/RedPolya/article/details/71435905RedPolyaMon, 08 May 2017 21:23:11 +0800 #include #include #include using namespace std;bool v[2000]; int ts[2000];int main(){ int T,n,m,mins,secs,num; string st; c]]>https://blog.youkuaiyun.com/RedPolya/article/details/70767654https://blog.youkuaiyun.com/RedPolya/article/details/70767654RedPolyaTue, 25 Apr 2017 21:38:34 +0800https://blog.youkuaiyun.com/RedPolya/article/details/70626075https://blog.youkuaiyun.com/RedPolya/article/details/70626075RedPolyaMon, 24 Apr 2017 17:53:41 +0800https://blog.youkuaiyun.com/RedPolya/article/details/62442459https://blog.youkuaiyun.com/RedPolya/article/details/62442459RedPolyaThu, 16 Mar 2017 20:59:19 +0800 #include #include https://blog.youkuaiyun.com/RedPolya/article/details/58596338https://blog.youkuaiyun.com/RedPolya/article/details/58596338RedPolyaTue, 28 Feb 2017 14:45:16 +0800https://blog.youkuaiyun.com/RedPolya/article/details/58147802https://blog.youkuaiyun.com/RedPolya/article/details/58147802RedPolyaMon, 27 Feb 2017 17:31:17 +0800https://blog.youkuaiyun.com/RedPolya/article/details/58123313https://blog.youkuaiyun.com/RedPolya/article/details/58123313RedPolyaMon, 27 Feb 2017 15:56:00 +0800https://blog.youkuaiyun.com/RedPolya/article/details/56834306https://blog.youkuaiyun.com/RedPolya/article/details/56834306RedPolyaFri, 24 Feb 2017 10:38:34 +0800https://blog.youkuaiyun.com/RedPolya/article/details/53863764https://blog.youkuaiyun.com/RedPolya/article/details/53863764RedPolyaSat, 24 Dec 2016 23:17:11 +0800 #include #include using namespace std;int main(){ int T;char st[1111]; scanf("%d",&T); getchar(); while(T--){ gets(st);]]>https://blog.youkuaiyun.com/RedPolya/article/details/53649142https://blog.youkuaiyun.com/RedPolya/article/details/53649142RedPolyaWed, 14 Dec 2016 23:20:49 +0800 #include ]]>https://blog.youkuaiyun.com/RedPolya/article/details/53561765https://blog.youkuaiyun.com/RedPolya/article/details/53561765RedPolyaSat, 10 Dec 2016 22:30:02 +0800>T; while(T--){ s]]>https://blog.youkuaiyun.com/RedPolya/article/details/53511442https://blog.youkuaiyun.com/RedPolya/article/details/53511442RedPolyaWed, 07 Dec 2016 22:34:27 +0800 #include #include https://blog.youkuaiyun.com/RedPolya/article/details/53504547https://blog.youkuaiyun.com/RedPolya/article/details/53504547RedPolyaWed, 07 Dec 2016 13:34:15 +0800 #include const int d[]={6,8,4,2}; int main(){ int n; while(~scanf("%d",&n)){ if(n==0)pri]]>https://blog.youkuaiyun.com/RedPolya/article/details/53503372https://blog.youkuaiyun.com/RedPolya/article/details/53503372RedPolyaWed, 07 Dec 2016 11:23:02 +0800 #include #include #include using namespace std;const int MAXN=100001; bool prime[MA]]>