10719 - Quotient Polynomial

来源:互联网 发布:u盘黑苹果windows 编辑:程序博客网 时间:2024/06/14 09:31
#include <cstdio>#include <cstring>int main(){    //freopen("a.txt","r",stdin);    int i,count,k;    long int f[10010],l[10010];    char c;    while(scanf("%d",&k)!=EOF)    {        count=0;        memset(f,0,sizeof(f));        memset(l,0,sizeof(l));        while(scanf("%ld%c",&f[count++],&c)!=EOF)            if(c=='\n')break;        l[0]=f[0];        for(i=1; i<count; i++)            l[i]=f[i]+k*l[i-1];        printf("q(x):");        for(i=0; i<count-1; i++)            printf(" %ld",l[i]);        printf("\nr = %ld\n\n",l[count-1]);    }    return 0;}

原创粉丝点击