Contest3388 - 2024寒假集训-排位赛竞赛（二）（A-G,I,J,M)

wmrr

已于 2024-01-26 22:28:37 修改

阅读量1.9k

点赞数 52

文章标签： c++ 算法开发语言

于 2024-01-26 22:25:01 首次发布

本文链接：https://blog.csdn.net/2201_75715563/article/details/135874665

版权

问题 A: 三五倍数

题目描述

在小于 10 的自然数中，3 或 5 的倍数有 3、5、6 和 9，这些数之和是 23。

求小于 1000 的自然数中所有 3 或 5 的倍数之和。

思路分析

遍历，注意是小于1000，没有等于

AC代码

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n=1000;
	int su=0;
	for(int i=1;i<n;i++)
	{
		if(i%3==0||i%5==0)
		su+=i;
	}
	cout<<su<<endl;
 }

问题 B: 回文乘积

题目描述

回文数是指从前往后读和从后往前读都一样的数。由两个 2 位数相乘得到的回文数中，最大的是 9009=91×99。

求最大的由两个 3 位数相乘得到的回文数。

思路分析

双层遍历所有三位数，找到乘积为回文数的最大值。（注意：不要从999开始循环，找到第一个回文数就退出双层循环，如998*997>999*5,可退出单层循环）

AC代码

#include<iostream>
#include<algorithm>
using namespace std;
bool ishw(int n)
{
	int m=n,s=0;
	while(m)
	{
		s=s*10+m%10;
		m/=10;
	}
	if(s==n) return true;
	return false;
}
int main()
{
	int ma=0;
	for(int i=999;i>=100;i--)
	{
		for(int j=999;j>=100;j--)
		{
			if(ishw(i*j))
			{
				ma=max(ma,i*j);//注意不能找到就退出，999*1<998*997 
				break;
			}
		}
	}
	cout<<ma<<endl;
 }

问题 C: 整除正数

题目描述

2520 是最小的能够被 1 到 10 整除的正数。
最小的能够被 1 到 2023 整除的正数是多少？

由于答案很大，输出答案对 109+7 取模的结果

思路分析

所有数的最大公倍数=所有数的乘积/所有数的最大公因数，从i=2开始，对于所有大于i的数，如果能被i整除，就除i

注意，取余运算对除法不满足分配律，不能求出所有数的乘积mod（1e9+7）再除所有数的最大公因数mod（1e9+7）

AC代码

#include<iostream>
#include<algorithm>
#define int long long
const int N=1e9+7;
using namespace std;
signed main()
{
	int a[2030];
	for(int i=1;i<=2023;i++)
	a[i]=i;
	for(int i=2;i<2023;i++)
	{
		for(int j=i+1;j<=2023;j++)
		{
			if(a[j]%a[i]==0)
			a[j]/=a[i];
		}
	}
	int n=1;
	for(int i=1;i<=2023;i++)
	{
		n=n*a[i];
		n=n%N;
	}
	cout<<n<<endl;
}

问题 D: 斐波那契

题目描述

斐波那契数列是指这样的数列：数列的第一个和第二个数都为1，接下来每个数都等于前面两个数之和。
给出一个正整数k，要求斐波那契数列中第k个数是多少。

样例输入

样例输出

思路分析

注意 long long 即可

AC代码

#include<iostream>
#include<algorithm>
#define int long long
const int N=1e9+7;
using namespace std;
signed main()
{
	int a[2030]={0,1,1};
	int n;
	cin>>n;
	for(int i=3;i<=n;i++)
	a[i]=a[i-1]+a[i-2];
	cout<<a[n]<<endl;
}

问题 E: 字串加工

题目描述

小F拥有一个0-1字符串，这个字符串至少有一个0和一个1。
她想要把字符串分为连续的m段，每一段含有至少一个0和一个1，并且m越大越好。
给定字符串，你能算出m是多少吗？

样例输入

10101111000010101111010101

样例输出

思路分析

样例解释：分为9段：10 10 11110 0001 01 01 1110 10 101

从头开始，若1，0都出现一次时为一段，最后若有不符合一段的，归到上一段

AC代码

#include<iostream>
#include<algorithm>
#include<string.h>
#define int long long
const int N=1e9+7;
using namespace std;
signed main()
{
	string s;
	cin>>s;
	int n=s.size();
	int f1=0,f2=0;//f1=1,f2=1,分别表示出现了0和1 
	int su=0;
	for(int i=0;i<n;i++)
	{
		if(s[i]=='1')
		f1=1;
		else
		f2=1;
		if(f1&&f2)//满足一段，划分一次 
		{
			su++;
			f1=0;f2=0;//下一段初始条件 
		}
	}
	cout<<su<<endl;
}

问题 F: 有趣的制造

题目描述

今天的主题是制造。
小F需要制造一批灯牌，由于她的幸运数字是3和7，她希望灯牌上印的数字全部由3或7组成，例如，3377和37是小F想要的数，而137和38都不是。
然而，刁钻的老板定义了一种函数f(x)，表示大于等于x的第一个小F想要的数，例如f(36)=37。
老板给了小F一个区间[l,r]，让小F计算f(l)+f(l+1)+……f(r-1)+f(r)，如果小F算不出来，灯牌上印什么就由老板说了算，请你帮帮焦急的小F，她真的很喜欢灯牌。

样例输入

2 7

样例输出

思路分析

每两个满足条件的数之间的数的f均为更大的那个数，可以将[l,r]分为若干个区间，每个区间的f均为同一个值。我是先写了一个函数，求出1到1e9之间所有满足条件的数，防在一个数组里，然后求出l和r与数组的相对位置，划分区间，分别求每个区间的和，再加和

AC代码

/*求1-1e9满足条件的数的代码 
#include<iostream>
#include<algorithm>
#define int long long
const int N=1e9+7;
using namespace std;
bool f37(int n)
{
	while(n)
	{
		if(n%10!=3&&n%10!=7) return false;
		n=n/10;
	 } 
	 return true;
}
signed main()
{
	int su=0;
	for(int i=1;i<=1000000000;i++)
	{
		if(f37(i))
		{
			su++;
			cout<<i<<",";
		}
	}
	cout<<endl;
	cout<<su<<endl;
}*/
#include<iostream>
#include<algorithm>
#define int long long
const int N=1e9+7;
using namespace std;
int a[1050]={3,7,33,37,73,77,333,337,373,377,733,737,773,777,3333,3337,3373,3377,3733,3737,3773,3777,7333,7337,7373,7377,7733,7737,7773,7777,33333,33337,33373,33377,33733,33737,33773,33777,37333,37337,37373,37377,37733,37737,37773,37777,73333,73337,73373,73377,73733,73737,73773,73777,77333,77337,77373,77377,77733,77737,77773,77777,333333,333337,333373,333377,333733,333737,333773,333777,337333,337337,337373,337377,337733,337737,337773,337777,373333,373337,373373,373377,373733,373737,373773,373777,377333,377337,377373,377377,377733,377737,377773,377777,733333,733337,733373,733377,733733,733737,733773,733777,737333,737337,737373,737377,737733,737737,737773,737777,773333,773337,773373,773377,773733,773737,773773,773777,777333,777337,777373,777377,777733,777737,777773,777777,3333333,3333337,3333373,3333377,3333733,3333737,3333773,3333777,3337333,3337337,3337373,3337377,3337733,3337737,3337773,3337777,3373333,3373337,3373373,3373377,3373733,3373737,3373773,3373777,3377333,3377337,3377373,3377377,3377733,3377737,3377773,3377777,3733333,3733337,3733373,3733377,3733733,3733737,3733773,3733777,3737333,3737337,3737373,3737377,3737733,3737737,3737773,3737777,3773333,3773337,3773373,3773377,3773733,3773737,3773773,3773777,3777333,3777337,3777373,3777377,3777733,3777737,3777773,3777777,7333333,7333337,7333373,7333377,7333733,7333737,7333773,7333777,7337333,7337337,7337373,7337377,7337733,7337737,7337773,7337777,7373333,7373337,7373373,7373377,7373733,7373737,7373773,7373777,7377333,7377337,7377373,7377377,7377733,7377737,7377773,7377777,7733333,7733337,7733373,7733377,7733733,7733737,7733773,7733777,7737333,7737337,7737373,7737377,7737733,7737737,7737773,7737777,7773333,7773337,7773373,7773377,7773733,7773737,7773773,7773777,7777333,7777337,7777373,7777377,7777733,7777737,7777773,7777777,33333333,33333337,33333373,33333377,33333733,33333737,33333773,33333777,33337333,33337337,33337373,33337377,33337733,33337737,33337773,33337777,33373333,33373337,33373373,33373377,33373733,33373737,33373773,33373777,33377333,33377337,33377373,33377377,33377733,33377737,33377773,33377777,33733333,33733337,33733373,33733377,33733733,33733737,33733773,33733777,33737333,33737337,33737373,33737377,33737733,33737737,33737773,33737777,33773333,33773337,33773373,33773377,33773733,33773737,33773773,33773777,33777333,33777337,33777373,33777377,33777733,33777737,33777773,33777777,37333333,37333337,37333373,37333377,37333733,37333737,37333773,37333777,37337333,37337337,37337373,37337377,37337733,37337737,37337773,37337777,37373333,37373337,37373373,37373377,37373733,37373737,37373773,37373777,37377333,37377337,37377373,37377377,37377733,37377737,37377773,37377777,37733333,37733337,37733373,37733377,37733733,37733737,37733773,37733777,37737333,37737337,37737373,37737377,37737733,37737737,37737773,37737777,37773333,37773337,37773373,37773377,37773733,37773737,37773773,37773777,37777333,37777337,37777373,37777377,37777733,37777737,37777773,37777777,73333333,73333337,73333373,73333377,73333733,73333737,73333773,73333777,73337333,73337337,73337373,73337377,73337733,73337737,73337773,73337777,73373333,73373337,73373373,73373377,73373733,73373737,73373773,73373777,73377333,73377337,73377373,73377377,73377733,73377737,73377773,73377777,73733333,73733337,73733373,73733377,73733733,73733737,73733773,73733777,73737333,73737337,73737373,73737377,73737733,73737737,73737773,73737777,73773333,73773337,73773373,73773377,73773733,73773737,73773773,73773777,73777333,73777337,73777373,73777377,73777733,73777737,73777773,73777777,77333333,77333337,77333373,77333377,77333733,77333737,77333773,77333777,77337333,77337337,77337373,77337377,77337733,77337737,77337773,77337777,77373333,77373337,77373373,77373377,77373733,77373737,77373773,77373777,77377333,77377337,77377373,77377377,77377733,77377737,77377773,77377777,77733333,77733337,77733373,77733377,77733733,77733737,77733773,77733777,77737333,77737337,77737373,77737377,77737733,77737737,77737773,77737777,77773333,77773337,77773373,77773377,77773733,77773737,77773773,77773777,77777333,77777337,77777373,77777377,77777733,77777737,77777773,77777777,333333333,333333337,333333373,333333377,333333733,333333737,333333773,333333777,333337333,333337337,333337373,333337377,333337733,333337737,333337773,333337777,333373333,333373337,333373373,333373377,333373733,333373737,333373773,333373777,333377333,333377337,333377373,333377377,333377733,333377737,333377773,333377777,333733333,333733337,333733373,333733377,333733733,333733737,333733773,333733777,333737333,333737337,333737373,333737377,333737733,333737737,333737773,333737777,333773333,333773337,333773373,333773377,333773733,333773737,333773773,333773777,333777333,333777337,333777373,333777377,333777733,333777737,333777773,333777777,337333333,337333337,337333373,337333377,337333733,337333737,337333773,337333777,337337333,337337337,337337373,337337377,337337733,337337737,337337773,337337777,337373333,337373337,337373373,337373377,337373733,337373737,337373773,337373777,337377333,337377337,337377373,337377377,337377733,337377737,337377773,337377777,337733333,337733337,337733373,337733377,337733733,337733737,337733773,337733777,337737333,337737337,337737373,337737377,337737733,337737737,337737773,337737777,337773333,337773337,337773373,337773377,337773733,337773737,337773773,337773777,337777333,337777337,337777373,337777377,337777733,337777737,337777773,337777777,373333333,373333337,373333373,373333377,373333733,373333737,373333773,373333777,373337333,373337337,373337373,373337377,373337733,373337737,373337773,373337777,373373333,373373337,373373373,373373377,373373733,373373737,373373773,373373777,373377333,373377337,373377373,373377377,373377733,373377737,373377773,373377777,373733333,373733337,373733373,373733377,373733733,373733737,373733773,373733777,373737333,373737337,373737373,373737377,373737733,373737737,373737773,373737777,373773333,373773337,373773373,373773377,373773733,373773737,373773773,373773777,373777333,373777337,373777373,373777377,373777733,373777737,373777773,373777777,377333333,377333337,377333373,377333377,377333733,377333737,377333773,377333777,377337333,377337337,377337373,377337377,377337733,377337737,377337773,377337777,377373333,377373337,377373373,377373377,377373733,377373737,377373773,377373777,377377333,377377337,377377373,377377377,377377733,377377737,377377773,377377777,377733333,377733337,377733373,377733377,377733733,377733737,377733773,377733777,377737333,377737337,377737373,377737377,377737733,377737737,377737773,377737777,377773333,377773337,377773373,377773377,377773733,377773737,377773773,377773777,377777333,377777337,377777373,377777377,377777733,377777737,377777773,377777777,733333333,733333337,733333373,733333377,733333733,733333737,733333773,733333777,733337333,733337337,733337373,733337377,733337733,733337737,733337773,733337777,733373333,733373337,733373373,733373377,733373733,733373737,733373773,733373777,733377333,733377337,733377373,733377377,733377733,733377737,733377773,733377777,733733333,733733337,733733373,733733377,733733733,733733737,733733773,733733777,733737333,733737337,733737373,733737377,733737733,733737737,733737773,733737777,733773333,733773337,733773373,733773377,733773733,733773737,733773773,733773777,733777333,733777337,733777373,733777377,733777733,733777737,733777773,733777777,737333333,737333337,737333373,737333377,737333733,737333737,737333773,737333777,737337333,737337337,737337373,737337377,737337733,737337737,737337773,737337777,737373333,737373337,737373373,737373377,737373733,737373737,737373773,737373777,737377333,737377337,737377373,737377377,737377733,737377737,737377773,737377777,737733333,737733337,737733373,737733377,737733733,737733737,737733773,737733777,737737333,737737337,737737373,737737377,737737733,737737737,737737773,737737777,737773333,737773337,737773373,737773377,737773733,737773737,737773773,737773777,737777333,737777337,737777373,737777377,737777733,737777737,737777773,737777777,773333333,773333337,773333373,773333377,773333733,773333737,773333773,773333777,773337333,773337337,773337373,773337377,773337733,773337737,773337773,773337777,773373333,773373337,773373373,773373377,773373733,773373737,773373773,773373777,773377333,773377337,773377373,773377377,773377733,773377737,773377773,773377777,773733333,773733337,773733373,773733377,773733733,773733737,773733773,773733777,773737333,773737337,773737373,773737377,773737733,773737737,773737773,773737777,773773333,773773337,773773373,773773377,773773733,773773737,773773773,773773777,773777333,773777337,773777373,773777377,773777733,773777737,773777773,773777777,777333333,777333337,777333373,777333377,777333733,777333737,777333773,777333777,777337333,777337337,777337373,777337377,777337733,777337737,777337773,777337777,777373333,777373337,777373373,777373377,777373733,777373737,777373773,777373777,777377333,777377337,777377373,777377377,777377733,777377737,777377773,777377777,777733333,777733337,777733373,777733377,777733733,777733737,777733773,777733777,777737333,777737337,777737373,777737377,777737733,777737737,777737773,777737777,777773333,777773337,777773373,777773377,777773733,777773737,777773773,777773777,777777333,777777337,777777373,777777377,777777733,777777737,777777773,777777777,3333333333};
signed main()
{
	int l,r;
	cin>>l>>r;
	int su=0;
	int p,q;
	for(int i=0;i<=1022;i++)
	if(a[i]>=l) 
	{
		p=i;break;
	}
	for(int i=0;i<=1022;i++)
	if(a[i]>=r)
	{
		q=i;
		break;
	} 
	if(p==q)//注意相等的时候单独分析 
	{
		cout<<a[p]*(r-l+1)<<endl;
		return 0;
	}
	su+=a[q]*(r-a[q-1]);//尾区间 
	su+=a[p]*(a[p]-l+1);//头区间 
	for(int i=p+1;i<q;i++)//中间区间 
	{
		su+=a[i]*(a[i]-a[i-1]);
	}
	cout<<su<<endl;
}

问题 G: 流吧！我的眼泪

题目描述

小F拥有n个杯子，杯子的容量是分别是a1,a2，……，an。
下雨了，小F将自己的空杯子一个接一个地放到走廊上接水，杯子中的水每秒增加容量v。
只有一个杯子满了以后，小F才会放下一个，时间需要向上取整。例如，容量为5的杯子，每秒增加2，3秒后才会装满，即3秒后才放下一个杯子。
由于小F性子急，她希望在m秒后所有杯子都装满。
已知n,m和ai，请问杯子中的水每秒最少要增加多少容量v？

样例输入

2 10
5 6

样例输出

思路分析

二分。从1到杯子最大容量找装满杯子所花时间小于等于m的最小的v

注意：流速v是从小到大，花费时间是从大到小（判断条件时错过……）

AC代码

#include<iostream>
#include<algorithm>
#include<string.h>
#define int long long
using namespace std;
int n,m,a[2000006];
int tt(int v)
{
	int s=0;
	for(int i=0;i<n;i++)
	s+=(a[i]+v-1)/v;//向上取整 
	return s;
}
signed main()
{
	cin>>n>>m;
	int r=0;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		r=max(r,a[i]);
	}
	int l=1;
	while(l<r)
	{
		int mid=(l+r)/2;
		if(tt(mid)<=m) r=mid;
		else l=mid+1;
	}
	printf("%lld\n",l);
}

问题 I: 木头加工

题目描述

百年以后，智能机器人在各个行业大显身手，小F的运输队里就有一个。

这天，她的任务是要把N根木头运回家，运前要切割。等智能机器人切完木材，小F一看结果，发现机器人切后的所有小段木材长度相同，而且机器人选择了切割次数最少的方案。
如果告诉你最开始那N根木材的长度，你能算出机器人切出的小段木头的长度吗？

样例输入

4
4 22 8 12

样例输出

思路分析

即求所有木头长度的最大公因数

AC代码

#include<iostream>
#include<algorithm>
#include<string.h>
#define int long long
using namespace std;
int a[200005];
int gcd(int x,int y)
{
	int t=x%y;
	if(t==0)
	return y;
	return gcd(y,t);
}
signed main()
{
	int n;
	cin>>n;
	int s;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	s=a[0];
	for(int i=1;i<n;i++)
	{
		s=gcd(s,a[i]);
	}
	cout<<s<<endl;
}

问题 J: 进阶斐波那契

题目描述

如你所知，斐波那契数列是这样一种数列：
1 1 2 3 5 8 13 ……
除了开头两个数是1，后面每个数都是前面两个数之和。
小F最近对斐波那契数列和平方很感兴趣，她想知道斐波那契前n项的平方和是多少，答案可能很大，你只需要输出mod 1e9+7的结果就行。

样例输入

样例输出

思路分析

斐波那契平方和的性质：f(1)^2+f(2)^2+……+f(n)^2=f(n)*f(n+1)，所以我们只需要求f(n)和f(n+1)即可，但是n干到了1e18，就要用矩阵的快速幂

$\begin{pmatrix} 1 & 1\\ 1 & 0\end{pmatrix}$ $\begin{pmatrix} F(n+1)&F(n) \\ F(n)& F(n-1) \end{pmatrix}=$ $\begin{pmatrix} F(n+2) &F(n+1) \\ F(n+1)& F(n) \end{pmatrix}$

$\begin{pmatrix} 1 &1 \\ 1 &0 \end{pmatrix}*\begin{pmatrix} 1 &1 \\ 1& 0 \end{pmatrix}=\begin{pmatrix} 1 &1 \\ 1& 0 \end{pmatrix}*\begin{pmatrix} F(2) &F(1) \\ F(1) & F(0) \end{pmatrix}=\begin{pmatrix} F(3) &F(2) \\ F(2) & F(1) \end{pmatrix}$

$\begin{pmatrix} 1 &1 \\ 1& 0 \end{pmatrix}$ 的n次方 $=\begin{pmatrix} F(n+1) &F(n) \\ F(n)& F(n-1) \end{pmatrix}$

AC代码

#include<iostream>
#include<algorithm>
#include<math.h>
#define int long long
const int N=1e9+7;
using namespace std;
struct popo
{
	int c[5][5];
};
//矩阵乘法 
popo jzc(popo x,popo y)
{
	popo res;
	res.c[0][0]=(x.c[0][0]*y.c[0][0]%N+x.c[0][1]*y.c[1][0]%N)%N;
	res.c[0][1]=(x.c[0][0]*y.c[0][1]%N+x.c[0][1]*y.c[1][1]%N)%N;
	res.c[1][0]=(x.c[1][0]*y.c[0][0]%N+x.c[1][1]*y.c[1][0]%N)%N;
	res.c[1][1]=(x.c[1][0]*y.c[0][1]%N+x.c[1][1]*y.c[1][1]%N)%N;
	return res;
}
//快速幂 
popo fb(popo x,int n)
{
	popo res;
	res.c[0][0]=res.c[1][1]=1;
	res.c[0][1]=res.c[1][0]=1;
	while(n)
	{
		if(n&1)
		{
			res=jzc(res,x);
		}
		x=jzc(x,x);
		n/=2;
	}
	return res;
}
signed main()
{
	int n;
	scanf("%lld",&n);
	popo s;
	s.c[1][1]=0;
	s.c[0][0]=s.c[0][1]=s.c[1][0]=1;
	popo la;
	la=fb(s,n-1);
	cout<<la.c[0][0]*la.c[0][1]%N<<endl;
}

问题 M: 数字显示屏仿真

题目描述

ACM 小组接受了计算机组成原理教研室的一项开发任务，要为计算机组成原理课程开发一款实验面板仿真系统，其中有一项数字显示屏的任务分配给了你。数字显示屏是由一组数字显示单元组成的，每个数字显示单元由七个液晶显示管组成，如下所示：

 -
| |
 -
| |
 -
你的任务是将输入数字用数字显示屏的样子仿真输出。

样例输入

1
123456789

样例输出

    -  -     -  -  -  -  - 
  |  |  || ||  |    || || |
    -  -  -  -  -     -  - 
  ||    |  |  || |  || |  |
    -  -     -  -     -  -

思路分析

将0-9的显示结果依次存储起来即可，需要注意输出的循环顺序为列-每个数-行

AC代码

#include<iostream>
#include<algorithm>
#include<string.h>
#define int long long
using namespace std;
const int N=1e9+7;
int n;
char c[10][10][10];
void popo(int i,char c0)
{
	if(c0=='0')
	{
		c[i][0][1]=c[i][4][1]='-';
		c[i][1][0]=c[i][1][2]=c[i][3][0]=c[i][3][2]='|';
	}
	else if(c0=='1')
	{
		c[i][1][2]=c[i][3][2]='|';
	}
	else if(c0=='2')
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][2]=c[i][3][0]='|';
	}
	else if(c0=='3')
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][2]=c[i][3][2]='|';
	}
	else if(c0=='4')
	{
		c[i][2][1]='-';
		c[i][1][0]=c[i][1][2]=c[i][3][2]='|';
	}
	else if(c0=='5')
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][0]=c[i][3][2]='|';
	}
	else if(c0=='6')
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][0]=c[i][3][0]=c[i][3][2]='|';
	}
	else if(c0=='7')
	{
		c[i][0][1]='-';
		c[i][1][2]=c[i][3][2]='|';
	}
	else if(c0=='8')
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][0]=c[i][1][2]=c[i][3][0]=c[i][3][2]='|';
	}
	else
	{
		c[i][0][1]=c[i][2][1]=c[i][4][1]='-';
		c[i][1][0]=c[i][1][2]=c[i][3][2]='|';
	}
	return ;
}
signed main()
{
	int t;
	cin>>t;
	while(t--)
	{
		string s;
		cin>>s;
		n=s.size();
		memset(c,' ',sizeof c);
		for(int i=0;i<n;i++)
		popo(i,s[i]);
		for(int j=0;j<5;j++)
		{
			for(int i=0;i<n;i++)
			{
				for(int k=0;k<3;k++)
				cout<<c[i][j][k];
			}
			cout<<endl;
		}
	}
}