魔法數(shù)字Magic Number C語(yǔ)言代碼

AE/pr調(diào)色插件Magic Bullet Looksv1.41 漢化版

• 類型：濾鏡插件大�。�54.0M語(yǔ)言：中文 評(píng)分：2.1
• 標(biāo)簽：

立即下載

題目描述：
如果一個(gè)數(shù)（可能包含前導(dǎo)0）乘以2，如142857*2=285714，
依然由原來(lái)的數(shù)字組成的話，這樣的數(shù)(142857)就叫Magic Number

輸入：
多組測(cè)試數(shù)據(jù)，每組一行，每行是一個(gè)不大于1e10000整數(shù)（可能有前導(dǎo)0），
遇到EOF標(biāo)志結(jié)束程序

輸出：
判斷這個(gè)數(shù)是不是Magic Number，是的話輸出“Magic Number”
否則輸出“Not Magic Number”

樣例輸入：
142857
0142857
857142
0588235294117647

樣例輸出：
Magic Number
Magic Number
Not Magic Number
Magic Number

難度：Very Easy

CODE:

#include <stdio.h>
#include <string.h>
#define MAX 10001
typedef struct {
int date[MAX];
int len;
}BigInt;
int magic(BigInt a,int m);
int main() {
char str[MAX];
BigInt a;
int i,len;
while ( scanf("%s",str) != EOF ) {
len = strlen(str);
for ( i = 0; i < len; i++ ) {
a.date[len-i-1] = str[i] - '0';
}
a.len = len;
if ( magic(a,2) ) {
printf("Magic Number\n");
} else {
printf("Not Magic Number\n");
}
}
return 0;
}
int magic(BigInt a,int m) {
int i,temp;
int carry = 0;
int s[10],e[10];
for( i = 0; i < 10; i++ ) {
s[i] = e[i] = 0;
}
for ( i = 0; i < a.len; i++ ) {
s[a.date[i]] ++;
}
for ( i = 0; i < a.len; i ++ ) {
temp = a.date[i] * m + carry;
e[temp%10] ++;
carry = temp / 10;
}
if ( carry ) {
e[carry] ++;
}
for ( i = 0; i < 10; i++ ) {
if ( s[i] != e[i] ) {
return 0;
}
}
return 1;
}

CODE1:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int a[10005],old[10],mulold[10];
memset(old,0,sizeof(old));
memset(mulold,0,sizeof(mulold));
char c;
int i=0,j,k,bit=0,number=0;
bool flag=true;
for (;scanf("%c",&c)!=EOF;i=0,bit=0,number=0,flag=true) {
//scanf("%c",&c);
while(c!='\n') {
/*if(i==0&&c=='0') {
while(c=='0')
scanf("%c",&c);
}
if(c=='\n')
break;*/
a[i]=c-'0';
old[c-'0']=1;
i++;
scanf("%c",&c);
}
//for(j=0;j<i;j++) printf("%d ",a[j]);
/*if(a[0]==0) {
printf("Magic Number \n");
flag=false;
}
else*/
for(j=0;j<i;j++) {
int tmp=a[i-1-j]*2+bit;
//printf("tmp:%d ",tmp);
if(j==i-1&&tmp>=10) {
if(old[tmp/10]==0)
{
printf("*Not Magic Number \n");
flag=false;
break;
}
mulold[tmp/10]=1;
}
if(old[tmp%10]==0)
{
printf("*Not Magic Number \n");
flag=false;
break;
}
mulold[tmp%10]=1;
bit=tmp/10;
}
//for(k=0;k<10;k++) {printf("%d ",old[k]);printf("%d\n",mulold[k]);}
if(flag) {
for(k=0;k<10;k++)
if(old[k]!=mulold[k]) {
printf("Not Magic Number \n");
break;
}
if(k==10)
printf("Magic Number \n");

}
memset(old,0,sizeof(old));
memset(mulold,0,sizeof(mulold));
}
return 0;
}

CODE2:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int a[10005],old[10],mulold[10];
memset(old,0,sizeof(old));
memset(mulold,0,sizeof(mulold));
char c;
int i=0,j,k,bit=0,number=0;
bool flag=true;
for (;scanf("%c",&c)!=EOF;i=0,bit=0,number=0,flag=true) {
//scanf("%c",&c);
while(c!='\n') {
/*if(i==0&&c=='0') {
while(c=='0')
scanf("%c",&c);
}
if(c=='\n')
break;*/
a[i]=c-'0';
old[c-'0']=1;
i++;
scanf("%c",&c);
}
//for(j=0;j<i;j++) printf("%d ",a[j]);
/*if(a[0]==0) {
printf("Magic Number \n");
flag=false;
}
else*/
for(j=0;j<i;j++) {
int tmp=a[i-1-j]*2+bit;
//printf("tmp:%d ",tmp);
if(j==i-1&&tmp>=10) {
if(old[tmp/10]==0)
{
printf("Not Magic Number \n");
flag=false;
break;
}
mulold[tmp/10]=1;
}
if(old[tmp%10]==0)
{
printf("*Not Magic Number \n");
flag=false;
break;
}
mulold[tmp%10]=1;
bit=tmp/10;
}
//for(k=0;k<10;k++) {printf("%d ",old[k]);printf("%d\n",mulold[k]);}
if(flag) {
for(k=0;k<10;k++)
if(old[k]!=mulold[k]) {
printf("Not Magic Number \n");
break;
}
if(k==10)
printf("Magic Number \n");

}
memset(old,0,sizeof(old));
memset(mulold,0,sizeof(mulold));
}
return 0;
}