POJ 1001

最新推荐文章于 2020-08-17 11:20:42 发布

超神工作室

最新推荐文章于 2020-08-17 11:20:42 发布

阅读量216

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/u013177821/article/details/39357621

版权

POJ 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

用数组模拟手算，最后把小数点加进去，要注意去掉前面的0和后面的0对小数点位置的影响。

AC的代码

/*
Memory 280K
Code Length 1603B
Time 0MS
*/
#include <iostream>
#include <string>
using namespace std;

int main()
{
	string s;
	int num;
	int dot = 0;
	int mul[20];
	int r[151];
	memset(r,0,151*sizeof(int));
	int result[151];
	memset(result,0,151*sizeof(int));
	int i,j,k,l,m,n;
	int over = 0;
	while(cin>>s>>num)
	{
		dot = 0;
		memset(r,0,151*sizeof(int));
		memset(result,0,151*sizeof(int));
		//s->mul,r
		j = 0;
		for(i = 0;i < s.length();i ++)
		{
			if(s.at(s.length() - i - 1) != '.')
			{
				mul[j] = (int)s.at(s.length() - i - 1) - 48;
				r[j] = mul[j];
				j++;
			}
			else
				dot = i;
		}
		k = j;
		dot *= num; 
		while(--num != 0)
		{
			
			//result += mul * r
			for(i = 0;i < j;i ++)
			{
				n = i;
				over = 0;
				for(l = 0;l < k;l++)
				{
					m = mul[i] * r[l];
					result[n] += m + over;
					if(result[n] > 9)
					{
						over = result[n] / 10;
						result[n] = result[n] % 10;
						
					}
					else
						over = 0;
					n ++;
				}
				if(over != 0)
					result[n] = over;
				else
					n--;
			}
			for(i = 0;i <= n;i ++)
				r[i] = result[i];
			memset(result,0,151*sizeof(int));
			k = n + 1;
		}
		//delete last 0s
		int flag = 0;
		int end = -1;

			for(i = 0;i < k;i ++)
			{
				if(i == dot)
					break;
				if(r[i] == 0)
					end++;
				else
					break;
			}
		
		for(i = k - 1;i > end;i --)
		{
			if(i == dot - 1 && dot != 0)
			{
				cout<<".";
				flag = 1;
			}
			if(r[i] == 0 && flag == 0)	//delete first 0s
				continue;
			else
				flag = 1;
			
			cout<<r[i];
		}
		cout<<endl;
	}
	return 0;
}