cf-379D-New Year Letter

枚举s1,s2字串的纯AC的个数。

然后加上s1-s2,s2-s1,s1-s1,s2-s2中产生的AC的个数。

注意：数的范围

#include <stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<math.h>
#include<stack>
#define LL __int64
#define maxn 20000
using namespace std;
LL num[55][7];//1,2,12,21,11,22
int wei[55];
int shou[55];
int k,s,n,m;
int t1,t2,t3;
void init()
{int i,j;memset(num,0,sizeof(num));num[1][1]=1;num[2][2]=1;wei[1]=shou[1]=1;wei[2]=shou[2]=2;for(i=3;i<=50;i++){for(j=1;j<=6;j++)num[i][j]=num[i-2][j]+num[i-1][j];if(wei[i-2]==1){if(shou[i-1]==1)num[i][5]++;else num[i][3]++;}else{if(shou[i-1]==1)num[i][4]++;else num[i][6]++;}wei[i]=wei[i-1];shou[i]=shou[i-2];}
}
int dos(int need,int xx,int yy)
{/// cout<<need<<endl;int i,j;int a[4]={1,1,2,0};int b[4]={1,1,0,2};int a1,a2;int b1,b2;a1=a2=b1=b2=0;for(i=0;i<(1<<4);i++){int x,y;x=xx;y=yy;a1=a2=b1=b2=0;int leaps=1;int nn;nn=0;for(j=0;j<4;j++){if(i&(1<<j)){if(j==0)a2=b1=1;if(j==1)a1=b2=1;if(j==2)a1=a2=1;if(j==3)b1=b2=1;}}if(a1+a2>xx)continue;if(b1+b2>yy)continue;if(a2==1&&b1==1)nn+=num[k][3];if(a1==1&&b2==1)nn+=num[k][4];if(a2==1&&a1==1)nn+=num[k][5];if(b2==1&&b1==1)nn+=num[k][6];if(nn==need){t3=i;return 1;}}return 0;
}
void print()
{// cout<<t1<<" "<<t2<<" "<<t3<<endl;int i,j;char stra[501];char strb[501];for(i=0;i<201;i++)stra[i]=strb[i]='B';for(i=0;i<4;i++){if((1<<i)&t3){if(i==0)stra[n-1]='A',strb[0]='C';if(i==1)stra[0]='C',strb[m-1]='A';if(i==2)stra[0]='C',stra[n-1]='A';if(i==3)strb[0]='C',strb[m-1]='A';}}if(stra[0]=='B')i=0;else i=1;for(j=1;j<=t1;j++){stra[i]='A';stra[i+1]='C';i+=2;}if(strb[0]=='B')i=0;else i=1;for(j=1;j<=t2;j++){strb[i]='A';strb[i+1]='C';i+=2;}for(i=0;i<n;i++)cout<<stra[i];cout<<endl;for(i=0;i<m;i++)cout<<strb[i];cout<<endl;
}
int main()
{int i,j;init();// for(i=1;i<=6;i++)cout<<num[i][6]<<endl;//cout<<num[48][2]<<endl;// cout<<num[48][3]<<endl;while(~scanf("%d%d%d%d",&k,&s,&n,&m)){int leap=0;for(i=0;i*2<=n;i++){for(j=0;j*2<=m;j++){t1=i;t2=j;t3=0;LL xx=num[k][1]*i;LL yy=num[k][2]*j;//cout<<xx<<" "<<yy<<endl;if(xx+yy>s){leap=0;break;}if(xx+yy==s){leap=1;break;}if(dos(s-xx-yy,n-i*2,m-j*2)){leap=1;break;}}if(leap==1)break;}if(leap==1)print();else cout<<"Happy new year!"<<endl;}return 0;
}

cf-379D-New Year Letter相关推荐

CF 379D: New Year Letter
题目链接: http://codeforces.com/contest/379/problem/D 题目大意: 给定一个长度为n的字符串s1和一个长度为m的字符串s2. 做k - 2次类似斐波那契的操 ...
CF 379D NewYearLetter [dp+暴力]
题意: 给出k,x,n,m 找出这样的字符串s1,s2,s1长为n,s2长为m 给出规则,sn=sn-1+sn-2 使得第Sk项出现x个"AC"子串我们很容易知道k次运算后有几个 ...
卧槽！这世上为什么要有乱码这个东西？？？
点击上方"五分钟学算法",选择"星标"公众号重磅干货,第一时间送达这世上为什么要有乱码这个东西... 先给大家出个思考题吧,一个汉字占多少字节?是不是网上搜 ...
CF - D. Letter Picking（博弈 + 区间dp）
https://codeforces.com/problemset/problem/1728/D 题意给定长度为 n 的字符串 S,n 为偶数.Alice 和 Bob 初始分别都有一个空串. 现在 ...
LeetCode 17. Letter Combinations of a Phone Number--笔试题--C++,Python解法
题目地址:Letter Combinations of a Phone Number - LeetCode Given a string containing digits from 2-9 incl ...
【CF 1188 A1，B，C】Add on a Tree // Count Pairs // Array Beauty
传送门这些天风也温柔,题也温柔开车啦! 文章目录 A1:Add on a Tree 题意翻译题解证明代码实现 B:Count Pairs 题意翻译题解代码实现 C:Array Beaut ...
[Swift]LeetCode17. 电话号码的字母组合 | Letter Combinations of a Phone Number
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
Leetcode 17 - Letter Combinations of a Phone Number
题目 https://leetcode.com/problems/letter-combinations-of-a-phone-number/ 题意已知在九宫格的输入法上,2对应的字符是a\b\c, ...
LeetCode Letter Combinations of a Phone Number
LeetCode解题之Letter Combinations of a Phone Number 原题手机按键上每一个数字都相应了多个字母,如2相应了"abc",现给出一个数字串 ...
Letter Combinations of a Phone Number
题目描述: Given a digit string, return all possible letter combinations that the number could represent. ...

cf-379D-New Year Letter

cf-379D-New Year Letter相关推荐

最新文章

热门文章