Hidden Message

比赛主页
我的提交

时间限制：C/C++ 2秒，其他语言4秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

John was reading the local newspaper, and noticed that the phrase “chime a cork teen” could be
split into three sub-phrases “eat”, “more”, and “chicken”. Note that the three sub-phrases
combined contain exactly the same letters as the original phrase and the letters in each sub-phrase
appear in the same order as they appear in the original phrase. Note also that the number of
occurrences of each letter in the three sub-phrases combined is the same as that of the original
phrase.
John began to theorize that the newspapers were sending him messages, but you decide to show
him that a message like that was not abnormal. You want to determine the number of ways a

phrase can be broken down into three words that John finds.

Given three sub-phrases and the original phrase, determine the number of ways the sub-phrases
can be formed from the original phrase. The number of ways can be quite large, so determine the
number modulo 1,000,000,007.

输入描述:

The input consists of four lines. Each of the first three input lines contains 1-100 lowercase letters,
representing a sub-phrase. The fourth input line contains 3-300 lowercase letters, representing the
original phrase. Note that the sum of the lengths of the three sub-phrases is equal to the length of
the original phrase.

输出描述:

Print a single integer representing the number of ways to partition the original phrase into three
groups where each group is one of the three sub-phrases. Print the count modulo 1,000,000,007.

示例1

输入

复制

eat
more
chicken
chimeacorkteen

输出

复制

示例2

输入

复制

the
great
depression
depressigortheneat

输出

复制

示例3

输入

复制

a
a
a
aaa

输出

复制

#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
ll mod=1000000007;
ll dp[200][200][200];
const int maxn=100010;
int main(){char a[110];char b[110];char c[110];char d[500];int la,lb,lc,ld;cin>>a+1>>b+1>>c+1>>d+1;la=strlen(a+1);lb=strlen(b+1);lc=strlen(c+1);ld=strlen(d+1);dp[0][0][0]=1;for(int i=1;i<=ld;i++){for(int j=0;j<=la;j++){for(int k=0;k<=lb;k++){for(int l=0;l<=lc;l++){if(j+k+l!=i) continue;if(d[i] == a[j] && j - 1 >= 0) dp[j][k][l] += dp[j-1][k][l] % mod;if(d[i] == b[k]&& k - 1 >= 0) dp[j][k][l] += dp[j][k-1][l] % mod;if(d[i] == c[l]&& l - 1 >= 0) dp[j][k][l] += dp[j][k][l-1] % mod;}}}}cout<<dp[la][lb][lc]%mod;
}

Hidden Message相关推荐

URAL 题目1297. Palindrome（后缀数组+RMQ求最长回文子串）
1297. Palindrome Time limit: 1.0 second Memory limit: 64 MB The "U.S. Robots" HQ has just ...
CPU8085 8086名字的由来
为什么CPU叫8085呢? 8085这个名字的由来还是很有逻辑的:The naming of microprocessor indicates historical facts blended wit ...
重力传感器测重力代码_“重力瀑布”如何帮助您教授孩子的密码学基础知识...
重力传感器测重力代码 by Kamil Tustanowski 通过卡米尔·图斯坦诺夫斯基 "重力瀑布"如何帮助您教授孩子的密码学基础知识 (How "Gravity ...
URAL1297 Palindrome【manacher算法】
1297. Palindrome Time limit: 1.0 second Memory limit: 64 MB The "U.S. Robots" HQ has just ...
2021-06-14 Socketio学习使用搭建一个聊天室
Socketio搭建一个聊天室前言本次实验所用编程语言为HTML以及javascript和JQurey语言和Socketio框架,所用编辑文本工具为VS code. 注意事项 (1)前端编程注意H ...
浙江大学计算机学院金小刚,金小刚（浙江大学CADCG国家重点实验室教授）_百度百科...
Bo Wang,Quan Chen,Min Zhou,Zhiqiang Zhang,Xiaogang Jin,Kun Gai,"Progressive Feature Polishing N ...
CAPICAPICOM的一些知识
CAPI&CAPICOM的一些知识 2007-06-09 22:09 1 引言 CryptoAPI(一个应用程序编程接口)目的就是提供开发者在Windows 下使用PKI 的 ...
CAPICAPICOM的一些知识[转]
1 引言 CryptoAPI(一个应用程序编程接口)目的就是提供开发者在Windows 下使用PKI 的编程接口.CryptoAPI 提供了很多函数,包括编码.解码.加密.解密.哈希 ...
用 websocket、JQuery开发仿微信聊天
1项目展示登陆界面不同的端口登陆属于不同的用户登陆两个端口号后的界面 2项目基本配置 2.1参考文档 socket.io 先引入 socket.io插件 npm install --sav ...

Hidden Message

题目描述

输入描述:

输出描述:

输入

输出

输入

输出

输入

输出

Hidden Message相关推荐

最新文章

热门文章