2496176_ac_0ms_140k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 41 行

#include <stdio.h>
#include <math.h>

int n, t;
int c[101];

int f(int i)
{
	if(i<0)
		i *= -1;
	return (int)(log10(i)+1);
}

int main()
{
	int i, v, ans, vv, cas = 1;

	while(scanf("%d%d",&n,&t)==2&&n)
	{
		ans = n+1;
		c[n] = 1;
		for(i = n-1; i > 0; i--)
			scanf("%d",&c[i]);
		scanf("%d%d",&c[0],&v);
		vv = c[0]+(int)pow(v,n);
		for(i = n-1; i > 0; i--)
		{
			ans++;
			if(c[i])
			{
				
				ans += 1+f(c[i]);
				vv += c[i]*(int)pow(v,i);
			}
		}
		if(c[0])
			ans += f(c[0])+1;
		printf("Polynomial %d: %d %d\n",cas++,vv,ans);
	}
	return 0;
}