結果

問題 No.40 多項式の割り算
ユーザー anta
提出日時 2014-10-14 23:46:18
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 3,115 bytes
コンパイル時間 1,247 ms
コンパイル使用メモリ 85,148 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-30 09:08:23
合計ジャッジ時間 2,070 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:84:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   84 |         scanf("%d", &D);
      |         ~~~~~^~~~~~~~~~
main.cpp:88:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   88 |                 scanf("%d", &a);
      |                 ~~~~~^~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
struct Polynomial {
    typedef int Coef; typedef Coef Val;
    vector<Coef> coef;  //... + coef[2] x^2 + coef[1] x + coef[0]
    Polynomial() {}
    explicit Polynomial(int n): coef(n) {}
    static Polynomial One() {
        Polynomial r(1);
        r.coef[0] = 1;
        return r;
    }
    bool iszero() const { return coef.empty(); }
    int degree1() const { return coef.size(); } //degree + 1
    int resize(int d) { if(degree1() < d) coef.resize(d); return d; }
    const Coef operator[](int i) const {
        return i >= degree1() ? Coef() : coef[i];
    }
    void canonicalize() {
        int i = coef.size();
        while(i > 0 && coef[i-1] == Coef()) i --;
        coef.resize(i);
    }
    //long division
    pair<Polynomial, Polynomial> divmod(const Polynomial &that) const {
        int x = degree1() - 1, y = that.degree1() - 1;
        int d = max(0, x - y);
        Polynomial q(d + 1), r = *this;
        for(int i = x; i >= y; i --) {
            Coef t = r.coef[i] / that.coef[y];
            q.coef[i - y] = t;
            assert(t * that.coef[y] == r.coef[i]);
            r.coef[i] = 0;
            if(t == 0) continue;
            for(int j = 0; j < y; j ++)
                r.coef[i - y + j] -= t * that.coef[j];
        }
        q.canonicalize(); r.canonicalize();
        return make_pair(q, r);
    }
    Polynomial operator/(const Polynomial &that) const { return divmod(that).first; }
    Polynomial operator%(const Polynomial &that) const { return divmod(that).second; }
};
int main() {
    int D;
    scanf("%d", &D);
    Polynomial p(D+1);
    rep(i, D+1) {
        int a;
        scanf("%d", &a);
        p.coef[i] = a;
    }
    Polynomial q(4);
    q.coef[1] = -1;
    q.coef[3] = 1;
    Polynomial r = p % q;
    if(r.iszero()) r.resize(1);
    printf("%d\n", r.degree1()-1);
    rep(i, r.degree1()) {
        if(i != 0) putchar(' ');
        printf("%d", r[i]);
    }
    puts("");
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0