답안 #17849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17849	2016-01-12T13:34:23 Z	Erzhann	홀-짝 수열 (IZhO11_oddeven)	C++	컴파일 오류	0 ms	0 KB

oddeven

/*
  /\     /\
  | ).|.( |
  |  >-<  |
  =========
It's Adilkhan99 miaaaaaau      
*/
#include<bits/stdc++.h>

#define ll long long
#define pb push_back
#define endl "\n"
#define foreach(it, S) for(__typeof (S.begin()) it = S.begin(); it != S.end(); it++)
#define mp make_pair
#define f first
#define s second 
#define name ""
#define _ ios_base::sync_with_stdio(false);cin.tie(0);

using namespace std;
                                            
#define in freopen("input.txt" , "r" , stdin)
#define out freopen("output.txt" , "w" , stdout)

const int base = 1000000000;
const int base_digits = 9;

struct bigint {
    vector<int> a;
    int sign;

    bigint() :
        sign(1) {
    }

    bigint(long long v) {
        *this = v;
    }

    bigint(const string &s) {
        read(s);
    }

    void operator=(const bigint &v) {
        sign = v.sign;
        a = v.a;
    }

    void operator=(long long v) {
        sign = 1;
        if (v < 0)
            sign = -1, v = -v;
        for (; v > 0; v = v / base)
            a.push_back(v % base);
    }

    bigint operator+(const bigint &v) const {
        if (sign == v.sign) {
            bigint res = v;

            for (int i = 0, carry = 0; i < (int) max(a.size(), v.a.size()) || carry; ++i) {
                if (i == (int) res.a.size())
                    res.a.push_back(0);
                res.a[i] += carry + (i < (int) a.size() ? a[i] : 0);
                carry = res.a[i] >= base;
                if (carry)
                    res.a[i] -= base;
            }
            return res;
        }
        return *this - (-v);
    }

    bigint operator-(const bigint &v) const {
        if (sign == v.sign) {
            if (abs() >= v.abs()) {
                bigint res = *this;
                for (int i = 0, carry = 0; i < (int) v.a.size() || carry; ++i) {
                    res.a[i] -= carry + (i < (int) v.a.size() ? v.a[i] : 0);
                    carry = res.a[i] < 0;
                    if (carry)
                        res.a[i] += base;
                }
                res.trim();
                return res;
            }
            return -(v - *this);
        }
        return *this + (-v);
    }

    void operator*=(int v) {
        if (v < 0)
            sign = -sign, v = -v;
        for (int i = 0, carry = 0; i < (int) a.size() || carry; ++i) {
            if (i == (int) a.size())
                a.push_back(0);
            long long cur = a[i] * (long long) v + carry;
            carry = (int) (cur / base);
            a[i] = (int) (cur % base);
            //asm("divl %%ecx" : "=a"(carry), "=d"(a[i]) : "A"(cur), "c"(base));
        }
        trim();
    }

    bigint operator*(int v) const {
        bigint res = *this;
        res *= v;
        return res;
    }

    friend pair<bigint, bigint> divmod(const bigint &a1, const bigint &b1) {
        int norm = base / (b1.a.back() + 1);
        bigint a = a1.abs() * norm;
        bigint b = b1.abs() * norm;
        bigint q, r;
        q.a.resize(a.a.size());

        for (int i = a.a.size() - 1; i >= 0; i--) {
            r *= base;
            r += a.a[i];
            int s1 = r.a.size() <= b.a.size() ? 0 : r.a[b.a.size()];
            int s2 = r.a.size() <= b.a.size() - 1 ? 0 : r.a[b.a.size() - 1];
            int d = ((long long) base * s1 + s2) / b.a.back();
            r -= b * d;
            while (r < 0)
                r += b, --d;
            q.a[i] = d;
        }

        q.sign = a1.sign * b1.sign;
        r.sign = a1.sign;
        q.trim();
        r.trim();
        return make_pair(q, r / norm);
    }

    bigint operator/(const bigint &v) const {
        return divmod(*this, v).first;
    }

    bigint operator%(const bigint &v) const {
        return divmod(*this, v).second;
    }

    void operator/=(int v) {
        if (v < 0)
            sign = -sign, v = -v;
        for (int i = (int) a.size() - 1, rem = 0; i >= 0; --i) {
            long long cur = a[i] + rem * (long long) base;
            a[i] = (int) (cur / v);
            rem = (int) (cur % v);
        }
        trim();
    }

    bigint operator/(int v) const {
        bigint res = *this;
        res /= v;
        return res;
    }

    int operator%(int v) const {
        if (v < 0)
            v = -v;
        int m = 0;
        for (int i = a.size() - 1; i >= 0; --i)
            m = (a[i] + m * (long long) base) % v;
        return m * sign;
    }

    void operator+=(const bigint &v) {
        *this = *this + v;
    }
    void operator-=(const bigint &v) {
        *this = *this - v;
    }
    void operator*=(const bigint &v) {
        *this = *this * v;
    }
    void operator/=(const bigint &v) {
        *this = *this / v;
    }

    bool operator<(const bigint &v) const {
        if (sign != v.sign)
            return sign < v.sign;
        if (a.size() != v.a.size())
            return a.size() * sign < v.a.size() * v.sign;
        for (int i = a.size() - 1; i >= 0; i--)
            if (a[i] != v.a[i])
                return a[i] * sign < v.a[i] * sign;
        return false;
    }

    bool operator>(const bigint &v) const {
        return v < *this;
    }
    bool operator<=(const bigint &v) const {
        return !(v < *this);
    }
    bool operator>=(const bigint &v) const {
        return !(*this < v);
    }
    bool operator==(const bigint &v) const {
        return !(*this < v) && !(v < *this);
    }
    bool operator!=(const bigint &v) const {
        return *this < v || v < *this;
    }

    void trim() {
        while (!a.empty() && !a.back())
            a.pop_back();
        if (a.empty())
            sign = 1;
    }

    bool isZero() const {
        return a.empty() || (a.size() == 1 && !a[0]);
    }

    bigint operator-() const {
        bigint res = *this;
        res.sign = -sign;
        return res;
    }

    bigint abs() const {
        bigint res = *this;
        res.sign *= res.sign;
        return res;
    }

    long long longValue() const {
        long long res = 0;
        for (int i = a.size() - 1; i >= 0; i--)
            res = res * base + a[i];
        return res * sign;
    }

    friend bigint gcd(const bigint &a, const bigint &b) {
        return b.isZero() ? a : gcd(b, a % b);
    }
    friend bigint lcm(const bigint &a, const bigint &b) {
        return a / gcd(a, b) * b;
    }

    void read(const string &s) {
        sign = 1;
        a.clear();
        int pos = 0;
        while (pos < (int) s.size() && (s[pos] == '-' || s[pos] == '+')) {
            if (s[pos] == '-')
                sign = -sign;
            ++pos;
        }
        for (int i = s.size() - 1; i >= pos; i -= base_digits) {
            int x = 0;
            for (int j = max(pos, i - base_digits + 1); j <= i; j++)
                x = x * 10 + s[j] - '0';
            a.push_back(x);
        }
        trim();
    }

    friend istream& operator>>(istream &stream, bigint &v) {
        string s;
        stream >> s;
        v.read(s);
        return stream;
    }

    friend ostream& operator<<(ostream &stream, const bigint &v) {
        if (v.sign == -1)
            stream << '-';
        stream << (v.a.empty() ? 0 : v.a.back());
        for (int i = (int) v.a.size() - 2; i >= 0; --i)
            stream << setw(base_digits) << setfill('0') << v.a[i];
        return stream;
    }

    static vector<int> convert_base(const vector<int> &a, int old_digits, int new_digits) {
        vector<long long> p(max(old_digits, new_digits) + 1);
        p[0] = 1;
        for (int i = 1; i < (int) p.size(); i++)
            p[i] = p[i - 1] * 10;
        vector<int> res;
        long long cur = 0;
        int cur_digits = 0;
        for (int i = 0; i < (int) a.size(); i++) {
            cur += a[i] * p[cur_digits];
            cur_digits += old_digits;
            while (cur_digits >= new_digits) {
                res.push_back(int(cur % p[new_digits]));
                cur /= p[new_digits];
                cur_digits -= new_digits;
            }
        }
        res.push_back((int) cur);
        while (!res.empty() && !res.back())
            res.pop_back();
        return res;
    }

    typedef vector<long long> vll;

    static vll karatsubaMultiply(const vll &a, const vll &b) {
        int n = a.size();
        vll res(n + n);
        if (n <= 32) {
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                    res[i + j] += a[i] * b[j];
            return res;
        }

        int k = n >> 1;
        vll a1(a.begin(), a.begin() + k);
        vll a2(a.begin() + k, a.end());
        vll b1(b.begin(), b.begin() + k);
        vll b2(b.begin() + k, b.end());

        vll a1b1 = karatsubaMultiply(a1, b1);
        vll a2b2 = karatsubaMultiply(a2, b2);

        for (int i = 0; i < k; i++)
            a2[i] += a1[i];
        for (int i = 0; i < k; i++)
            b2[i] += b1[i];

        vll r = karatsubaMultiply(a2, b2);
        for (int i = 0; i < (int) a1b1.size(); i++)
            r[i] -= a1b1[i];
        for (int i = 0; i < (int) a2b2.size(); i++)
            r[i] -= a2b2[i];

        for (int i = 0; i < (int) r.size(); i++)
            res[i + k] += r[i];
        for (int i = 0; i < (int) a1b1.size(); i++)
            res[i] += a1b1[i];
        for (int i = 0; i < (int) a2b2.size(); i++)
            res[i + n] += a2b2[i];
        return res;
    }

    bigint operator*(const bigint &v) const {
        vector<int> a6 = convert_base(this->a, base_digits, 6);
        vector<int> b6 = convert_base(v.a, base_digits, 6);
        vll a(a6.begin(), a6.end());
        vll b(b6.begin(), b6.end());
        while (a.size() < b.size())
            a.push_back(0);
        while (b.size() < a.size())
            b.push_back(0);
        while (a.size() & (a.size() - 1))
            a.push_back(0), b.push_back(0);
        vll c = karatsubaMultiply(a, b);
        bigint res;
        res.sign = sign * v.sign;
        for (int i = 0, carry = 0; i < (int) c.size(); i++) {
            long long cur = c[i] + carry;
            res.a.push_back((int) (cur % 1000000));
            carry = (int) (cur / 1000000);
        }
        res.a = convert_base(res.a, 6, base_digits);
        res.trim();
        return res;
    }
};

  
const int MaxN = int (2e5) + 256;
const int INF = int(1e9);  
const int mod = (int)(1e9) + 7;
int n, a[MaxN], m, t;
  
bigint n, l, r = 1;


int main (){
    cin >> n;
    for(int i = 1; i <= 100; i++)
        r *= 10;
    while(l < r)
    {
        bigint m = (l + r) / 2;
        bigint C = m * (m + 1) / 2;
        if(C >= n)
            r = m;
        else l = m + 1;
    }
    cout << n * 2 - l;
return 0;
}

Compilation message

oddeven.cpp:378:8: error: conflicting declaration ‘bigint n’
 bigint n, l, r = 1;
        ^
oddeven.cpp:376:5: note: previous declaration as ‘int n’
 int n, a[MaxN], m, t;
     ^
oddeven.cpp: In function ‘int main()’:
oddeven.cpp:393:19: error: no match for ‘operator-’ (operand types are ‘int’ and ‘bigint’)
     cout << n * 2 - l;
                   ^
oddeven.cpp:393:19: note: candidates are:
In file included from /usr/include/c++/4.9/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.9/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:64,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/stl_iterator.h:328:5: note: template<class _Iterator> typename std::reverse_iterator<_Iterator>::difference_type std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)
     operator-(const reverse_iterator<_Iterator>& __x,
     ^
/usr/include/c++/4.9/bits/stl_iterator.h:328:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::reverse_iterator<_Iterator>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.9/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:64,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/stl_iterator.h:385:5: note: template<class _IteratorL, class _IteratorR> typename std::reverse_iterator<_Iterator>::difference_type std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&)
     operator-(const reverse_iterator<_IteratorL>& __x,
     ^
/usr/include/c++/4.9/bits/stl_iterator.h:385:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::reverse_iterator<_Iterator>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:66:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/complex:351:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&, const std::complex<_Tp>&)
     operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
     ^
/usr/include/c++/4.9/complex:351:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::complex<_Tp>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:66:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/complex:360:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&, const _Tp&)
     operator-(const complex<_Tp>& __x, const _Tp& __y)
     ^
/usr/include/c++/4.9/complex:360:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::complex<_Tp>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:66:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/complex:369:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const _Tp&, const std::complex<_Tp>&)
     operator-(const _Tp& __x, const complex<_Tp>& __y)
     ^
/usr/include/c++/4.9/complex:369:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   ‘bigint’ is not derived from ‘const std::complex<_Tp>’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:66:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/complex:446:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&)
     operator-(const complex<_Tp>& __x)
     ^
/usr/include/c++/4.9/complex:446:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::complex<_Tp>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/deque:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:67,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/stl_deque.h:335:5: note: template<class _Tp, class _Ref, class _Ptr> typename std::_Deque_iterator<_Tp, _Ref, _Ptr>::difference_type std::operator-(const std::_Deque_iterator<_Tp, _Ref, _Ptr>&, const std::_Deque_iterator<_Tp, _Ref, _Ptr>&)
     operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
     ^
/usr/include/c++/4.9/bits/stl_deque.h:335:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::_Deque_iterator<_Tp, _Ref, _Ptr>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/deque:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:67,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/stl_deque.h:347:5: note: template<class _Tp, class _RefL, class _PtrL, class _RefR, class _PtrR> typename std::_Deque_iterator<_Tp, _Ref, _Ptr>::difference_type std::operator-(const std::_Deque_iterator<_Tp, _Ref, _Ptr>&, const std::_Deque_iterator<_Tp, _RefR, _PtrR>&)
     operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
     ^
/usr/include/c++/4.9/bits/stl_deque.h:347:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::_Deque_iterator<_Tp, _Ref, _Ptr>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/vector:65:0,
                 from /usr/include/c++/4.9/queue:61,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:85,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/stl_bvector.h:208:3: note: std::ptrdiff_t std::operator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
   operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
   ^
/usr/include/c++/4.9/bits/stl_bvector.h:208:3: note:   no known conversion for argument 1 from ‘int’ to ‘const std::_Bit_iterator_base&’
In file included from /usr/include/c++/4.9/valarray:587:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note: template<class _Dom1, class _Dom2> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::_Expr<_Dom2, typename _Dom2::value_type>&)
     _DEFINE_EXPR_BINARY_OPERATOR(-, __minus)
     ^
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/valarray:587:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)
     _DEFINE_EXPR_BINARY_OPERATOR(-, __minus)
     ^
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/valarray:587:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const typename _Dom::value_type&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)
     _DEFINE_EXPR_BINARY_OPERATOR(-, __minus)
     ^
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   ‘bigint’ is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/valarray:587:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::valarray<typename _Dom::value_type>&)
     _DEFINE_EXPR_BINARY_OPERATOR(-, __minus)
     ^
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/c++/4.9/valarray:587:0,
                 from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::valarray<typename _Dom::value_type>&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)
     _DEFINE_EXPR_BINARY_OPERATOR(-, __minus)
     ^
/usr/include/c++/4.9/bits/valarray_after.h:403:5: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   ‘bigint’ is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const std::valarray<_Tp>&, const std::valarray<_Tp>&)
 _DEFINE_BINARY_OPERATOR(-, __minus)
 ^
/usr/include/c++/4.9/valarray:1168:1: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::valarray<_Tp>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const std::valarray<_Tp>&, const _Tp&)
 _DEFINE_BINARY_OPERATOR(-, __minus)
 ^
/usr/include/c++/4.9/valarray:1168:1: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   mismatched types ‘const std::valarray<_Tp>’ and ‘int’
     cout << n * 2 - l;
                     ^
In file included from /usr/include/x86_64-linux-gnu/c++/4.9/bits/stdc++.h:94:0,
                 from oddeven.cpp:8:
/usr/include/c++/4.9/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const _Tp&, const std::valarray<_Tp>&)
 _DEFINE_BINARY_OPERATOR(-, __minus)
 ^
/usr/include/c++/4.9/valarray:1168:1: note:   template argument deduction/substitution failed:
oddeven.cpp:393:21: note:   ‘bigint’ is not derived from ‘const std::valarray<_Tp>’
     cout << n * 2 - l;
                     ^