H. Special Palindrome

time limit per test:1 second
memory limit per test:64 megabytes
input:standard input
output:standard output

A sequence of positive and non-zero integers called palindromic if it can be read the same forward and backward, for example:

15 2 6 4 6 2 15

20 3 1 1 3 20

We have a special kind of palindromic sequences, let's call it a special palindrome.

A palindromic sequence is a special palindrome if its values don't decrease up to the middle value, and of course they don't increase from the middle to the end.

The sequences above is NOT special, while the following sequences are:

1 2 3 3 7 8 7 3 3 2 1

2 10 2

1 4 13 13 4 1

Let's define the function F(N), which represents the number of special sequences that the sum of their values is N.

For example F(7) = 5 which are : (7), (1 5 1), (2 3 2), (1 1 3 1 1), (1 1 1 1 1 1 1)

Your job is to write a program that compute the Value F(N) for given N's.

Input

The Input consists of a sequence of lines, each line contains a positive none zero integer N less than or equal to 250. The last line contains 0 which indicates the end of the input.

Output

Print one line for each given number N, which it the value F(N).

Examples
Input
1
3
7
10
0
Output
1
2
5
17

题目链接：http://codeforces.com/gym/100952/problem/H

题意：一个从开始到中间是非递减的回文被称为特殊回文，例如1123211，定义F(N)为和为N的特殊回文的个数，如F(1)=1，即和为1的回文只有一个 就是 1，F(5)=7, (7), (1 5 1), (2 3 2), (1 1 3 1 1), (1 1 1 1 1 1 1)，求F(N),N小于等于250！

思路：当N为偶数时，分2种情况，第一种为回文的长度为奇数，那么，最中间的数 m 一定是2 4 6 8......两边的数的和为(N-m)>>1，对(N-i)>>1进行整数划分（m划分），第二种为回文长度为偶数，则回文两边的和为N>>1，对N>>1整数划分(N>>1划分)，当N为奇数的时候只有一种情况，就是回文长度为奇数，最中间的数m为1 3 5 7....划分和上面一样！

下面给出AC代码：

 #include <bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 inline ll read()

 {

     ll x=,f=;

     char ch=getchar();

     while(ch<''||ch>'')

     {

         if(ch=='-')

             f=-;

         ch=getchar();

     }

     while(ch>=''&&ch<='')

     {

         x=x*+ch-'';

         ch=getchar();

     }

     return x*f;

 }

 inline void write(ll x)

 {

     if(x<)

     {

         putchar('-');

         x=-x;

     }

     if(x>)

         write(x/);

     putchar(x%+'');

 }

 ll dp[][];

 inline void funday(ll n)

 {

     for(ll i=;i<=n;i++)

     {

         for(ll j=;j<=n;j++)

         {

             if(i==||j==)

                 dp[i][j]=;

             else if(i>j)

                 dp[i][j]=dp[i-j][j]+dp[i][j-];

             else if(i==j)

                 dp[i][j]=dp[i][i-]+;

             else dp[i][j]=dp[i][i];

         }

     }

 }

 ll n,m,ans;

 int main()

 {

     funday();

     while(n=read())

     {

         if(n==)

             return ;

         ans=;

         if(n&)

         {

             for(ll i=;i<=n;i+=)

                 ans+=dp[(n-i)/][i];

             ans++;

         }

         else

         {

             for(ll i=;i<=n;i+=)

                 ans+=dp[(n-i)/][i];

             ans+=dp[n/][n/];

             ans++;

         }

         write(ans);

         printf("\n");

     }

     return ;

 }

打表解法：

分奇偶用 dfs 搞出非递减的左半边串， 然后求出这个的和 ans[sum + i]++;

对于偶数个的直接dfs， 对于奇数的则枚举mid， 然后依次dfs

 void dfseven(int k, int sum)

 {

     if(*sum > ) return;

     //cout<<"here1"<<endl;

     for(int i = k; i <= ; i++){

         if(*(sum + i) <= ) {ans[*(sum + i)]++; dfseven(i, sum + i);}

         else return;

     }

 }

 void dfsodd(int mid, int k, int sum)

 {

     if(*sum + mid > ) return;

     //cout<<"here2"<<endl;

     for(int i = k; i <= ; i++){

         if(*(sum + i) + mid <=  && i <= mid) {ans[*(sum + i) + mid]++; dfsodd(mid, i, sum + i);}

         else return;

     }

 }

然后只打了前ans[50] 及以前的， 因为后面的比较大时间不够的， 所以打出前50的表然后到数列网站 OEIS 查了一下， 还真有，??

所以把那前250个ans贴到 txt里， 然后写一个中间程序 把这些数据 转换成 printf("ans[%d] = %d;", i, val);的样子打到另一个txt文件里， 然后复杂粘贴到上去， 整理下就好了

打表完整代码：

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 typedef long long LL;

 const int maxn =  + ;

 int ans[maxn];

 //偶数个的

 void dfseven(int k, int sum)

 {

     if(*sum > ) return;

     //cout<<"here1"<<endl;

     for(int i = k; i <= ; i++){

         if(*(sum + i) <= ) {ans[*(sum + i)]++; dfseven(i, sum + i);}

         else return;

     }

 }

 void dfsodd(int mid, int k, int sum)

 {

     if(*sum + mid > ) return;

     //cout<<"here2"<<endl;

     for(int i = k; i <= ; i++){

         if(*(sum + i) + mid <=  && i <= mid) {ans[*(sum + i) + mid]++; dfsodd(mid, i, sum + i);}

         else return;

     }

 }

 int main()

 {

     #ifdef LOCAL

     freopen("a.txt", "r", stdin);

     freopen("b.txt", "w", stdout);

     #endif // LOCAL

     memset(ans, , sizeof ans);

     //ans[2]++;

     dfseven(, );

     //ans[1]++;

     for(int i = ; i <= ; i++){

         dfsodd(i, , );

     }

     for(int i = ; i <= ; i++){

         printf("ans[%d] = %d;", i, ans[i] + );

     }

 /*

     int n;

     while(scanf("%d", &n)){

         printf("%d", ans[n]);

     }

     */

     return ;

 }

最终AC代码如下：

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 typedef long long LL;

 const int maxn =  + ;

 LL ans[maxn];

 int main()

 {

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

 ans[] = ;

     int n;

     while(scanf("%d", &n)){

         if(n == ) break;

         printf("%I64d\n", ans[n]);

     }

     return ;

 }

Gym 100952H&&2015 HIAST Collegiate Programming Contest H. Special Palindrome【dp预处理+矩阵快速幂/打表解法】的更多相关文章

  1. Gym 100952E&&2015 HIAST Collegiate Programming Contest E. Arrange Teams【DFS+剪枝】

    E. Arrange Teams time limit per test:2 seconds memory limit per test:64 megabytes input:standard inp ...

  2. Gym 100952F&&2015 HIAST Collegiate Programming Contest F. Contestants Ranking【BFS+STL乱搞(map+vector)+优先队列】

    F. Contestants Ranking time limit per test:1 second memory limit per test:24 megabytes input:standar ...

  3. 2015 HIAST Collegiate Programming Contest H

    A sequence of positive and non-zero integers called palindromic if it can be read the same forward a ...

  4. Gym 100952J&&2015 HIAST Collegiate Programming Contest J. Polygons Intersection【计算几何求解两个凸多边形的相交面积板子题】

    J. Polygons Intersection time limit per test:2 seconds memory limit per test:64 megabytes input:stan ...

  5. Gym 100952I&&2015 HIAST Collegiate Programming Contest I. Mancala【模拟】

    I. Mancala time limit per test:3 seconds memory limit per test:256 megabytes input:standard input ou ...

  6. Gym 100952G&&2015 HIAST Collegiate Programming Contest G. The jar of divisors【简单博弈】

    G. The jar of divisors time limit per test:2 seconds memory limit per test:64 megabytes input:standa ...

  7. Gym 100952D&&2015 HIAST Collegiate Programming Contest D. Time to go back【杨辉三角预处理，组合数，dp】

    D. Time to go back time limit per test:1 second memory limit per test:256 megabytes input:standard i ...

  8. Gym 100952C&&2015 HIAST Collegiate Programming Contest C. Palindrome Again !!【字符串，模拟】

    C. Palindrome Again !! time limit per test:1 second memory limit per test:64 megabytes input:standar ...

  9. Gym 100952B&&2015 HIAST Collegiate Programming Contest B. New Job【模拟】

    B. New Job time limit per test:1 second memory limit per test:64 megabytes input:standard input outp ...

随机推荐

  1. 507. Perfect Number

    We define the Perfect Number is a positive integer that is equal to the sum of all its positive divi ...

  2. 解决linux重启后无法开启nginx问题“var/run/nginx/nginx.pid" no such file or directory问题

    起因:每次重启虚拟机后,var/run/nginx/目录都会被删除,所以无法在这个目录创建nginx.pid文件, 可以自己创建var/run/nginx/目录,然后可以运行,但治标不治本,下次虚拟机 ...

  3. RedisPool操作Redis，工具类实例

    redis.properties 配置文件内容 redis.pool.maxActive=100redis.pool.maxIdle=20redis.pool.maxWait=3000redis.po ...

  4. java 多线程，T1 T2 T3 顺序执行

    一.程序设计 1.抽象公共类PublicThread,具有先前线程属性previousThread.父类为Thread 2.在PublicThread的run()方法中判断previousThread ...

  5. Golang 网络爬虫框架gocolly/colly 一

    Golang 网络爬虫框架gocolly/colly 一 gocolly是用go实现的网络爬虫框架,目前在github上具有3400+星,名列go版爬虫程序榜首.gocolly快速优雅,在单核上每秒可 ...

  6. Linux_服务器_07_ 将用户设置为管理员

    二.参考资料 1.CentOS普通用户获得管理员权限 2.linux下添加用户并赋予root权限

  7. 佛祖保佑永无bug的源代码

    ${AnsiColor.BRIGHT_YELLOW} ${AnsiColor.BRIGHT_RED}_ooOoo_${AnsiColor.BRIGHT_YELLOW} ${AnsiColor.BRIG ...

  8. 【http转https】其之二：申请Let's Encrypt颁发SSL证书

    文:铁乐猫 2017年1月12日 申请Let's Encrypt颁发SSL证书 由 ISRG(Internet Security Research Group,互联网安全研究小组)提供服务, ISRG ...

  9. 三十天学不会TCP,UDP/IP网络编程-TraceRoute的哲学

    新年快乐,继续来部分粘贴复制我的这一系列文章啦,如果对和程序员有关的计算机网络知识,和对计算机网络方面的编程有兴趣,欢迎去gitbook(https://www.gitbook.com/@rogerz ...

  10. 服务器 Python服务停服、起服脚本

    近日,在阿里云服务器上部署了一个Python,Web框架为Tornado,服务器为Ubuntu 16.04. 服务的启动也十分的简单: python services.py 我是利用Xshell工具连 ...