結果

問題 No.265 数学のテスト
コンテスト
ユーザー Haar
提出日時 2019-07-03 05:56:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 3,661 bytes
コンパイル時間 1,940 ms
コンパイル使用メモリ 196,328 KB
最終ジャッジ日時 2025-01-07 05:51:01
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))
#define sz(v) ((LLI)(v).size())

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct polynomial{
  int64_t d[11] = {};
};

polynomial operator+(const polynomial &a, const polynomial &b){
  polynomial ret;
  REPE(i,10) ret.d[i] = a.d[i] + b.d[i];
  return ret;
}

polynomial operator*(const polynomial &a, const polynomial &b){
  polynomial ret;
  REPE(i,10){
    REPE(j,10){
      if(i+j > 10) continue;
      ret.d[i+j] += a.d[i] * b.d[j];
    }
  }
  return ret;
}

polynomial differentiate(const polynomial &a){
  polynomial ret;

  REP(i,10){
    ret.d[i] = a.d[i+1] * (i+1);
  }

  return ret;
}

void show(const polynomial &a){
  REPE(i,10){
    cerr << a.d[i] << " ";
  }
  cerr << endl;
}




using state = string::const_iterator;

struct parser{

  static polynomial number(state &cur){
    polynomial ret;
    int64_t n = *cur-'0';

    while(1){
      ++cur;
      if(isdigit(*cur)){
	n = n*10 + *cur-'0';
      }else{
	break;
      }
    }

    ret.d[0] = n;
    return ret;
  }

  static polynomial factor(state &cur){
    polynomial ret;

    if(isdigit(*cur)){
      ret = number(cur);
    }else if(*cur == 'x'){
      ret.d[1] = 1;
      ++cur;
    }else if(*cur == 'd'){
      ++cur; // d
      ++cur; // open bracket

      polynomial temp  = expression(cur);
      ret = differentiate(temp);
      ++cur; // close bracket
    }

    return ret;
  }

  static polynomial term(state &cur){
    polynomial ret = factor(cur);

    while(1){
      if(*cur == '*'){
	++cur;
	ret = ret * factor(cur);
      }else{
	break;
      }
    }

    return ret;
  }


  static polynomial expression(state &cur){
    polynomial ret = term(cur);

    while(1){
      if(*cur == '+'){
	++cur;
	ret = ret + term(cur);
      }else{
	break;
      }
    }
    
    return ret;
  }
  
  static polynomial parse(const string &s){
    auto cur = s.cbegin();
    return expression(cur);
  }
};



int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,d;
  string S;
  while(cin >> N >> d >> S){
    polynomial ans = parser::parse(S);

    REPE(i,d){
      if(i) cout << " ";
      cout << ans.d[i];
    }
    
    cout << endl;
  }
  
  return 0;
}
0