1267.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 1267 on 2006-02-26 at 16:19:24 */ 
#include <cstdio>

const int MAX = 128;

inline int getLen(int);

int main()
{
	int coe[MAX], n, x;
	int i, t;
	
	for(t = 1; scanf("%d", &n) != EOF && n != 0; t++) {
		for(i = 0; i <= n; i++) scanf("%d", &coe[n-i]);
		scanf("%d", &x);
		int v = 1, cost = 0;
		for(i = n-1; i >= 0; i--) {
			v = v * x + coe[i]; cost += 2;
			if(coe[i] != 0) cost += 1+getLen(coe[i]);
		}
		printf("Polynomial %d: %d %d\n", t, v, cost);
	}
	
	return 0;
}

inline int getLen(int m)
{
	int l;
	for(l = 0; m != 0; l++) m /= 10;
	return l;
}