hdu 1708 Fibonacci String

最新推荐文章于 2019-06-04 19:31:12 发布
最新推荐文章于 2019-06-04 19:31:12 发布
阅读量240 收藏 1
点赞数
分类专栏： hdu 矩阵快速幂
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/mengzhongsharen/article/details/78069766
版权

题目链接：点这里。

Problem Description

After little Jim learned Fibonacci Number in the class , he was very interest in it.
Now he is thinking about a new thing -- Fibonacci String .

He defines : str[n] = str[n-1] + str[n-2] ( n > 1 )

He is so crazying that if someone gives him two strings str[0] and str[1], he will calculate the str[2],str[3],str[4] , str[5]....

For example :
If str[0] = "ab"; str[1] = "bc";
he will get the result , str[2]="abbc", str[3]="bcabbc" , str[4]="abbcbcabbc" …………;

As the string is too long ,Jim can't write down all the strings in paper. So he just want to know how many times each letter appears in Kth Fibonacci String . Can you help him ?

Input

The first line contains a integer N which indicates the number of test cases.
Then N cases follow.
In each case,there are two strings str[0], str[1] and a integer K (0 <= K < 50) which are separated by a blank.
The string in the input will only contains less than 30 low-case letters.

Output

For each case,you should count how many times each letter appears in the Kth Fibonacci String and print out them in the format "X:N".
If you still have some questions, look the sample output carefully.
Please output a blank line after each test case.

To make the problem easier, you can assume the result will in the range of int.

Sample Input

1
ab bc 3

Sample Output

a:1
b:3
c:2
d:0
e:0
f:0
g:0
h:0
i:0
j:0
k:0
l:0
m:0
n:0
o:0
p:0
q:0
r:0
s:0
t:0
u:0
v:0
w:0
x:0
y:0
z:0

【题意】

首先fib数列，我们都知道，是根据前两项的和得到第三项的。然后这里我们用一种更高级的操作，就是直接让字符串进行这个操作，显然会得到一个很长很长的字符串，现在不要你输出最后需要的字符串，而是让你输出最后字符串的各个字母的数量。

【分析】

看到fib，反手就是一个矩阵快速幂。果然是。其实初始的那个矩阵，也就是用来快速幂的矩阵有一点不好想。其实也不麻烦，稍微想想就知道了。

fib数列的矩阵快速幂的递推式是：

显然这里，我们借用这个思想，但是这里的fn是一个26个int的数组。于是我们就直接将快速幂的那个矩阵里面的1直接换成一个26*26的单位矩阵，0换成0矩阵不就行了？so easy！

【代码】

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<time.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<sstream>
using namespace std;
#define rep0(i,l,r) for(int i = (l);i < (r);i++)
#define rep1(i,l,r) for(int i = (l);i <= (r);i++)
#define rep_0(i,r,l) for(int i = (r);i > (l);i--)
#define rep_1(i,r,l) for(int i = (r);i >= (l);i--)
#define MS0(a) memset(a,0,sizeof(a))
#define MS_1(a) memset(a,-1,sizeof(a))
#define MSinf(a) memset(a,0x3f,sizeof(a))
#define MSfalse(a) memset(a,false,sizeof(a))
#define pin1(a) printf("%d",(a))
#define pin2(a,b) printf("%d %d",(a),(b))
#define pin3(a,b,c) printf("%d %d %d",(a),(b),(c))
#define pll1(a) printf("%lld",(a))
#define pll2(a,b) printf("%lld %lld",(a),(b))
#define pll3(a,b,c) printf("%lld %lld %lld",(a),(b),(c))
#define pdo1(a) printf("%f",(a))
#define pdo2(a,b) printf("%f %f",(a),(b))
#define pdo3(a,b,c) printf("%f %f %f",(a),(b),(c))
#define huiche puts("")
#define inf 0x3f3f3f3f
#define lson (ind<<1),l,mid
#define rson ((ind<<1)|1),mid+1,r
#define uint unsigned int
typedef pair<int,int> PII;
#define A first
#define B second
#define pb push_back
#define mp make_pair
#define ll long long
#define eps 1e-8
inline void read1(int &num) {
    char in;
    bool IsN=false;
    in=getchar();
    while(in!='-'&&(in<'0'||in>'9')) in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else num=in-'0';
    while(in=getchar(),in>='0'&&in<='9') {
        num*=10,num+=in-'0';
    }
    if(IsN) num=-num;
}
inline void read2(int &a,int &b) {
    read1(a);
    read1(b);
}
inline void read3(int &a,int &b,int &c) {
    read1(a);
    read1(b);
    read1(c);
}
inline void read1(ll &num) {
    char in;
    bool IsN=false;
    in=getchar();
    while(in!='-'&&(in<'0'||in>'9')) in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else num=in-'0';
    while(in=getchar(),in>='0'&&in<='9') {
        num*=10,num+=in-'0';
    }
    if(IsN) num=-num;
}
inline void read2(ll &a,ll &b) {
    read1(a);
    read1(b);
}
inline void read3(ll &a,ll &b,ll &c) {
    read1(a);
    read1(b);
    read1(c);
}
inline void read1(double &num) {
    char in;
    double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else if(in=='.') {
        IsD=true;
        num=0;
    } else num=in-'0';
    if(!IsD) {
        while(in=getchar(),in>='0'&&in<='9') {
            num*=10;
            num+=in-'0';
        }
    }
    if(in!='.') {
        if(IsN) num=-num;
        return ;
    } else {
        while(in=getchar(),in>='0'&&in<='9') {
            num+=Dec*(in-'0');
            Dec*=0.1;
        }
    }
    if(IsN) num=-num;
}
inline void read2(double &a,double &b) {
    read1(a);
    read1(b);
}
inline void read3(double &a,double &b,double &c) {
    read1(a);
    read1(b);
    read1(c);
}
///----------------------------------------------------------------------------------------------------------
struct juzhen
{
    int m[52][52];
};
juzhen mul(juzhen a,juzhen b)
{
    juzhen c;
    MS0(c.m);
    rep0(i,0,52)
    rep0(j,0,52)
    rep0(k,0,52)
    c.m[i][k]+=a.m[i][j]*b.m[j][k];
    return c;
}
juzhen quick(juzhen a,int b)
{
    juzhen c;
    MS0(c.m);
    rep0(i,0,52) c.m[i][i]=1ll;
    while(b)
    {
        if(b&1)
        {
            c = mul(c,a);
        }
        a = mul(a,a);
        b>>=1;
    }
    return c;
}
int T;
char nouse[35];
int  str1[30];
int  str2[30];
int main() {
//    freopen("in.txt","r",stdin);
    while(scanf("%d",&T)!=EOF) {
        while(T--)
        {
            MS0(str1);
            MS0(str2);
            scanf("%s",nouse);
            int len = strlen(nouse);
            rep0(i,0,len) str1[nouse[i]-'a']++;
            scanf("%s",nouse);
            len = strlen(nouse);
            rep0(i,0,len) str2[nouse[i]-'a']++;
            int x;
            read1(x);
            if(x==0) rep0(i,0,26) printf("%c:%d\n",i+'a',str1[i]);
            else if(x==1) rep0(i,0,26) printf("%c:%d\n",i+'a',str2[i]);
            else
            {
                juzhen a;
                MS0(a.m);
                rep0(i,0,26) a.m[i][i]=a.m[i][i+26]=a.m[i+26][i]=1ll;
                a = quick(a,x-1);
                rep0(i,0,26)
                {
                    printf("%c:%d\n",i+'a',(a.m[i][i]*str2[i]+a.m[i][i+26]*str1[i]));
                }
            }
            puts("");
        }
    }
    return 0;
}

【分析2】

其实这个题呢，也没有这么麻烦，有一个很水很水的做法，因为里面的k是小于50的，所以就可以直接暴力出来，显然可以过，（心疼我写了半天的矩阵快速幂）。

【代码2】

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<time.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<sstream>
using namespace std;
#define rep0(i,l,r) for(int i = (l);i < (r);i++)
#define rep1(i,l,r) for(int i = (l);i <= (r);i++)
#define rep_0(i,r,l) for(int i = (r);i > (l);i--)
#define rep_1(i,r,l) for(int i = (r);i >= (l);i--)
#define MS0(a) memset(a,0,sizeof(a))
#define MS_1(a) memset(a,-1,sizeof(a))
#define MSinf(a) memset(a,0x3f,sizeof(a))
#define MSfalse(a) memset(a,false,sizeof(a))
#define pin1(a) printf("%d",(a))
#define pin2(a,b) printf("%d %d",(a),(b))
#define pin3(a,b,c) printf("%d %d %d",(a),(b),(c))
#define pll1(a) printf("%lld",(a))
#define pll2(a,b) printf("%lld %lld",(a),(b))
#define pll3(a,b,c) printf("%lld %lld %lld",(a),(b),(c))
#define pdo1(a) printf("%f",(a))
#define pdo2(a,b) printf("%f %f",(a),(b))
#define pdo3(a,b,c) printf("%f %f %f",(a),(b),(c))
#define huiche puts("")
#define inf 0x3f3f3f3f
#define lson (ind<<1),l,mid
#define rson ((ind<<1)|1),mid+1,r
#define uint unsigned int
typedef pair<int,int> PII;
#define A first
#define B second
#define pb push_back
#define mp make_pair
#define ll long long
#define eps 1e-8
inline void read1(int &num) {
    char in;
    bool IsN=false;
    in=getchar();
    while(in!='-'&&(in<'0'||in>'9')) in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else num=in-'0';
    while(in=getchar(),in>='0'&&in<='9') {
        num*=10,num+=in-'0';
    }
    if(IsN) num=-num;
}
inline void read2(int &a,int &b) {
    read1(a);
    read1(b);
}
inline void read3(int &a,int &b,int &c) {
    read1(a);
    read1(b);
    read1(c);
}
inline void read1(ll &num) {
    char in;
    bool IsN=false;
    in=getchar();
    while(in!='-'&&(in<'0'||in>'9')) in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else num=in-'0';
    while(in=getchar(),in>='0'&&in<='9') {
        num*=10,num+=in-'0';
    }
    if(IsN) num=-num;
}
inline void read2(ll &a,ll &b) {
    read1(a);
    read1(b);
}
inline void read3(ll &a,ll &b,ll &c) {
    read1(a);
    read1(b);
    read1(c);
}
inline void read1(double &num) {
    char in;
    double Dec=0.1;
    bool IsN=false,IsD=false;
    in=getchar();
    while(in!='-'&&in!='.'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-') {
        IsN=true;
        num=0;
    } else if(in=='.') {
        IsD=true;
        num=0;
    } else num=in-'0';
    if(!IsD) {
        while(in=getchar(),in>='0'&&in<='9') {
            num*=10;
            num+=in-'0';
        }
    }
    if(in!='.') {
        if(IsN) num=-num;
        return ;
    } else {
        while(in=getchar(),in>='0'&&in<='9') {
            num+=Dec*(in-'0');
            Dec*=0.1;
        }
    }
    if(IsN) num=-num;
}
inline void read2(double &a,double &b) {
    read1(a);
    read1(b);
}
inline void read3(double &a,double &b,double &c) {
    read1(a);
    read1(b);
    read1(c);
}
///------------------------------------------------------------------------------------------------------------
int T;
char nouse[35];
int  str[50][30];
int main() {
//    freopen("in.txt","r",stdin);
    while(scanf("%d",&T)!=EOF) {
        while(T--)
        {
            MS0(str);
            scanf("%s",nouse);
            int len = strlen(nouse);
            rep0(i,0,len) str[0][nouse[i]-'a']++;
            scanf("%s",nouse);
            len = strlen(nouse);
            rep0(i,0,len) str[1][nouse[i]-'a']++;
            int x;
            read1(x);
            rep1(i,2,x)
            {
                rep0(j,0,26)
                {
                    str[i][j] = str[i-1][j]+str[i-2][j];
                }
            }
            rep0(i,0,26) printf("%c:%d\n",i+'a',str[x][i]);
            puts("");
        }
    }
    return 0;
}
zuhiul
关注
  • 0
    点赞
  • 踩
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
专栏目录
『杭电1708』Fibonacci String
漠宸离若的博客
09-28 176
Problem Description After little Jim learned Fibonacci Number in the class , he was very interest in it. Now he is thinking about a new thing -- Fibonacci String . He defines : str[n] = str[n-1] + str[n-2] ( n > 1 ) He is so crazying that if someone g
hdu4786 Fibonacci Tree（最小生成树+最大生成树+01树+理解）
Iguodala的博客
11-13 1499
http://acm.hdu.edu.cn/showproblem.php?pid=4786 题意：有n个节点，给你一些白边和黑边，问能否用两色边构造出一棵生成树，且树中白色边的数量为一个Fibonacci数？ 思路：自己对生成树的理解不够，没能做出此题。打从一开始就没想到最小生成树到最大生成树权值和之间的权值都可以达到，感觉没道理啊，于是也就不会有判断斐波那契的思路了。 总体思
hdu 1708 Fibonacci String 斐波那契数列
冷月之殇
08-27 1217
#include #include #include #include #include using namespace std; char a[33],b[33]; int main() { int f[55],g[55],i,j,k,s[33],n,T; f[0]=1;f[1]=0; g[0]=0;g[1]=1; for(i=2;i<50;i++)
hdu_1708_Fibonacci String
Lyn12030706的专栏
12-29 657
原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=1708区别格式：1）There is a blank line between output blocks. 2）Please output a blank line after each test case.使用字符串模拟是不行的，要学会想别的方法解决、、、、#include using n
HDU - 1708 Fibonacci String
qwerty559的博客
06-04 160
After little Jim learned Fibonacci Number in the class , he was very interest in it. Now he is thinking about a new thing -- Fibonacci String . He defines : str[n] = str[n-1] + str[n-2] ( n > 1 )...
HDU1708 Fibonacci String【水题】
程序员充电站（itcharge）
12-22 802
Fibonacci String Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3652    Accepted Submission(s): 1259 Problem Description After
hdu 1021 Fibonacci Again(取余规律水题)
ZoneForZero
01-16 430
Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). Input Input consists of a sequence of lines, each containing an integer n....
HDU题目java实现
09-11
3. **字符串处理**：String类是Java中处理文本的重要工具，涉及字符串的连接、查找、替换、分割等方法。 4. **输入输出流**：如Scanner类用于从标准输入读取数据，FileReader/Writer用于文件操作，BufferedReader/...
ACM-SG函数之Fibonacci again and again——hdu1848
继续激情，继续奋斗。
05-03 4142
ACM SG函数 Fibonacci again and again hdu1848
HDU.1708Fibonacci String（贪心）
八百标兵奔北坡的博客
02-17 237
Fibonacci String Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7711 Accepted Submission(s): 2566 Problem Description After little Jim lear...
杭电 HDU ACM 1708 Fibonacci String
舒哥的blog
04-08 897
Fibonacci String Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4102    Accepted Submission(s): 1396 Problem Description After lit
hdu 1708
ysc504的专栏
12-07 696
Fibonacci String Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2079    Accepted Submission(s): 727 Problem Description After little J
HDU 1708 Fibonacci String（字符串模拟）
Java识堂，一个有干货的微信公众号
11-21 917
题目地址：点击打开链接 思路：任意一个字符串都是由最初的第零个和第一个构成的，只要记录含有的第零个和第一个字符串的个数即可 AC代码： #include #include #include #include #include #include #include #include #include #include #include typedef long long
HDU 1780 Fibonacci String
DT_Zhangshuo的博客
08-24 492
斐波那契，统计字母数。
HDOJ(HDU) 1708 Fibonacci String
weixin_34019929的博客
04-21 124
Problem Description After little Jim learned Fibonacci Number in the class , he was very interest in it. Now he is thinking about a new thing – Fibonacci String . He ...
【做题】CF177G2. Fibonacci Strings——思维+数列
weixin_30737363的博客
07-11 214
题意：定义斐波那契字符串为: $f_1 = $ "a" \(f_2 =\) "b" \(f_n = f_{n-1} + f_{n-2}, \, n > 2\) 例如，$f_3 = $ “ba”。 有\(m\)次询问，第\(i\)次给出一个字符串\(s_i\)，问\(s_i\)在\(f_n\)中的出现次数。 \(m \leq 10^4, \, n \leq 10^{18}, \, \su...
HDU 1708 Fibonacci String
a_ppler的专栏
08-16 391
After little Jim learned Fibonacci Number in the class , he was very interest in it. Now he is thinking about a new thing -- Fibonacci String . He defines : str[n] = str[n-1] + str[n-2] ( n > 1 )
HDU5509 : Pattern String
最新发布
05-25
这是一道字符串匹配的题目，可以使用 KMP 算法解决。 KMP 算法是一种字符串匹配算法，可以在 $O(n+m)$ 的时间内，判断一个长度为 $n$ 的文本串中是否包含一个长度为 $m$ 的模式串。 算法的核心在于计算模式串的 next 数组，next 数组用于在匹配失败时，快速跳过已经匹配成功的前缀部分。 具体实现可以参考以下代码：
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

zuhiul

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值