UVa 10101 Bangla Numbers

想法：
　　透過遞迴求出答案。

	#include <cstdio>
	using namespace std;
	void bangla(long long int n)
	{
	if (n >= 10000000){
	bangla (n / 10000000);
	printf (" kuti");
	n %= 10000000;
	}
	if (n >= 100000){
	bangla (n / 100000);
	printf (" lakh");
	n %= 100000;
	}
	if (n >= 1000){
	bangla (n / 1000);
	printf (" hajar");
	n %= 1000;
	}
	if (n >= 100){
	bangla (n / 100);
	printf (" shata");
	n %= 100;
	}
	if (n)
	printf (" %d",n);
	}
	int main()
	{
	long long int n;
	int Case=1;
	while (scanf("%lld",&n)!=EOF){
	printf ("%4d.",Case++);
	if (n==0) printf(" 0");
	bangla (n);
	printf("\n");
	}
	return 0;
	}

view raw [UVa] 10101 Bangla Numbers.cpp hosted with ❤ by GitHub