马上就要毕业了,各种笔试面试应接不暇,刚刚又来一只:
将一个正整数表示为素数的乘积,输出在屏幕上要求是类似于计算器的输出,即每个数字占5*3。。。。。。貌似自己还没发过文章啥的,就在此献丑咯~~
直接上效果图
代码如下:
/****************************************************************
*输入一个正整数n(1<n<1000000),表示为素数的乘积,每个数字为3*5的块
*eg: 数字8为
* -
* | |
* -
* | |
* -
*
*****************************************************************/
#include<iostream>
#include<cmath>
using namespace std;
//得到1000000之内的素数,保存在A[]中,n为素数的个数
void getPrime(int A[],int& n){
n = 0;
for(int i=2;i<1000000;i++){
bool x = true;
for(int j=2;j<=sqrt(i);j++){
if(i%j==0){
x = false;
break;
}
}
if(x){
A[n++] = i;
}
}
}
//计算数字X的素数因子,按升序保存在Y[]中,n为因子个数
void getSolution(const int X,int Y[],int& n,const int prime[]){
int x = X;
n = 0;
int i = 0;
while(x!=1){
for(i=0;prime[i]<=x;i++){
if(x%prime[i]==0){
Y[n++] = prime[i];
x /= prime[i];
break;
}
}
}
}
//数字digit在第l行的对应位置应该显示的,digit为“-1”代表“*”
void print(int digit,int l){//digit -1:*
if(digit<-1||digit>9||l<1||l>5)return;
switch(digit){
case 0:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<" ";break;
case 3:cout<<" - ";break;
case 4:cout<<" ";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 1:switch(l){
case 1:cout<<" ";break;
case 2:cout<<" |";break;
case 3:cout<<" ";break;
case 4:cout<<" |";break;
case 5:cout<<" ";break;
default:break;
}break;
case 2:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<" |";break;
case 3:cout<<" - ";break;
case 4:cout<<"| ";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 3:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<" |";break;
case 3:cout<<" - ";break;
case 4:cout<<" |";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 4:switch(l){
case 1:cout<<" ";break;
case 2:cout<<"| |";break;
case 3:cout<<" - ";break;
case 4:cout<<" |";break;
case 5:cout<<" ";break;
default:break;
}break;
case 5:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<"| ";break;
case 3:cout<<" - ";break;
case 4:cout<<" |";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 6:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<"| ";break;
case 3:cout<<" - ";break;
case 4:cout<<"| |";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 7:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<" |";break;
case 3:cout<<" ";break;
case 4:cout<<" |";break;
case 5:cout<<" ";break;
default:break;
}break;
case 8:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<"| |";break;
case 3:cout<<" - ";break;
case 4:cout<<"| |";break;
case 5:cout<<" - ";break;
default:break;
}break;
case 9:switch(l){
case 1:cout<<" - ";break;
case 2:cout<<"| |";break;
case 3:cout<<" - ";break;
case 4:cout<<" |";break;
case 5:cout<<" - ";break;
default:break;
}break;
case -1:switch(l){
case 1:cout<<" ";break;
case 2:cout<<" ";break;
case 3:cout<<" * ";break;
case 4:cout<<" ";break;
case 5:cout<<" ";break;
default:break;
}
default:break;
}
}
//输出函数
void disp(const int Y[],const int n){
int C[20];//每个素数的位数
for(int i=0;i<n;i++){
int num = Y[i];
C[i] = 1;
while((num/10)!=0){
C[i]++;
num /= 10;
}
}
int printDigit[40];//应显示的数字 “*”为“-1”
int r = 0;
for(i=0;i<n;i++){
int num = Y[i];
for(int j=C[i]-1;j>=0;j--){
printDigit[r++] = num/pow(10,j);
num -= pow(10,j) * printDigit[r-1];
}
printDigit[r++] = -1;//*
}
r--;
//屏幕输出
for(int l=1;l<=5;l++){
for(i=0;i<r;i++)
print(printDigit[i],l);
cout<<endl;
}
}
int main(){
int prime[80000] = {0};
int countPrime;
getPrime(prime,countPrime);
// cout<<countPrime<<endl;
int X;
cin>>X;
if(X<2||X>1000000)exit(0);
int Y[20] = {0};
int n;
getSolution(X,Y,n,prime);
// cout<<"X="<<X<<" Answer:"<<endl;
// for(int i=0;i<n;i++)
// cout<<Y[i]<<" ";
// cout<<endl;
disp(Y,n);
return 0;
}
VC++6.0上写的,pow 函数不用确定参数类型,,,
感觉还凑合吧,不足之处,望大家指正