POJ 1140 Expanding Fractions G++ 巧妙

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
//英语       看博友分析      抄博友程序     巧妙 
int main() 
{
	int a,b;
	while(cin>>a>>b)
	{
		if(a==0 && b==0)
		{
			break;
		} 
		map<int,int> mp;
		map<int,int> shang;//没考虑商 
		mp.clear();
		shang.clear(); 
		int i=1;
		cout<<".";
		int js=1;
		int jg=0;
		while(1)
		{		
			i++;
			a=a*10;
			int t=a/b;			
			a=a%b;//余数 
			//cout<<" "<<a<<endl; 
			if(a==0)
			{
				cout<<t<<endl;
				break;
			}
			if(mp[a]!=0)
			{
				if(shang[a]!=t && a!=0)
				{
					cout<<t;
				}
				jg=js-mp[a]+1;
				if(js%50!=0)//不加pe 
				cout<<endl;
				//cout<<js<<" "<<mp[a]<<endl;
				break;//抄博友程序 
			}else
			{
				mp[a]=i;
			}				
			shang[a]=t;			
			cout<<t;
			js++;
			if(js%50==0)
			{
				cout<<endl; 
			}			
		}
		if(jg==0)
		{
			cout<<"This expansion terminates."<<endl;
		}else
		{
			cout<<"The last "<<jg<<" digits repeat forever."<<endl;
		}
	}
	return 0;
}