ZOJ 2969 Easy Task(模拟)

来源:互联网 发布:家庭ktv 知乎 编辑:程序博客网 时间:2024/06/05 00:54

题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2969

给出一个多项式的系数,求其导数的系数,简单模拟 水题

#include<iostream>#include<cstdio>#include<set>#include<string>#include<string.h>#include<cstring>#include<vector>#include<map>#include<queue>#include<stack>#include<cctype>#include<algorithm>#define mt(a) memset(a,0,sizeof a)#define fl(a,b,c) fill(a,b,c)#define inf 1000000000+7using namespace std;typedef long long ll;int ans[200];int  main(){    int T;    cin >> T;    while (T--)    {        int n;        scanf("%d", &n);        for (int i = n; i >= 0; i--)        {            scanf("%d", &ans[i]);            ans[i] *= i;        }        for (int i = n; i > 0; i--)        {            if (i!=n)printf(" ");            printf("%d", ans[i]);        }        if (n == 0)printf("%d", ans[0]);        else        {            if (ans[0])printf(" %d", ans[0]);        }        printf("\n");    }    return 0;}
0 0
原创粉丝点击