7-25 念数字，笨人笨方法，c语言

题目描述：
输入一个整数，输出每个数字对应的拼音。当整数为负数时，先输出fu字。十个数字对应的拼音如下：

0: ling
1: yi
2: er
3: san
4: si
5: wu
6: liu
7: qi
8: ba
9: jiu
输入格式：
输入在一行中给出一个整数，如：1234。

提示：整数包括负数、零和正数。

输出格式：
在一行中输出这个整数对应的拼音，每个数字的拼音之间用空格分开，行末没有最后的空格。如 yi er san si。

输入样例：
-600
输出样例：
fu liu ling ling

笨人笨方法…
几乎是三位数，四位数…一直到九位数这样下去的，代码看着很长但是打起来不难，思路有了全是复制粘贴，用时15分钟，代码量三百多行，真的都是两位数的想清楚了就一直复制粘贴下去，不花什么时间，反正也是应付应试考试嘛
唯一要注意的就是，最后一个数是没有空格的，所以要单独switch，每一个for都单独switch一遍，又加了七八十行代码…嗯，很好懂，很好写，很好想，但是不美观，不过做对题我已经满足了

#include<stdio.h>
int main()
{
	int n,i,a[10]={0};//一开始给个值，不然运行会出问题，并不影响之后a[i]有几个
	scanf("%d",&n);
	if(n<0)
	{
		printf("fu ");
		n=-n;
	}
	if(n<10)
	{
		switch(n)
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	if(n==10)
	{
		printf("yi ling");
	}
	if(n>10&&n<100)//两位数字
	{
		for(i=0;i<2;i++)//首先从个位开始算，个位十位
		{
			a[i]=n%10;//放进数组
			n=n/10;
		}
	for(i=1;i>0;i--)//逆序输出，i不能等于0，因为a[0]后面没有空格，a[0]要单独看
	{
		switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])//跳出for语句单独看a[0]，switch里面没有空格
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>100&&n<1000)
	{
		for(i=0;i<3;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=2;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>1000&&n<10000)
	{
		for(i=0;i<4;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=3;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>10000&&n<100000)
	{
		for(i=0;i<5;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=4;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>100000&&n<1000000)
	{
		for(i=0;i<6;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
		for(i=5;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>1000000&&n<10000000)
	{
		for(i=0;i<7;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=6;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	else if(n>10000000&&n<100000000)
	{
		for(i=0;i<8;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=7;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
		else if(n>100000000&&n<1000000000)
	{
		for(i=0;i<9;i++)
		{
			a[i]=n%10;
			n=n/10;
		}
	for(i=8;i>0;i--)
	{
				switch(a[i])
		{
			case 0:printf("ling ");break;
			case 1:printf("yi ");break;
			case 2:printf("er ");break;
			case 3:printf("san ");break;
			case 4:printf("si ");break;
			case 5:printf("wu ");break;
			case 6:printf("liu ");break;
			case 7:printf("qi ");break;
			case 8:printf("ba ");break;
			case 9:printf("jiu ");break;
		}
	}
			switch(a[0])
		{
			case 0:printf("ling");break;
			case 1:printf("yi");break;
			case 2:printf("er");break;
			case 3:printf("san");break;
			case 4:printf("si");break;
			case 5:printf("wu");break;
			case 6:printf("liu");break;
			case 7:printf("qi");break;
			case 8:printf("ba");break;
			case 9:printf("jiu");break;
		}
	}
	return 0;
}