洛谷P1538迎春舞会之数字舞蹈

最新推荐文章于 2020-08-07 11:41:04 发布

原创最新推荐文章于 2020-08-07 11:41:04 发布 · 224 阅读

0 ·

CC 4.0 BY-SA版权

数据结构专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种使用C++编程语言实现的数字放大器，该程序能够根据输入的整数序列和指定的放大倍数，输出放大后的数字序列。通过详细的代码示例，展示了如何处理不同数字的显示特性，例如1、2、3等数字在放大后的特殊表现。

题目： https://www.luogu.org/problemnew/show/P1538

输出：

坑。。。。。。。。。

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	int k;
	char a[260];
	int b;
	cin>>k;
	cin>>a;
	b=strlen(a);
	for(int j=0;j<b;j++)
	{
		int p=a[j]-'0';
		switch(p)
		{
			case 1:
				{ 
				cout<<" ";
				  for(int i=0;i<k;i++)
				  cout<<" "; 
				 cout<<"  ";break;
			    } 
			case 2:
				 {
				 	cout<<" ";
				  for(int i=0;i<k;i++)
				    cout<<"-";
				    cout<<"  ";break;	
				 }
			case 3:
				{
				cout<<" ";	
				for(int i=0;i<k;i++)
				  cout<<"-";
				  cout<<"  ";break;	
				}	
			case 4:
				{
				cout<<" ";
				for(int i=0;i<k;i++)
				  cout<<" ";
				  cout<<"  ";break;
			    }
			case 5:
			case 6:
				{ 
				 cout<<" ";
			     for(int i=0;i<k;i++)
			       cout<<"-";
			       cout<<"  ";break;
			    } 
			case 7:
				{ 
				cout<<" ";
				for(int i=0;i<k;i++)
				   cout<<"-";
				   cout<<"  ";break;
				} 
			case 8:
			case 9:
			case 0:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					  cout<<"-";
					  cout<<"  ";break;
				}
				   
		}
		
	}
	cout<<endl;
	for(int m=0;m<k;m++)
	{
	for(int j=0;j<b;j++)
	{
		int p=a[j]-'0';
		
		switch(p)
		  {
			case 1:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					cout<<" ";
					 cout<<"| ";break;
				}
			case 2:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					  cout<<" ";
					  cout<<"| ";break;
			    }
			case 3:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					  cout<<" ";
					  cout<<"| ";break;
			    }
			case 7:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					  cout<<" ";
					  cout<<"| ";break;
			    }
			case 4:
			case 8:
			case 9:
			case 0:
				{
					cout<<"|";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"| ";break;
			    }
			case 5:
			case 6:
				{
					cout<<"|";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"  ";break;
				}
		  }
		 
	    }
	   cout<<endl;  
	}
	
	for(int j=0;j<b;j++)
	{
		int p=a[j]-'0';
		
		switch(p)
		{
			case 1:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					cout<<" ";
					cout<<"  ";break;
				}
			case 3:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<"-";
					 cout<<"  ";break;
				}
		
			case 7:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"  ";break;
				}
			case 2:
			case 4:
			case 5:
			case 6:
			case 8:
			case 9:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<"-";
					 cout<<"  ";break;
				}
			case 0:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"  ";
				}
		}
	}
	cout<<endl;
	for(int m=0;m<k;m++)
	{
	
	for(int j=0;j<b;j++)
	 {
		int p=a[j]-'0';
		
		switch(p)
		{
		   case 1:
		   {
		   	cout<<" ";
		   	for(int i=0;i<k;i++)
		   	cout<<" ";
		   	cout<<"| ";break;
			}
			case 2:
			{
			   cout<<"|";
			   for(int i=0;i<k;i++)
			    cout<<" ";
				cout<<"  ";break;	
		    }
		    case 3:
		    	{
		    		cout<<" ";
		    		for(int i=0;i<k;i++)
		    		 cout<<" ";
		    		 cout<<"| ";break;
				}
			case 4:
			case 5:
			case 9:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"| ";break;
				}
			case 6:
			case 8:
			case 0:
				{
					cout<<"|";
					for(int i=0;i<k;i++)
					cout<<" ";
					cout<<"| ";break;
				}
			case 7:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					 cout<<" ";
					 cout<<"| ";break; 
				}
		}
	 }
	 cout<<endl;
    }
	
	for(int j=0;j<b;j++)
	{
		int p=a[j]-'0';
		
		switch(p){
			case 1:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					cout<<" ";
					cout<<"  ";break;
				}
				
			case 2:
				 {
				 	cout<<" ";
				  for(int i=0;i<k;i++)
				    cout<<"-";
				    cout<<"  ";break;	
				 }
			case 3:
				{
					cout<<" ";
				for(int i=0;i<k;i++)
				  cout<<"-";
				  cout<<"  ";break;	
				}	
			case 4:
				{
				cout<<" ";
				for(int i=0;i<k;i++)
				  cout<<" ";
				  cout<<"  ";break;
			    }
			case 5:
			case 6:
				{ 
				 cout<<" ";
			     for(int i=0;i<k;i++)
			       cout<<"-";
			       cout<<"  ";break;
			    } 
			case 7:
				{ 
				cout<<" ";
				for(int i=0;i<k;i++)
				   cout<<" ";
				   cout<<"  ";break;
				} 
			case 8:
			case 9:
			case 0:
				{
					cout<<" ";
					for(int i=0;i<k;i++)
					  cout<<"-";
					  cout<<"  ";break;
				}
		}
	}
	return 0;
}