南阳198 数数

http://acm.nyist.net/JudgeOnline/problem.php?pid=198

 

 

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
	int t,i,len;
	char a[20];
	cin>>t;
	while(t--)
	{
		cin>>a;
		len=strlen(a);
		for(i=len-1;i>=0;--i)
		{
			if(a[i]=='0'||a[i]=='1')
			 printf("O");
			if(a[i]=='2'||a[i]=='3')
			 printf("T");
			if(a[i]=='4'||a[i]=='5')
			 printf("F");
			if(a[i]=='6'||a[i]=='7')
			 printf("S");
			if(a[i]=='8')
			 printf("E");
			if(a[i]=='9')
			 printf("N");
		}
		cout<<endl;
	}
	return 0;
}

 

#include<stdio.h>
int main( ){
	int test, number;
	char map[10] = {'O', 'O', 'T', 'T', 'F', 'F', 'S', 'S', 'E', 'N'};
	scanf("%d", &test);
	while(test--){
		scanf("%d", &number);
		
//		从后往前输出 
		while(number){
			printf("%c", map[number%10]);
			number /= 10;
		}
		printf("\n");
	}
	return 0;
}