( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus && !tmp.zero();\\n\\n}\\n\\nbool operator<=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator>=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator==( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.zero();\\n\\n}\\n\\nbool operator!=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.zero();\\n\\n}\\n\\nint main(){\\n\\n string val1, val2;\\n bool minus;\\n \\n cin >> val1;\\n if( val1[0] == '-' ){\\n minus = true;\\n val1 = val1.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi1( val1, minus );\\n\\n cin >> val2;\\n if( val2[0] == '-' ){\\n minus = true;\\n val2 = val2.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi2( val2, minus );\\n \\n BigInteger res = sub( bi1, bi2 );\\n res.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5108,\n \"score_of_the_acc\": -0.0758,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_10710923\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos( -1.0 );\\n\\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\\n\\ntemplate <typename T>\\nvoid print_arr( vector<T> v ){\\n if( v.size() == 0 ) return;\\n for( int i = 0 ; i < v.size() ; i++ )\\n cout << v[i];\\n cout << endl;\\n}\\n\\nstruct BigInteger{\\n\\n bool minus;\\n int digit;\\n vector<ll> arr;\\n\\n BigInteger( string val = \\\"\\\", bool m = false ){\\n\\n minus = m;\\n while( val.length() > 4 ){\\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\\n val = val.substr( 0, val.length() - 4 );\\n }\\n if( val.length() != 0 )\\n arr.push_back( stoll( val ) );\\n set_digit();\\n\\n }\\n\\n bool zero(){\\n\\n return arr.size() == 1 && arr[0] == 0;\\n\\n }\\n\\n void set_digit(){\\n\\n while( arr.size() > 1 && arr[arr.size()-1] == 0 ){\\n arr.pop_back();\\n }\\n digit = arr.size();\\n\\n }\\n\\n void print(){\\n\\n if( zero() ){\\n cout << 0 << endl;\\n return;\\n }\\n if( minus )\\n cout << \\\"-\\\";\\n cout << arr[digit - 1];\\n for( int i = digit - 2 ; i >= 0 ; i-- )\\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\\n cout << endl;\\n\\n }\\n\\n};\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 );\\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return sub( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n return sub( bi2, bi1 );\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n\\n BigInteger res;\\n ll up = 0;\\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i];\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \\n up = ( val1 + val2 + up ) / 10000;\\n }\\n res.arr.push_back( up );\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return add( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = sub( bi2, bi1 );\\n return res;\\n }\\n\\n if( bi1.digit < bi2.digit ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.digit == bi2.digit ){\\n if( bi1.arr[bi1.digit-1] < bi2.arr[bi2.digit-1] ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n }\\n \\n BigInteger res;\\n ll down = 0;\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i] - down;\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n if( val1 < val2 ){\\n down = 1;\\n val1 += 10000;\\n }\\n else \\n down = 0;\\n res.arr.push_back( val1 - val2 );\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nint main(){\\n\\n string val1, val2;\\n bool minus;\\n \\n cin >> val1;\\n if( val1[0] == '-' ){\\n minus = true;\\n val1 = val1.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi1( val1, minus );\\n\\n cin >> val2;\\n if( val2[0] == '-' ){\\n minus = true;\\n val2 = val2.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi2( val2, minus );\\n \\n BigInteger res = sub( bi1, bi2 );\\n res.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5040,\n \"score_of_the_acc\": -0.0751,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_10025747\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n string rawA, rawB;\\n cin >> rawA >> rawB;\\n int fa = 1, fb = 1;\\n string A = rawA, B = rawB;\\n if (B[0] == '-') {\\n B.erase(0, 1);\\n } else {\\n B = \\\"-\\\" + B;\\n }\\n if (A[0] == '-') {\\n fa = -1;\\n A.erase(0, 1);\\n }\\n if (B[0] == '-') {\\n fb = -1;\\n B.erase(0, 1);\\n }\\n bool is_swap = A.size() < B.size();\\n if (A.size() == B.size()) {\\n for (int i = 0; i < A.size(); i++) {\\n if (A[i] == B[i]) {\\n continue;\\n }\\n is_swap = A[i] < B[i];\\n break;\\n }\\n }\\n if (is_swap) {\\n std::swap(A, B);\\n std::swap(fa, fb);\\n std::swap(rawA, rawB);\\n }\\n int diff = (A.size() - B.size());\\n for (int i = 0; i < diff; i++) {\\n B = '0' + B;\\n }\\n int f = fa * fb;\\n int next = 0;\\n string s = \\\"\\\";\\n for (int i = 1; i <= A.size(); i++) {\\n int val = A[A.size() - i] - '0' + f * (B[B.size() - i] - '0') + next;\\n if (val > 9) {\\n next = 1;\\n val -= 10;\\n } else if (val < 0) {\\n next = -1;\\n val += 10;\\n } else {\\n next = 0;\\n }\\n s = to_string(val) + s;\\n }\\n if (next != 0) {\\n s = \\\"1\\\" + s;\\n }\\n while (s.size() > 1 && s[0] == '0') {\\n s.erase(0, 1);\\n }\\n if (s != \\\"0\\\" && fa < 0) {\\n s = \\\"-\\\" + s;\\n }\\n cout << s << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 4100,\n \"score_of_the_acc\": -0.3695,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_9795744\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\ntemplate <int BASE>\\nclass BigDecimal {\\n public:\\n static constexpr std::string_view NUMERAL{\\n \\\"0123456789ABCDEF\\\"}; // 16進数まで対応\\n\\n private: // 静的関数\\n static int CompareIgnoreSign(const BigDecimal& a, const BigDecimal& b) {\\n // a-bの符号で覚えてもよいかも。\\n // a<b: -1\\n // a>b: +1\\n // a==b: 0\\n if (a._digit.size() != b._digit.size())\\n return a._digit.size() < b._digit.size() ? -1 : 1;\\n for (int i = a._digit.size() - 1; i >= 0; --i) {\\n if (a._digit[i] == b._digit[i]) continue;\\n return a._digit[i] < b._digit[i] ? -1 : 1;\\n }\\n return 0;\\n }\\n\\n static BigDecimal Karatsuba(const BigDecimal& a, const BigDecimal& b) {\\n // |a| >= |b|にする\\n if (a._digit.size() < b._digit.size()) return Karatsuba(b, a);\\n // 1桁に絞ったら直に計算して返す\\n if (b._digit.size() == 1) {\\n BigDecimal ret(a);\\n for (int i = 0; i < a._digit.size(); ++i) {\\n ret._digit[i] *= b._digit[0];\\n }\\n ret.carry_and_fix();\\n if (b._positive)\\n return ret;\\n else\\n return -ret;\\n }\\n int N = a._digit.size() / 2; // 下半分の桁数\\n bool sign = !(a._positive xor b._positive); // 符号を計算しておく\\n BigDecimal a0(a), a1(a), b0(b), b1(b); // x = concat(x0, x1)\\n // aの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (a1._digit.size() > N) a1._digit.pop_back();\\n // x0のデータを消去\\n a0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < a._digit.size(); ++i)\\n a0._digit.emplace_back(a._digit[N + i]);\\n if (a0._digit.size() == 0) a0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n a0._positive = a1._positive = true;\\n if (b._digit.size() < N) { // 一方が他方の半分もない\\n BigDecimal p0, c1;\\n p0 = Karatsuba(a0, b);\\n c1 = Karatsuba(a1, b);\\n BigDecimal c0;\\n for (int i = 0; i < N - 1; ++i) c0._digit.emplace_back(0);\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1;\\n ret._positive = sign;\\n return ret;\\n }\\n // bの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (b1._digit.size() > N) b1._digit.pop_back();\\n // x0のデータを消去\\n b0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < b._digit.size(); ++i)\\n b0._digit.emplace_back(b._digit[N + i]);\\n if (b0._digit.size() == 0) b0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n b0._positive = b1._positive = true;\\n // 3種類の積\\n BigDecimal p0, p1, p2;\\n p0 = Karatsuba(a0, b0);\\n p2 = Karatsuba(a1, b1);\\n p1 = Karatsuba(a0 + a1, b0 + b1) - p0 - p2;\\n // 積に対応する数\\n BigDecimal c0, c1, c2;\\n c0._digit.clear();\\n c1._digit.clear();\\n c2._digit.clear();\\n for (int i = 0; i < N; ++i) {\\n c0._digit.emplace_back(0);\\n c0._digit.emplace_back(0);\\n c1._digit.emplace_back(0);\\n }\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n for (const auto& d : p1._digit) c1._digit.emplace_back(d);\\n for (const auto& d : p2._digit) c2._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1 + c2;\\n ret._positive = sign;\\n return ret;\\n }\\n\\n private:\\n std::vector<int> _digit;\\n bool _positive;\\n\\n void carry_and_fix() {\\n // 新規の桁が発生しない範疇(最後の桁以外)を処理\\n for (int i = 0; i < _digit.size() - 1; ++i) {\\n if (_digit[i] >= BASE) {\\n // 桁の数が基数以上: 繰り上げる必要あり\\n int k = _digit[i] / BASE; // 繰り上がり発生回数\\n _digit[i] -= k * BASE;\\n _digit[i + 1] += k;\\n } else if (_digit[i] < 0) {\\n // 桁の数が負: 繰り下げが必要\\n int k = (-_digit[i] - 1) / BASE + 1;\\n _digit[i] += k * BASE;\\n _digit[i + 1] -= k;\\n }\\n }\\n // 最後の桁を処理する場合\\n while (_digit.back() >= BASE) {\\n int k = _digit.back() / BASE; // 繰り上がり発生回数\\n _digit.back() -= k * BASE;\\n _digit.emplace_back(k);\\n }\\n // 計算結果がマイナスなら全体に-1をかけて符号反転\\n if (_digit.back() < 0) {\\n this->_positive = !this->_positive;\\n for (int i = 0; i < _digit.size(); ++i) {\\n _digit[i] *= -1;\\n }\\n this->carry_and_fix();\\n }\\n // 0の桁を上から消す\\n while (_digit.size() >= 2 && _digit.back() == 0) _digit.pop_back();\\n // 0になったら正の数にしておく(-0表記は困るため)\\n if(_digit.size() == 1 && _digit[0] == 0) _positive = true;\\n }\\n\\n public:\\n // コンストラクタ\\n BigDecimal(int num = 0) : _digit(0), _positive(num >= 0) {\\n if (!_positive) num *= -1;\\n while (num > 0) {\\n _digit.emplace_back(num % BASE);\\n num /= BASE;\\n }\\n if (_digit.size() == 0) _digit.emplace_back(0);\\n }\\n BigDecimal(std::string s) {\\n if (s[0] == '-') {\\n s = s.substr(1);\\n _positive = false;\\n } else {\\n _positive = true;\\n }\\n while (s.size() > 0) {\\n int i = NUMERAL.find(s.back());\\n _digit.emplace_back(i);\\n s.pop_back();\\n }\\n }\\n // コピーコンストラクタ\\n BigDecimal(const BigDecimal& x)\\n : _digit(x._digit.size()), _positive(x._positive) {\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] = x._digit[i];\\n }\\n }\\n\\n // 比較演算子\\n bool operator==(const BigDecimal& x) const {\\n if (this->_positive != x._positive) return false;\\n if (this->_digit.size() != x._digit.size()) return false;\\n for (int i = 0; i < this->_digit.size(); ++i) {\\n if (this->_digit[i] != x._digit[i]) return false;\\n }\\n return true;\\n }\\n bool operator!=(const BigDecimal& x) const { return !(*this == x); }\\n bool operator<(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) < 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) > 0;\\n }\\n }\\n bool operator>(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) > 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) < 0;\\n }\\n }\\n bool operator<=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) <= 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) >= 0;\\n }\\n }\\n bool operator>=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) >= 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) <= 0;\\n }\\n }\\n\\n // 単項演算子\\n BigDecimal operator+() const { return *this; }\\n BigDecimal operator-() const {\\n BigDecimal ret = *this;\\n ret._positive = !ret._positive;\\n return ret;\\n }\\n // 複号代入演算子\\n BigDecimal& operator+=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて引き算に\\n if (this->_positive != x._positive) {\\n return *this -= (-x);\\n }\\n // 符号が同じ物にのみ足し算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] += x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator-=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて足し算に\\n if (this->_positive != x._positive) {\\n return *this += (-x);\\n }\\n // 符号が同じ物にのみ引き算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] -= x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator*=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator/=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator%=(const BigDecimal& x) { return *this; }\\n\\n // 二項演算子\\n BigDecimal operator+(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret += x);\\n }\\n BigDecimal operator-(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret -= x);\\n }\\n BigDecimal operator*(const BigDecimal& x) const {\\n return Karatsuba(*this, x);\\n }\\n BigDecimal operator/(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret /= x);\\n }\\n BigDecimal operator%(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret %= x);\\n }\\n\\n // キャスト\\n operator std::string() const {\\n std::string ret = \\\"\\\";\\n for (const auto& c : _digit) {\\n ret = NUMERAL.at(c) + ret;\\n }\\n if (!_positive) ret = \\\"-\\\" + ret;\\n return ret;\\n }\\n};\\n\\nint main() {\\n std::string A, B;\\n std::cin >> A >> B;\\n BigDecimal<10> a(A), b(B);\\n std::cout << std::string(a-b) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 5128,\n \"score_of_the_acc\": -0.1484,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_9478646\",\n \"code_snippet\": \"#include <iostream>\\n#include <list>\\n#include <string>\\n#define Nm 0\\n#define nM 1\\n#define NM 2\\nusing namespace std;\\n\\n// グローバル変数\\nlist<int> n, m, result;\\nint x = 0;\\nint nminus = 0, mminus = 1;\\n\\n// 1つ目の数値を入力する関数\\nvoid inputN() {\\n string N;\\n cin >> N;\\n if (N[0] == '-') nminus = 1; // 負数の場合\\n for (int i = nminus; i < N.length(); i++) {\\n n.push_front(N[i] - '0'); // 数値をリストに追加\\n }\\n}\\n\\n// 2つ目の数値を入力する関数\\nvoid inputM() {\\n string M;\\n cin >> M;\\n if (M[0] == '-') mminus = 0; // 負数の場合\\n for (int i = 1 - mminus; i < M.length(); i++) {\\n m.push_front(M[i] - '0'); // 数値をリストに追加\\n }\\n}\\n\\n// 足し算を行う関数\\nvoid computeplus(list<int> *n, list<int> *m) {\\n if ((*n).empty() && (*m).empty()) {\\n if (x == 0) return;\\n else {\\n result.push_front(1);\\n return;\\n }\\n }\\n if ((*n).empty()) {\\n result.push_front((*((*m).begin()) + x) % 10);\\n x = (*((*m).begin()) + x) / 10;\\n (*m).pop_front();\\n computeplus(n, m);\\n return;\\n }\\n if ((*m).empty()) {\\n result.push_front((*((*n).begin()) + x) % 10);\\n x = (*((*n).begin()) + x) / 10;\\n (*n).pop_front();\\n computeplus(n, m);\\n return;\\n }\\n result.push_front((*((*n).begin()) + *((*m).begin()) + x) % 10);\\n x = ((*((*n).begin()) + *((*m).begin()) + x) / 10);\\n (*n).pop_front();\\n (*m).pop_front();\\n computeplus(n, m);\\n return;\\n}\\n\\n// 数値の大小を比較する関数\\nint compare(list<int> n, list<int> m) {\\n if (n.size() > m.size()) return Nm;\\n if (n.size() < m.size()) return nM;\\n auto itn = n.end();\\n auto itm = m.end();\\n for (; itn != n.begin();) {\\n itn--;\\n itm--;\\n if (*itn == *itm) continue;\\n if (*itn > *itm) return Nm;\\n if (*itn < *itm) return nM;\\n }\\n return NM;\\n}\\n\\n// 引き算を行う関数\\nvoid computeminus(list<int> *n, list<int> *m) {\\n if ((*n).empty() && (*m).empty()) return;\\n if ((*m).empty()) {\\n if ((*((*n).begin()) - x) >= 0) {\\n result.push_front((*((*n).begin()) - x));\\n x = 0;\\n (*n).pop_front();\\n computeminus(n, m);\\n return;\\n } else {\\n result.push_front((*((*n).begin()) - x) + 10);\\n x = 1;\\n (*n).pop_front();\\n computeminus(n, m);\\n return;\\n }\\n }\\n if ((*((*n).begin()) - *((*m).begin()) - x) >= 0) {\\n result.push_front((*((*n).begin()) - *((*m).begin()) - x));\\n x = 0;\\n (*n).pop_front();\\n (*m).pop_front();\\n computeminus(n, m);\\n return;\\n } else {\\n result.push_front((*((*n).begin()) - *((*m).begin()) - x) + 10);\\n x = 1;\\n (*n).pop_front();\\n (*m).pop_front();\\n computeminus(n, m);\\n return;\\n }\\n}\\n\\n// 先頭の0を削除する関数\\nvoid eliminateO() {\\n while (*(result.begin()) == 0 && result.size() > 1) {\\n result.pop_front();\\n }\\n return;\\n}\\n\\nint main(void) {\\n inputN();\\n inputM();\\n if (nminus == 0 && mminus == 0) computeplus(&n, &m);\\n if (nminus == 1 && mminus == 1) {\\n computeplus(&n, &m);\\n cout << \\\"-\\\";\\n }\\n if (nminus == 0 && mminus == 1) {\\n if (compare(n, m) == NM) {\\n cout << 0 << endl;\\n return 0;\\n } else if (compare(n, m) == Nm) {\\n computeminus(&n, &m);\\n eliminateO();\\n } else if (compare(n, m) == nM) {\\n computeminus(&m, &n);\\n eliminateO();\\n cout << \\\"-\\\";\\n }\\n }\\n if (nminus == 1 && mminus == 0) {\\n if (compare(n, m) == NM) {\\n cout << 0 << endl;\\n return 0;\\n } else if (compare(n, m) == Nm) {\\n computeminus(&n, &m);\\n eliminateO();\\n cout << \\\"-\\\";\\n } else if (compare(n, m) == nM) {\\n computeminus(&m, &n);\\n eliminateO();\\n }\\n }\\n while (!(result.empty())) {\\n cout << *(result.begin());\\n result.pop_front();\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 15940,\n \"score_of_the_acc\": -0.1462,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_9288522\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n\\nint main() {\\n boost::multiprecision::cpp_int a, b;\\n cin >> a >> b;\\n cout << a - b << '\\\\n' \\n ;return 0;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_8219549\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nint main() {\\n std::string rawA, rawB;\\n std::cin >> rawA >> rawB;\\n\\n int fa = 1, fb = 1;\\n std::string A = rawA, B = rawB;\\n\\n if (B[0] == '-') {\\n B.erase(0, 1);\\n } else {\\n B = \\\"-\\\" + B;\\n }\\n\\n if (A[0] == '-') {\\n fa = -1;\\n A.erase(0, 1);\\n }\\n if (B[0] == '-') {\\n fb = -1;\\n B.erase(0, 1);\\n }\\n // std::cout << A << \\\" , \\\" << B << std::endl;\\n\\n bool is_swap = A.size() < B.size();\\n if (A.size() == B.size()) {\\n for (int i = 0; i < A.size(); i++) {\\n if (A[i] == B[i]) {\\n continue;\\n }\\n is_swap = A[i] < B[i];\\n break;\\n }\\n }\\n\\n if (is_swap) {\\n std::swap(A, B);\\n std::swap(fa, fb);\\n std::swap(rawA, rawB);\\n }\\n\\n int diff = (A.size() - B.size());\\n for (int i = 0; i < diff; i++) {\\n B = '0' + B;\\n }\\n\\n int f = fa * fb;\\n int next = 0;\\n std::string s = \\\"\\\";\\n // std::cout << A << std::endl;\\n // std::cout << B << std::endl;\\n for (int i = 1; i <= A.size(); i++) {\\n int val = A[A.size() - i] - '0' + f * (B[B.size() - i] - '0') + next;\\n if (val > 9) {\\n next = 1;\\n val -= 10;\\n } else if (val < 0) {\\n next = -1;\\n val += 10;\\n } else {\\n next = 0;\\n }\\n s = std::to_string(val) + s;\\n }\\n if (next != 0) {\\n s = \\\"1\\\" + s;\\n }\\n\\n while (s.size() > 1 && s[0] == '0') {\\n s.erase(0, 1);\\n }\\n\\n if (s != \\\"0\\\" && fa < 0) {\\n s = \\\"-\\\" + s;\\n }\\n\\n std::cout << s << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 4164,\n \"score_of_the_acc\": -0.3847,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_7680380\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iomanip>\\n#include <iostream>\\n\\nusing namespace std;\\n\\ntypedef unsigned long long u64;\\ntypedef __uint128_t u128;\\n\\nstruct bignum {\\n u64 a[30005];\\n int n;\\n\\n int ctz() const {\\n for (int i = 0;; i++) {\\n if (a[i]) {\\n return i << 6 | __builtin_ctzll(a[i]);\\n }\\n }\\n }\\n\\n int lg() const {\\n return n << 6 | __lg(a[n]);\\n }\\n\\n bool operator<(const bignum &b) const {\\n if (n != b.n) {\\n return n < b.n;\\n }\\n for (int i = n; i != -1; i--) {\\n if (a[i] < b.a[i]) {\\n return 1;\\n }\\n if (a[i] > b.a[i]) {\\n return 0;\\n }\\n }\\n return 0;\\n }\\n\\n bool operator>(const bignum &b) const {\\n return b < *this;\\n }\\n\\n bool operator<=(const bignum &b) const {\\n return !(b < *this);\\n }\\n\\n bool operator>=(const bignum &b) const {\\n return !(*this < b);\\n }\\n\\n bool operator==(const bignum &b) const {\\n if (n != b.n) {\\n return 0;\\n }\\n for (int i = 0; i <= n; i++) {\\n if (a[i] != b.a[i]) {\\n return 0;\\n }\\n }\\n return 1;\\n }\\n\\n bool operator!=(const bignum &b) const {\\n return !(*this == b);\\n }\\n\\n bignum operator+(u64 x) const {\\n bignum c = *this;\\n int l = c.n;\\n\\n c.a[0] += x;\\n\\n bool o = c.a[0] < a[0];\\n if (o) {\\n for (int i = 1; i <= l; i++) {\\n if (a[i] == (u64)-1) {\\n c.a[i] = 0;\\n } else {\\n c.a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n c.a[++l] = 1;\\n }\\n }\\n c.n = l;\\n return c;\\n }\\n\\n bignum operator-(u64 x) const {\\n bignum c = *this;\\n int l = c.n;\\n\\n c.a[0] -= x;\\n\\n bool o = c.a[0] > a[0];\\n if (o) {\\n for (int i = 1; i <= l; i++) {\\n if (!a[i]) {\\n c.a[i] = -1;\\n } else {\\n c.a[i]--;\\n break;\\n }\\n }\\n while (l && !c.a[l]) {\\n l--;\\n c.n--;\\n }\\n }\\n return c;\\n }\\n\\n bignum operator*(u64 x) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int l = n;\\n u128 ad = 0;\\n\\n for (int i = 0; i <= l; i++) {\\n ad += (u128)a[i] * x;\\n c.a[i] = ad, ad >>= 64;\\n }\\n\\n if (ad) {\\n c.a[++l] = ad;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator/(int m) const {\\n if (m == 1) {\\n return *this;\\n }\\n\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int l = n;\\n int r = 0;\\n\\n for (int i = l; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n c.a[i] = r * b + q, r = gu;\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n int operator%(int m) const {\\n if (m == 1) {\\n return 0;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n int r = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n r = v - q * m;\\n if (r >= m) {\\n r -= m;\\n }\\n }\\n\\n return r;\\n }\\n\\n bignum operator+(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n bool o = 0;\\n int l = max(n, b.n);\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = a[i] + b.a[i] + o;\\n o = (c.a[i] < a[i]) || (b.a[i] == (u64)-1 && o);\\n }\\n if (o) {\\n c.a[++l] = 1;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator-(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n bool o = 0;\\n int l = n;\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = a[i] - b.a[i] - o;\\n o = (c.a[i] > a[i]) || (b.a[i] == (u64)-1 && o);\\n }\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator*(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n u128 r = 0;\\n int l = n + b.n;\\n for (int i = 0; i <= n + b.n; i++) {\\n u128 h = 0;\\n\\n for (int j = max(0, i - b.n); j <= min(i, n); j++) {\\n u128 tp = (u128)a[j] * b.a[i - j];\\n r += tp & ((u64)-1), h += tp >> 64;\\n }\\n\\n c.a[i] = r;\\n r = h + (r >> 64);\\n }\\n if (r) {\\n c.a[++l] = r;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator/(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int n = lg(), m = b.lg();\\n if (n < m) {\\n return c;\\n }\\n\\n bignum tp = *this, qwq = b << (n - m);\\n int l = 0;\\n for (int i = n - m; i != -1; i--, qwq >>= 1) {\\n if (tp >= qwq) {\\n tp -= qwq;\\n c.a[i >> 6] |= 1ull << (i & 63);\\n if (!l) {\\n l = i;\\n }\\n }\\n }\\n\\n c.n = l >> 6;\\n return c;\\n }\\n\\n bignum operator%(const bignum &b) const {\\n bignum c = *this;\\n\\n int n = lg(), m = b.lg();\\n if (n < m) {\\n return c;\\n }\\n\\n bignum tp = b << (n - m);\\n for (int i = n; i >= m; i--, tp >>= 1) {\\n if (c >= tp) {\\n c -= tp;\\n }\\n }\\n\\n return c;\\n }\\n\\n bignum operator+=(u64 x) {\\n u64 tp = a[0];\\n a[0] += x;\\n bool o = a[0] < tp;\\n\\n if (o) {\\n for (int i = 1; i <= n; i++) {\\n if (a[i] == (u64)-1) {\\n a[i] = 0;\\n } else {\\n a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n a[++n] = 1;\\n }\\n }\\n return *this;\\n }\\n\\n bignum operator-=(u64 x) {\\n u64 tp = a[0];\\n a[0] -= x;\\n bool o = a[0] > tp;\\n\\n if (o) {\\n for (int i = 1; i <= n; i++) {\\n if (!a[i]) {\\n a[i] = -1;\\n } else {\\n a[i]--;\\n break;\\n }\\n }\\n while (n && !a[n]) {\\n n--;\\n }\\n }\\n return *this;\\n }\\n\\n bignum operator*=(u64 x) {\\n u128 ad = 0;\\n\\n for (int i = 0; i <= n; i++) {\\n ad += (u128)a[i] * x;\\n a[i] = ad, ad >>= 64;\\n }\\n\\n if (ad) {\\n a[++n] = ad;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator/=(int m) {\\n if (m == 1) {\\n return *this;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int r = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n a[i] = r * b + q, r = gu;\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator+=(const bignum &b) {\\n bool o = 0;\\n int l = max(n, b.n);\\n for (int i = 0; i <= l; i++) {\\n u64 tp = a[i];\\n a[i] += b.a[i] + o;\\n o = (a[i] < tp) || (b.a[i] == (u64)-1 && o);\\n }\\n if (o) {\\n a[++l] = 1;\\n }\\n n = l;\\n\\n return *this;\\n }\\n\\n bignum operator-=(const bignum &b) {\\n bool o = 0;\\n int l = n;\\n for (int i = 0; i <= l; i++) {\\n u64 tp = a[i];\\n a[i] -= b.a[i] + o;\\n o = (a[i] > tp) || (b.a[i] == (u64)-1 && o);\\n }\\n while (l && !a[l]) {\\n l--;\\n }\\n n = l;\\n\\n return *this;\\n }\\n\\n bignum operator*=(const bignum &b) {\\n return *this = *this * b;\\n }\\n\\n bignum operator/=(const bignum &b) {\\n return *this = *this / b;\\n }\\n\\n bignum operator%=(const bignum &b) {\\n return *this = *this % b;\\n }\\n\\n bignum operator<<(int k) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int t = k >> 6;\\n memcpy(c.a + t, a, (n + 1) << 3);\\n int l = n + t;\\n\\n t = k & 63;\\n if (t) {\\n for (int i = l + 1; i; i--) {\\n c.a[i] = (c.a[i] << t) | (c.a[i - 1] >> (64 - t));\\n }\\n c.a[0] <<= t;\\n\\n if (c.a[l + 1]) {\\n l++;\\n }\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator>>(int k) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int t = k >> 6;\\n if (t > n) {\\n return c;\\n }\\n\\n memcpy(c.a, a + t, (n - t + 1) << 3);\\n\\n int l = n - t;\\n t = k & 63;\\n\\n if (t) {\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = (c.a[i] >> t) | (c.a[i + 1] << (64 - t));\\n }\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator&(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] &= b.a[i];\\n }\\n for (int i = b.n + 1; i <= c.n; i++) {\\n c.a[i] = 0;\\n }\\n\\n int l = c.n;\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator|(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] |= b.a[i];\\n }\\n c.n = max(c.n, b.n);\\n\\n return c;\\n }\\n\\n bignum operator^(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] ^= b.a[i];\\n }\\n\\n int l = max(c.n, b.n);\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator<<=(int k) {\\n int t = k >> 6;\\n\\n if (t) {\\n for (int i = n; i != -1; i--) {\\n a[i + t] = a[i];\\n }\\n memset(a, 0, t << 3);\\n }\\n n += t;\\n\\n t = k & 63;\\n\\n if (t) {\\n for (int i = n + 1; i; i--) {\\n a[i] = (a[i] << t) | (a[i - 1] >> (64 - t));\\n }\\n a[0] <<= t;\\n }\\n\\n if (a[n + 1]) {\\n n++;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator>>=(int k) {\\n int t = k >> 6;\\n\\n if (t > n) {\\n memset(a, 0, (n + 1) << 3);\\n n = 0;\\n return *this;\\n }\\n\\n for (int i = t; i <= n; i++) {\\n a[i - t] = a[i];\\n }\\n memset(a + n - t + 1, 0, t << 3);\\n n -= t;\\n\\n t = k & 63;\\n\\n if (t) {\\n for (int i = 0; i <= n; i++) {\\n a[i] = (a[i] >> t) | (a[i + 1] << (64 - t));\\n }\\n }\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator&=(const bignum &b) {\\n for (int i = 0; i <= b.n; i++) {\\n a[i] &= b.a[i];\\n }\\n for (int i = b.n + 1; i <= n; i++) {\\n a[i] = 0;\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator|=(const bignum &b) {\\n for (int i = 0; i <= b.n; i++) {\\n a[i] |= b.a[i];\\n }\\n n = max(n, b.n);\\n\\n return *this;\\n }\\n\\n bignum operator^=(const bignum &b) {\\n n = max(n, b.n);\\n for (int i = 0; i <= b.n; i++) {\\n a[i] ^= b.a[i];\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n};\\n\\nbool oa, ob;\\n\\nbignum read_bignum(bool &o) {\\n static char str[100005];\\n static u64 a[10005];\\n static u64 bs = 1000000000000000000ll;\\n\\n cin >> str;\\n int n = strlen(str);\\n if (str[0] == '-') {\\n o = 1;\\n n--;\\n for (int i = 0; i != n; i++) {\\n str[i] = str[i + 1];\\n }\\n }\\n reverse(str, str + n);\\n\\n for (int i = 0; i <= (n - 1) / 18; i++) {\\n u64 v = 0;\\n for (int j = min(n, (i + 1) * 18) - 1; j >= i * 18; j--) {\\n v = v * 10 + str[j] - '0';\\n }\\n a[i] = v;\\n }\\n n = (n - 1) / 18;\\n\\n bignum c;\\n memset(&c, 0, sizeof c);\\n int m = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 ad = 0;\\n for (int j = 0; j <= m; j++) {\\n ad += (u128)c.a[j] * bs;\\n c.a[j] = ad, ad >>= 64;\\n }\\n\\n while (ad) {\\n c.a[++m] = ad, ad >>= 64;\\n }\\n c.n = m;\\n\\n c += a[i], m = c.n;\\n }\\n\\n return c;\\n}\\n\\nvoid output(bignum a) {\\n static u64 v[30005];\\n const u64 bs = 1000000000000000000ll;\\n\\n int n = a.n, m = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 ad = 0;\\n for (int j = 0; j <= m; j++) {\\n ad += (u128)v[j] << 64;\\n u128 gu = ad / bs;\\n v[j] = ad - gu * bs, ad = gu;\\n }\\n\\n while (ad) {\\n u128 gu = ad / bs;\\n v[++m] = ad - gu * bs, ad = gu;\\n }\\n\\n ad = a.a[i];\\n for (int j = 0; j <= m && ad; j++) {\\n ad += v[j];\\n u128 gu = ad / bs;\\n v[j] = ad - gu * bs, ad = gu;\\n }\\n while (ad) {\\n u128 gu = ad / bs;\\n v[++m] = ad - gu * bs, ad = gu;\\n }\\n }\\n\\n cout << v[m];\\n for (int i = m - 1; i != -1; i--) {\\n cout << setw(18) << setfill('0') << v[i];\\n }\\n memset(v, 0, sizeof v);\\n}\\n\\nbignum updiv(bignum &a, int m) {\\n static bignum c;\\n memset(&c, 0, sizeof c);\\n\\n if (m == 1) {\\n return a;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int l = a.n;\\n int r = 0;\\n\\n for (int i = l; i != -1; i--) {\\n u128 v = (u128)r * rr + a.a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n c.a[i] = r * b + q, r = gu;\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n if (r) {\\n bool o = 1;\\n for (int i = 0; i <= l; i++) {\\n if (c.a[i] == (u64)-1) {\\n c.a[i] = 0;\\n } else {\\n c.a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n c.a[++l] = 1;\\n }\\n }\\n\\n c.n = l;\\n\\n return c;\\n}\\n\\nbignum gcd(bignum a, bignum b) {\\n if (a > b) {\\n swap(a, b);\\n }\\n\\n if (a.n == 0 && !a.a[0]) {\\n return b;\\n }\\n\\n int l = min(a.ctz(), b.ctz());\\n a >>= a.ctz(), b >>= b.ctz();\\n\\n while (1) {\\n if (a.n == 0 && !a.a[0]) {\\n return b << l;\\n }\\n\\n if (!(a.a[0] & 1)) {\\n a >>= 1;\\n } else if (!(b.a[0] & 1)) {\\n b >>= 1;\\n } else {\\n if (a < b) {\\n swap(a, b);\\n }\\n a -= b;\\n }\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n\\n bignum a = read_bignum(oa), b = read_bignum(ob);\\n ob ^= 1;\\n if (oa && ob) {\\n cout << '-';\\n oa = ob = 0;\\n }\\n\\n if (oa == 0 && ob == 0) {\\n output(a + b);\\n cout << endl;\\n return 0;\\n }\\n\\n if (oa) {\\n swap(a, b);\\n }\\n\\n if (a >= b) {\\n output(a - b);\\n cout << endl;\\n } else {\\n cout << '-';\\n output(b - a);\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 5028,\n \"score_of_the_acc\": -0.4517,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_7593487\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#include <boost/multiprecision/cpp_int.hpp>\\n\\nsigned main() {\\n boost::multiprecision::cpp_int A, B;\\n cin >> A >> B;\\n cout << A - B << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -1.0005,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_7525128\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\\n#define pb push_back\\n#define f first\\n#define s second\\n\\nusing namespace std;\\ntypedef pair <int,int> pii;\\n\\nconst int maxn = 1e5 + 5;\\n\\nstring t(string a,string b)\\n{\\n string c = \\\"\\\";\\n int n1 = a.size();\\n int n2 = b.size();\\n if(n1 > n2) forr(i,1,n1 - n2) b = \\\"0\\\" + b;\\n if(n1 < n2)\\n {\\n forr(i,1,n2 - n1) a = \\\"0\\\" + a;\\n n1 = n2;\\n }\\n int nho = 0;\\n forw(i,n1 - 1,0)\\n {\\n int res = a[i] - '0' + b[i] - '0' + nho;\\n if(res > 9) nho = 1;\\n else nho = 0;\\n c = char(res%10 + 48) + c;\\n }\\n if(nho == 1) c = \\\"1\\\" + c;\\n return c;\\n}\\n\\nstring h(string a,string b)\\n{\\n string c = \\\"\\\";\\n int n1 = a.size();\\n int n2 = b.size();\\n if(n2 < n1) forr(i,1,n1 - n2) b = \\\"0\\\" + b;\\n int nho = 0;\\n forw(i,n1 - 1,0)\\n {\\n int res = a[i] - '0' - (b[i] - '0') - nho;\\n if(res < 0) nho = 1;\\n else nho = 0;\\n if(res < 0) c = char(res + 10 + 48) + c;\\n else c = char(res + 48) + c;\\n }\\n while(c.size() > 1 && c[0] == '0') c.erase(0,1);\\n return c;\\n}\\n\\nstring a,b;\\n\\nint main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n cin >> a >> b;\\n if(a[0] != '-')\\n {\\n if(b[0] != '-')\\n {\\n if(a.size() > b.size() || (a.size() == b.size() && a >= b))\\n {\\n cout << h(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else\\n {\\n cout << \\\"-\\\" << h(b,a) << \\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n else /// -> a + b;\\n {\\n b.erase(0,1);\\n cout << t(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n else\\n {\\n if(b[0] != '-') /// - a - b = - (a + b);\\n {\\n a.erase(0,1);\\n cout << \\\"-\\\" << t(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else /// - a + b -> b - a\\n {\\n a.erase(0,1);\\n b.erase(0,1);\\n if(a.size() < b.size() || (a.size() == b.size() && a <= b))\\n {\\n cout << h(b,a) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else\\n {\\n cout << \\\"-\\\" << h(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -0.3539,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_7338656\",\n \"code_snippet\": \"#line 2 \\\"nachia\\\\\\\\math-modulo\\\\\\\\modulo-primitive-root.hpp\\\"\\n#include <vector>\\n#include <utility>\\n\\nnamespace nachia{\\n\\ntemplate<unsigned int MOD>\\nstruct PrimitiveRoot{\\n using u64 = unsigned long long;\\n static constexpr u64 powm(u64 a, u64 i) {\\n u64 res = 1, aa = a;\\n while(i){\\n if(i & 1) res = res * aa % MOD;\\n aa = aa * aa % MOD;\\n i /= 2;\\n }\\n return res;\\n }\\n static constexpr bool ExamineVal(unsigned int g){\\n unsigned int t = MOD - 1;\\n for(u64 d=2; d*d<=t; d++) if(t % d == 0){\\n if(powm(g, (MOD - 1) / d) == 1) return false;\\n while(t % d == 0) t /= d;\\n }\\n if(t != 1) if(powm(g, (MOD - 1) / t) == 1) return false;\\n return true;\\n }\\n static constexpr unsigned int GetVal(){\\n for(unsigned int x=2; x<MOD; x++) if(ExamineVal(x)) return x;\\n return 0;\\n }\\n static const unsigned int val = GetVal();\\n};\\n\\n} // namespace nachia\\n#line 1 \\\"nachia\\\\\\\\fps\\\\\\\\ntt-interface.hpp\\\"\\n#include <algorithm>\\n\\nnamespace nachia {\\n\\ntemplate<class mint>\\nstruct NttInterface{\\n\\ntemplate<class Iter>\\nvoid Butterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid IButterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid BitReversal(Iter a, int N) const {\\n for(int i=0, j=0; j<N; j++){\\n if(i < j) std::swap(a[i], a[j]);\\n for(int k = N>>1; k > (i^=k); k>>=1);\\n }\\n}\\n\\n};\\n\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\misc\\\\\\\\bit-operations.hpp\\\"\\n\\nnamespace nachia{\\n\\nint Popcount(unsigned long long c) noexcept {\\n#ifdef __GNUC__\\n return __builtin_popcountll(c);\\n#else\\n c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));\\n c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));\\n c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));\\n c = (c * (~0ull/257)) >> 56;\\n return c;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint MsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return 63 - __builtin_clzll(x);\\n#else\\n int res = 0;\\n for(int d=32; d>0; d>>=1) if(x >> d){ res |= d; x >>= d; }\\n return res;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint LsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return __builtin_ctzll(x);\\n#else\\n return MsbIndex(x & -x);\\n#endif\\n}\\n\\n}\\n\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <iterator>\\n#include <cassert>\\n#line 8 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <array>\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nconstexpr int bsf_constexpr(unsigned int n) {\\n\\tint x = 0;\\n\\twhile (!(n & (1 << x))) x++;\\n\\treturn x;\\n}\\n\\ntemplate <class mint>\\nstruct NttFromAcl : NttInterface<mint> {\\n\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\n \\nstatic int ceil_pow2(int n) {\\n\\tint x = 0;\\n\\twhile ((1U << x) < (u32)(n)) x++;\\n\\treturn x;\\n}\\n\\nstruct fft_info {\\n\\tstatic constexpr u32 g = nachia::PrimitiveRoot<mint::GetMod()>::val;\\n\\tstatic constexpr int rank2 = bsf_constexpr(mint::GetMod()-1);\\n\\tstd::array<mint, rank2+1> root;\\n\\tstd::array<mint, rank2+1> iroot;\\n\\n\\tstd::array<mint, std::max(0, rank2-1)> rate2;\\n\\tstd::array<mint, std::max(0, rank2-1)> irate2;\\n\\n\\tstd::array<mint, std::max(0, rank2-2)> rate3;\\n\\tstd::array<mint, std::max(0, rank2-2)> irate3;\\n\\n\\tfft_info(){\\n\\t\\troot[rank2] = mint(g).pow((mint::GetMod() - 1) >> rank2);\\n\\t\\tiroot[rank2] = root[rank2].inv();\\n\\t\\tfor(int i=rank2-1; i>=0; i--){\\n\\t\\t\\troot[i] = root[i+1] * root[i+1];\\n\\t\\t\\tiroot[i] = iroot[i+1] * iroot[i+1];\\n\\t\\t}\\n\\t\\tmint prod = 1u, iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-2; i++){\\n\\t\\t\\trate2[i] = root[i+2] * prod;\\n\\t\\t\\tirate2[i] = iroot[i+2] * iprod;\\n\\t\\t\\tprod *= iroot[i+2];\\n\\t\\t\\tiprod *= root[i+2];\\n\\t\\t}\\n\\t\\tprod = 1u; iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-3; i++){\\n\\t\\t\\trate3[i] = root[i+3] * prod;\\n\\t\\t\\tirate3[i] = iroot[i+3] * iprod;\\n\\t\\t\\tprod *= iroot[i+3];\\n\\t\\t\\tiprod *= root[i+3];\\n\\t\\t}\\n\\t}\\n};\\n\\ntemplate<class RandomAccessIterator>\\nvoid Butterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = 0;\\n\\twhile(len < h){\\n\\t\\tif(h-len == 1){\\n\\t\\t\\tint p = 1 << (h-len-1);\\n\\t\\t\\tmint rot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = l-r;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen++;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len-2);\\n\\t\\t\\tmint rot = 1u, imag = info.root[2];\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tmint rot2 = rot * rot;\\n\\t\\t\\t\\tmint rot3 = rot2 * rot;\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p] * rot2;\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p] * rot3;\\n\\t\\t\\t\\t\\tauto a0a2 = a0 + a2;\\n\\t\\t\\t\\t\\tauto a0b2 = a0 - a2;\\n\\t\\t\\t\\t\\tauto a1a3 = a1 + a3;\\n\\t\\t\\t\\t\\tauto a1na3imag = (a1 - a3) * imag;\\n\\t\\t\\t\\t\\ta[i+offset] = a0a2 + a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = a0a2 - a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = a0b2 + a1na3imag;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = a0b2 - a1na3imag;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen += 2;\\n\\t\\t}\\n\\t}\\n}\\n\\ntemplate<class RandomAccessIterator>\\nvoid IButterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = h;\\n\\twhile(len){\\n\\t\\tif(len == 1){\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<(len-1)); s++){\\n\\t\\t\\t\\tint offset = s << (h-len+1);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p];\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = (l-r)*irot;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-1))) irot *= info.irate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen--;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u, iimag = info.iroot[2];\\n\\t\\t\\tfor(int s=0; s<(1<<(len-2)); s++){\\n\\t\\t\\t\\tmint irot2 = irot * irot;\\n\\t\\t\\t\\tmint irot3 = irot2 * irot;\\n\\t\\t\\t\\tint offset = s << (h-len+2);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset+0*p];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+1*p];\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p];\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p];\\n\\t\\t\\t\\t\\tauto a0a1 = a0 + a1;\\n\\t\\t\\t\\t\\tauto a0b1 = a0 - a1;\\n\\t\\t\\t\\t\\tauto a2a3 = a2 + a3;\\n\\t\\t\\t\\t\\tauto a2na3iimag = (a2 - a3) * iimag;\\n\\n\\t\\t\\t\\t\\ta[i+offset] = a0a1 + a2a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = (a0b1 + a2na3iimag) * irot;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = (a0a1 - a2a3) * irot2;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = (a0b1 - a2na3iimag) * irot3;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-2))) irot *= info.irate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen -= 2;\\n\\t\\t}\\n\\t}\\n}\\n\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 3 \\\"nachia\\\\\\\\bigint\\\\\\\\static-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\ntemplate<unsigned int MxVal>\\nclass Montgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 u32inverse(u32 x){\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static constexpr u32 getMy(u32 mx){ return (-mx) % mx; }\\n static constexpr u32 powMod(u32 a, u32 i, u32 m){\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n static constexpr u32 Mx = MxVal;\\n static constexpr u32 iMx = u32inverse(Mx);\\n static constexpr u32 My1 = getMy(Mx);\\n static constexpr u32 My2 = powMod(getMy(Mx), 2, Mx);\\n static constexpr u32 My3 = powMod(getMy(Mx), 3, Mx);\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n static constexpr u32 red(u64 x){\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n};\\n\\ntemplate<unsigned int MOD>\\nclass StaticPModint{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\nprivate:\\n static constexpr u32 mod = MOD;\\n using Tool = Montgomery32Info<MOD>;\\n using MyType = StaticPModint;\\n u32 _v;\\n static MyType RAW(u32 v) { auto res = StaticPModint(); res._v = v; return res; }\\npublic:\\n StaticPModint() : _v(0) {}\\n StaticPModint(u32 v) : _v(Tool::red((u64)v * Tool::My2)) {}\\n StaticPModint(u64 v) : _v(Tool::red((u64)Tool::My3 * Tool::red(v))) {}\\n u32 val() const { return Tool::red(_v); }\\n u32 mrVal() const { return _v; }\\n MyType& operator-=(MyType r) { _v = _v - r._v + (_v < r._v ? mod : 0); return *this; }\\n MyType& operator+=(MyType r) { u32 t = mod - r._v; _v = _v - t + (_v < t ? mod : 0); return *this; }\\n MyType& operator*=(MyType r) { _v = Tool::red((u64)_v * r._v); return *this; }\\n MyType operator+(MyType r) const { auto v = *this; v += r; return v; }\\n MyType operator-(MyType r) const { auto v = *this; v -= r; return v; }\\n MyType operator*(MyType r) const { auto v = *this; v *= r; return v; }\\n MyType operator-() const { return RAW(_v ? mod - _v : (u32)0); }\\n MyType pow(unsigned long long i) const {\\n MyType x = *this, r = RAW(Tool::My1);\\n while(i){ if(i&1){ r *= x; } x*=x; i>>=1; }\\n return r;\\n }\\n MyType inv() const { return pow(mod-2); }\\n static constexpr u32 GetMod() { return mod; }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 2 \\\"nachia\\\\\\\\bigint\\\\\\\\dynamic-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nclass DynMontgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static u32 u32inverse(u32 x) {\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static u32 getMy(u32 mx) { return (-mx) % mx; }\\n static u32 powMod(u32 a, u32 i, u32 m) {\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n const u32 Mx;\\n const u32 iMx;\\n const u32 My1;\\n const u32 My2;\\n const u32 My3;\\n DynMontgomery32Info(u32 newMod)\\n : Mx(newMod)\\n , iMx(u32inverse(Mx))\\n , My1(getMy(Mx))\\n , My2((u64)My1 * My1 % Mx)\\n , My3((u64)My2 * My1 % Mx) {}\\n\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n u32 red(u64 x) const {\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n u32 add(u32 a, u32 b) const { b = Mx-b; return a - b + ((a < b) ? Mx : 0u); }\\n u32 sub(u32 a, u32 b) const { return a - b + ((a < b) ? Mx : 0u); }\\n u32 mul(u32 a, u32 b) const { return red((u64)a * b); }\\n u32 pow(u32 a, u32 i) const {\\n u32 x = a, r = My1;\\n while(i){ if(i&1){ r=mul(r,x); } x=mul(x,x); i>>=1; }\\n return r;\\n }\\n u32 inv(u32 a) const { return pow(a, Mx-2); }\\n u32 input64(u64 a) const { return mul(red(a), My3); }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\garner.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct GarnerU96{\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n std::vector<u32> mods;\\n std::vector<DynMontgomery32Info> dynmods;\\n std::vector<std::vector<u32>> table_coeff;\\n std::vector<u32> table_coeffinv;\\n\\n void precalc(std::vector<u32> new_mods){\\n mods = std::move(new_mods);\\n for(std::size_t i=0; i<mods.size(); i++) dynmods.emplace_back(mods[i]);\\n int nmods = mods.size();\\n table_coeff.assign(nmods+1, std::vector<u32>(nmods, 0));\\n for(int k=0; k<nmods; k++) table_coeff[0][k] = dynmods[k].My2;\\n for(int j=0; j<nmods; j++){\\n for(int k=0; k<nmods; k++) table_coeff[j+1][k] = table_coeff[j][k];\\n for(int k=j+1; k<nmods; k++) table_coeff[j+1][k] = dynmods[k].mul(table_coeff[j+1][k], dynmods[k].input64(mods[j]));\\n }\\n table_coeffinv.resize(nmods);\\n for(int i=0; i<nmods; i++) table_coeffinv[i] = dynmods[i].inv(table_coeff[i][i]);\\n }\\n\\n u64 calc(const std::vector<u32>& x){\\n int nmods = mods.size();\\n std::vector<u32> table_const(nmods);\\n u64 res = 0;\\n u64 res_coeff = 1;\\n for(int j=0; j<nmods; j++){\\n u32 t = dynmods[j].mul(dynmods[j].sub(x[j], table_const[j]), table_coeffinv[j]);\\n for(int k=j+1; k<nmods; k++){\\n table_const[k] = dynmods[k].add(dynmods[k].mul(t, table_coeff[j][k]), table_const[k]);\\n }\\n res += res_coeff * u64(t);\\n res_coeff *= mods[j];\\n }\\n return res;\\n }\\n\\n std::pair<std::vector<u32>, std::vector<u64>> calc(std::vector<std::vector<u32>> x){\\n int n = x[0].size(), m = x.size();\\n std::vector<u64> resl(n);\\n std::vector<u32> resh(n);\\n std::vector<u32> buf(m);\\n u32 inv64 = dynmods[0].inv(dynmods[0].mul(dynmods[0].My3, dynmods[0].My2));\\n for(int i=0; i<n; i++){\\n for(int j=0; j<m; j++) buf[j] = x[j][i];\\n resl[i] = calc(buf);\\n resh[i] = dynmods[0].mul(dynmods[0].sub(buf[0], dynmods[0].input64(resl[i])), inv64);\\n }\\n return std::make_pair(std::move(resh), std::move(resl));\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\convolution.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct MultiplySupply {\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 MODCNT = 3;\\n static constexpr u32 MOD[3] = { 3892314113, 3489660929, 3221225473 };\\n \\n GarnerU96 garner;\\n\\n MultiplySupply(){\\n garner.precalc(std::vector<u32>(MOD, MOD + MODCNT));\\n }\\n \\n template<unsigned int P>\\n static std::vector<u32> SubConvolution(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ) {\\n using Elem = StaticPModint<P>;\\n static NttFromAcl<Elem> ntt;\\n int z = a.size() + b.size() - 1;\\n int N = 1; while(N < z) N *= 2;\\n std::vector<Elem> A(N), B(N);\\n for(std::size_t i=0; i<a.size(); i++) A[i] = a[i];\\n for(std::size_t i=0; i<b.size(); i++) B[i] = b[i];\\n Elem iN = Elem((u32)N).inv();\\n ntt.Butterfly(A.begin(), N);\\n ntt.Butterfly(B.begin(), N);\\n for(int i=0; i<N; i++) A[i] = A[i] * B[i] * iN;\\n ntt.IButterfly(A.begin(), N);\\n std::vector<u32> res(z);\\n for(int i=0; i<z; i++) res[i] = A[i].mrVal();\\n return res;\\n }\\n \\n std::vector<u32> multiplyBin(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ){\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q = garner.calc(std::move(cx));\\n int n = q.first.size();\\n std::vector<u32> res(n + 2);\\n for(int i=0; i<n; i++) res[i] = q.second[i];\\n u64 c = 0;\\n for(int i=0; i<n; i++){ res[i+1] = c += (u64)res[i+1] + (q.second[i] >> 32); c >>= 32; }\\n res[n+1] = c; c = 0;\\n for(int i=0; i<n; i++){ res[i+2] = c += (u64)res[i+2] + q.first[i]; c >>= 32; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n \\n std::vector<u32> multiplyDec(\\n std::vector<u32> a,\\n std::vector<u32> b\\n ){\\n static constexpr u32 d = 1000000000;\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q0 = garner.calc(std::move(cx));\\n int n = q0.first.size();\\n std::vector<u64> buf(n + 2);\\n static constexpr u32 j11 = (1ull << 32) / d;\\n static constexpr u32 j10 = (-d) % d;\\n static constexpr u32 j22 = 1 + (0ull- 1ull * d * d) / d / d;\\n static constexpr u32 j21 = (-1ull * j22 * d * d) / d;\\n static constexpr u32 j20 = (0ull-d) % d;\\n for(int i=0; i<n; i++) buf[i] = q0.second[i] & ((1ull << 32) - 1);\\n for(int i=0; i<n; i++) buf[i] += 1ull * (q0.second[i] >> 32) * j10;\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * (q0.second[i] >> 32) * j11;\\n for(int i=0; i<n; i++) buf[i] += 1ull * q0.first[i] * j20; // q0.first[i] is small enough\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * q0.first[i] * j21;\\n for(int i=0; i<n; i++) buf[i+2] += 1ull * q0.first[i] * j22;\\n std::vector<u32> res(n + 2);\\n u64 c = 0;\\n for(int i=0; i<n+2; i++){ c += buf[i]; res[i] = c % d; c /= d; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\base-operators.hpp\\\"\\n#include <iostream>\\n\\nnamespace nachia {\\nnamespace bigint {\\n\\nclass UIntDec {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\nstatic constexpr u32 BASE = 1'000'000'000;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntDec() = default;\\nUIntDec(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntDec& operator+=(const UIntDec& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n if(c >= BASE){ x[i] = c - BASE; c = 1; }\\n else{ x[i] = c; c = 0; }\\n }\\n for(int i=b.x.size(); c; i++){\\n c += x[i];\\n if(c >= BASE){\\n x[i] = c - BASE;\\n c = 1;\\n } else {\\n x[i] = c;\\n c = 0;\\n break;\\n }\\n }\\n Regularize();\\n return *this;\\n}\\nUIntDec operator*(const UIntDec& b) const { return MultiplySupply().multiplyDec(x, b.x); }\\n\\nUIntDec Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulU32(unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ c += (u64)x[i] << 32; x[i] = c % BASE; c /= BASE; }\\n while(c){ x.push_back(c % BASE); c /= BASE; }\\n}\\n\\n};\\n\\nclass UIntBin {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntBin() = default;\\nUIntBin(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntBin& operator+=(const UIntBin& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n x[i] = c; c >>= 32;\\n }\\n for(int i=b.x.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n Regularize();\\n return *this;\\n}\\nUIntBin operator*(const UIntBin& b) const { return MultiplySupply().multiplyBin(x, b.x); }\\n\\nUIntBin Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulD(unsigned int d, unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ x[i] = (c += (u64)x[i] * d); c >>= 32; }\\n if(c) x.push_back(c);\\n}\\n\\n};\\n\\nstd::vector<unsigned int> DecToBin(std::string decstr){\\n std::vector<UIntBin> pdec;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntBin {\\n if(r - l <= 308){\\n UIntBin p;\\n for(int j=l; j<l+(r-l)%9; j++) p.mulD(10, decstr[j] - '0');\\n for(int j=l+(r-l)%9; j<r; j+=9) p.mulD(1000000000, std::stoi(decstr.substr(j, 9)));\\n return p;\\n }\\n if(pdec.empty()) pdec.push_back(UIntBin({10}).Pow(308));\\n int h = 0; while(((308*2)<<h) < r-l) h++;\\n while((int)pdec.size() < h+1) pdec.push_back(pdec.back() * pdec.back());\\n auto res = dfs(dfs, l, r-(308<<h)) * pdec[h];\\n res += dfs(dfs, r-(308<<h), r);\\n return res;\\n };\\n return std::move(dfs(dfs, 0, decstr.size()).x);\\n}\\n\\nstd::string BinToDec(std::vector<unsigned int> b){\\n while(!b.empty() && !b.back()) b.pop_back();\\n std::reverse(b.begin(), b.end());\\n if(b.empty()) return \\\"0\\\";\\n std::vector<UIntDec> pbin;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntDec {\\n if(r - l <= 29){\\n UIntDec p;\\n for(int j=l; j<r; j++) p.mulU32(b[j]);\\n return p;\\n }\\n if(pbin.empty()) pbin.push_back(UIntDec({2}).Pow(32*29));\\n int h = 0; while(((29*2)<<h) < r-l) h++;\\n while((int)pbin.size() < h+1) pbin.push_back(pbin.back() * pbin.back());\\n auto res = dfs(dfs, l, r-(29<<h)) * pbin[h];\\n res += dfs(dfs, r-(29<<h), r);\\n return res;\\n };\\n auto x = std::move(dfs(dfs, 0, b.size()).x);\\n while(!x.empty() && !x.back()) x.pop_back();\\n std::string res = std::to_string(x.back());\\n res.resize(res.size() + 9 * (int)(x.size()-1), '0');\\n for(int i=(int)x.size()-2; i>=0; i--){\\n int o = res.size() - i*9 - 9;\\n for(int j=o+8; j>=o; j--){ res[j] += x[i] % 10; x[i] /= 10; }\\n }\\n return res;\\n}\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\bigint\\\\\\\\integer.hpp\\\"\\n\\nnamespace nachia{\\n\\nclass UnsignedIntegerBin{\\npublic:\\n using MyType = UnsignedIntegerBin;\\n friend class SignedIntegerBin;\\nprivate:\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n std::vector<u32> x;\\n static inline bool Cflag;\\n static MyType FromVec(std::vector<u32> _x){ MyType res; res.x = std::move(_x); return res; }\\npublic:\\n UnsignedIntegerBin(){}\\n MyType operator>>(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() - h);\\n for(int i=h; i<size(); i++) res[i-h] = x[i] >> l;\\n if(l) for(int i=h+1; i<size(); i++) res[i-h-1] |= x[i] << (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType operator<<(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() + h + 1);\\n for(int i=0; i<size(); i++) res[i+h] = x[i] << l;\\n if(l) for(int i=0; i<size(); i++) res[i+h+1] |= x[i] >> (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType& operator>>=(int sh) { return (*this) = operator>>(sh); }\\n MyType& operator<<=(int sh) { return (*this) = operator<<(sh); }\\n MyType& operator%=(const MyType& d) { divInternal(d); return *this; }\\n MyType operator%(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType operator/(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType& operator/=(const MyType& d) { return (*this) = divInternal(d); }\\n MyType& operator+=(const MyType& v){\\n memreserve(std::max(size(), v.size()) + 1);\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){ x[i] = (c += (u64)x[i] + v[i]); c >>= 32; }\\n for(int i=v.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& v){\\n memreserve(std::max(size(), v.size()));\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){\\n c += v[i];\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n for(int i=v.size(); i<size() && c; i++){\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n Cflag = c;\\n if(c){ complement(); increment(); }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& v) const {\\n MyType res;\\n res.x = bigint::MultiplySupply().multiplyBin(x, v.x);\\n res.regularize();\\n return res;\\n }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) { auto p = *this; p -= r; return p; }\\n bool operator<(const MyType& r) const {\\n return (size() != r.size())\\n ? (size() < r.size())\\n : std::lexicographical_compare(x.rbegin(), x.rend(), r.x.rbegin(), r.x.rend());\\n }\\n bool operator>(const MyType& r) const { return r < (*this); }\\n bool operator<=(const MyType& r) const { return !(r < (*this)); }\\n bool operator>=(const MyType& r) const { return !operator<(r); }\\n bool operator==(const MyType& r) const { return x == r.x; }\\n bool operator!=(const MyType& r) const { return x != r.x; }\\n bool operator!() const { return size(); }\\n bool isZero() const { return size() == 0; }\\n std::string toStringBin() const {\\n std::string res;\\n for(int i=size()-1; i>=0; i--) for(int j=31; j>=0; j--) res.push_back('0' + (x[i]>>j) % 2);\\n return res;\\n }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n \\n //auto p = *this;\\n //std::string s;\\n //while(!p.isZero()) s.push_back('0' + p.div10());\\n //std::reverse(s.begin(), s.end());\\n //return s;\\n \\n return bigint::BinToDec(x);\\n }\\n static MyType FromStringDec(const std::string& s) {\\n return FromVec(bigint::DecToBin(s));\\n }\\n int lsb() const { for(int i=0; i<size(); i++){ if(x[i]) return nachia::LsbIndex(x[i]) + i * 32; } return -1; }\\n int msb() const { for(int i=size()-1; i>=0; i--){ if(x[i]) return nachia::MsbIndex(x[i]) + i * 32; } return -1; }\\nprivate:\\n int size() const { return x.size(); }\\n u32& operator[](int at) { return x[at]; }\\n u32 operator[](int at) const { return x[at]; }\\n void memreserve(int sz) { if((int)x.size() < sz) x.resize(sz); }\\n void setBit(int at, bool val){ memreserve(at/32+1); x[at/32] |= (u32)(val?1:0) << (at%32); regularize(); }\\n MyType divInternal(const MyType& d) {\\n if(d.isZero()) throw 1;\\n MyType res;\\n for(int s=(size()-d.size())*32+31; s>=0; s--){\\n MyType x = d << s;\\n if(operator>=(x)){\\n res.setBit(s, true); operator-=(x);\\n }\\n }\\n res.regularize();\\n return res;\\n }\\n void complement() { for(u32& y:x){ y = ~y; } }\\n void increment() { if(isZero()){ x = {1}; return; } int i=0; while(i < size() && !~x[i]){ x[i++]++; } if(i>=size()){ x.push_back(1); } else x[i]++; }\\n void decrement() { if(isZero()){ x = {1}; return; } int i=0; while(x[i]){ x[i++]--; } x[i]--; regularize(); }\\n void regularize() { while(!x.empty() && 0 == x.back()) x.pop_back(); }\\n int div10() {\\n u64 c = 0;\\n for(int i=size()-1; i>=0; i--){\\n c = (c << 32) | x[i];\\n x[i] = c / 10;\\n c %= 10;\\n }\\n regularize();\\n return c;\\n }\\n void mul10(int d) {\\n u64 c = d;\\n for(int i=0; i<size(); i++){ x[i] = (c += (u64)x[i] * 10); c >>= 32; }\\n if(c) x.push_back(c);\\n }\\n};\\n\\nclass SignedIntegerBin{\\n using MyType = SignedIntegerBin;\\n using UInt = UnsignedIntegerBin;\\nprivate:\\n UInt u;\\n int sign = 1;\\n void regularize(){ u.regularize(); if(u.isZero()) sign = 1; }\\n static MyType Raw(UInt u, int s){ MyType res; res.u = std::move(u); res.sign = s; res.regularize(); return res; }\\npublic:\\n bool isZero() const { return u.isZero(); }\\n MyType& operator+=(const MyType& r) {\\n if(sign == r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& r) {\\n if(sign != r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& r) const { return Raw(u*r.u, sign*r.sign); }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) const { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) const { auto p = *this; p -= r; return p; }\\n MyType operator-() const { return Raw(u, -sign); }\\n MyType& operator<<=(int sh) { u <<= sh; return *this; }\\n MyType& operator>>=(int sh) { u >>= sh; return *this; }\\n MyType operator<<(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator>>(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator/(const MyType& r) const { return Raw(u/r.u, sign*r.sign); }\\n MyType& operator/=(const MyType& r) { return (*this) = operator/(r); }\\n MyType operator%(const MyType& r) const { return Raw(u%r.u, sign*r.sign); }\\n MyType& operator%=(const MyType& r) { return (*this) = operator%(r); }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n return (sign>0 ? \\\"\\\" : \\\"-\\\") + u.toStringDec();\\n }\\n static MyType FromStringDec(const std::string& s) {\\n if(s.empty()) return MyType();\\n if(s[0] == '+') return Raw(UInt::FromStringDec(s.substr(1)), 1);\\n if(s[0] == '-') return Raw(UInt::FromStringDec(s.substr(1)), -1);\\n return Raw(UInt::FromStringDec(s), 1);\\n }\\n};\\n\\n} // namespace nachia\\n#line 2 \\\"Main.cpp\\\"\\n#include <cstdint>\\n#line 5 \\\"Main.cpp\\\"\\n#include <string>\\n#line 7 \\\"Main.cpp\\\"\\n\\n\\nint main() {\\n using Int = nachia::SignedIntegerBin;\\n std::string s;\\n std::cin >> s;\\n Int a = Int::FromStringDec(s);\\n std::cin >> s;\\n Int b = Int::FromStringDec(s);\\n Int c = a - b;\\n std::cout << c.toStringDec() << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4260,\n \"score_of_the_acc\": -0.0813,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6975959\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n // sizeの再計算\\n void resize(){\\n\\n size = 0;\\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- ){\\n if( dat[i][j] != 0 ){\\n size = i;\\n return;\\n }\\n }\\n }\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.minus = l.minus;\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l.minus & r.minus ){\\n if( l < r ){\\n l.minus = false;\\n r.minus = false;\\n res = l - r;\\n res.minus = true;\\n }\\n else{\\n l.minus = false;\\n r.minus = false;\\n res = r - l;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n }\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt diff = a - b;\\n diff.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 74116,\n \"score_of_the_acc\": -0.8161,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6975947\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n // sizeの再計算\\n void resize(){\\n\\n size = 0;\\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- ){\\n if( dat[i][j] != 0 ){\\n size = i;\\n return;\\n }\\n }\\n }\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.minus = l.minus;\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt diff = a - b;\\n diff.print();\\n\\n}\",\n \"accuracy\": 0.44,\n \"time_ms\": 60,\n \"memory_kb\": 74040,\n \"score_of_the_acc\": -0.8153,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6975935\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.size = ( up != 0 ? maxSize+1 : maxSize );\\n res.minus = l.minus;\\n }\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n res.size = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= res.size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n if( res.dat[res.size][0] == 0 && res.dat[res.size][1] == 0 && res.dat[res.size][2] == 0 && res.dat[res.size][3] == 0 )\\n res.size = max( res.size-1, 0 );\\n }\\n }\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt diff = a - b;\\n diff.print();\\n\\n}\",\n \"accuracy\": 0.44,\n \"time_ms\": 60,\n \"memory_kb\": 74336,\n \"score_of_the_acc\": -0.8184,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6917609\",\n \"code_snippet\": \"// multiprecision\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n// fft\\n#include <complex>\\n#include <cmath>\\nnamespace fourier {\\n using complex = std::complex<double>;\\n constexpr double pi = 3.14159265358979323L;\\n\\n std::vector<complex> fft(const std::vector<complex>& c, bool inverse = false) {\\n std::size_t N = c.size(); // N = 2^m\\n double N_inv = 1.0 / static_cast<double>(N); // Inverse of N\\n std::vector<complex> f(N); // FFT result\\n int inv = inverse ? -1 : 1; // Inverse flag\\n if(N <= 1) return c;\\n\\n // Decompose by even-odd\\n std::vector<complex> even(N / 2), odd(N / 2);\\n for(int i = 0; i < N / 2; ++i) {\\n even.at(i) = c.at(2 * i);\\n odd.at(i) = c.at((2 * i) + 1);\\n }\\n even = fft(even, inverse);\\n odd = fft(odd, inverse);\\n\\n // Calculate C_k(e) + C_k(o) * xi^j\\n double theta = (2.0 * pi * N_inv * inv);\\n const auto xi = [&](int j) {\\n return complex(std::cos(theta * j), std::sin(theta * j));\\n };\\n for(int j = 0; j < N; ++j) {\\n int k = j % (N / 2);\\n f.at(j) = even.at(k) + (odd.at(k) * xi(j));\\n }\\n return f;\\n }\\n std::vector<complex> convolution(const std::vector<complex>& f, const std::vector<complex>& g) {\\n std::size_t N = 1;\\n while(N < (f.size() + g.size() - 1)) N *= 2;\\n\\n std::vector<complex> F(N), G(N);\\n for(int i = 0; i < f.size(); ++i) {\\n F.at(i) = f.at(i);\\n G.at(i) = g.at(i);\\n }\\n F = fft(F);\\n G = fft(G);\\n\\n std::vector<complex> conv(N);\\n for(int i = 0; i < N; ++i)\\n conv.at(i) = F.at(i) * G.at(i);\\n \\n conv = fft(conv, -1);\\n for(int i = 0; i < N; ++i)\\n conv.at(i) *= complex(1.0 / static_cast<double>(conv.size()));\\n return conv;\\n }\\n}\\nnamespace multiprecision {\\n using i32 = std::int32_t;\\n using i64 = std::int64_t;\\n using Bigint = std::vector<i32>;\\n class Int {\\n private:\\n Bigint integer; // 120 -> 0, 2, 1\\n bool is_negative; // -1 -> true\\n\\n public:\\n Int() : integer({0}), is_negative(false){} // default\\n Int(const Int& i) : integer(i.integer), is_negative(i.is_negative){} // copy\\n Int(const std::string& s){ (*this) = string_to_integer(s); } // string to bigint\\n Int(const char*& s){ (*this) = string_to_integer(s); } // char* to bigint\\n Int(const i64& i){ (*this) = string_to_integer(std::to_string(i)); } // int to bigint\\n \\n private:\\n // string から integer 配列を生成する.\\n Int string_to_integer(const std::string& s) {\\n Bigint t;\\n Int temp;\\n if(s.front() == '-') temp.is_negative = true;\\n\\n for(int i = s.size() - 1; temp.is_negative ? (i > 0) : (i >= 0); --i) {\\n t.push_back(static_cast<i32>(s.at(i) - '0'));\\n }\\n temp.integer = t;\\n return temp;\\n };\\n // 繰り上がり, 繰り下がり処理を行う.\\n Int carry() {\\n // [19, 2, -2, 15] -> [9, 3, 8, 14]\\n for(int i = 0; i < this->integer.size() - 1; ++i) {\\n if(this->integer.at(i) >= 10) {\\n int k = this->integer.at(i) / 10;\\n this->integer.at(i) -= k * 10;\\n this->integer.at(i + 1) += k;\\n }\\n if(this->integer.at(i) < 0) {\\n int k = (-this->integer.at(i) - 1) / 10 + 1;\\n this->integer.at(i) += k * 10;\\n this->integer.at(i + 1) -= k;\\n }\\n }\\n // [9, 3, 8, 14] -> [9, 3, 8, 4, 1]\\n while(this->integer.back() >= 10) {\\n int k = this->integer.back() / 10;\\n this->integer.back() -= k * 10;\\n this->integer.push_back(k);\\n }\\n // [1, 2, 3, 0, 0, 0, 0] -> [1, 2, 3]\\n while(this->integer.size() > 1 && this->integer.back() == 0) {\\n this->integer.pop_back();\\n }\\n // [-0] -> [0]\\n if(this->integer.size() == 1 && this->integer.front() == 0) {\\n this->is_negative = false;\\n }\\n return (*this);\\n }\\n // true なら -1, false なら +1 を返す\\n i32 sign(const bool& is_negative) { return is_negative ? -1 : +1; }\\n public:\\n bool positive() const { return !this->is_negative; }\\n bool negative() const { return this->is_negative; }\\n std::size_t size() const { return this->integer.size(); }\\n i32 at(const std::size_t& i) const { return this->integer.at(i); }\\n\\n Int abs() const { Int tmp = (*this); tmp.is_negative = false; return tmp; }\\n Int operator= (const Int& r) { this->integer = r.integer; this->is_negative = r.is_negative; return (*this); }\\n Int operator+=(const Int& r) {\\n bool operator< (const Int&, const Int&);\\n Bigint result(std::max(this->integer.size(), r.integer.size()));\\n // 異符号\\n if(this->is_negative != r.is_negative){\\n // 右辺が大きいなら 右辺 - 左辺\\n if((*this).abs() < r.abs()) {\\n this->is_negative = !this->is_negative;\\n for(int i = 0; i < result.size(); ++i) {\\n result.at(i)\\n = (i < r.integer.size() ? r.integer.at(i) : 0) - (i < this->integer.size() ? this->integer.at(i) : 0);\\n }\\n }\\n // 左辺が大きいなら 左辺 - 右辺\\n else {\\n for(int i = 0; i < result.size(); ++i) {\\n result.at(i)\\n = (i < this->integer.size() ? this->integer.at(i) : 0) - (i < r.integer.size() ? r.integer.at(i) : 0);\\n }\\n }\\n }\\n // 同符号 -> そのまま加算\\n else {\\n for(int i = 0; i < result.size(); ++i) {\\n result.at(i)\\n = (i < this->integer.size() ? this->integer.at(i) : 0) + (i < r.integer.size() ? r.integer.at(i) : 0);\\n }\\n }\\n this->integer = result;\\n return (*this).carry();\\n }\\n Int operator-=(const Int& r) {\\n Int operator-(const Int&);\\n (*this) += -r;\\n // 繰り上がり処理済み\\n return (*this);\\n }\\n Int operator*=(const Int& r) {\\n std::vector<std::complex<double>> lhs(this->integer.size()), rhs(r.integer.size()), conv;\\n for(int i = 0; i < std::max(lhs.size(), rhs.size()); ++i) {\\n if(i < lhs.size()) lhs.at(i) = this->integer.at(i);\\n if(i < rhs.size()) rhs.at(i) = r.integer.at(i);\\n }\\n while(lhs.size() < rhs.size()) lhs.push_back(0);\\n while(lhs.size() > rhs.size()) rhs.push_back(0);\\n conv = fourier::convolution(lhs, rhs);\\n Bigint result(conv.size());\\n for(int i = 0; i < result.size(); ++i)\\n result.at(i) = std::round(conv.at(i).real());\\n this->integer = result, this->is_negative ^= r.is_negative;\\n return (*this).carry();\\n }\\n \\n private:\\n friend std::ostream& operator<<(std::ostream&, const Int&);\\n friend std::istream& operator>>(std::istream&, Int&);\\n };\\n Int operator+(const Int& r) { return r; }\\n Int operator-(const Int& r) { Int l(-1); l *= r; return l; }\\n Int operator+(const Int& lhs, const Int& rhs) { Int tmp = lhs; return tmp += rhs; }\\n Int operator-(const Int& lhs, const Int& rhs) { Int tmp = lhs; return tmp -= rhs; }\\n Int operator*(const Int& lhs, const Int& rhs) { Int tmp = lhs; return tmp *= rhs; }\\n \\n bool operator==(const Int& lhs, const Int& rhs) {\\n if(lhs.size() != rhs.size()) return false;\\n for(int i = 0; i < lhs.size(); ++i) {\\n if(lhs.at(i) != rhs.at(i)) return false;\\n }\\n return true;\\n }\\n bool operator!=(const Int& lhs, const Int& rhs) { return !(lhs == rhs); }\\n bool operator> (const Int& lhs, const Int& rhs) {\\n if(lhs.positive() != rhs.positive())\\n return lhs.positive();\\n if(lhs.size() != rhs.size())\\n return lhs.positive() ? (lhs.size() > rhs.size()) : (lhs.size() < rhs.size());\\n for(int i = lhs.size() - 1; i >= 0; --i) {\\n if(lhs.at(i) != rhs.at(i))\\n return lhs.positive() ? (lhs.at(i) > rhs.at(i)) : (lhs.at(i) < rhs.at(i));\\n }\\n return false;\\n }\\n bool operator>=(const Int& lhs, const Int& rhs) {\\n return (lhs > rhs) || (lhs == rhs);\\n }\\n bool operator< (const Int& lhs, const Int& rhs) {\\n return !(lhs >= rhs);\\n }\\n bool operator<=(const Int& lhs, const Int& rhs) {\\n return !(lhs > rhs);\\n }\\n std::ostream& operator<<(std::ostream& out, const Int& v) {\\n if(v.is_negative) out << \\\"-\\\";\\n for(int i = v.integer.size() - 1; i >= 0; --i)\\n out << v.integer.at(i);\\n return out;\\n }\\n std::istream& operator>>(std::istream& cin, Int& v) {\\n std::string s; cin >> s;\\n v = Int(s);\\n return cin;\\n }\\n}\\n\\nint main() {\\n multiprecision::Int a, b;\\n std::cin >> a >> b;\\n std::cout << a - b << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 36412,\n \"score_of_the_acc\": -0.8978,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6691787\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\ntypedef long long ll;\\nusing namespace boost::multiprecision;\\n\\nint main() {\\n cpp_int a,b;cin>>a>>b;\\n cpp_int ans=a-b;\\n cout<<ans<<endl;\\n return 0;\\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.0004,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6677814\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#include <boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\n\\nconst int mod=1e9+7;\\n\\nint32_t main()\\n{\\n boost::multiprecision::cpp_int a, b;\\n cin >> a >> b;\\n \\n cout << a-b << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.0004,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6499536\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nbool f(const string& a) {return a == \\\"\\\" || a == \\\"-\\\";}\\n\\nstring add(string& a, string& b, int c)\\n{\\n\\tif (!f(a)) {\\n\\t\\tc += a.back() - '0';\\n\\t\\ta.pop_back();\\n\\t}\\n\\tif (!f(b)) {\\n\\t\\tc += b.back() - '0';\\n\\t\\tb.pop_back();\\n\\t}\\n\\tif (f(a) && f(b)) {\\n\\t\\tif (c < 0 || a == b) return \\\"x\\\";\\n\\t\\tif (c < 10) {\\n\\t\\t\\tif (c > 0) a.push_back(c % 10 + '0');\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t}\\n\\tauto t = add(a, b, c / 10);\\n\\tt.push_back(c % 10 + '0');\\n\\treturn t;\\n}\\n\\nstring sub(string& a, string& b, int c, bool rev)\\n{\\n\\tif (!f(a)) {\\n\\t\\tc += a.back() - '0';\\n\\t\\ta.pop_back();\\n\\t}\\n\\tif (!f(b)) {\\n\\t\\tc -= b.back() - '0';\\n\\t\\tb.pop_back();\\n\\t}\\n\\tif (f(a) && f(b)) {\\n\\t\\tif (c < 0 || a != b) return \\\"x\\\";\\n\\t\\tif (rev) {if (a == \\\"\\\") a = \\\"-\\\"; else a = \\\"\\\";}\\n\\t\\tif (c < 10) {\\n\\t\\t\\tif (c > 0) a.push_back(c % 10 + '0');\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t}\\n\\tauto t = sub(a, b, (c - (c + 100) % 10) / 10, rev);\\n\\tt.push_back((c + 100) % 10 + '0');\\n\\treturn t;\\n}\\n\\nstring add(string a, string b) {return add(a, b, 0);}\\nstring sub(string a, string b, bool rev) {return sub(a, b, 0, rev);}\\n\\nint main()\\n{\\n\\tstring a, b, c; cin >> a >> b;\\n\\tc = add(a, b);\\n\\tif (c[0] == 'x') c = sub(a, b, false);\\n\\tif (c[0] == 'x') c = sub(b, a, true);\\n\\tif (f(c) || c == \\\"-0\\\") c = \\\"0\\\";\\n\\tcout << c << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 10,\n \"memory_kb\": 13172,\n \"score_of_the_acc\": -0.1026,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6386415\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define all(v) v.begin(), v.end()\\n#define sz(v) int(v.size())\\n#define INF 1e18+999999\\n#define EPSILON 1e-14\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nstring BigSum(string A, string B){\\n vector<int> a(sz(A));\\n vector<int> b(sz(B));\\n rep(i, sz(A)){\\n a.at(i) = A.at(sz(A)-1-i) - '0';\\n }\\n rep(i, sz(B)){\\n b.at(i) = B.at(sz(B)-1-i) - '0';\\n }\\n vector<int> ans(sz(A)+sz(B)+1, 0);\\n rep(i, max(sz(A), sz(B))){\\n ans.at(i) = (i < sz(A) ? a.at(i) : 0) + (i < sz(B) ? b.at(i) : 0);\\n }\\n rep(i, sz(ans)-1){\\n ans.at(i+1) += ans.at(i) / 10;\\n ans.at(i) %= 10;\\n }\\n string Ans;\\n rep(i, sz(ans)){\\n Ans += ans.at(i) + '0';\\n }\\n reverse(all(Ans));\\n while(sz(Ans) > 1){\\n if(Ans.at(0) == '0'){\\n Ans.erase(0, 1);\\n }\\n else{\\n break;\\n }\\n }\\n return Ans;\\n}\\n\\nstring BigSub(string A, string B){\\n if(sz(A) < sz(B)){\\n return '-' + BigSub(B, A);\\n }\\n vector<int> a(sz(A));\\n vector<int> b(sz(B));\\n rep(i, sz(A)){\\n a.at(i) = A.at(sz(A)-1-i) - '0';\\n }\\n rep(i, sz(B)){\\n b.at(i) = B.at(sz(B)-1-i) - '0';\\n }\\n if(sz(A) == sz(B)){\\n rep(i, sz(A)){\\n if(a.at(sz(a)-1-i) > b.at(sz(a)-1-i)){\\n break;\\n }\\n if(a.at(sz(a)-1-i) < b.at(sz(a)-1-i)){\\n return '-' + BigSub(B, A);\\n }\\n }\\n }\\n vector<int> ans(sz(A)+sz(B)+1, 0);\\n rep(i, max(sz(A), sz(B))){\\n ans.at(i) = (i < sz(A) ? a.at(i) : 0) - (i < sz(B) ? b.at(i) : 0);\\n }\\n rep(i, sz(ans)-1){\\n if(ans.at(i) < 0){\\n int c = (-ans.at(i) + 9) / 10;\\n ans.at(i+1) -= c;\\n ans.at(i) += 10 * c;\\n }\\n }\\n string Ans;\\n rep(i, sz(ans)){\\n Ans += ans.at(i) + '0';\\n }\\n reverse(all(Ans));\\n while(sz(Ans) > 1){\\n if(Ans.at(0) == '0'){\\n Ans.erase(0, 1);\\n }\\n else{\\n break;\\n }\\n }\\n return Ans;\\n}\\n\\nint main()\\n{\\n string A, B;\\n cin >> A >> B;\\n if(A.at(0) == '-'){\\n A.erase(0, 1);\\n if(B.at(0) == '-'){\\n B.erase(0, 1);\\n cout << BigSub(B, A) << '\\\\n';\\n }\\n else{\\n cout << '-' << BigSum(A, B) << '\\\\n';\\n }\\n }\\n else{\\n if(B.at(0) == '-'){\\n B.erase(0, 1);\\n cout << BigSum(A, B) << '\\\\n';\\n }\\n else{\\n cout << BigSub(A, B) << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 6144,\n \"score_of_the_acc\": -0.7533,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_NTL_2_B_6347785\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstruct BigIntTiny {\\n int sign;\\n std::vector<int> v;\\n\\n BigIntTiny() : sign(1) {}\\n BigIntTiny(const std::string& s) { *this = s; }\\n BigIntTiny(int v) {\\n char buf[21];\\n sprintf(buf, \\\"%d\\\", v);\\n *this = buf;\\n }\\n void zip(int unzip) {\\n if (unzip == 0) {\\n for (int i = 0; i < (int)v.size(); i++)\\n v[i] = get_pos(i * 4) + get_pos(i * 4 + 1) * 10 + get_pos(i * 4 + 2) * 100 + get_pos(i * 4 + 3) * 1000;\\n }\\n else\\n for (int i = (v.resize(v.size() * 4), (int)v.size() - 1), a; i >= 0; i--)\\n a = (i % 4 >= 2) ? v[i / 4] / 100 : v[i / 4] % 100, v[i] = (i & 1) ? a / 10 : a % 10;\\n setsign(1, 1);\\n }\\n int get_pos(unsigned pos) const { return pos >= v.size() ? 0 : v[pos]; }\\n BigIntTiny& setsign(int newsign, int rev) {\\n for (int i = (int)v.size() - 1; i > 0 && v[i] == 0; i--)\\n v.erase(v.begin() + i);\\n sign = (v.size() == 0 || (v.size() == 1 && v[0] == 0)) ? 1 : (rev ? newsign * sign : newsign);\\n return *this;\\n }\\n std::string to_str() const {\\n BigIntTiny b = *this;\\n std::string s;\\n for (int i = (b.zip(1), 0); i < (int)b.v.size(); ++i)\\n s += char(*(b.v.rbegin() + i) + '0');\\n return (sign < 0 ? \\\"-\\\" : \\\"\\\") + (s.empty() ? std::string(\\\"0\\\") : s);\\n }\\n bool absless(const BigIntTiny& b) const {\\n if (v.size() != b.v.size()) return v.size() < b.v.size();\\n for (int i = (int)v.size() - 1; i >= 0; i--)\\n if (v[i] != b.v[i]) return v[i] < b.v[i];\\n return false;\\n }\\n BigIntTiny operator-() const {\\n BigIntTiny c = *this;\\n c.sign = (v.size() > 1 || v[0]) ? -c.sign : 1;\\n return c;\\n }\\n BigIntTiny& operator=(const std::string& s) {\\n if (s[0] == '-')\\n *this = s.substr(1);\\n else {\\n for (int i = (v.clear(), 0); i < (int)s.size(); ++i)\\n v.push_back(*(s.rbegin() + i) - '0');\\n zip(0);\\n }\\n return setsign(s[0] == '-' ? -1 : 1, sign = 1);\\n }\\n bool operator<(const BigIntTiny& b) const {\\n return sign != b.sign ? sign < b.sign : (sign == 1 ? absless(b) : b.absless(*this));\\n }\\n bool operator==(const BigIntTiny& b) const { return v == b.v && sign == b.sign; }\\n BigIntTiny& operator+=(const BigIntTiny& b) {\\n if (sign != b.sign) return *this = (*this) - -b;\\n v.resize(std::max(v.size(), b.v.size()) + 1);\\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\\n carry += v[i] + b.get_pos(i);\\n v[i] = carry % 10000, carry /= 10000;\\n }\\n return setsign(sign, 0);\\n }\\n BigIntTiny operator+(const BigIntTiny& b) const {\\n BigIntTiny c = *this;\\n return c += b;\\n }\\n void add_mul(const BigIntTiny& b, int mul) {\\n v.resize(std::max(v.size(), b.v.size()) + 2);\\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\\n carry += v[i] + b.get_pos(i) * mul;\\n v[i] = carry % 10000, carry /= 10000;\\n }\\n }\\n BigIntTiny operator-(const BigIntTiny& b) const {\\n if (sign != b.sign) return (*this) + -b;\\n if (absless(b)) return -(b - *this);\\n BigIntTiny c;\\n for (int i = 0, borrow = 0; i < (int)v.size(); i++) {\\n borrow += v[i] - b.get_pos(i);\\n c.v.push_back(borrow);\\n c.v.back() -= 10000 * (borrow >>= 31);\\n }\\n return c.setsign(sign, 0);\\n }\\n BigIntTiny operator*(const BigIntTiny& b) const {\\n if (b < *this) return b * *this;\\n BigIntTiny c, d = b;\\n for (int i = 0; i < (int)v.size(); i++, d.v.insert(d.v.begin(), 0))\\n c.add_mul(d, v[i]);\\n return c.setsign(sign * b.sign, 0);\\n }\\n BigIntTiny operator/(const BigIntTiny& b) const {\\n BigIntTiny c, d;\\n d.v.resize(v.size());\\n double db = 1.0 / (b.v.back() + (b.get_pos((unsigned)b.v.size() - 2) / 1e4) +\\n (b.get_pos((unsigned)b.v.size() - 3) + 1) / 1e8);\\n for (int i = (int)v.size() - 1; i >= 0; i--) {\\n c.v.insert(c.v.begin(), v[i]);\\n int m = (int)((c.get_pos((int)b.v.size()) * 10000 + c.get_pos((int)b.v.size() - 1)) * db);\\n c = c - b * m, d.v[i] += m;\\n while (!(c < b))\\n c = c - b, d.v[i] += 1;\\n }\\n return d.setsign(sign * b.sign, 0);\\n }\\n BigIntTiny operator%(const BigIntTiny& b) const { return *this - *this / b * b; }\\n bool operator>(const BigIntTiny& b) const { return b < *this; }\\n bool operator<=(const BigIntTiny& b) const { return !(b < *this); }\\n bool operator>=(const BigIntTiny& b) const { return !(*this < b); }\\n bool operator!=(const BigIntTiny& b) const { return !(*this == b); }\\n};\\n//FFT部分 \\nconst double PI = acos(-1);\\ntypedef complex<double> Complex;\\nconst int maxn = 3e6 + 10;\\n\\nComplex a[maxn], b[maxn];\\nint m, n;\\nint bit = 2, rev[maxn];\\nint ans[maxn];\\n\\nvoid get_rev() {\\n memset(rev, 0, sizeof(rev));\\n while (bit <= n + m) bit <<= 1;\\n for (int i = 0; i < bit; ++i) {\\n rev[i] = (rev[i >> 1] >> 1) | (bit >> 1) * (i & 1);\\n }\\n}\\n\\nvoid FFT(Complex* a, int op) {\\n for (int i = 0; i < bit; ++i) {\\n if (i < rev[i]) swap(a[i], a[rev[i]]);\\n }\\n for (int mid = 1; mid < bit; mid <<= 1) {\\n Complex wn = Complex(cos(PI / mid), op * sin(PI / mid));\\n for (int j = 0; j < bit; j += mid << 1) {\\n Complex w(1, 0);\\n for (int k = 0; k < mid; ++k, w = w * wn) {\\n Complex x = a[j + k], y = w * a[j + k + mid];\\n a[j + k] = x + y, a[j + k + mid] = x - y;\\n }\\n }\\n }\\n}\\n\\nstring fftmul(string s1, string s2) {\\n //cout<<s1<<endl<<s2<<endl;\\n n = s1.size(), m = s2.size();\\n memset(a, 0, sizeof(a));\\n memset(b, 0, sizeof(b));\\n for (int i = 0; i < n; ++i) {\\n a[i] = s1[n - i - 1] - '0';\\n }\\n for (int i = 0; i < m; ++i) {\\n b[i] = s2[m - i - 1] - '0';\\n }\\n get_rev();\\n FFT(a, 1);\\n FFT(b, 1);\\n for (int i = 0; i <= bit; ++i) {\\n a[i] *= b[i];\\n }\\n FFT(a, -1);\\n for (int i = 0; i < n + m; ++i) {\\n ans[i] = (int)(a[i].real() / bit + 0.5);\\n }\\n for (int i = 1; i < n + m; ++i) {\\n ans[i] = ans[i] + ans[i - 1] / 10;\\n ans[i - 1] = ans[i - 1] % 10;\\n }\\n int s = n + m - 1;\\n for (; s >= 0; --s) {\\n if (ans[s]) break;\\n }\\n string ret;\\n if (s < 0) ret.push_back('0');//printf(\\\"0\\\\n\\\");\\n else {\\n for (int i = s; i >= 0; --i) {\\n ret.push_back(ans[i] + '0');//printf(\\\"%d\\\", ans[i]);\\n }\\n //printf(\\\"\\\\n\\\");\\n }\\n return ret;\\n}\\n\\nBigIntTiny fastmul(BigIntTiny b1, BigIntTiny b2) {\\n //cout<<b1.to_str()<<'\\\\n'<<b2.to_str()<<endl;\\n //cout<<fftmul(b1.to_str(),b2.to_str())<<endl;\\n bool flag = 0;//要不要变负,1负\\n if (b1 < 0)b1 = -b1, flag ^= 1;\\n if (b2 < 0)b2 = -b2, flag ^= 1;\\n BigIntTiny ans = fftmul(b1.to_str(), b2.to_str());\\n return flag ? -ans : ans;\\n}\\nconst int p = 998244353;\\nBigIntTiny qpow(BigIntTiny a, BigIntTiny n, BigIntTiny p) {\\n BigIntTiny res = 1;\\n while (n>0) {\\n if (n % 2 == 1) res = res * a % p;\\n a = a * a % p;\\n n = n / 2;\\n }\\n return res;\\n}\\nBigIntTiny qpow1(BigIntTiny a, BigIntTiny n) {\\n BigIntTiny res = 1;\\n while (n > 0) {\\n if (n % 2 == 1) res = res * a;\\n a = a * a;\\n n = n / 2;\\n }\\n return res;\\n}\\nBigIntTiny v[51], sum[51];\\nint main(){\\n string a, b;\\n cin>>a>>b;\\n cout<<(BigIntTiny(a)-BigIntTiny(b)).to_str()<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 98488,\n \"score_of_the_acc\": -1.0145,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":88,"cells":{"group_id":{"kind":"string","value":"aoj_NTL_2_A_cpp"},"problem_description":{"kind":"string","value":"Addition of Big Integers\nGiven two integers $A$ and $B$, compute the sum, $A + B$.\nInput\nTwo integers $A$ and $B$ separated by a space character are given in a line.\nOutput\nPrint the sum in a line.\nConstraints\n$-1 \\times 10^{100000} \\leq A, B \\leq 10^{100000}$\nSample Input 1\n5 8\nSample Output 1\n13\nSample Input 2\n100 25\nSample Output 2\n125\nSample Input 3\n-1 1\nSample Output 3\n0\nSample Input 4\n12 -3\nSample Output 4\n9"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_NTL_2_A_10774189","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst ld PI = acos( -1.0 );\n\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\n\ntemplate <typename T>\nvoid print_arr( vector<T> v ){\n if( v.size() == 0 ) return;\n for( int i = 0 ; i < v.size() ; i++ )\n cout << v[i];\n cout << endl;\n}\n\nstruct BigInteger{\n\n bool minus;\n int digit;\n vector<ll> arr;\n\n BigInteger( string val = \"\", bool m = false ){\n\n minus = m;\n while( val.length() > 4 ){\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\n val = val.substr( 0, val.length() - 4 );\n }\n if( val.length() != 0 )\n arr.push_back( stoll( val ) );\n set_digit();\n\n }\n\n void shift_l(){\n\n ll up = 0;\n for( int i = 0 ; i < digit ; i++ ){\n ll next_up = arr[i] / 1000;\n arr[i] = ( arr[i] % 1000 ) * 10 + up; \n up = next_up;\n }\n arr.push_back( up );\n set_digit();\n\n }\n\n void shift_r(){\n\n ll down = 0;\n for( int i = digit - 1 ; i >= 0 ; i-- ){\n ll next_down = arr[i] % 10;\n arr[i] = 1000 * down + arr[i] / 10;\n down = next_down;\n }\n set_digit();\n\n }\n\n bool zero(){\n\n return digit == 1 && arr[0] == 0;\n\n }\n\n void set_digit(){\n\n while( arr.size() > 1 && arr[arr.size()-1] == 0 )\n arr.pop_back();\n digit = arr.size();\n\n }\n\n void print(){\n\n if( zero() ){\n cout << 0 << endl;\n return;\n }\n if( minus )\n cout << \"-\";\n cout << arr[digit - 1];\n for( int i = digit - 2 ; i >= 0 ; i-- )\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\n cout << endl;\n\n }\n\n};\n\nBigInteger add( BigInteger bi1, BigInteger bi2 );\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\nBigInteger mul( BigInteger bi1, BigInteger bi2 );\nBigInteger div( BigInteger bi1, BigInteger bi2 );\nbool operator<( const BigInteger bi1, const BigInteger bi2 );\nbool operator>( const BigInteger bi1, const BigInteger bi2 );\nbool operator<=( const BigInteger bi1, const BigInteger bi2 );\nbool operator>=( const BigInteger bi1, const BigInteger bi2 );\nbool operator==( const BigInteger bi1, const BigInteger bi2 );\nbool operator!=( const BigInteger bi1, const BigInteger bi2 );\n\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return sub( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n return sub( bi2, bi1 );\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n\n BigInteger res;\n ll up = 0;\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i];\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \n up = ( val1 + val2 + up ) / 10000;\n }\n res.arr.push_back( up );\n res.set_digit();\n return res;\n\n}\n\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return add( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = sub( bi2, bi1 );\n return res;\n }\n\n if( bi1.digit < bi2.digit ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n else if( bi1.digit == bi2.digit ){\n for( int i = bi1.digit-1 ; i >= 0 ; i-- ){\n if( bi1.arr[i] > bi2.arr[i] )\n break;\n else if( bi1.arr[i] < bi2.arr[i] ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n }\n }\n \n BigInteger res;\n ll down = 0;\n for( int i = 0 ; i < bi1.digit ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i] - down;\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n if( val1 < val2 ){\n down = 1;\n val1 += 10000;\n }\n else \n down = 0;\n res.arr.push_back( val1 - val2 );\n }\n res.set_digit();\n return res;\n\n}\n\nBigInteger mul( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n res.minus = ( bi1.minus != bi2.minus );\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ )\n res.arr.push_back( 0 );\n for( int i = 0 ; i < bi1.digit ; i++ ){\n for( int j = 0 ; j < bi2.digit ; j++ )\n res.arr[i+j] += bi1.arr[i] * bi2.arr[j];\n }\n ll up = 0;\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ ){\n ll next_up = ( res.arr[i] + up ) / 10000;\n res.arr[i] = ( res.arr[i] + up ) % 10000;\n up = next_up;\n }\n res.set_digit();\n return res;\n\n}\n\nBigInteger div( BigInteger bi1, BigInteger bi2 ){\n\n string num = \"\";\n bool m = ( bi1.minus != bi2.minus );\n bi1.minus = bi2.minus = false;\n BigInteger org = bi2;\n if( bi1 < bi2 ){\n BigInteger zero( \"0\", false );\n return zero;\n }\n while( bi1.digit > bi2.digit ){\n bi2.arr.insert( bi2.arr.begin(), 0 );\n bi2.digit++;\n }\n while( to_string( bi1.arr[bi1.digit-1] ).length() > to_string( bi2.arr[bi2.digit-1] ).length() )\n bi2.shift_l();\n while( to_string( bi1.arr[bi1.digit-1] ).length() < to_string( bi2.arr[bi2.digit-1] ).length() )\n bi2.shift_r();\n while( bi2 >= org ){ \n int i;\n for( i = 0 ; i <= 9 ; i++ ){\n BigInteger tmp = sub( bi1, bi2 );\n tmp.print();\n if( !tmp.zero() && tmp.minus )\n break;\n bi1 = tmp;\n } \n num += to_string( i );\n bi2.shift_r();\n }\n BigInteger res( num, m );\n return res;\n\n}\n\nbool operator<( const BigInteger bi1, const BigInteger bi2 ){\n\n BigInteger tmp = sub( bi1, bi2 );\n return tmp.minus && !tmp.zero();\n\n}\n\nbool operator>( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.minus && !tmp.zero();\n\n}\n\nbool operator<=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return tmp.minus || tmp.zero();\n\n}\n\nbool operator>=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.minus || tmp.zero();\n\n}\n\nbool operator==( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return tmp.zero();\n\n}\n\nbool operator!=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.zero();\n\n}\n\nint main(){\n\n string val1, val2;\n bool minus;\n \n cin >> val1;\n if( val1[0] == '-' ){\n minus = true;\n val1 = val1.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi1( val1, minus );\n\n cin >> val2;\n if( val2[0] == '-' ){\n minus = true;\n val2 = val2.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi2( val2, minus );\n \n BigInteger res = add( bi1, bi2 );\n res.print();\n\n}","accuracy":1,"time_ms":50,"memory_kb":5368,"score_of_the_acc":-0.0795,"final_rank":2},{"submission_id":"aoj_NTL_2_A_10774163","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst ld PI = acos( -1.0 );\n\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\n\ntemplate <typename T>\nvoid print_arr( vector<T> v ){\n if( v.size() == 0 ) return;\n for( int i = 0 ; i < v.size() ; i++ )\n cout << v[i];\n cout << endl;\n}\n\nstruct BigInteger{\n\n bool minus;\n int digit;\n vector<ll> arr;\n\n BigInteger( string val = \"\", bool m = false ){\n\n minus = m;\n while( val.length() > 4 ){\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\n val = val.substr( 0, val.length() - 4 );\n }\n if( val.length() != 0 )\n arr.push_back( stoll( val ) );\n set_digit();\n\n }\n\n void shift_l(){\n\n ll up = 0;\n for( int i = 0 ; i < digit ; i++ ){\n ll next_up = arr[i] / 1000;\n arr[i] = ( arr[i] % 1000 ) * 10 + up; \n up = next_up;\n }\n arr.push_back( up );\n set_digit();\n\n }\n\n void shift_r(){\n\n ll down = 0;\n for( int i = digit - 1 ; i >= 0 ; i-- ){\n ll next_down = arr[i] % 10;\n arr[i] = 1000 * down + arr[i] / 10;\n down = next_down;\n }\n set_digit();\n\n }\n\n bool zero(){\n\n return digit == 1 && arr[0] == 0;\n\n }\n\n void set_digit(){\n\n while( arr.size() > 1 && arr[arr.size()-1] == 0 )\n arr.pop_back();\n digit = arr.size();\n\n }\n\n void print(){\n\n if( zero() ){\n cout << 0 << endl;\n return;\n }\n if( minus )\n cout << \"-\";\n cout << arr[digit - 1];\n for( int i = digit - 2 ; i >= 0 ; i-- )\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\n cout << endl;\n\n }\n\n};\n\nBigInteger add( BigInteger bi1, BigInteger bi2 );\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\nBigInteger mul( BigInteger bi1, BigInteger bi2 );\nBigInteger div( BigInteger bi1, BigInteger bi2 );\nbool operator<( const BigInteger bi1, const BigInteger bi2 );\nbool operator>( const BigInteger bi1, const BigInteger bi2 );\nbool operator<=( const BigInteger bi1, const BigInteger bi2 );\nbool operator>=( const BigInteger bi1, const BigInteger bi2 );\nbool operator==( const BigInteger bi1, const BigInteger bi2 );\nbool operator!=( const BigInteger bi1, const BigInteger bi2 );\n\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return sub( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n return sub( bi2, bi1 );\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n\n BigInteger res;\n ll up = 0;\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i];\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \n up = ( val1 + val2 + up ) / 10000;\n }\n res.arr.push_back( up );\n res.set_digit();\n return res;\n\n}\n\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return add( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = sub( bi2, bi1 );\n return res;\n }\n\n if( bi1.digit < bi2.digit ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n else if( bi1.digit == bi2.digit ){\n for( int i = bi1.digit-1 ; i >= 0 ; i++ ){\n if( bi1.arr[i] > bi2.arr[i] )\n break;\n else if( bi1.arr[i] < bi2.arr[i] ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n }\n }\n \n BigInteger res;\n ll down = 0;\n for( int i = 0 ; i < bi1.digit ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i] - down;\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n if( val1 < val2 ){\n down = 1;\n val1 += 10000;\n }\n else \n down = 0;\n res.arr.push_back( val1 - val2 );\n }\n res.set_digit();\n return res;\n\n}\n\nBigInteger mul( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n res.minus = ( bi1.minus != bi2.minus );\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ )\n res.arr.push_back( 0 );\n for( int i = 0 ; i < bi1.digit ; i++ ){\n for( int j = 0 ; j < bi2.digit ; j++ )\n res.arr[i+j] += bi1.arr[i] * bi2.arr[j];\n }\n ll up = 0;\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ ){\n ll next_up = ( res.arr[i] + up ) / 10000;\n res.arr[i] = ( res.arr[i] + up ) % 10000;\n up = next_up;\n }\n res.set_digit();\n return res;\n\n}\n\nBigInteger div( BigInteger bi1, BigInteger bi2 ){\n\n string num = \"\";\n bool m = ( bi1.minus != bi2.minus );\n bi1.minus = bi2.minus = false;\n BigInteger org = bi2;\n if( bi1 < bi2 ){\n BigInteger zero( \"0\", false );\n return zero;\n }\n while( bi1.digit > bi2.digit ){\n bi2.arr.insert( bi2.arr.begin(), 0 );\n bi2.digit++;\n }\n while( to_string( bi1.arr[bi1.digit-1] ).length() > to_string( bi2.arr[bi2.digit-1] ).length() )\n bi2.shift_l();\n while( to_string( bi1.arr[bi1.digit-1] ).length() < to_string( bi2.arr[bi2.digit-1] ).length() )\n bi2.shift_r();\n while( bi2 >= org ){ \n int i;\n for( i = 0 ; i <= 9 ; i++ ){\n BigInteger tmp = sub( bi1, bi2 );\n tmp.print();\n if( !tmp.zero() && tmp.minus )\n break;\n bi1 = tmp;\n } \n num += to_string( i );\n bi2.shift_r();\n }\n BigInteger res( num, m );\n return res;\n\n}\n\nbool operator<( const BigInteger bi1, const BigInteger bi2 ){\n\n BigInteger tmp = sub( bi1, bi2 );\n return tmp.minus && !tmp.zero();\n\n}\n\nbool operator>( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.minus && !tmp.zero();\n\n}\n\nbool operator<=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return tmp.minus || tmp.zero();\n\n}\n\nbool operator>=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.minus || tmp.zero();\n\n}\n\nbool operator==( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return tmp.zero();\n\n}\n\nbool operator!=( const BigInteger bi1, const BigInteger bi2 ){\n \n BigInteger tmp = sub( bi1, bi2 );\n return !tmp.zero();\n\n}\n\nint main(){\n\n string val1, val2;\n bool minus;\n \n cin >> val1;\n if( val1[0] == '-' ){\n minus = true;\n val1 = val1.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi1( val1, minus );\n\n cin >> val2;\n if( val2[0] == '-' ){\n minus = true;\n val2 = val2.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi2( val2, minus );\n \n BigInteger res = add( bi1, bi2 );\n res.print();\n\n}","accuracy":1,"time_ms":50,"memory_kb":5420,"score_of_the_acc":-0.0801,"final_rank":3},{"submission_id":"aoj_NTL_2_A_10710894","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst ld PI = acos( -1.0 );\n\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\n\ntemplate <typename T>\nvoid print_arr( vector<T> v ){\n if( v.size() == 0 ) return;\n for( int i = 0 ; i < v.size() ; i++ )\n cout << v[i];\n cout << endl;\n}\n\nstruct BigInteger{\n\n bool minus;\n int digit;\n vector<ll> arr;\n\n BigInteger( string val = \"\", bool m = false ){\n\n minus = m;\n while( val.length() > 4 ){\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\n val = val.substr( 0, val.length() - 4 );\n }\n if( val.length() != 0 )\n arr.push_back( stoll( val ) );\n set_digit();\n\n }\n\n bool zero(){\n\n return arr.size() == 1 && arr[0] == 0;\n\n }\n\n void set_digit(){\n\n while( arr.size() > 1 && arr[arr.size()-1] == 0 ){\n arr.pop_back();\n }\n digit = arr.size();\n\n }\n\n void print(){\n\n if( zero() ){\n cout << 0 << endl;\n return;\n }\n if( minus )\n cout << \"-\";\n cout << arr[digit - 1];\n for( int i = digit - 2 ; i >= 0 ; i-- )\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\n cout << endl;\n\n }\n\n};\n\nBigInteger add( BigInteger bi1, BigInteger bi2 );\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\n\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return sub( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n return sub( bi2, bi1 );\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n\n BigInteger res;\n ll up = 0;\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i];\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \n up = ( val1 + val2 + up ) / 10000;\n }\n res.arr.push_back( up );\n res.set_digit();\n return res;\n\n}\n\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\n\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n return add( bi1, bi2 );\n }\n else if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n BigInteger res = add( bi1, bi2 );\n res.minus = true;\n return res;\n }\n else if( bi1.minus && bi2.minus ){\n bi1.minus = false;\n bi2.minus = false;\n BigInteger res = sub( bi2, bi1 );\n return res;\n }\n\n if( bi1.digit < bi2.digit ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n else if( bi1.digit == bi2.digit ){\n if( bi1.arr[bi1.digit-1] < bi2.arr[bi2.digit-1] ){\n BigInteger res = sub( bi2, bi1 );\n res.minus = true;\n return res;\n }\n }\n \n BigInteger res;\n ll down = 0;\n for( int i = 0 ; i < bi1.digit ; i++ ){\n ll val1 = 0, val2 = 0;\n if( i < bi1.digit )\n val1 = bi1.arr[i] - down;\n if( i < bi2.digit )\n val2 = bi2.arr[i];\n if( val1 < val2 ){\n down = 1;\n val1 += 10000;\n }\n else \n down = 0;\n res.arr.push_back( val1 - val2 );\n }\n res.set_digit();\n return res;\n\n}\n\nint main(){\n\n string val1, val2;\n bool minus;\n \n cin >> val1;\n if( val1[0] == '-' ){\n minus = true;\n val1 = val1.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi1( val1, minus );\n\n cin >> val2;\n if( val2[0] == '-' ){\n minus = true;\n val2 = val2.substr( 1 );\n }\n else\n minus = false;\n BigInteger bi2( val2, minus );\n \n BigInteger res = add( bi1, bi2 );\n res.print();\n\n}","accuracy":1,"time_ms":50,"memory_kb":5448,"score_of_the_acc":-0.0804,"final_rank":4},{"submission_id":"aoj_NTL_2_A_9795740","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n\ntemplate <int BASE>\nclass BigDecimal {\n public:\n static constexpr std::string_view NUMERAL{\n \"0123456789ABCDEF\"}; // 16進数まで対応\n\n private: // 静的関数\n static int CompareIgnoreSign(const BigDecimal& a, const BigDecimal& b) {\n // a-bの符号で覚えてもよいかも。\n // a<b: -1\n // a>b: +1\n // a==b: 0\n if (a._digit.size() != b._digit.size())\n return a._digit.size() < b._digit.size() ? -1 : 1;\n for (int i = a._digit.size() - 1; i >= 0; --i) {\n if (a._digit[i] == b._digit[i]) continue;\n return a._digit[i] < b._digit[i] ? -1 : 1;\n }\n return 0;\n }\n\n static BigDecimal Karatsuba(const BigDecimal& a, const BigDecimal& b) {\n // |a| >= |b|にする\n if (a._digit.size() < b._digit.size()) return Karatsuba(b, a);\n // 1桁に絞ったら直に計算して返す\n if (b._digit.size() == 1) {\n BigDecimal ret(a);\n for (int i = 0; i < a._digit.size(); ++i) {\n ret._digit[i] *= b._digit[0];\n }\n ret.carry_and_fix();\n if (b._positive)\n return ret;\n else\n return -ret;\n }\n int N = a._digit.size() / 2; // 下半分の桁数\n bool sign = !(a._positive xor b._positive); // 符号を計算しておく\n BigDecimal a0(a), a1(a), b0(b), b1(b); // x = concat(x0, x1)\n // aの処理\n // x1の下N桁を残す形で上の桁を取り除く\n while (a1._digit.size() > N) a1._digit.pop_back();\n // x0のデータを消去\n a0._digit.clear();\n // x0に下N桁より上の桁を保存しなおす\n for (int i = 0; N + i < a._digit.size(); ++i)\n a0._digit.emplace_back(a._digit[N + i]);\n if (a0._digit.size() == 0) a0._digit.emplace_back(0);\n // x0, x1の符号を取り除く\n a0._positive = a1._positive = true;\n if (b._digit.size() < N) { // 一方が他方の半分もない\n BigDecimal p0, c1;\n p0 = Karatsuba(a0, b);\n c1 = Karatsuba(a1, b);\n BigDecimal c0;\n for (int i = 0; i < N - 1; ++i) c0._digit.emplace_back(0);\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\n BigDecimal ret = c0 + c1;\n ret._positive = sign;\n return ret;\n }\n // bの処理\n // x1の下N桁を残す形で上の桁を取り除く\n while (b1._digit.size() > N) b1._digit.pop_back();\n // x0のデータを消去\n b0._digit.clear();\n // x0に下N桁より上の桁を保存しなおす\n for (int i = 0; N + i < b._digit.size(); ++i)\n b0._digit.emplace_back(b._digit[N + i]);\n if (b0._digit.size() == 0) b0._digit.emplace_back(0);\n // x0, x1の符号を取り除く\n b0._positive = b1._positive = true;\n // 3種類の積\n BigDecimal p0, p1, p2;\n p0 = Karatsuba(a0, b0);\n p2 = Karatsuba(a1, b1);\n p1 = Karatsuba(a0 + a1, b0 + b1) - p0 - p2;\n // 積に対応する数\n BigDecimal c0, c1, c2;\n c0._digit.clear();\n c1._digit.clear();\n c2._digit.clear();\n for (int i = 0; i < N; ++i) {\n c0._digit.emplace_back(0);\n c0._digit.emplace_back(0);\n c1._digit.emplace_back(0);\n }\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\n for (const auto& d : p1._digit) c1._digit.emplace_back(d);\n for (const auto& d : p2._digit) c2._digit.emplace_back(d);\n BigDecimal ret = c0 + c1 + c2;\n ret._positive = sign;\n return ret;\n }\n\n private:\n std::vector<int> _digit;\n bool _positive;\n\n void carry_and_fix() {\n // 新規の桁が発生しない範疇(最後の桁以外)を処理\n for (int i = 0; i < _digit.size() - 1; ++i) {\n if (_digit[i] >= BASE) {\n // 桁の数が基数以上: 繰り上げる必要あり\n int k = _digit[i] / BASE; // 繰り上がり発生回数\n _digit[i] -= k * BASE;\n _digit[i + 1] += k;\n } else if (_digit[i] < 0) {\n // 桁の数が負: 繰り下げが必要\n int k = (-_digit[i] - 1) / BASE + 1;\n _digit[i] += k * BASE;\n _digit[i + 1] -= k;\n }\n }\n // 最後の桁を処理する場合\n while (_digit.back() >= BASE) {\n int k = _digit.back() / BASE; // 繰り上がり発生回数\n _digit.back() -= k * BASE;\n _digit.emplace_back(k);\n }\n // 計算結果がマイナスなら全体に-1をかけて符号反転\n if (_digit.back() < 0) {\n this->_positive = !this->_positive;\n for (int i = 0; i < _digit.size(); ++i) {\n _digit[i] *= -1;\n }\n this->carry_and_fix();\n }\n // 0の桁を上から消す\n while (_digit.size() >= 2 && _digit.back() == 0) _digit.pop_back();\n // 0になったら正の数にしておく(-0表記は困るため)\n if(_digit.size() == 1 && _digit[0] == 0) _positive = true;\n }\n\n public:\n // コンストラクタ\n BigDecimal(int num = 0) : _digit(0), _positive(num >= 0) {\n if (!_positive) num *= -1;\n while (num > 0) {\n _digit.emplace_back(num % BASE);\n num /= BASE;\n }\n if (_digit.size() == 0) _digit.emplace_back(0);\n }\n BigDecimal(std::string s) {\n if (s[0] == '-') {\n s = s.substr(1);\n _positive = false;\n } else {\n _positive = true;\n }\n while (s.size() > 0) {\n int i = NUMERAL.find(s.back());\n _digit.emplace_back(i);\n s.pop_back();\n }\n }\n // コピーコンストラクタ\n BigDecimal(const BigDecimal& x)\n : _digit(x._digit.size()), _positive(x._positive) {\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] = x._digit[i];\n }\n }\n\n // 比較演算子\n bool operator==(const BigDecimal& x) const {\n if (this->_positive != x._positive) return false;\n if (this->_digit.size() != x._digit.size()) return false;\n for (int i = 0; i < this->_digit.size(); ++i) {\n if (this->_digit[i] != x._digit[i]) return false;\n }\n return true;\n }\n bool operator!=(const BigDecimal& x) const { return !(*this == x); }\n bool operator<(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return false; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) < 0;\n } else {\n if (x._positive) return true; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) > 0;\n }\n }\n bool operator>(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return true; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) > 0;\n } else {\n if (x._positive) return false; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) < 0;\n }\n }\n bool operator<=(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return false; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) <= 0;\n } else {\n if (x._positive) return true; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) >= 0;\n }\n }\n bool operator>=(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return true; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) >= 0;\n } else {\n if (x._positive) return false; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) <= 0;\n }\n }\n\n // 単項演算子\n BigDecimal operator+() const { return *this; }\n BigDecimal operator-() const {\n BigDecimal ret = *this;\n ret._positive = !ret._positive;\n return ret;\n }\n // 複号代入演算子\n BigDecimal& operator+=(const BigDecimal& x) {\n // 符号が異なる場合は符号をそろえて引き算に\n if (this->_positive != x._positive) {\n return *this -= (-x);\n }\n // 符号が同じ物にのみ足し算を行う\n while (this->_digit.size() < x._digit.size()) {\n this->_digit.emplace_back(0);\n }\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] += x._digit[i];\n }\n this->carry_and_fix();\n return *this;\n }\n BigDecimal& operator-=(const BigDecimal& x) {\n // 符号が異なる場合は符号をそろえて足し算に\n if (this->_positive != x._positive) {\n return *this += (-x);\n }\n // 符号が同じ物にのみ引き算を行う\n while (this->_digit.size() < x._digit.size()) {\n this->_digit.emplace_back(0);\n }\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] -= x._digit[i];\n }\n this->carry_and_fix();\n return *this;\n }\n BigDecimal& operator*=(const BigDecimal& x) { return *this; }\n BigDecimal& operator/=(const BigDecimal& x) { return *this; }\n BigDecimal& operator%=(const BigDecimal& x) { return *this; }\n\n // 二項演算子\n BigDecimal operator+(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret += x);\n }\n BigDecimal operator-(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret -= x);\n }\n BigDecimal operator*(const BigDecimal& x) const {\n return Karatsuba(*this, x);\n }\n BigDecimal operator/(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret /= x);\n }\n BigDecimal operator%(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret %= x);\n }\n\n // キャスト\n operator std::string() const {\n std::string ret = \"\";\n for (const auto& c : _digit) {\n ret = NUMERAL.at(c) + ret;\n }\n if (!_positive) ret = \"-\" + ret;\n return ret;\n }\n};\n\nint main() {\n std::string A, B;\n std::cin >> A >> B;\n BigDecimal<10> a(A), b(B);\n std::cout << std::string(a+b) << std::endl;\n}","accuracy":1,"time_ms":110,"memory_kb":5252,"score_of_the_acc":-0.1652,"final_rank":6},{"submission_id":"aoj_NTL_2_A_9288512","code_snippet":"#include <bits/stdc++.h>\n#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\n\nint main() {\n boost::multiprecision::cpp_int a, b;\n cin >> a >> b;\n cout << a+b << '\\n';\n}","accuracy":1,"time_ms":700,"memory_kb":3432,"score_of_the_acc":-1.0005,"final_rank":14},{"submission_id":"aoj_NTL_2_A_9072897","code_snippet":"#include <iostream>\n\n#include \"boost/multiprecision/cpp_int.hpp\"\n\nint main() {\n boost::multiprecision::cpp_int a, b;\n std::cin >> a >> b;\n std::cout << a + b << std::endl;\n return 0;\n}","accuracy":1,"time_ms":700,"memory_kb":3424,"score_of_the_acc":-1.0004,"final_rank":12},{"submission_id":"aoj_NTL_2_A_8219544","code_snippet":"#include <bits/stdc++.h>\n\n\nint main() {\n std::string rawA, rawB;\n std::cin >> rawA >> rawB;\n\n int fa = 1, fb = 1;\n std::string A = rawA, B = rawB;\n if (A[0] == '-') {\n fa = -1;\n A.erase(0, 1);\n }\n if (B[0] == '-') {\n fb = -1;\n B.erase(0, 1);\n }\n // std::cout << A << \" , \" << B << std::endl;\n\n bool is_swap = A.size() < B.size();\n if (A.size() == B.size()) {\n for (int i = 0; i < A.size(); i++) {\n if (A[i] == B[i]) {\n continue;\n }\n is_swap = A[i] < B[i];\n break;\n }\n }\n\n if (is_swap) {\n std::swap(A, B);\n std::swap(fa, fb);\n std::swap(rawA, rawB);\n }\n\n int diff = (A.size() - B.size());\n for (int i = 0; i < diff; i++) {\n B = '0' + B;\n }\n\n int f = fa * fb;\n int next = 0;\n std::string s = \"\";\n // std::cout << A << std::endl;\n // std::cout << B << std::endl;\n for (int i = 1; i <= A.size(); i++) {\n int val = A[A.size() - i] - '0' + f * (B[B.size() - i] - '0') + next;\n if (val > 9) {\n next = 1;\n val -= 10;\n } else if (val < 0) {\n next = -1;\n val += 10;\n } else {\n next = 0;\n }\n s = std::to_string(val) + s;\n }\n if (next != 0) {\n s = \"1\" + s;\n }\n\n while (s.size() > 1 && s[0] == '0') {\n s.erase(0, 1);\n }\n\n if (s != \"0\" && fa < 0) {\n s = \"-\" + s;\n }\n\n std::cout << s << std::endl;\n}","accuracy":1,"time_ms":260,"memory_kb":4196,"score_of_the_acc":-0.3711,"final_rank":8},{"submission_id":"aoj_NTL_2_A_7680352","code_snippet":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iomanip>\n#include <iostream>\n\nusing namespace std;\n\ntypedef unsigned long long u64;\ntypedef __uint128_t u128;\n\nstruct bignum {\n u64 a[30005];\n int n;\n\n int ctz() const {\n for (int i = 0;; i++) {\n if (a[i]) {\n return i << 6 | __builtin_ctzll(a[i]);\n }\n }\n }\n\n int lg() const {\n return n << 6 | __lg(a[n]);\n }\n\n bool operator<(const bignum &b) const {\n if (n != b.n) {\n return n < b.n;\n }\n for (int i = n; i != -1; i--) {\n if (a[i] < b.a[i]) {\n return 1;\n }\n if (a[i] > b.a[i]) {\n return 0;\n }\n }\n return 0;\n }\n\n bool operator>(const bignum &b) const {\n return b < *this;\n }\n\n bool operator<=(const bignum &b) const {\n return !(b < *this);\n }\n\n bool operator>=(const bignum &b) const {\n return !(*this < b);\n }\n\n bool operator==(const bignum &b) const {\n if (n != b.n) {\n return 0;\n }\n for (int i = 0; i <= n; i++) {\n if (a[i] != b.a[i]) {\n return 0;\n }\n }\n return 1;\n }\n\n bool operator!=(const bignum &b) const {\n return !(*this == b);\n }\n\n bignum operator+(u64 x) const {\n bignum c = *this;\n int l = c.n;\n\n c.a[0] += x;\n\n bool o = c.a[0] < a[0];\n if (o) {\n for (int i = 1; i <= l; i++) {\n if (a[i] == (u64)-1) {\n c.a[i] = 0;\n } else {\n c.a[i]++;\n o = 0;\n break;\n }\n }\n\n if (o) {\n c.a[++l] = 1;\n }\n }\n c.n = l;\n return c;\n }\n\n bignum operator-(u64 x) const {\n bignum c = *this;\n int l = c.n;\n\n c.a[0] -= x;\n\n bool o = c.a[0] > a[0];\n if (o) {\n for (int i = 1; i <= l; i++) {\n if (!a[i]) {\n c.a[i] = -1;\n } else {\n c.a[i]--;\n break;\n }\n }\n while (l && !c.a[l]) {\n l--;\n c.n--;\n }\n }\n return c;\n }\n\n bignum operator*(u64 x) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n int l = n;\n u128 ad = 0;\n\n for (int i = 0; i <= l; i++) {\n ad += (u128)a[i] * x;\n c.a[i] = ad, ad >>= 64;\n }\n\n if (ad) {\n c.a[++l] = ad;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator/(int m) const {\n if (m == 1) {\n return *this;\n }\n\n bignum c;\n memset(&c, 0, sizeof c);\n\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\n\n int l = n;\n int r = 0;\n\n for (int i = l; i != -1; i--) {\n u128 v = (u128)r * rr + a[i];\n u64 q = (v * b) >> 64;\n int gu = v - (u128)q * m;\n if (gu >= m) {\n gu -= m, q++;\n }\n\n c.a[i] = r * b + q, r = gu;\n }\n\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n return c;\n }\n\n int operator%(int m) const {\n if (m == 1) {\n return 0;\n }\n\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\n int r = 0;\n\n for (int i = n; i != -1; i--) {\n u128 v = (u128)r * rr + a[i];\n u64 q = (v * b) >> 64;\n r = v - q * m;\n if (r >= m) {\n r -= m;\n }\n }\n\n return r;\n }\n\n bignum operator+(const bignum &b) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n bool o = 0;\n int l = max(n, b.n);\n for (int i = 0; i <= l; i++) {\n c.a[i] = a[i] + b.a[i] + o;\n o = (c.a[i] < a[i]) || (b.a[i] == (u64)-1 && o);\n }\n if (o) {\n c.a[++l] = 1;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator-(const bignum &b) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n bool o = 0;\n int l = n;\n for (int i = 0; i <= l; i++) {\n c.a[i] = a[i] - b.a[i] - o;\n o = (c.a[i] > a[i]) || (b.a[i] == (u64)-1 && o);\n }\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator*(const bignum &b) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n u128 r = 0;\n int l = n + b.n;\n for (int i = 0; i <= n + b.n; i++) {\n u128 h = 0;\n\n for (int j = max(0, i - b.n); j <= min(i, n); j++) {\n u128 tp = (u128)a[j] * b.a[i - j];\n r += tp & ((u64)-1), h += tp >> 64;\n }\n\n c.a[i] = r;\n r = h + (r >> 64);\n }\n if (r) {\n c.a[++l] = r;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator/(const bignum &b) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n int n = lg(), m = b.lg();\n if (n < m) {\n return c;\n }\n\n bignum tp = *this, qwq = b << (n - m);\n int l = 0;\n for (int i = n - m; i != -1; i--, qwq >>= 1) {\n if (tp >= qwq) {\n tp -= qwq;\n c.a[i >> 6] |= 1ull << (i & 63);\n if (!l) {\n l = i;\n }\n }\n }\n\n c.n = l >> 6;\n return c;\n }\n\n bignum operator%(const bignum &b) const {\n bignum c = *this;\n\n int n = lg(), m = b.lg();\n if (n < m) {\n return c;\n }\n\n bignum tp = b << (n - m);\n for (int i = n; i >= m; i--, tp >>= 1) {\n if (c >= tp) {\n c -= tp;\n }\n }\n\n return c;\n }\n\n bignum operator+=(u64 x) {\n u64 tp = a[0];\n a[0] += x;\n bool o = a[0] < tp;\n\n if (o) {\n for (int i = 1; i <= n; i++) {\n if (a[i] == (u64)-1) {\n a[i] = 0;\n } else {\n a[i]++;\n o = 0;\n break;\n }\n }\n\n if (o) {\n a[++n] = 1;\n }\n }\n return *this;\n }\n\n bignum operator-=(u64 x) {\n u64 tp = a[0];\n a[0] -= x;\n bool o = a[0] > tp;\n\n if (o) {\n for (int i = 1; i <= n; i++) {\n if (!a[i]) {\n a[i] = -1;\n } else {\n a[i]--;\n break;\n }\n }\n while (n && !a[n]) {\n n--;\n }\n }\n return *this;\n }\n\n bignum operator*=(u64 x) {\n u128 ad = 0;\n\n for (int i = 0; i <= n; i++) {\n ad += (u128)a[i] * x;\n a[i] = ad, ad >>= 64;\n }\n\n if (ad) {\n a[++n] = ad;\n }\n\n return *this;\n }\n\n bignum operator/=(int m) {\n if (m == 1) {\n return *this;\n }\n\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\n\n int r = 0;\n\n for (int i = n; i != -1; i--) {\n u128 v = (u128)r * rr + a[i];\n u64 q = (v * b) >> 64;\n int gu = v - (u128)q * m;\n if (gu >= m) {\n gu -= m, q++;\n }\n\n a[i] = r * b + q, r = gu;\n }\n\n while (n && !a[n]) {\n n--;\n }\n\n return *this;\n }\n\n bignum operator+=(const bignum &b) {\n bool o = 0;\n int l = max(n, b.n);\n for (int i = 0; i <= l; i++) {\n u64 tp = a[i];\n a[i] += b.a[i] + o;\n o = (a[i] < tp) || (b.a[i] == (u64)-1 && o);\n }\n if (o) {\n a[++l] = 1;\n }\n n = l;\n\n return *this;\n }\n\n bignum operator-=(const bignum &b) {\n bool o = 0;\n int l = n;\n for (int i = 0; i <= l; i++) {\n u64 tp = a[i];\n a[i] -= b.a[i] + o;\n o = (a[i] > tp) || (b.a[i] == (u64)-1 && o);\n }\n while (l && !a[l]) {\n l--;\n }\n n = l;\n\n return *this;\n }\n\n bignum operator*=(const bignum &b) {\n return *this = *this * b;\n }\n\n bignum operator/=(const bignum &b) {\n return *this = *this / b;\n }\n\n bignum operator%=(const bignum &b) {\n return *this = *this % b;\n }\n\n bignum operator<<(int k) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n int t = k >> 6;\n memcpy(c.a + t, a, (n + 1) << 3);\n int l = n + t;\n\n t = k & 63;\n if (t) {\n for (int i = l + 1; i; i--) {\n c.a[i] = (c.a[i] << t) | (c.a[i - 1] >> (64 - t));\n }\n c.a[0] <<= t;\n\n if (c.a[l + 1]) {\n l++;\n }\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator>>(int k) const {\n bignum c;\n memset(&c, 0, sizeof c);\n\n int t = k >> 6;\n if (t > n) {\n return c;\n }\n\n memcpy(c.a, a + t, (n - t + 1) << 3);\n\n int l = n - t;\n t = k & 63;\n\n if (t) {\n for (int i = 0; i <= l; i++) {\n c.a[i] = (c.a[i] >> t) | (c.a[i + 1] << (64 - t));\n }\n }\n\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator&(const bignum &b) const {\n bignum c = *this;\n\n for (int i = 0; i <= b.n; i++) {\n c.a[i] &= b.a[i];\n }\n for (int i = b.n + 1; i <= c.n; i++) {\n c.a[i] = 0;\n }\n\n int l = c.n;\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator|(const bignum &b) const {\n bignum c = *this;\n\n for (int i = 0; i <= b.n; i++) {\n c.a[i] |= b.a[i];\n }\n c.n = max(c.n, b.n);\n\n return c;\n }\n\n bignum operator^(const bignum &b) const {\n bignum c = *this;\n\n for (int i = 0; i <= b.n; i++) {\n c.a[i] ^= b.a[i];\n }\n\n int l = max(c.n, b.n);\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n return c;\n }\n\n bignum operator<<=(int k) {\n int t = k >> 6;\n\n if (t) {\n for (int i = n; i != -1; i--) {\n a[i + t] = a[i];\n }\n memset(a, 0, t << 3);\n }\n n += t;\n\n t = k & 63;\n\n if (t) {\n for (int i = n + 1; i; i--) {\n a[i] = (a[i] << t) | (a[i - 1] >> (64 - t));\n }\n a[0] <<= t;\n }\n\n if (a[n + 1]) {\n n++;\n }\n\n return *this;\n }\n\n bignum operator>>=(int k) {\n int t = k >> 6;\n\n if (t > n) {\n memset(a, 0, (n + 1) << 3);\n n = 0;\n return *this;\n }\n\n for (int i = t; i <= n; i++) {\n a[i - t] = a[i];\n }\n memset(a + n - t + 1, 0, t << 3);\n n -= t;\n\n t = k & 63;\n\n if (t) {\n for (int i = 0; i <= n; i++) {\n a[i] = (a[i] >> t) | (a[i + 1] << (64 - t));\n }\n }\n while (n && !a[n]) {\n n--;\n }\n\n return *this;\n }\n\n bignum operator&=(const bignum &b) {\n for (int i = 0; i <= b.n; i++) {\n a[i] &= b.a[i];\n }\n for (int i = b.n + 1; i <= n; i++) {\n a[i] = 0;\n }\n\n while (n && !a[n]) {\n n--;\n }\n\n return *this;\n }\n\n bignum operator|=(const bignum &b) {\n for (int i = 0; i <= b.n; i++) {\n a[i] |= b.a[i];\n }\n n = max(n, b.n);\n\n return *this;\n }\n\n bignum operator^=(const bignum &b) {\n n = max(n, b.n);\n for (int i = 0; i <= b.n; i++) {\n a[i] ^= b.a[i];\n }\n\n while (n && !a[n]) {\n n--;\n }\n\n return *this;\n }\n};\n\nbool oa, ob;\n\nbignum read_bignum(bool &o) {\n static char str[100005];\n static u64 a[10005];\n static u64 bs = 1000000000000000000ll;\n\n cin >> str;\n int n = strlen(str);\n if (str[0] == '-') {\n o = 1;\n n--;\n for (int i = 0; i != n; i++) {\n str[i] = str[i + 1];\n }\n }\n reverse(str, str + n);\n\n for (int i = 0; i <= (n - 1) / 18; i++) {\n u64 v = 0;\n for (int j = min(n, (i + 1) * 18) - 1; j >= i * 18; j--) {\n v = v * 10 + str[j] - '0';\n }\n a[i] = v;\n }\n n = (n - 1) / 18;\n\n bignum c;\n memset(&c, 0, sizeof c);\n int m = 0;\n\n for (int i = n; i != -1; i--) {\n u128 ad = 0;\n for (int j = 0; j <= m; j++) {\n ad += (u128)c.a[j] * bs;\n c.a[j] = ad, ad >>= 64;\n }\n\n while (ad) {\n c.a[++m] = ad, ad >>= 64;\n }\n c.n = m;\n\n c += a[i], m = c.n;\n }\n\n return c;\n}\n\nvoid output(bignum a) {\n static u64 v[30005];\n const u64 bs = 1000000000000000000ll;\n\n int n = a.n, m = 0;\n\n for (int i = n; i != -1; i--) {\n u128 ad = 0;\n for (int j = 0; j <= m; j++) {\n ad += (u128)v[j] << 64;\n u128 gu = ad / bs;\n v[j] = ad - gu * bs, ad = gu;\n }\n\n while (ad) {\n u128 gu = ad / bs;\n v[++m] = ad - gu * bs, ad = gu;\n }\n\n ad = a.a[i];\n for (int j = 0; j <= m && ad; j++) {\n ad += v[j];\n u128 gu = ad / bs;\n v[j] = ad - gu * bs, ad = gu;\n }\n while (ad) {\n u128 gu = ad / bs;\n v[++m] = ad - gu * bs, ad = gu;\n }\n }\n\n cout << v[m];\n for (int i = m - 1; i != -1; i--) {\n cout << setw(18) << setfill('0') << v[i];\n }\n memset(v, 0, sizeof v);\n}\n\nbignum updiv(bignum &a, int m) {\n static bignum c;\n memset(&c, 0, sizeof c);\n\n if (m == 1) {\n return a;\n }\n\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\n\n int l = a.n;\n int r = 0;\n\n for (int i = l; i != -1; i--) {\n u128 v = (u128)r * rr + a.a[i];\n u64 q = (v * b) >> 64;\n int gu = v - (u128)q * m;\n if (gu >= m) {\n gu -= m, q++;\n }\n\n c.a[i] = r * b + q, r = gu;\n }\n\n while (l && !c.a[l]) {\n l--;\n }\n c.n = l;\n\n if (r) {\n bool o = 1;\n for (int i = 0; i <= l; i++) {\n if (c.a[i] == (u64)-1) {\n c.a[i] = 0;\n } else {\n c.a[i]++;\n o = 0;\n break;\n }\n }\n\n if (o) {\n c.a[++l] = 1;\n }\n }\n\n c.n = l;\n\n return c;\n}\n\nbignum gcd(bignum a, bignum b) {\n if (a > b) {\n swap(a, b);\n }\n\n if (a.n == 0 && !a.a[0]) {\n return b;\n }\n\n int l = min(a.ctz(), b.ctz());\n a >>= a.ctz(), b >>= b.ctz();\n\n while (1) {\n if (a.n == 0 && !a.a[0]) {\n return b << l;\n }\n\n if (!(a.a[0] & 1)) {\n a >>= 1;\n } else if (!(b.a[0] & 1)) {\n b >>= 1;\n } else {\n if (a < b) {\n swap(a, b);\n }\n a -= b;\n }\n }\n}\n\nint main() {\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\n bignum a = read_bignum(oa), b = read_bignum(ob);\n if (oa && ob) {\n cout << '-';\n oa = ob = 0;\n }\n\n if (oa == 0 && ob == 0) {\n output(a + b);\n cout << endl;\n return 0;\n }\n\n if (oa) {\n swap(a, b);\n }\n\n if (a >= b) {\n output(a - b);\n cout << endl;\n } else {\n cout << '-';\n output(b - a);\n cout << endl;\n }\n}","accuracy":1,"time_ms":320,"memory_kb":4732,"score_of_the_acc":-0.4639,"final_rank":9},{"submission_id":"aoj_NTL_2_A_7593476","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#include <boost/multiprecision/cpp_int.hpp>\n\nsigned main() {\n boost::multiprecision::cpp_int A, B;\n cin >> A >> B;\n cout << A + B << endl;\n}","accuracy":1,"time_ms":700,"memory_kb":3384,"score_of_the_acc":-1,"final_rank":10},{"submission_id":"aoj_NTL_2_A_7484494","code_snippet":"#include <bits/stdc++.h>\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\n#define pb push_back\n#define f first\n#define s second\n\nusing namespace std;\ntypedef pair <int,int> pii;\n\nconst int maxn = 1e5 + 5;\n\nstring t(string a,string b)\n{\n string c = \"\";\n int n1 = a.size();\n int n2 = b.size();\n if(n1 > n2) forr(i,1,n1 - n2) b = \"0\" + b;\n if(n1 < n2)\n {\n forr(i,1,n2 - n1) a = \"0\" + a;\n n1 = n2;\n }\n int nho = 0;\n forw(i,n1 - 1,0)\n {\n int res = a[i] - '0' + b[i] - '0' + nho;\n if(res > 9) nho = 1;\n else nho = 0;\n c = char(res%10 + 48) + c;\n }\n if(nho == 1) c = \"1\" + c;\n return c;\n}\n\nstring h(string a,string b)\n{\n string c = \"\";\n int n1 = a.size();\n int n2 = b.size();\n if(n2 < n1) forr(i,1,n1 - n2) b = \"0\" + b;\n int nho = 0;\n forw(i,n1 - 1,0)\n {\n int res = a[i] - '0' - (b[i] - '0') - nho;\n if(res < 0) nho = 1;\n else nho = 0;\n if(res < 0) c = char(res + 10 + 48) + c;\n else c = char(res + 48) + c;\n }\n while(c.size() > 1 && c[0] == '0') c.erase(0,1);\n return c;\n}\n\nstring a,b;\n\nint main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> a >> b;\n if(a[0] == '-')\n {\n if(b[0] == '-')\n {\n a.erase(0,1);\n b.erase(0,1);\n cout << \"-\" << t(a,b) << \"\\n\";\n return 0;\n }\n a.erase(0,1);\n if(b.size() > a.size() || (b.size() == a.size() && b >= a))\n {\n cout << h(b,a) << \"\\n\";\n return 0;\n }\n else\n {\n cout << \"-\" << h(a,b) << \"\\n\";\n return 0;\n }\n }\n else\n {\n if(b[0] == '-')\n {\n b.erase(0,1);\n if(b.size() < a.size() || (b.size() == a.size() && b <= a))\n {\n cout << h(a,b) << \"\\n\";\n return 0;\n }\n else\n {\n cout << \"-\" << h(b,a) << \"\\n\";\n return 0;\n }\n }\n else cout << t(a,b) << \"\\n\";\n //cout << \"Vandeeptry\";\n }\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":3988,"score_of_the_acc":-0.3544,"final_rank":7},{"submission_id":"aoj_NTL_2_A_7338655","code_snippet":"#line 2 \"nachia\\\\math-modulo\\\\modulo-primitive-root.hpp\"\n#include <vector>\n#include <utility>\n\nnamespace nachia{\n\ntemplate<unsigned int MOD>\nstruct PrimitiveRoot{\n using u64 = unsigned long long;\n static constexpr u64 powm(u64 a, u64 i) {\n u64 res = 1, aa = a;\n while(i){\n if(i & 1) res = res * aa % MOD;\n aa = aa * aa % MOD;\n i /= 2;\n }\n return res;\n }\n static constexpr bool ExamineVal(unsigned int g){\n unsigned int t = MOD - 1;\n for(u64 d=2; d*d<=t; d++) if(t % d == 0){\n if(powm(g, (MOD - 1) / d) == 1) return false;\n while(t % d == 0) t /= d;\n }\n if(t != 1) if(powm(g, (MOD - 1) / t) == 1) return false;\n return true;\n }\n static constexpr unsigned int GetVal(){\n for(unsigned int x=2; x<MOD; x++) if(ExamineVal(x)) return x;\n return 0;\n }\n static const unsigned int val = GetVal();\n};\n\n} // namespace nachia\n#line 1 \"nachia\\\\fps\\\\ntt-interface.hpp\"\n#include <algorithm>\n\nnamespace nachia {\n\ntemplate<class mint>\nstruct NttInterface{\n\ntemplate<class Iter>\nvoid Butterfly(Iter, int) const {}\n\ntemplate<class Iter>\nvoid IButterfly(Iter, int) const {}\n\ntemplate<class Iter>\nvoid BitReversal(Iter a, int N) const {\n for(int i=0, j=0; j<N; j++){\n if(i < j) std::swap(a[i], a[j]);\n for(int k = N>>1; k > (i^=k); k>>=1);\n }\n}\n\n};\n\n} // namespace nachia\n#line 4 \"nachia\\\\misc\\\\bit-operations.hpp\"\n\nnamespace nachia{\n\nint Popcount(unsigned long long c) noexcept {\n#ifdef __GNUC__\n return __builtin_popcountll(c);\n#else\n c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));\n c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));\n c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));\n c = (c * (~0ull/257)) >> 56;\n return c;\n#endif\n}\n\n// please ensure x != 0\nint MsbIndex(unsigned long long x) noexcept {\n#ifdef __GNUC__\n return 63 - __builtin_clzll(x);\n#else\n int res = 0;\n for(int d=32; d>0; d>>=1) if(x >> d){ res |= d; x >>= d; }\n return res;\n#endif\n}\n\n// please ensure x != 0\nint LsbIndex(unsigned long long x) noexcept {\n#ifdef __GNUC__\n return __builtin_ctzll(x);\n#else\n return MsbIndex(x & -x);\n#endif\n}\n\n}\n\n#line 5 \"nachia\\\\bigint\\\\ntt.hpp\"\n#include <iterator>\n#include <cassert>\n#line 8 \"nachia\\\\bigint\\\\ntt.hpp\"\n#include <array>\n\nnamespace nachia{\nnamespace bigint{\n\nconstexpr int bsf_constexpr(unsigned int n) {\n\tint x = 0;\n\twhile (!(n & (1 << x))) x++;\n\treturn x;\n}\n\ntemplate <class mint>\nstruct NttFromAcl : NttInterface<mint> {\n\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\n \nstatic int ceil_pow2(int n) {\n\tint x = 0;\n\twhile ((1U << x) < (u32)(n)) x++;\n\treturn x;\n}\n\nstruct fft_info {\n\tstatic constexpr u32 g = nachia::PrimitiveRoot<mint::GetMod()>::val;\n\tstatic constexpr int rank2 = bsf_constexpr(mint::GetMod()-1);\n\tstd::array<mint, rank2+1> root;\n\tstd::array<mint, rank2+1> iroot;\n\n\tstd::array<mint, std::max(0, rank2-1)> rate2;\n\tstd::array<mint, std::max(0, rank2-1)> irate2;\n\n\tstd::array<mint, std::max(0, rank2-2)> rate3;\n\tstd::array<mint, std::max(0, rank2-2)> irate3;\n\n\tfft_info(){\n\t\troot[rank2] = mint(g).pow((mint::GetMod() - 1) >> rank2);\n\t\tiroot[rank2] = root[rank2].inv();\n\t\tfor(int i=rank2-1; i>=0; i--){\n\t\t\troot[i] = root[i+1] * root[i+1];\n\t\t\tiroot[i] = iroot[i+1] * iroot[i+1];\n\t\t}\n\t\tmint prod = 1u, iprod = 1u;\n\t\tfor(int i=0; i<=rank2-2; i++){\n\t\t\trate2[i] = root[i+2] * prod;\n\t\t\tirate2[i] = iroot[i+2] * iprod;\n\t\t\tprod *= iroot[i+2];\n\t\t\tiprod *= root[i+2];\n\t\t}\n\t\tprod = 1u; iprod = 1u;\n\t\tfor(int i=0; i<=rank2-3; i++){\n\t\t\trate3[i] = root[i+3] * prod;\n\t\t\tirate3[i] = iroot[i+3] * iprod;\n\t\t\tprod *= iroot[i+3];\n\t\t\tiprod *= root[i+3];\n\t\t}\n\t}\n};\n\ntemplate<class RandomAccessIterator>\nvoid Butterfly(RandomAccessIterator a, int n) const {\n\tint h = ceil_pow2(n);\n\n\tstatic const fft_info info;\n\n\tint len = 0;\n\twhile(len < h){\n\t\tif(h-len == 1){\n\t\t\tint p = 1 << (h-len-1);\n\t\t\tmint rot = 1u;\n\t\t\tfor(int s=0; s<(1<<len); s++){\n\t\t\t\tint offset = s << (h-len);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto l = a[i+offset];\n\t\t\t\t\tauto r = a[i+offset+p] * rot;\n\t\t\t\t\ta[i+offset] = l+r;\n\t\t\t\t\ta[i+offset+p] = l-r;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<len)) rot *= info.rate2[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen++;\n\t\t} else {\n\t\t\tint p = 1 << (h-len-2);\n\t\t\tmint rot = 1u, imag = info.root[2];\n\t\t\tfor(int s=0; s<(1<<len); s++){\n\t\t\t\tmint rot2 = rot * rot;\n\t\t\t\tmint rot3 = rot2 * rot;\n\t\t\t\tint offset = s << (h-len);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto a0 = a[i+offset];\n\t\t\t\t\tauto a1 = a[i+offset+p] * rot;\n\t\t\t\t\tauto a2 = a[i+offset+2*p] * rot2;\n\t\t\t\t\tauto a3 = a[i+offset+3*p] * rot3;\n\t\t\t\t\tauto a0a2 = a0 + a2;\n\t\t\t\t\tauto a0b2 = a0 - a2;\n\t\t\t\t\tauto a1a3 = a1 + a3;\n\t\t\t\t\tauto a1na3imag = (a1 - a3) * imag;\n\t\t\t\t\ta[i+offset] = a0a2 + a1a3;\n\t\t\t\t\ta[i+offset+1*p] = a0a2 - a1a3;\n\t\t\t\t\ta[i+offset+2*p] = a0b2 + a1na3imag;\n\t\t\t\t\ta[i+offset+3*p] = a0b2 - a1na3imag;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<len)) rot *= info.rate3[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen += 2;\n\t\t}\n\t}\n}\n\ntemplate<class RandomAccessIterator>\nvoid IButterfly(RandomAccessIterator a, int n) const {\n\tint h = ceil_pow2(n);\n\n\tstatic const fft_info info;\n\n\tint len = h;\n\twhile(len){\n\t\tif(len == 1){\n\t\t\tint p = 1 << (h-len);\n\t\t\tmint irot = 1u;\n\t\t\tfor(int s=0; s<(1<<(len-1)); s++){\n\t\t\t\tint offset = s << (h-len+1);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto l = a[i+offset];\n\t\t\t\t\tauto r = a[i+offset+p];\n\t\t\t\t\ta[i+offset] = l+r;\n\t\t\t\t\ta[i+offset+p] = (l-r)*irot;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<(len-1))) irot *= info.irate2[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen--;\n\t\t} else {\n\t\t\tint p = 1 << (h-len);\n\t\t\tmint irot = 1u, iimag = info.iroot[2];\n\t\t\tfor(int s=0; s<(1<<(len-2)); s++){\n\t\t\t\tmint irot2 = irot * irot;\n\t\t\t\tmint irot3 = irot2 * irot;\n\t\t\t\tint offset = s << (h-len+2);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto a0 = a[i+offset+0*p];\n\t\t\t\t\tauto a1 = a[i+offset+1*p];\n\t\t\t\t\tauto a2 = a[i+offset+2*p];\n\t\t\t\t\tauto a3 = a[i+offset+3*p];\n\t\t\t\t\tauto a0a1 = a0 + a1;\n\t\t\t\t\tauto a0b1 = a0 - a1;\n\t\t\t\t\tauto a2a3 = a2 + a3;\n\t\t\t\t\tauto a2na3iimag = (a2 - a3) * iimag;\n\n\t\t\t\t\ta[i+offset] = a0a1 + a2a3;\n\t\t\t\t\ta[i+offset+1*p] = (a0b1 + a2na3iimag) * irot;\n\t\t\t\t\ta[i+offset+2*p] = (a0a1 - a2a3) * irot2;\n\t\t\t\t\ta[i+offset+3*p] = (a0b1 - a2na3iimag) * irot3;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<(len-2))) irot *= info.irate3[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen -= 2;\n\t\t}\n\t}\n}\n\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 3 \"nachia\\\\bigint\\\\static-p-modint.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\ntemplate<unsigned int MxVal>\nclass Montgomery32Info{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static constexpr u32 u32inverse(u32 x){\n u32 v = 1;\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\n return v;\n }\n static constexpr u32 getMy(u32 mx){ return (-mx) % mx; }\n static constexpr u32 powMod(u32 a, u32 i, u32 m){\n if(i == 0) return 1 % m;\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\n }\n static constexpr u32 Mx = MxVal;\n static constexpr u32 iMx = u32inverse(Mx);\n static constexpr u32 My1 = getMy(Mx);\n static constexpr u32 My2 = powMod(getMy(Mx), 2, Mx);\n static constexpr u32 My3 = powMod(getMy(Mx), 3, Mx);\n // return z\n // + z % Mx == x % Mx\n // + x <= max(x>>32, Mx-1)\n static constexpr u32 red(u64 x){\n u32 z1 = x >> 32;\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\n return z1 - z2 + (z1 < z2 ? Mx : 0);\n }\n};\n\ntemplate<unsigned int MOD>\nclass StaticPModint{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\nprivate:\n static constexpr u32 mod = MOD;\n using Tool = Montgomery32Info<MOD>;\n using MyType = StaticPModint;\n u32 _v;\n static MyType RAW(u32 v) { auto res = StaticPModint(); res._v = v; return res; }\npublic:\n StaticPModint() : _v(0) {}\n StaticPModint(u32 v) : _v(Tool::red((u64)v * Tool::My2)) {}\n StaticPModint(u64 v) : _v(Tool::red((u64)Tool::My3 * Tool::red(v))) {}\n u32 val() const { return Tool::red(_v); }\n u32 mrVal() const { return _v; }\n MyType& operator-=(MyType r) { _v = _v - r._v + (_v < r._v ? mod : 0); return *this; }\n MyType& operator+=(MyType r) { u32 t = mod - r._v; _v = _v - t + (_v < t ? mod : 0); return *this; }\n MyType& operator*=(MyType r) { _v = Tool::red((u64)_v * r._v); return *this; }\n MyType operator+(MyType r) const { auto v = *this; v += r; return v; }\n MyType operator-(MyType r) const { auto v = *this; v -= r; return v; }\n MyType operator*(MyType r) const { auto v = *this; v *= r; return v; }\n MyType operator-() const { return RAW(_v ? mod - _v : (u32)0); }\n MyType pow(unsigned long long i) const {\n MyType x = *this, r = RAW(Tool::My1);\n while(i){ if(i&1){ r *= x; } x*=x; i>>=1; }\n return r;\n }\n MyType inv() const { return pow(mod-2); }\n static constexpr u32 GetMod() { return mod; }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 2 \"nachia\\\\bigint\\\\dynamic-p-modint.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nclass DynMontgomery32Info{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static u32 u32inverse(u32 x) {\n u32 v = 1;\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\n return v;\n }\n static u32 getMy(u32 mx) { return (-mx) % mx; }\n static u32 powMod(u32 a, u32 i, u32 m) {\n if(i == 0) return 1 % m;\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\n }\n const u32 Mx;\n const u32 iMx;\n const u32 My1;\n const u32 My2;\n const u32 My3;\n DynMontgomery32Info(u32 newMod)\n : Mx(newMod)\n , iMx(u32inverse(Mx))\n , My1(getMy(Mx))\n , My2((u64)My1 * My1 % Mx)\n , My3((u64)My2 * My1 % Mx) {}\n\n // return z\n // + z % Mx == x % Mx\n // + x <= max(x>>32, Mx-1)\n u32 red(u64 x) const {\n u32 z1 = x >> 32;\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\n return z1 - z2 + (z1 < z2 ? Mx : 0);\n }\n u32 add(u32 a, u32 b) const { b = Mx-b; return a - b + ((a < b) ? Mx : 0u); }\n u32 sub(u32 a, u32 b) const { return a - b + ((a < b) ? Mx : 0u); }\n u32 mul(u32 a, u32 b) const { return red((u64)a * b); }\n u32 pow(u32 a, u32 i) const {\n u32 x = a, r = My1;\n while(i){ if(i&1){ r=mul(r,x); } x=mul(x,x); i>>=1; }\n return r;\n }\n u32 inv(u32 a) const { return pow(a, Mx-2); }\n u32 input64(u64 a) const { return mul(red(a), My3); }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\garner.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nstruct GarnerU96{\n using u32 = unsigned int;\n using u64 = unsigned long long;\n std::vector<u32> mods;\n std::vector<DynMontgomery32Info> dynmods;\n std::vector<std::vector<u32>> table_coeff;\n std::vector<u32> table_coeffinv;\n\n void precalc(std::vector<u32> new_mods){\n mods = std::move(new_mods);\n for(std::size_t i=0; i<mods.size(); i++) dynmods.emplace_back(mods[i]);\n int nmods = mods.size();\n table_coeff.assign(nmods+1, std::vector<u32>(nmods, 0));\n for(int k=0; k<nmods; k++) table_coeff[0][k] = dynmods[k].My2;\n for(int j=0; j<nmods; j++){\n for(int k=0; k<nmods; k++) table_coeff[j+1][k] = table_coeff[j][k];\n for(int k=j+1; k<nmods; k++) table_coeff[j+1][k] = dynmods[k].mul(table_coeff[j+1][k], dynmods[k].input64(mods[j]));\n }\n table_coeffinv.resize(nmods);\n for(int i=0; i<nmods; i++) table_coeffinv[i] = dynmods[i].inv(table_coeff[i][i]);\n }\n\n u64 calc(const std::vector<u32>& x){\n int nmods = mods.size();\n std::vector<u32> table_const(nmods);\n u64 res = 0;\n u64 res_coeff = 1;\n for(int j=0; j<nmods; j++){\n u32 t = dynmods[j].mul(dynmods[j].sub(x[j], table_const[j]), table_coeffinv[j]);\n for(int k=j+1; k<nmods; k++){\n table_const[k] = dynmods[k].add(dynmods[k].mul(t, table_coeff[j][k]), table_const[k]);\n }\n res += res_coeff * u64(t);\n res_coeff *= mods[j];\n }\n return res;\n }\n\n std::pair<std::vector<u32>, std::vector<u64>> calc(std::vector<std::vector<u32>> x){\n int n = x[0].size(), m = x.size();\n std::vector<u64> resl(n);\n std::vector<u32> resh(n);\n std::vector<u32> buf(m);\n u32 inv64 = dynmods[0].inv(dynmods[0].mul(dynmods[0].My3, dynmods[0].My2));\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++) buf[j] = x[j][i];\n resl[i] = calc(buf);\n resh[i] = dynmods[0].mul(dynmods[0].sub(buf[0], dynmods[0].input64(resl[i])), inv64);\n }\n return std::make_pair(std::move(resh), std::move(resl));\n }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\convolution.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nstruct MultiplySupply {\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static constexpr u32 MODCNT = 3;\n static constexpr u32 MOD[3] = { 3892314113, 3489660929, 3221225473 };\n \n GarnerU96 garner;\n\n MultiplySupply(){\n garner.precalc(std::vector<u32>(MOD, MOD + MODCNT));\n }\n \n template<unsigned int P>\n static std::vector<u32> SubConvolution(\n const std::vector<u32>& a,\n const std::vector<u32>& b\n ) {\n using Elem = StaticPModint<P>;\n static NttFromAcl<Elem> ntt;\n int z = a.size() + b.size() - 1;\n int N = 1; while(N < z) N *= 2;\n std::vector<Elem> A(N), B(N);\n for(std::size_t i=0; i<a.size(); i++) A[i] = a[i];\n for(std::size_t i=0; i<b.size(); i++) B[i] = b[i];\n Elem iN = Elem((u32)N).inv();\n ntt.Butterfly(A.begin(), N);\n ntt.Butterfly(B.begin(), N);\n for(int i=0; i<N; i++) A[i] = A[i] * B[i] * iN;\n ntt.IButterfly(A.begin(), N);\n std::vector<u32> res(z);\n for(int i=0; i<z; i++) res[i] = A[i].mrVal();\n return res;\n }\n \n std::vector<u32> multiplyBin(\n const std::vector<u32>& a,\n const std::vector<u32>& b\n ){\n if(a.empty() || b.empty()) return {};\n std::vector<std::vector<u32>> cx(MODCNT);\n cx[0] = SubConvolution<MOD[0]>(a, b);\n cx[1] = SubConvolution<MOD[1]>(a, b);\n cx[2] = SubConvolution<MOD[2]>(a, b);\n auto q = garner.calc(std::move(cx));\n int n = q.first.size();\n std::vector<u32> res(n + 2);\n for(int i=0; i<n; i++) res[i] = q.second[i];\n u64 c = 0;\n for(int i=0; i<n; i++){ res[i+1] = c += (u64)res[i+1] + (q.second[i] >> 32); c >>= 32; }\n res[n+1] = c; c = 0;\n for(int i=0; i<n; i++){ res[i+2] = c += (u64)res[i+2] + q.first[i]; c >>= 32; }\n while(res.size() && res.back() == 0) res.pop_back();\n return res;\n }\n \n std::vector<u32> multiplyDec(\n std::vector<u32> a,\n std::vector<u32> b\n ){\n static constexpr u32 d = 1000000000;\n if(a.empty() || b.empty()) return {};\n std::vector<std::vector<u32>> cx(MODCNT);\n cx[0] = SubConvolution<MOD[0]>(a, b);\n cx[1] = SubConvolution<MOD[1]>(a, b);\n cx[2] = SubConvolution<MOD[2]>(a, b);\n auto q0 = garner.calc(std::move(cx));\n int n = q0.first.size();\n std::vector<u64> buf(n + 2);\n static constexpr u32 j11 = (1ull << 32) / d;\n static constexpr u32 j10 = (-d) % d;\n static constexpr u32 j22 = 1 + (0ull- 1ull * d * d) / d / d;\n static constexpr u32 j21 = (-1ull * j22 * d * d) / d;\n static constexpr u32 j20 = (0ull-d) % d;\n for(int i=0; i<n; i++) buf[i] = q0.second[i] & ((1ull << 32) - 1);\n for(int i=0; i<n; i++) buf[i] += 1ull * (q0.second[i] >> 32) * j10;\n for(int i=0; i<n; i++) buf[i+1] += 1ull * (q0.second[i] >> 32) * j11;\n for(int i=0; i<n; i++) buf[i] += 1ull * q0.first[i] * j20; // q0.first[i] is small enough\n for(int i=0; i<n; i++) buf[i+1] += 1ull * q0.first[i] * j21;\n for(int i=0; i<n; i++) buf[i+2] += 1ull * q0.first[i] * j22;\n std::vector<u32> res(n + 2);\n u64 c = 0;\n for(int i=0; i<n+2; i++){ c += buf[i]; res[i] = c % d; c /= d; }\n while(res.size() && res.back() == 0) res.pop_back();\n return res;\n }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\base-operators.hpp\"\n#include <iostream>\n\nnamespace nachia {\nnamespace bigint {\n\nclass UIntDec {\npublic:\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nstd::vector<u32> x;\nstatic constexpr u32 BASE = 1'000'000'000;\n\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\n\nUIntDec() = default;\nUIntDec(std::vector<u32> _x) : x(std::move(_x)) {}\nUIntDec& operator+=(const UIntDec& b){\n x.resize(std::max(x.size(), b.x.size()) + 1);\n u64 c = 0;\n for(std::size_t i=0; i<b.x.size(); i++){\n c += b.x[i]; c += x[i];\n if(c >= BASE){ x[i] = c - BASE; c = 1; }\n else{ x[i] = c; c = 0; }\n }\n for(int i=b.x.size(); c; i++){\n c += x[i];\n if(c >= BASE){\n x[i] = c - BASE;\n c = 1;\n } else {\n x[i] = c;\n c = 0;\n break;\n }\n }\n Regularize();\n return *this;\n}\nUIntDec operator*(const UIntDec& b) const { return MultiplySupply().multiplyDec(x, b.x); }\n\nUIntDec Pow(u32 c) const {\n if(c == 0) return std::vector<u32>{1};\n if(c == 1) return *this;\n auto aa = Pow(c/2);\n aa = aa * aa;\n return (c&1) ? aa * (*this) : aa;\n}\nvoid mulU32(unsigned int cx) {\n u64 c = cx;\n for(std::size_t i=0; i<x.size(); i++){ c += (u64)x[i] << 32; x[i] = c % BASE; c /= BASE; }\n while(c){ x.push_back(c % BASE); c /= BASE; }\n}\n\n};\n\nclass UIntBin {\npublic:\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nstd::vector<u32> x;\n\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\n\nUIntBin() = default;\nUIntBin(std::vector<u32> _x) : x(std::move(_x)) {}\nUIntBin& operator+=(const UIntBin& b){\n x.resize(std::max(x.size(), b.x.size()) + 1);\n u64 c = 0;\n for(std::size_t i=0; i<b.x.size(); i++){\n c += b.x[i]; c += x[i];\n x[i] = c; c >>= 32;\n }\n for(int i=b.x.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\n Regularize();\n return *this;\n}\nUIntBin operator*(const UIntBin& b) const { return MultiplySupply().multiplyBin(x, b.x); }\n\nUIntBin Pow(u32 c) const {\n if(c == 0) return std::vector<u32>{1};\n if(c == 1) return *this;\n auto aa = Pow(c/2);\n aa = aa * aa;\n return (c&1) ? aa * (*this) : aa;\n}\nvoid mulD(unsigned int d, unsigned int cx) {\n u64 c = cx;\n for(std::size_t i=0; i<x.size(); i++){ x[i] = (c += (u64)x[i] * d); c >>= 32; }\n if(c) x.push_back(c);\n}\n\n};\n\nstd::vector<unsigned int> DecToBin(std::string decstr){\n std::vector<UIntBin> pdec;\n auto dfs = [&](auto& dfs, int l, int r) -> UIntBin {\n if(r - l <= 308){\n UIntBin p;\n for(int j=l; j<l+(r-l)%9; j++) p.mulD(10, decstr[j] - '0');\n for(int j=l+(r-l)%9; j<r; j+=9) p.mulD(1000000000, std::stoi(decstr.substr(j, 9)));\n return p;\n }\n if(pdec.empty()) pdec.push_back(UIntBin({10}).Pow(308));\n int h = 0; while(((308*2)<<h) < r-l) h++;\n while((int)pdec.size() < h+1) pdec.push_back(pdec.back() * pdec.back());\n auto res = dfs(dfs, l, r-(308<<h)) * pdec[h];\n res += dfs(dfs, r-(308<<h), r);\n return res;\n };\n return std::move(dfs(dfs, 0, decstr.size()).x);\n}\n\nstd::string BinToDec(std::vector<unsigned int> b){\n while(!b.empty() && !b.back()) b.pop_back();\n std::reverse(b.begin(), b.end());\n if(b.empty()) return \"0\";\n std::vector<UIntDec> pbin;\n auto dfs = [&](auto& dfs, int l, int r) -> UIntDec {\n if(r - l <= 29){\n UIntDec p;\n for(int j=l; j<r; j++) p.mulU32(b[j]);\n return p;\n }\n if(pbin.empty()) pbin.push_back(UIntDec({2}).Pow(32*29));\n int h = 0; while(((29*2)<<h) < r-l) h++;\n while((int)pbin.size() < h+1) pbin.push_back(pbin.back() * pbin.back());\n auto res = dfs(dfs, l, r-(29<<h)) * pbin[h];\n res += dfs(dfs, r-(29<<h), r);\n return res;\n };\n auto x = std::move(dfs(dfs, 0, b.size()).x);\n while(!x.empty() && !x.back()) x.pop_back();\n std::string res = std::to_string(x.back());\n res.resize(res.size() + 9 * (int)(x.size()-1), '0');\n for(int i=(int)x.size()-2; i>=0; i--){\n int o = res.size() - i*9 - 9;\n for(int j=o+8; j>=o; j--){ res[j] += x[i] % 10; x[i] /= 10; }\n }\n return res;\n}\n\n} // namespace bigint\n} // namespace nachia\n#line 4 \"nachia\\\\bigint\\\\integer.hpp\"\n\nnamespace nachia{\n\nclass UnsignedIntegerBin{\npublic:\n using MyType = UnsignedIntegerBin;\n friend class SignedIntegerBin;\nprivate:\n using u32 = uint32_t;\n using u64 = uint64_t;\n std::vector<u32> x;\n static inline bool Cflag;\n static MyType FromVec(std::vector<u32> _x){ MyType res; res.x = std::move(_x); return res; }\npublic:\n UnsignedIntegerBin(){}\n MyType operator>>(int sh) const {\n int h = sh / 32, l = sh % 32;\n MyType res; res.memreserve(size() - h);\n for(int i=h; i<size(); i++) res[i-h] = x[i] >> l;\n if(l) for(int i=h+1; i<size(); i++) res[i-h-1] |= x[i] << (32-l);\n res.regularize();\n return res;\n }\n MyType operator<<(int sh) const {\n int h = sh / 32, l = sh % 32;\n MyType res; res.memreserve(size() + h + 1);\n for(int i=0; i<size(); i++) res[i+h] = x[i] << l;\n if(l) for(int i=0; i<size(); i++) res[i+h+1] |= x[i] >> (32-l);\n res.regularize();\n return res;\n }\n MyType& operator>>=(int sh) { return (*this) = operator>>(sh); }\n MyType& operator<<=(int sh) { return (*this) = operator<<(sh); }\n MyType& operator%=(const MyType& d) { divInternal(d); return *this; }\n MyType operator%(const MyType& d) const { auto p = *this; return p.divInternal(d); }\n MyType operator/(const MyType& d) const { auto p = *this; return p.divInternal(d); }\n MyType& operator/=(const MyType& d) { return (*this) = divInternal(d); }\n MyType& operator+=(const MyType& v){\n memreserve(std::max(size(), v.size()) + 1);\n u64 c = 0;\n for(int i=0; i<v.size(); i++){ x[i] = (c += (u64)x[i] + v[i]); c >>= 32; }\n for(int i=v.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\n regularize();\n return *this;\n }\n MyType& operator-=(const MyType& v){\n memreserve(std::max(size(), v.size()));\n u64 c = 0;\n for(int i=0; i<v.size(); i++){\n c += v[i];\n x[i] -= c;\n c = (c + x[i]) >> 32;\n }\n for(int i=v.size(); i<size() && c; i++){\n x[i] -= c;\n c = (c + x[i]) >> 32;\n }\n Cflag = c;\n if(c){ complement(); increment(); }\n regularize();\n return *this;\n }\n MyType operator*(const MyType& v) const {\n MyType res;\n res.x = bigint::MultiplySupply().multiplyBin(x, v.x);\n res.regularize();\n return res;\n }\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\n MyType operator+(const MyType& r) { auto p = *this; p += r; return p; }\n MyType operator-(const MyType& r) { auto p = *this; p -= r; return p; }\n bool operator<(const MyType& r) const {\n return (size() != r.size())\n ? (size() < r.size())\n : std::lexicographical_compare(x.rbegin(), x.rend(), r.x.rbegin(), r.x.rend());\n }\n bool operator>(const MyType& r) const { return r < (*this); }\n bool operator<=(const MyType& r) const { return !(r < (*this)); }\n bool operator>=(const MyType& r) const { return !operator<(r); }\n bool operator==(const MyType& r) const { return x == r.x; }\n bool operator!=(const MyType& r) const { return x != r.x; }\n bool operator!() const { return size(); }\n bool isZero() const { return size() == 0; }\n std::string toStringBin() const {\n std::string res;\n for(int i=size()-1; i>=0; i--) for(int j=31; j>=0; j--) res.push_back('0' + (x[i]>>j) % 2);\n return res;\n }\n std::string toStringDec() const {\n if(isZero()) return \"0\";\n \n //auto p = *this;\n //std::string s;\n //while(!p.isZero()) s.push_back('0' + p.div10());\n //std::reverse(s.begin(), s.end());\n //return s;\n \n return bigint::BinToDec(x);\n }\n static MyType FromStringDec(const std::string& s) {\n return FromVec(bigint::DecToBin(s));\n }\n int lsb() const { for(int i=0; i<size(); i++){ if(x[i]) return nachia::LsbIndex(x[i]) + i * 32; } return -1; }\n int msb() const { for(int i=size()-1; i>=0; i--){ if(x[i]) return nachia::MsbIndex(x[i]) + i * 32; } return -1; }\nprivate:\n int size() const { return x.size(); }\n u32& operator[](int at) { return x[at]; }\n u32 operator[](int at) const { return x[at]; }\n void memreserve(int sz) { if((int)x.size() < sz) x.resize(sz); }\n void setBit(int at, bool val){ memreserve(at/32+1); x[at/32] |= (u32)(val?1:0) << (at%32); regularize(); }\n MyType divInternal(const MyType& d) {\n if(d.isZero()) throw 1;\n MyType res;\n for(int s=(size()-d.size())*32+31; s>=0; s--){\n MyType x = d << s;\n if(operator>=(x)){\n res.setBit(s, true); operator-=(x);\n }\n }\n res.regularize();\n return res;\n }\n void complement() { for(u32& y:x){ y = ~y; } }\n void increment() { if(isZero()){ x = {1}; return; } int i=0; while(i < size() && !~x[i]){ x[i++]++; } if(i>=size()){ x.push_back(1); } else x[i]++; }\n void decrement() { if(isZero()){ x = {1}; return; } int i=0; while(x[i]){ x[i++]--; } x[i]--; regularize(); }\n void regularize() { while(!x.empty() && 0 == x.back()) x.pop_back(); }\n int div10() {\n u64 c = 0;\n for(int i=size()-1; i>=0; i--){\n c = (c << 32) | x[i];\n x[i] = c / 10;\n c %= 10;\n }\n regularize();\n return c;\n }\n void mul10(int d) {\n u64 c = d;\n for(int i=0; i<size(); i++){ x[i] = (c += (u64)x[i] * 10); c >>= 32; }\n if(c) x.push_back(c);\n }\n};\n\nclass SignedIntegerBin{\n using MyType = SignedIntegerBin;\n using UInt = UnsignedIntegerBin;\nprivate:\n UInt u;\n int sign = 1;\n void regularize(){ u.regularize(); if(u.isZero()) sign = 1; }\n static MyType Raw(UInt u, int s){ MyType res; res.u = std::move(u); res.sign = s; res.regularize(); return res; }\npublic:\n bool isZero() const { return u.isZero(); }\n MyType& operator+=(const MyType& r) {\n if(sign == r.sign) u += r.u;\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\n regularize();\n return *this;\n }\n MyType& operator-=(const MyType& r) {\n if(sign != r.sign) u += r.u;\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\n regularize();\n return *this;\n }\n MyType operator*(const MyType& r) const { return Raw(u*r.u, sign*r.sign); }\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\n MyType operator+(const MyType& r) const { auto p = *this; p += r; return p; }\n MyType operator-(const MyType& r) const { auto p = *this; p -= r; return p; }\n MyType operator-() const { return Raw(u, -sign); }\n MyType& operator<<=(int sh) { u <<= sh; return *this; }\n MyType& operator>>=(int sh) { u >>= sh; return *this; }\n MyType operator<<(int sh) const { return Raw(u<<sh, sign); }\n MyType operator>>(int sh) const { return Raw(u<<sh, sign); }\n MyType operator/(const MyType& r) const { return Raw(u/r.u, sign*r.sign); }\n MyType& operator/=(const MyType& r) { return (*this) = operator/(r); }\n MyType operator%(const MyType& r) const { return Raw(u%r.u, sign*r.sign); }\n MyType& operator%=(const MyType& r) { return (*this) = operator%(r); }\n std::string toStringDec() const {\n if(isZero()) return \"0\";\n return (sign>0 ? \"\" : \"-\") + u.toStringDec();\n }\n static MyType FromStringDec(const std::string& s) {\n if(s.empty()) return MyType();\n if(s[0] == '+') return Raw(UInt::FromStringDec(s.substr(1)), 1);\n if(s[0] == '-') return Raw(UInt::FromStringDec(s.substr(1)), -1);\n return Raw(UInt::FromStringDec(s), 1);\n }\n};\n\n} // namespace nachia\n#line 2 \"Main.cpp\"\n#include <cstdint>\n#line 5 \"Main.cpp\"\n#include <string>\n#line 7 \"Main.cpp\"\n\n\nint main() {\n using Int = nachia::SignedIntegerBin;\n std::string s;\n std::cin >> s;\n Int a = Int::FromStringDec(s);\n std::cin >> s;\n Int b = Int::FromStringDec(s);\n Int c = a + b;\n std::cout << c.toStringDec() << '\\n';\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4312,"score_of_the_acc":-0.0825,"final_rank":5},{"submission_id":"aoj_NTL_2_A_7338649","code_snippet":"#line 2 \"nachia\\\\math-modulo\\\\modulo-primitive-root.hpp\"\n#include <vector>\n#include <utility>\n\nnamespace nachia{\n\ntemplate<unsigned int MOD>\nstruct PrimitiveRoot{\n using u64 = unsigned long long;\n static constexpr u64 powm(u64 a, u64 i) {\n u64 res = 1, aa = a;\n while(i){\n if(i & 1) res = res * aa % MOD;\n aa = aa * aa % MOD;\n i /= 2;\n }\n return res;\n }\n static constexpr bool ExamineVal(unsigned int g){\n unsigned int t = MOD - 1;\n for(u64 d=2; d*d<=t; d++) if(t % d == 0){\n if(powm(g, (MOD - 1) / d) == 1) return false;\n while(t % d == 0) t /= d;\n }\n if(t != 1) if(powm(g, (MOD - 1) / t) == 1) return false;\n return true;\n }\n static constexpr unsigned int GetVal(){\n for(unsigned int x=2; x<MOD; x++) if(ExamineVal(x)) return x;\n return 0;\n }\n static const unsigned int val = GetVal();\n};\n\n} // namespace nachia\n#line 1 \"nachia\\\\fps\\\\ntt-interface.hpp\"\n#include <algorithm>\n\nnamespace nachia {\n\ntemplate<class mint>\nstruct NttInterface{\n\ntemplate<class Iter>\nvoid Butterfly(Iter, int) const {}\n\ntemplate<class Iter>\nvoid IButterfly(Iter, int) const {}\n\ntemplate<class Iter>\nvoid BitReversal(Iter a, int N) const {\n for(int i=0, j=0; j<N; j++){\n if(i < j) std::swap(a[i], a[j]);\n for(int k = N>>1; k > (i^=k); k>>=1);\n }\n}\n\n};\n\n} // namespace nachia\n#line 4 \"nachia\\\\misc\\\\bit-operations.hpp\"\n\nnamespace nachia{\n\nint Popcount(unsigned long long c) noexcept {\n#ifdef __GNUC__\n return __builtin_popcountll(c);\n#else\n c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));\n c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));\n c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));\n c = (c * (~0ull/257)) >> 56;\n return c;\n#endif\n}\n\n// please ensure x != 0\nint MsbIndex(unsigned long long x) noexcept {\n#ifdef __GNUC__\n return 63 - __builtin_clzll(x);\n#else\n int res = 0;\n for(int d=32; d>0; d>>=1) if(x >> d){ res |= d; x >>= d; }\n return res;\n#endif\n}\n\n// please ensure x != 0\nint LsbIndex(unsigned long long x) noexcept {\n#ifdef __GNUC__\n return __builtin_ctzll(x);\n#else\n return MsbIndex(x & -x);\n#endif\n}\n\n}\n\n#line 5 \"nachia\\\\bigint\\\\ntt.hpp\"\n#include <iterator>\n#include <cassert>\n#line 8 \"nachia\\\\bigint\\\\ntt.hpp\"\n#include <array>\n\nnamespace nachia{\nnamespace bigint{\n\nconstexpr int bsf_constexpr(unsigned int n) {\n\tint x = 0;\n\twhile (!(n & (1 << x))) x++;\n\treturn x;\n}\n\ntemplate <class mint>\nstruct NttFromAcl : NttInterface<mint> {\n\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\n \nstatic int ceil_pow2(int n) {\n\tint x = 0;\n\twhile ((1U << x) < (u32)(n)) x++;\n\treturn x;\n}\n\nstruct fft_info {\n\tstatic constexpr u32 g = nachia::PrimitiveRoot<mint::GetMod()>::val;\n\tstatic constexpr int rank2 = bsf_constexpr(mint::GetMod()-1);\n\tstd::array<mint, rank2+1> root;\n\tstd::array<mint, rank2+1> iroot;\n\n\tstd::array<mint, std::max(0, rank2-1)> rate2;\n\tstd::array<mint, std::max(0, rank2-1)> irate2;\n\n\tstd::array<mint, std::max(0, rank2-2)> rate3;\n\tstd::array<mint, std::max(0, rank2-2)> irate3;\n\n\tfft_info(){\n\t\troot[rank2] = mint(g).pow((mint::GetMod() - 1) >> rank2);\n\t\tiroot[rank2] = root[rank2].inv();\n\t\tfor(int i=rank2-1; i>=0; i--){\n\t\t\troot[i] = root[i+1] * root[i+1];\n\t\t\tiroot[i] = iroot[i+1] * iroot[i+1];\n\t\t}\n\t\tmint prod = 1u, iprod = 1u;\n\t\tfor(int i=0; i<=rank2-2; i++){\n\t\t\trate2[i] = root[i+2] * prod;\n\t\t\tirate2[i] = iroot[i+2] * iprod;\n\t\t\tprod *= iroot[i+2];\n\t\t\tiprod *= root[i+2];\n\t\t}\n\t\tprod = 1u; iprod = 1u;\n\t\tfor(int i=0; i<=rank2-3; i++){\n\t\t\trate3[i] = root[i+3] * prod;\n\t\t\tirate3[i] = iroot[i+3] * iprod;\n\t\t\tprod *= iroot[i+3];\n\t\t\tiprod *= root[i+3];\n\t\t}\n\t}\n};\n\ntemplate<class RandomAccessIterator>\nvoid Butterfly(RandomAccessIterator a, int n) const {\n\tint h = ceil_pow2(n);\n\n\tstatic const fft_info info;\n\n\tint len = 0;\n\twhile(len < h){\n\t\tif(h-len == 1){\n\t\t\tint p = 1 << (h-len-1);\n\t\t\tmint rot = 1u;\n\t\t\tfor(int s=0; s<(1<<len); s++){\n\t\t\t\tint offset = s << (h-len);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto l = a[i+offset];\n\t\t\t\t\tauto r = a[i+offset+p] * rot;\n\t\t\t\t\ta[i+offset] = l+r;\n\t\t\t\t\ta[i+offset+p] = l-r;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<len)) rot *= info.rate2[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen++;\n\t\t} else {\n\t\t\tint p = 1 << (h-len-2);\n\t\t\tmint rot = 1u, imag = info.root[2];\n\t\t\tfor(int s=0; s<(1<<len); s++){\n\t\t\t\tmint rot2 = rot * rot;\n\t\t\t\tmint rot3 = rot2 * rot;\n\t\t\t\tint offset = s << (h-len);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto a0 = a[i+offset];\n\t\t\t\t\tauto a1 = a[i+offset+p] * rot;\n\t\t\t\t\tauto a2 = a[i+offset+2*p] * rot2;\n\t\t\t\t\tauto a3 = a[i+offset+3*p] * rot3;\n\t\t\t\t\tauto a0a2 = a0 + a2;\n\t\t\t\t\tauto a0b2 = a0 - a2;\n\t\t\t\t\tauto a1a3 = a1 + a3;\n\t\t\t\t\tauto a1na3imag = (a1 - a3) * imag;\n\t\t\t\t\ta[i+offset] = a0a2 + a1a3;\n\t\t\t\t\ta[i+offset+1*p] = a0a2 - a1a3;\n\t\t\t\t\ta[i+offset+2*p] = a0b2 + a1na3imag;\n\t\t\t\t\ta[i+offset+3*p] = a0b2 - a1na3imag;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<len)) rot *= info.rate3[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen += 2;\n\t\t}\n\t}\n}\n\ntemplate<class RandomAccessIterator>\nvoid IButterfly(RandomAccessIterator a, int n) const {\n\tint h = ceil_pow2(n);\n\n\tstatic const fft_info info;\n\n\tint len = h;\n\twhile(len){\n\t\tif(len == 1){\n\t\t\tint p = 1 << (h-len);\n\t\t\tmint irot = 1u;\n\t\t\tfor(int s=0; s<(1<<(len-1)); s++){\n\t\t\t\tint offset = s << (h-len+1);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto l = a[i+offset];\n\t\t\t\t\tauto r = a[i+offset+p];\n\t\t\t\t\ta[i+offset] = l+r;\n\t\t\t\t\ta[i+offset+p] = (l-r)*irot;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<(len-1))) irot *= info.irate2[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen--;\n\t\t} else {\n\t\t\tint p = 1 << (h-len);\n\t\t\tmint irot = 1u, iimag = info.iroot[2];\n\t\t\tfor(int s=0; s<(1<<(len-2)); s++){\n\t\t\t\tmint irot2 = irot * irot;\n\t\t\t\tmint irot3 = irot2 * irot;\n\t\t\t\tint offset = s << (h-len+2);\n\t\t\t\tfor(int i=0; i<p; i++){\n\t\t\t\t\tauto a0 = a[i+offset+0*p];\n\t\t\t\t\tauto a1 = a[i+offset+1*p];\n\t\t\t\t\tauto a2 = a[i+offset+2*p];\n\t\t\t\t\tauto a3 = a[i+offset+3*p];\n\t\t\t\t\tauto a0a1 = a0 + a1;\n\t\t\t\t\tauto a0b1 = a0 - a1;\n\t\t\t\t\tauto a2a3 = a2 + a3;\n\t\t\t\t\tauto a2na3iimag = (a2 - a3) * iimag;\n\n\t\t\t\t\ta[i+offset] = a0a1 + a2a3;\n\t\t\t\t\ta[i+offset+1*p] = (a0b1 + a2na3iimag) * irot;\n\t\t\t\t\ta[i+offset+2*p] = (a0a1 - a2a3) * irot2;\n\t\t\t\t\ta[i+offset+3*p] = (a0b1 - a2na3iimag) * irot3;\n\t\t\t\t}\n\t\t\t\tif(s+1 != (1<<(len-2))) irot *= info.irate3[LsbIndex(~(u32)(s))];\n\t\t\t}\n\t\t\tlen -= 2;\n\t\t}\n\t}\n}\n\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 3 \"nachia\\\\bigint\\\\static-p-modint.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\ntemplate<unsigned int MxVal>\nclass Montgomery32Info{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static constexpr u32 u32inverse(u32 x){\n u32 v = 1;\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\n return v;\n }\n static constexpr u32 getMy(u32 mx){ return (-mx) % mx; }\n static constexpr u32 powMod(u32 a, u32 i, u32 m){\n if(i == 0) return 1 % m;\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\n }\n static constexpr u32 Mx = MxVal;\n static constexpr u32 iMx = u32inverse(Mx);\n static constexpr u32 My1 = getMy(Mx);\n static constexpr u32 My2 = powMod(getMy(Mx), 2, Mx);\n static constexpr u32 My3 = powMod(getMy(Mx), 3, Mx);\n // return z\n // + z % Mx == x % Mx\n // + x <= max(x>>32, Mx-1)\n static constexpr u32 red(u64 x){\n u32 z1 = x >> 32;\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\n return z1 - z2 + (z1 < z2 ? Mx : 0);\n }\n};\n\ntemplate<unsigned int MOD>\nclass StaticPModint{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\nprivate:\n static constexpr u32 mod = MOD;\n using Tool = Montgomery32Info<MOD>;\n using MyType = StaticPModint;\n u32 _v;\n static MyType RAW(u32 v) { auto res = StaticPModint(); res._v = v; return res; }\npublic:\n StaticPModint() : _v(0) {}\n StaticPModint(u32 v) : _v(Tool::red((u64)v * Tool::My2)) {}\n StaticPModint(u64 v) : _v(Tool::red((u64)Tool::My3 * Tool::red(v))) {}\n u32 val() const { return Tool::red(_v); }\n u32 mrVal() const { return _v; }\n MyType& operator-=(MyType r) { _v = _v - r._v + (_v < r._v ? mod : 0); return *this; }\n MyType& operator+=(MyType r) { u32 t = mod - r._v; _v = _v - t + (_v < t ? mod : 0); return *this; }\n MyType& operator*=(MyType r) { _v = Tool::red((u64)_v * r._v); return *this; }\n MyType operator+(MyType r) const { auto v = *this; v += r; return v; }\n MyType operator-(MyType r) const { auto v = *this; v -= r; return v; }\n MyType operator*(MyType r) const { auto v = *this; v *= r; return v; }\n MyType operator-() const { return RAW(_v ? mod - _v : (u32)0); }\n MyType pow(unsigned long long i) const {\n MyType x = *this, r = RAW(Tool::My1);\n while(i){ if(i&1){ r *= x; } x*=x; i>>=1; }\n return r;\n }\n MyType inv() const { return pow(mod-2); }\n static constexpr u32 GetMod() { return mod; }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 2 \"nachia\\\\bigint\\\\dynamic-p-modint.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nclass DynMontgomery32Info{\npublic:\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static u32 u32inverse(u32 x) {\n u32 v = 1;\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\n return v;\n }\n static u32 getMy(u32 mx) { return (-mx) % mx; }\n static u32 powMod(u32 a, u32 i, u32 m) {\n if(i == 0) return 1 % m;\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\n }\n const u32 Mx;\n const u32 iMx;\n const u32 My1;\n const u32 My2;\n const u32 My3;\n DynMontgomery32Info(u32 newMod)\n : Mx(newMod)\n , iMx(u32inverse(Mx))\n , My1(getMy(Mx))\n , My2((u64)My1 * My1 % Mx)\n , My3((u64)My2 * My1 % Mx) {}\n\n // return z\n // + z % Mx == x % Mx\n // + x <= max(x>>32, Mx-1)\n u32 red(u64 x) const {\n u32 z1 = x >> 32;\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\n return z1 - z2 + (z1 < z2 ? Mx : 0);\n }\n u32 add(u32 a, u32 b) const { b = Mx-b; return a - b + ((a < b) ? Mx : 0u); }\n u32 sub(u32 a, u32 b) const { return a - b + ((a < b) ? Mx : 0u); }\n u32 mul(u32 a, u32 b) const { return red((u64)a * b); }\n u32 pow(u32 a, u32 i) const {\n u32 x = a, r = My1;\n while(i){ if(i&1){ r=mul(r,x); } x=mul(x,x); i>>=1; }\n return r;\n }\n u32 inv(u32 a) const { return pow(a, Mx-2); }\n u32 input64(u64 a) const { return mul(red(a), My3); }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\garner.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nstruct GarnerU96{\n using u32 = unsigned int;\n using u64 = unsigned long long;\n std::vector<u32> mods;\n std::vector<DynMontgomery32Info> dynmods;\n std::vector<std::vector<u32>> table_coeff;\n std::vector<u32> table_coeffinv;\n\n void precalc(std::vector<u32> new_mods){\n mods = std::move(new_mods);\n for(std::size_t i=0; i<mods.size(); i++) dynmods.emplace_back(mods[i]);\n int nmods = mods.size();\n table_coeff.assign(nmods+1, std::vector<u32>(nmods, 0));\n for(int k=0; k<nmods; k++) table_coeff[0][k] = dynmods[k].My2;\n for(int j=0; j<nmods; j++){\n for(int k=0; k<nmods; k++) table_coeff[j+1][k] = table_coeff[j][k];\n for(int k=j+1; k<nmods; k++) table_coeff[j+1][k] = dynmods[k].mul(table_coeff[j+1][k], dynmods[k].input64(mods[j]));\n }\n table_coeffinv.resize(nmods);\n for(int i=0; i<nmods; i++) table_coeffinv[i] = dynmods[i].inv(table_coeff[i][i]);\n }\n\n u64 calc(const std::vector<u32>& x){\n int nmods = mods.size();\n std::vector<u32> table_const(nmods);\n u64 res = 0;\n u64 res_coeff = 1;\n for(int j=0; j<nmods; j++){\n u32 t = dynmods[j].mul(dynmods[j].sub(x[j], table_const[j]), table_coeffinv[j]);\n for(int k=j+1; k<nmods; k++){\n table_const[k] = dynmods[k].add(dynmods[k].mul(t, table_coeff[j][k]), table_const[k]);\n }\n res += res_coeff * u64(t);\n res_coeff *= mods[j];\n }\n return res;\n }\n\n std::pair<std::vector<u32>, std::vector<u64>> calc(std::vector<std::vector<u32>> x){\n int n = x[0].size(), m = x.size();\n std::vector<u64> resl(n);\n std::vector<u32> resh(n);\n std::vector<u32> buf(m);\n u32 inv64 = dynmods[0].inv(dynmods[0].mul(dynmods[0].My3, dynmods[0].My2));\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++) buf[j] = x[j][i];\n resl[i] = calc(buf);\n resh[i] = dynmods[0].mul(dynmods[0].sub(buf[0], dynmods[0].input64(resl[i])), inv64);\n }\n return std::make_pair(std::move(resh), std::move(resl));\n }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\convolution.hpp\"\n\nnamespace nachia{\nnamespace bigint{\n\nstruct MultiplySupply {\n using u32 = unsigned int;\n using u64 = unsigned long long;\n static constexpr u32 MODCNT = 3;\n static constexpr u32 MOD[3] = { 3892314113, 3489660929, 3221225473 };\n \n GarnerU96 garner;\n\n MultiplySupply(){\n garner.precalc(std::vector<u32>(MOD, MOD + MODCNT));\n }\n \n template<unsigned int P>\n static std::vector<u32> SubConvolution(\n const std::vector<u32>& a,\n const std::vector<u32>& b\n ) {\n using Elem = StaticPModint<P>;\n static NttFromAcl<Elem> ntt;\n int z = a.size() + b.size() - 1;\n int N = 1; while(N < z) N *= 2;\n std::vector<Elem> A(N), B(N);\n for(std::size_t i=0; i<a.size(); i++) A[i] = a[i];\n for(std::size_t i=0; i<b.size(); i++) B[i] = b[i];\n Elem iN = Elem((u32)N).inv();\n ntt.Butterfly(A.begin(), N);\n ntt.Butterfly(B.begin(), N);\n for(int i=0; i<N; i++) A[i] = A[i] * B[i] * iN;\n ntt.IButterfly(A.begin(), N);\n std::vector<u32> res(z);\n for(int i=0; i<z; i++) res[i] = A[i].mrVal();\n return res;\n }\n \n std::vector<u32> multiplyBin(\n const std::vector<u32>& a,\n const std::vector<u32>& b\n ){\n if(a.empty() || b.empty()) return {};\n std::vector<std::vector<u32>> cx(MODCNT);\n cx[0] = SubConvolution<MOD[0]>(a, b);\n cx[1] = SubConvolution<MOD[1]>(a, b);\n cx[2] = SubConvolution<MOD[2]>(a, b);\n auto q = garner.calc(std::move(cx));\n int n = q.first.size();\n std::vector<u32> res(n + 2);\n for(int i=0; i<n; i++) res[i] = q.second[i];\n u64 c = 0;\n for(int i=0; i<n; i++){ res[i+1] = c += (u64)res[i+1] + (q.second[i] >> 32); c >>= 32; }\n res[n+1] = c; c = 0;\n for(int i=0; i<n; i++){ res[i+2] = c += (u64)res[i+2] + q.first[i]; c >>= 32; }\n while(res.size() && res.back() == 0) res.pop_back();\n return res;\n }\n \n std::vector<u32> multiplyDec(\n std::vector<u32> a,\n std::vector<u32> b\n ){\n static constexpr u32 d = 1000000000;\n if(a.empty() || b.empty()) return {};\n std::vector<std::vector<u32>> cx(MODCNT);\n cx[0] = SubConvolution<MOD[0]>(a, b);\n cx[1] = SubConvolution<MOD[1]>(a, b);\n cx[2] = SubConvolution<MOD[2]>(a, b);\n auto q0 = garner.calc(std::move(cx));\n int n = q0.first.size();\n std::vector<u64> buf(n + 2);\n static constexpr u32 j11 = (1ull << 32) / d;\n static constexpr u32 j10 = (-d) % d;\n static constexpr u32 j22 = 1 + (0ull- 1ull * d * d) / d / d;\n static constexpr u32 j21 = (-1ull * j22 * d * d) / d;\n static constexpr u32 j20 = (0ull-d) % d;\n for(int i=0; i<n; i++) buf[i] = q0.second[i] & ((1ull << 32) - 1);\n for(int i=0; i<n; i++) buf[i] += 1ull * (q0.second[i] >> 32) * j10;\n for(int i=0; i<n; i++) buf[i+1] += 1ull * (q0.second[i] >> 32) * j11;\n for(int i=0; i<n; i++) buf[i] += 1ull * q0.first[i] * j20; // q0.first[i] is small enough\n for(int i=0; i<n; i++) buf[i+1] += 1ull * q0.first[i] * j21;\n for(int i=0; i<n; i++) buf[i+2] += 1ull * q0.first[i] * j22;\n std::vector<u32> res(n + 2);\n u64 c = 0;\n for(int i=0; i<n+2; i++){ c += buf[i]; res[i] = c % d; c /= d; }\n while(res.size() && res.back() == 0) res.pop_back();\n return res;\n }\n};\n\n} // namespace bigint\n} // namespace nachia\n#line 5 \"nachia\\\\bigint\\\\base-operators.hpp\"\n#include <iostream>\n\nnamespace nachia {\nnamespace bigint {\n\nclass UIntDec {\npublic:\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nstd::vector<u32> x;\nstatic constexpr u32 BASE = 1'000'000'000;\n\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\n\nUIntDec() = default;\nUIntDec(std::vector<u32> _x) : x(std::move(_x)) {}\nUIntDec& operator+=(const UIntDec& b){\n x.resize(std::max(x.size(), b.x.size()) + 1);\n u64 c = 0;\n for(std::size_t i=0; i<b.x.size(); i++){\n c += b.x[i]; c += x[i];\n if(c >= BASE){ x[i] = c - BASE; c = 1; }\n else{ x[i] = c; c = 0; }\n }\n for(int i=b.x.size(); c; i++){\n x[i] = c += x[i];\n if(c < BASE) break;\n c = x[i] -= BASE;\n }\n Regularize();\n return *this;\n}\nUIntDec operator*(const UIntDec& b) const { return MultiplySupply().multiplyDec(x, b.x); }\n\nUIntDec Pow(u32 c) const {\n if(c == 0) return std::vector<u32>{1};\n if(c == 1) return *this;\n auto aa = Pow(c/2);\n aa = aa * aa;\n return (c&1) ? aa * (*this) : aa;\n}\nvoid mulU32(unsigned int cx) {\n u64 c = cx;\n for(std::size_t i=0; i<x.size(); i++){ c += (u64)x[i] << 32; x[i] = c % BASE; c /= BASE; }\n while(c){ x.push_back(c % BASE); c /= BASE; }\n}\n\n};\n\nclass UIntBin {\npublic:\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nstd::vector<u32> x;\n\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\n\nUIntBin() = default;\nUIntBin(std::vector<u32> _x) : x(std::move(_x)) {}\nUIntBin& operator+=(const UIntBin& b){\n x.resize(std::max(x.size(), b.x.size()) + 1);\n u64 c = 0;\n for(std::size_t i=0; i<b.x.size(); i++){\n c += b.x[i]; c += x[i];\n x[i] = c; c >>= 32;\n }\n for(int i=b.x.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\n Regularize();\n return *this;\n}\nUIntBin operator*(const UIntBin& b) const { return MultiplySupply().multiplyBin(x, b.x); }\n\nUIntBin Pow(u32 c) const {\n if(c == 0) return std::vector<u32>{1};\n if(c == 1) return *this;\n auto aa = Pow(c/2);\n aa = aa * aa;\n return (c&1) ? aa * (*this) : aa;\n}\nvoid mulD(unsigned int d, unsigned int cx) {\n u64 c = cx;\n for(std::size_t i=0; i<x.size(); i++){ x[i] = (c += (u64)x[i] * d); c >>= 32; }\n if(c) x.push_back(c);\n}\n\n};\n\nstd::vector<unsigned int> DecToBin(std::string decstr){\n std::vector<UIntBin> pdec;\n auto dfs = [&](auto& dfs, int l, int r) -> UIntBin {\n if(r - l <= 308){\n UIntBin p;\n for(int j=l; j<l+(r-l)%9; j++) p.mulD(10, decstr[j] - '0');\n for(int j=l+(r-l)%9; j<r; j+=9) p.mulD(1000000000, std::stoi(decstr.substr(j, 9)));\n return p;\n }\n if(pdec.empty()) pdec.push_back(UIntBin({10}).Pow(308));\n int h = 0; while(((308*2)<<h) < r-l) h++;\n while((int)pdec.size() < h+1) pdec.push_back(pdec.back() * pdec.back());\n auto res = dfs(dfs, l, r-(308<<h)) * pdec[h];\n res += dfs(dfs, r-(308<<h), r);\n return res;\n };\n return std::move(dfs(dfs, 0, decstr.size()).x);\n}\n\nstd::string BinToDec(std::vector<unsigned int> b){\n while(!b.empty() && !b.back()) b.pop_back();\n std::reverse(b.begin(), b.end());\n if(b.empty()) return \"0\";\n std::vector<UIntDec> pbin;\n auto dfs = [&](auto& dfs, int l, int r) -> UIntDec {\n if(r - l <= 29){\n UIntDec p;\n for(int j=l; j<r; j++) p.mulU32(b[j]);\n return p;\n }\n if(pbin.empty()) pbin.push_back(UIntDec({2}).Pow(32*29));\n int h = 0; while(((29*2)<<h) < r-l) h++;\n while((int)pbin.size() < h+1) pbin.push_back(pbin.back() * pbin.back());\n auto res = dfs(dfs, l, r-(29<<h)) * pbin[h];\n res += dfs(dfs, r-(29<<h), r);\n return res;\n };\n auto x = std::move(dfs(dfs, 0, b.size()).x);\n while(!x.empty() && !x.back()) x.pop_back();\n std::string res = std::to_string(x.back());\n res.resize(res.size() + 9 * (int)(x.size()-1), '0');\n for(int i=(int)x.size()-2; i>=0; i--){\n int o = res.size() - i*9 - 9;\n for(int j=o+8; j>=o; j--){ res[j] += x[i] % 10; x[i] /= 10; }\n }\n return res;\n}\n\n} // namespace bigint\n} // namespace nachia\n#line 4 \"nachia\\\\bigint\\\\integer.hpp\"\n\nnamespace nachia{\n\nclass UnsignedIntegerBin{\npublic:\n using MyType = UnsignedIntegerBin;\n friend class SignedIntegerBin;\nprivate:\n using u32 = uint32_t;\n using u64 = uint64_t;\n std::vector<u32> x;\n static inline bool Cflag;\n static MyType FromVec(std::vector<u32> _x){ MyType res; res.x = std::move(_x); return res; }\npublic:\n UnsignedIntegerBin(){}\n MyType operator>>(int sh) const {\n int h = sh / 32, l = sh % 32;\n MyType res; res.memreserve(size() - h);\n for(int i=h; i<size(); i++) res[i-h] = x[i] >> l;\n if(l) for(int i=h+1; i<size(); i++) res[i-h-1] |= x[i] << (32-l);\n res.regularize();\n return res;\n }\n MyType operator<<(int sh) const {\n int h = sh / 32, l = sh % 32;\n MyType res; res.memreserve(size() + h + 1);\n for(int i=0; i<size(); i++) res[i+h] = x[i] << l;\n if(l) for(int i=0; i<size(); i++) res[i+h+1] |= x[i] >> (32-l);\n res.regularize();\n return res;\n }\n MyType& operator>>=(int sh) { return (*this) = operator>>(sh); }\n MyType& operator<<=(int sh) { return (*this) = operator<<(sh); }\n MyType& operator%=(const MyType& d) { divInternal(d); return *this; }\n MyType operator%(const MyType& d) const { auto p = *this; return p.divInternal(d); }\n MyType operator/(const MyType& d) const { auto p = *this; return p.divInternal(d); }\n MyType& operator/=(const MyType& d) { return (*this) = divInternal(d); }\n MyType& operator+=(const MyType& v){\n memreserve(std::max(size(), v.size()) + 1);\n u64 c = 0;\n for(int i=0; i<v.size(); i++){ x[i] = (c += (u64)x[i] + v[i]); c >>= 32; }\n for(int i=v.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\n regularize();\n return *this;\n }\n MyType& operator-=(const MyType& v){\n memreserve(std::max(size(), v.size()));\n u64 c = 0;\n for(int i=0; i<v.size(); i++){\n c += v[i];\n x[i] -= c;\n c = (c + x[i]) >> 32;\n }\n for(int i=v.size(); i<size() && c; i++){\n x[i] -= c;\n c = (c + x[i]) >> 32;\n }\n Cflag = c;\n if(c){ complement(); increment(); }\n regularize();\n return *this;\n }\n MyType operator*(const MyType& v) const {\n MyType res;\n res.x = bigint::MultiplySupply().multiplyBin(x, v.x);\n res.regularize();\n return res;\n }\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\n MyType operator+(const MyType& r) { auto p = *this; p += r; return p; }\n MyType operator-(const MyType& r) { auto p = *this; p -= r; return p; }\n bool operator<(const MyType& r) const {\n return (size() != r.size())\n ? (size() < r.size())\n : std::lexicographical_compare(x.rbegin(), x.rend(), r.x.rbegin(), r.x.rend());\n }\n bool operator>(const MyType& r) const { return r < (*this); }\n bool operator<=(const MyType& r) const { return !(r < (*this)); }\n bool operator>=(const MyType& r) const { return !operator<(r); }\n bool operator==(const MyType& r) const { return x == r.x; }\n bool operator!=(const MyType& r) const { return x != r.x; }\n bool operator!() const { return size(); }\n bool isZero() const { return size() == 0; }\n std::string toStringBin() const {\n std::string res;\n for(int i=size()-1; i>=0; i--) for(int j=31; j>=0; j--) res.push_back('0' + (x[i]>>j) % 2);\n return res;\n }\n std::string toStringDec() const {\n if(isZero()) return \"0\";\n return bigint::BinToDec(x);\n }\n static MyType FromStringDec(const std::string& s) {\n return FromVec(bigint::DecToBin(s));\n }\n int lsb() const { for(int i=0; i<size(); i++){ if(x[i]) return nachia::LsbIndex(x[i]) + i * 32; } return -1; }\n int msb() const { for(int i=size()-1; i>=0; i--){ if(x[i]) return nachia::MsbIndex(x[i]) + i * 32; } return -1; }\nprivate:\n int size() const { return x.size(); }\n u32& operator[](int at) { return x[at]; }\n u32 operator[](int at) const { return x[at]; }\n void memreserve(int sz) { if((int)x.size() < sz) x.resize(sz); }\n void setBit(int at, bool val){ memreserve(at/32+1); x[at/32] |= (u32)(val?1:0) << (at%32); regularize(); }\n MyType divInternal(const MyType& d) {\n if(d.isZero()) throw 1;\n MyType res;\n for(int s=(size()-d.size())*32+31; s>=0; s--){\n MyType x = d << s;\n if(operator>=(x)){\n res.setBit(s, true); operator-=(x);\n }\n }\n res.regularize();\n return res;\n }\n void complement() { for(u32& y:x){ y = ~y; } }\n void increment() { if(isZero()){ x = {1}; return; } int i=0; while(i < size() && !~x[i]){ x[i++]++; } if(i>=size()){ x.push_back(1); } else x[i]++; }\n void decrement() { if(isZero()){ x = {1}; return; } int i=0; while(x[i]){ x[i++]--; } x[i]--; regularize(); }\n void regularize() { while(!x.empty() && 0 == x.back()) x.pop_back(); }\n int div10() {\n u64 c = 0;\n for(int i=size()-1; i>=0; i--){\n c = (c << 32) | x[i];\n x[i] = c / 10;\n c %= 10;\n }\n regularize();\n return c;\n }\n void mul10(int d) {\n u64 c = d;\n for(int i=0; i<size(); i++){ x[i] = (c += (u64)x[i] * 10); c >>= 32; }\n if(c) x.push_back(c);\n }\n};\n\nclass SignedIntegerBin{\n using MyType = SignedIntegerBin;\n using UInt = UnsignedIntegerBin;\nprivate:\n UInt u;\n int sign = 1;\n void regularize(){ u.regularize(); if(u.isZero()) sign = 1; }\n static MyType Raw(UInt u, int s){ MyType res; res.u = std::move(u); res.sign = s; res.regularize(); return res; }\npublic:\n bool isZero() const { return u.isZero(); }\n MyType& operator+=(const MyType& r) {\n if(sign == r.sign) u += r.u;\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\n regularize();\n return *this;\n }\n MyType& operator-=(const MyType& r) {\n if(sign != r.sign) u += r.u;\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\n regularize();\n return *this;\n }\n MyType operator*(const MyType& r) const { return Raw(u*r.u, sign*r.sign); }\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\n MyType operator+(const MyType& r) const { auto p = *this; p += r; return p; }\n MyType operator-(const MyType& r) const { auto p = *this; p -= r; return p; }\n MyType operator-() const { return Raw(u, -sign); }\n MyType& operator<<=(int sh) { u <<= sh; return *this; }\n MyType& operator>>=(int sh) { u >>= sh; return *this; }\n MyType operator<<(int sh) const { return Raw(u<<sh, sign); }\n MyType operator>>(int sh) const { return Raw(u<<sh, sign); }\n MyType operator/(const MyType& r) const { return Raw(u/r.u, sign*r.sign); }\n MyType& operator/=(const MyType& r) { return (*this) = operator/(r); }\n MyType operator%(const MyType& r) const { return Raw(u%r.u, sign*r.sign); }\n MyType& operator%=(const MyType& r) { return (*this) = operator%(r); }\n std::string toStringDec() const {\n if(isZero()) return \"0\";\n return (sign>0 ? \"\" : \"-\") + u.toStringDec();\n }\n static MyType FromStringDec(const std::string& s) {\n if(s.empty()) return MyType();\n if(s[0] == '+') return Raw(UInt::FromStringDec(s.substr(1)), 1);\n if(s[0] == '-') return Raw(UInt::FromStringDec(s.substr(1)), -1);\n return Raw(UInt::FromStringDec(s), 1);\n }\n};\n\n} // namespace nachia\n#line 2 \"Main.cpp\"\n#include <cstdint>\n#line 5 \"Main.cpp\"\n#include <string>\n#line 7 \"Main.cpp\"\n\n\nint main() {\n using Int = nachia::SignedIntegerBin;\n std::string s;\n std::cin >> s;\n Int a = Int::FromStringDec(s);\n std::cin >> s;\n Int b = Int::FromStringDec(s);\n Int c = a + b;\n std::cout << c.toStringDec() << '\\n';\n return 0;\n}","accuracy":0.84,"time_ms":60,"memory_kb":4204,"score_of_the_acc":-0.0814,"final_rank":18},{"submission_id":"aoj_NTL_2_A_6975961","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<int> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = str[id++] - '0';\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<int> v( 8, 0 );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n if( minus )\n cout << '-';\n int top = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n // sizeの再計算\n void resize(){\n\n size = 0;\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- ){\n if( dat[i][j] != 0 ){\n size = i;\n return;\n }\n }\n }\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n int up = 0; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.minus = l.minus;\n }\n res.resize();\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l.minus & r.minus ){\n if( l < r ){\n l.minus = false;\n r.minus = false;\n res = l - r;\n res.minus = true;\n }\n else{\n l.minus = false;\n r.minus = false;\n res = r - l;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n int maxSize = max( l.size, r.size );\n int down = 0; // 繰り下がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n else\n down = 0;\n }\n }\n }\n }\n }\n res.resize();\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt sum = a + b;\n sum.print();\n\n}","accuracy":1,"time_ms":80,"memory_kb":95404,"score_of_the_acc":-1.1003,"final_rank":16},{"submission_id":"aoj_NTL_2_A_6975930","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<int> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = str[id++] - '0';\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<int> v( 8, 0 );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n if( minus )\n cout << '-';\n int top = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n int up = 0; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.size = ( up != 0 ? maxSize+1 : maxSize );\n res.minus = l.minus;\n }\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n res.size = max( l.size, r.size );\n int down = 0; // 繰り下がり\n for( int i = 0 ; i <= res.size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n else\n down = 0;\n }\n }\n if( res.dat[res.size][0] == 0 && res.dat[res.size][1] == 0 && res.dat[res.size][2] == 0 && res.dat[res.size][3] == 0 )\n res.size = max( res.size-1, 0 );\n }\n }\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt sum = a + b;\n sum.print();\n\n}","accuracy":1,"time_ms":80,"memory_kb":95512,"score_of_the_acc":-1.1014,"final_rank":17},{"submission_id":"aoj_NTL_2_A_6975926","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<int> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = str[id++] - '0';\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<int> v( 8, 0 );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n if( minus )\n cout << '-';\n int top = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n int up = 0; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.size = ( up != 0 ? maxSize+1 : maxSize );\n res.minus = l.minus;\n }\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n res.size = max( l.size, r.size );\n int down = 0; // 繰り下がり\n for( int i = 0 ; i <= res.size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n else\n down = 0;\n }\n }\n if( res.dat[res.size][0] == 0 && res.dat[res.size][1] == 0 && res.dat[res.size][2] == 0 && res.dat[res.size][3] == 0 )\n res.size--;\n }\n }\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt sum = a + b;\n sum.print();\n\n}","accuracy":0.04,"time_ms":20,"memory_kb":38720,"score_of_the_acc":-0.398,"final_rank":20},{"submission_id":"aoj_NTL_2_A_6975914","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<int> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = str[id++] - '0';\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<int> v( 8, 0 );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n if( minus )\n cout << '-';\n int top = 0;\n int order = 1;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += l.dat[l.size][i];\n lVal *= 10;\n rVal += r.dat[r.size][i];\n rVal *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n int lVal = 0, rVal = 0;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += l.dat[l.size][i];\n lVal *= 10;\n rVal += r.dat[r.size][i];\n rVal *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n int up = 0; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.size = ( up != 0 ? maxSize+1 : maxSize );\n res.minus = l.minus;\n }\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n res.size = max( l.size, r.size );\n int down = 0; // 繰り下がり\n for( int i = 0 ; i <= res.size ; i++ ){\n if( i == res.size && down == 1 ){\n res.size--;\n break;\n }\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n }\n }\n }\n }\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt sum = a + b;\n sum.print();\n\n}","accuracy":0.06,"time_ms":70,"memory_kb":95232,"score_of_the_acc":-1.0839,"final_rank":19},{"submission_id":"aoj_NTL_2_A_6814556","code_snippet":"#include <bits/stdc++.h>\n#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\nint main(){\n boost::multiprecision::cpp_int a,b;\n std::cin>>a>>b;\n std::cout<<a+b<<std::endl;\n}","accuracy":1,"time_ms":700,"memory_kb":3408,"score_of_the_acc":-1.0003,"final_rank":11},{"submission_id":"aoj_NTL_2_A_6691773","code_snippet":"#include<bits/stdc++.h>\n#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);i++)\ntypedef long long ll;\nusing namespace boost::multiprecision;\n\nint main() {\n cpp_int a,b;cin>>a>>b;\n cpp_int ans=a+b;\n cout<<ans<<endl;\n return 0;\n\n\n\n}","accuracy":1,"time_ms":700,"memory_kb":3428,"score_of_the_acc":-1.0005,"final_rank":13},{"submission_id":"aoj_NTL_2_A_6677813","code_snippet":"#include<bits/stdc++.h>\n\n#include <boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\n\nconst int mod=1e9+7;\n\nint32_t main()\n{\n boost::multiprecision::cpp_int a, b;\n cin >> a >> b;\n \n cout << a+b << endl;\n \n return 0;\n}","accuracy":1,"time_ms":700,"memory_kb":3456,"score_of_the_acc":-1.0008,"final_rank":15},{"submission_id":"aoj_NTL_2_A_6663111","code_snippet":"// 多倍長整数\n//#include <atcoder/convolution>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nstruct multiprecision{\n private:\n const long long base=100;\n const int lg = 2;\n std::vector<long long> num;\n\n void adjust(){\n for(int i=0;i<num.size();i++){\n long long z=num[i]/base;\n num[i]%=base;\n if(num[i]<0){\n if(z!=0||i<num.size()-1){\n z--;\n num[i]+=base;\n }\n }\n if(z==0)continue;\n if(i==num.size()-1){\n num.emplace_back(z);\n }\n else{\n num[i+1]+=z;\n }\n }\n\n while(num.size()>0&&num[num.size()-1]==0)num.pop_back();\n if(num.size()==0)num.emplace_back(0);\n while(num[num.size()-1]==-1&&num.size()>1&&num[num.size()-2]!=0){\n num[num.size()-2]-=base;\n num.pop_back();\n }\n }\n\n public:\n multiprecision(long long val){\n if(val==0){\n num.emplace_back(0);\n }\n else{\n long long cpy=val;\n while(cpy!=0){\n num.emplace_back(cpy%base);\n cpy/=base;\n }\n }\n adjust();\n }\n\n multiprecision(std::vector<long long> val){\n num=val;\n adjust();\n }\n\n multiprecision(std::string s){\n reverse(s.begin(),s.end());\n bool neg=0;\n if(s[s.size()-1]=='-'){\n s[s.size()-1]='0';\n neg=1;\n }\n while(s.size()%lg!=0){\n s+='0';\n }\n\n for(int i=0;i<s.size()/lg;i++){\n std::string t=\"\";\n for(int j=0;j<lg;j++){\n t+=s[i*lg+j];\n }\n reverse(t.begin(),t.end());\n num.emplace_back(std::stoll(t));\n }\n\n if(neg){\n multiprecision zero=multiprecision(0);\n zero-=*this;\n *this=zero;\n }\n\n adjust();\n }\n\n std::vector<long long> val(){\n return num;\n }\n\n std::string s_val(){\n bool flg=0;\n if(num[num.size()-1]<0){\n flg=1;\n for(int i=0;i<num.size();i++){\n num[i]*=-1;\n }\n adjust();\n }\n std::string res=\"\";\n if(flg)res+='-';\n for(int i=num.size()-1;i>=0;i--){\n std::string t=std::to_string(num[i]);\n if(i==num.size()-1){\n res+=t;\n continue;\n }\n for(int j=0;j<lg-t.size();j++){\n res+='0';\n }\n res+=t;\n }\n\n if(flg){\n for(int i=0;i<num.size();i++){\n num[i]*=-1;\n }\n adjust();\n }\n\n return res;\n }\n\n multiprecision& operator =(const multiprecision& other){\n this->num=other.num;\n return *this;\n }\n\n multiprecision& operator +=(const multiprecision& other){\n for(int i=0;i<other.num.size();i++){\n if(i>=this->num.size()){\n this->num.emplace_back(other.num[i]);\n }\n else{\n this->num[i]+=other.num[i];\n }\n }\n this->adjust();\n return *this;\n }\n\n multiprecision& operator -=(const multiprecision& other){\n for(int i=0;i<other.num.size();i++){\n if(i>=this->num.size()){\n this->num.emplace_back(-other.num[i]);\n }\n else{\n this->num[i]-=other.num[i];\n }\n }\n this->adjust();\n return *this;\n }\n};\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nusing ll = long long;\nusing ld = long double;\n \nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vld = vector<ld>;\nusing vvld = vector<vld>;\nusing vst = vector<string>;\nusing vvst = vector<vst>;\n \n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define pq_big(T) priority_queue<T,vector<T>,less<T>>\n#define pq_small(T) priority_queue<T,vector<T>,greater<T>>\n#define all(a) a.begin(),a.end()\n#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)\n#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())\n\nint main(){\n string a,b;\n cin>>a>>b;\n\n multiprecision mp1(a),mp2(b);\n mp1+=mp2;\n\n cout<<mp1.s_val()<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5012,"score_of_the_acc":-0.0177,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_NTL_2_A_10774189\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos( -1.0 );\\n\\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\\n\\ntemplate <typename T>\\nvoid print_arr( vector<T> v ){\\n if( v.size() == 0 ) return;\\n for( int i = 0 ; i < v.size() ; i++ )\\n cout << v[i];\\n cout << endl;\\n}\\n\\nstruct BigInteger{\\n\\n bool minus;\\n int digit;\\n vector<ll> arr;\\n\\n BigInteger( string val = \\\"\\\", bool m = false ){\\n\\n minus = m;\\n while( val.length() > 4 ){\\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\\n val = val.substr( 0, val.length() - 4 );\\n }\\n if( val.length() != 0 )\\n arr.push_back( stoll( val ) );\\n set_digit();\\n\\n }\\n\\n void shift_l(){\\n\\n ll up = 0;\\n for( int i = 0 ; i < digit ; i++ ){\\n ll next_up = arr[i] / 1000;\\n arr[i] = ( arr[i] % 1000 ) * 10 + up; \\n up = next_up;\\n }\\n arr.push_back( up );\\n set_digit();\\n\\n }\\n\\n void shift_r(){\\n\\n ll down = 0;\\n for( int i = digit - 1 ; i >= 0 ; i-- ){\\n ll next_down = arr[i] % 10;\\n arr[i] = 1000 * down + arr[i] / 10;\\n down = next_down;\\n }\\n set_digit();\\n\\n }\\n\\n bool zero(){\\n\\n return digit == 1 && arr[0] == 0;\\n\\n }\\n\\n void set_digit(){\\n\\n while( arr.size() > 1 && arr[arr.size()-1] == 0 )\\n arr.pop_back();\\n digit = arr.size();\\n\\n }\\n\\n void print(){\\n\\n if( zero() ){\\n cout << 0 << endl;\\n return;\\n }\\n if( minus )\\n cout << \\\"-\\\";\\n cout << arr[digit - 1];\\n for( int i = digit - 2 ; i >= 0 ; i-- )\\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\\n cout << endl;\\n\\n }\\n\\n};\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 );\\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\\nBigInteger mul( BigInteger bi1, BigInteger bi2 );\\nBigInteger div( BigInteger bi1, BigInteger bi2 );\\nbool operator<( const BigInteger bi1, const BigInteger bi2 );\\nbool operator>( const BigInteger bi1, const BigInteger bi2 );\\nbool operator<=( const BigInteger bi1, const BigInteger bi2 );\\nbool operator>=( const BigInteger bi1, const BigInteger bi2 );\\nbool operator==( const BigInteger bi1, const BigInteger bi2 );\\nbool operator!=( const BigInteger bi1, const BigInteger bi2 );\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return sub( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n return sub( bi2, bi1 );\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n\\n BigInteger res;\\n ll up = 0;\\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i];\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \\n up = ( val1 + val2 + up ) / 10000;\\n }\\n res.arr.push_back( up );\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return add( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = sub( bi2, bi1 );\\n return res;\\n }\\n\\n if( bi1.digit < bi2.digit ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.digit == bi2.digit ){\\n for( int i = bi1.digit-1 ; i >= 0 ; i-- ){\\n if( bi1.arr[i] > bi2.arr[i] )\\n break;\\n else if( bi1.arr[i] < bi2.arr[i] ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n }\\n }\\n \\n BigInteger res;\\n ll down = 0;\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i] - down;\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n if( val1 < val2 ){\\n down = 1;\\n val1 += 10000;\\n }\\n else \\n down = 0;\\n res.arr.push_back( val1 - val2 );\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger mul( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n res.minus = ( bi1.minus != bi2.minus );\\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ )\\n res.arr.push_back( 0 );\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n for( int j = 0 ; j < bi2.digit ; j++ )\\n res.arr[i+j] += bi1.arr[i] * bi2.arr[j];\\n }\\n ll up = 0;\\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ ){\\n ll next_up = ( res.arr[i] + up ) / 10000;\\n res.arr[i] = ( res.arr[i] + up ) % 10000;\\n up = next_up;\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger div( BigInteger bi1, BigInteger bi2 ){\\n\\n string num = \\\"\\\";\\n bool m = ( bi1.minus != bi2.minus );\\n bi1.minus = bi2.minus = false;\\n BigInteger org = bi2;\\n if( bi1 < bi2 ){\\n BigInteger zero( \\\"0\\\", false );\\n return zero;\\n }\\n while( bi1.digit > bi2.digit ){\\n bi2.arr.insert( bi2.arr.begin(), 0 );\\n bi2.digit++;\\n }\\n while( to_string( bi1.arr[bi1.digit-1] ).length() > to_string( bi2.arr[bi2.digit-1] ).length() )\\n bi2.shift_l();\\n while( to_string( bi1.arr[bi1.digit-1] ).length() < to_string( bi2.arr[bi2.digit-1] ).length() )\\n bi2.shift_r();\\n while( bi2 >= org ){ \\n int i;\\n for( i = 0 ; i <= 9 ; i++ ){\\n BigInteger tmp = sub( bi1, bi2 );\\n tmp.print();\\n if( !tmp.zero() && tmp.minus )\\n break;\\n bi1 = tmp;\\n } \\n num += to_string( i );\\n bi2.shift_r();\\n }\\n BigInteger res( num, m );\\n return res;\\n\\n}\\n\\nbool operator<( const BigInteger bi1, const BigInteger bi2 ){\\n\\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.minus && !tmp.zero();\\n\\n}\\n\\nbool operator>( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus && !tmp.zero();\\n\\n}\\n\\nbool operator<=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator>=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator==( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.zero();\\n\\n}\\n\\nbool operator!=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.zero();\\n\\n}\\n\\nint main(){\\n\\n string val1, val2;\\n bool minus;\\n \\n cin >> val1;\\n if( val1[0] == '-' ){\\n minus = true;\\n val1 = val1.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi1( val1, minus );\\n\\n cin >> val2;\\n if( val2[0] == '-' ){\\n minus = true;\\n val2 = val2.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi2( val2, minus );\\n \\n BigInteger res = add( bi1, bi2 );\\n res.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5368,\n \"score_of_the_acc\": -0.0795,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_10774163\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos( -1.0 );\\n\\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\\n\\ntemplate <typename T>\\nvoid print_arr( vector<T> v ){\\n if( v.size() == 0 ) return;\\n for( int i = 0 ; i < v.size() ; i++ )\\n cout << v[i];\\n cout << endl;\\n}\\n\\nstruct BigInteger{\\n\\n bool minus;\\n int digit;\\n vector<ll> arr;\\n\\n BigInteger( string val = \\\"\\\", bool m = false ){\\n\\n minus = m;\\n while( val.length() > 4 ){\\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\\n val = val.substr( 0, val.length() - 4 );\\n }\\n if( val.length() != 0 )\\n arr.push_back( stoll( val ) );\\n set_digit();\\n\\n }\\n\\n void shift_l(){\\n\\n ll up = 0;\\n for( int i = 0 ; i < digit ; i++ ){\\n ll next_up = arr[i] / 1000;\\n arr[i] = ( arr[i] % 1000 ) * 10 + up; \\n up = next_up;\\n }\\n arr.push_back( up );\\n set_digit();\\n\\n }\\n\\n void shift_r(){\\n\\n ll down = 0;\\n for( int i = digit - 1 ; i >= 0 ; i-- ){\\n ll next_down = arr[i] % 10;\\n arr[i] = 1000 * down + arr[i] / 10;\\n down = next_down;\\n }\\n set_digit();\\n\\n }\\n\\n bool zero(){\\n\\n return digit == 1 && arr[0] == 0;\\n\\n }\\n\\n void set_digit(){\\n\\n while( arr.size() > 1 && arr[arr.size()-1] == 0 )\\n arr.pop_back();\\n digit = arr.size();\\n\\n }\\n\\n void print(){\\n\\n if( zero() ){\\n cout << 0 << endl;\\n return;\\n }\\n if( minus )\\n cout << \\\"-\\\";\\n cout << arr[digit - 1];\\n for( int i = digit - 2 ; i >= 0 ; i-- )\\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\\n cout << endl;\\n\\n }\\n\\n};\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 );\\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\\nBigInteger mul( BigInteger bi1, BigInteger bi2 );\\nBigInteger div( BigInteger bi1, BigInteger bi2 );\\nbool operator<( const BigInteger bi1, const BigInteger bi2 );\\nbool operator>( const BigInteger bi1, const BigInteger bi2 );\\nbool operator<=( const BigInteger bi1, const BigInteger bi2 );\\nbool operator>=( const BigInteger bi1, const BigInteger bi2 );\\nbool operator==( const BigInteger bi1, const BigInteger bi2 );\\nbool operator!=( const BigInteger bi1, const BigInteger bi2 );\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return sub( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n return sub( bi2, bi1 );\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n\\n BigInteger res;\\n ll up = 0;\\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i];\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \\n up = ( val1 + val2 + up ) / 10000;\\n }\\n res.arr.push_back( up );\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return add( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = sub( bi2, bi1 );\\n return res;\\n }\\n\\n if( bi1.digit < bi2.digit ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.digit == bi2.digit ){\\n for( int i = bi1.digit-1 ; i >= 0 ; i++ ){\\n if( bi1.arr[i] > bi2.arr[i] )\\n break;\\n else if( bi1.arr[i] < bi2.arr[i] ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n }\\n }\\n \\n BigInteger res;\\n ll down = 0;\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i] - down;\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n if( val1 < val2 ){\\n down = 1;\\n val1 += 10000;\\n }\\n else \\n down = 0;\\n res.arr.push_back( val1 - val2 );\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger mul( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n res.minus = ( bi1.minus != bi2.minus );\\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ )\\n res.arr.push_back( 0 );\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n for( int j = 0 ; j < bi2.digit ; j++ )\\n res.arr[i+j] += bi1.arr[i] * bi2.arr[j];\\n }\\n ll up = 0;\\n for( int i = 0 ; i < bi1.digit + bi2.digit ; i++ ){\\n ll next_up = ( res.arr[i] + up ) / 10000;\\n res.arr[i] = ( res.arr[i] + up ) % 10000;\\n up = next_up;\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger div( BigInteger bi1, BigInteger bi2 ){\\n\\n string num = \\\"\\\";\\n bool m = ( bi1.minus != bi2.minus );\\n bi1.minus = bi2.minus = false;\\n BigInteger org = bi2;\\n if( bi1 < bi2 ){\\n BigInteger zero( \\\"0\\\", false );\\n return zero;\\n }\\n while( bi1.digit > bi2.digit ){\\n bi2.arr.insert( bi2.arr.begin(), 0 );\\n bi2.digit++;\\n }\\n while( to_string( bi1.arr[bi1.digit-1] ).length() > to_string( bi2.arr[bi2.digit-1] ).length() )\\n bi2.shift_l();\\n while( to_string( bi1.arr[bi1.digit-1] ).length() < to_string( bi2.arr[bi2.digit-1] ).length() )\\n bi2.shift_r();\\n while( bi2 >= org ){ \\n int i;\\n for( i = 0 ; i <= 9 ; i++ ){\\n BigInteger tmp = sub( bi1, bi2 );\\n tmp.print();\\n if( !tmp.zero() && tmp.minus )\\n break;\\n bi1 = tmp;\\n } \\n num += to_string( i );\\n bi2.shift_r();\\n }\\n BigInteger res( num, m );\\n return res;\\n\\n}\\n\\nbool operator<( const BigInteger bi1, const BigInteger bi2 ){\\n\\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.minus && !tmp.zero();\\n\\n}\\n\\nbool operator>( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus && !tmp.zero();\\n\\n}\\n\\nbool operator<=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator>=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.minus || tmp.zero();\\n\\n}\\n\\nbool operator==( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return tmp.zero();\\n\\n}\\n\\nbool operator!=( const BigInteger bi1, const BigInteger bi2 ){\\n \\n BigInteger tmp = sub( bi1, bi2 );\\n return !tmp.zero();\\n\\n}\\n\\nint main(){\\n\\n string val1, val2;\\n bool minus;\\n \\n cin >> val1;\\n if( val1[0] == '-' ){\\n minus = true;\\n val1 = val1.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi1( val1, minus );\\n\\n cin >> val2;\\n if( val2[0] == '-' ){\\n minus = true;\\n val2 = val2.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi2( val2, minus );\\n \\n BigInteger res = add( bi1, bi2 );\\n res.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5420,\n \"score_of_the_acc\": -0.0801,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_10710894\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst ld PI = acos( -1.0 );\\n\\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\\n\\ntemplate <typename T>\\nvoid print_arr( vector<T> v ){\\n if( v.size() == 0 ) return;\\n for( int i = 0 ; i < v.size() ; i++ )\\n cout << v[i];\\n cout << endl;\\n}\\n\\nstruct BigInteger{\\n\\n bool minus;\\n int digit;\\n vector<ll> arr;\\n\\n BigInteger( string val = \\\"\\\", bool m = false ){\\n\\n minus = m;\\n while( val.length() > 4 ){\\n arr.push_back( stoll( val.substr( val.length() - 4 ) ) );\\n val = val.substr( 0, val.length() - 4 );\\n }\\n if( val.length() != 0 )\\n arr.push_back( stoll( val ) );\\n set_digit();\\n\\n }\\n\\n bool zero(){\\n\\n return arr.size() == 1 && arr[0] == 0;\\n\\n }\\n\\n void set_digit(){\\n\\n while( arr.size() > 1 && arr[arr.size()-1] == 0 ){\\n arr.pop_back();\\n }\\n digit = arr.size();\\n\\n }\\n\\n void print(){\\n\\n if( zero() ){\\n cout << 0 << endl;\\n return;\\n }\\n if( minus )\\n cout << \\\"-\\\";\\n cout << arr[digit - 1];\\n for( int i = digit - 2 ; i >= 0 ; i-- )\\n cout << setfill( '0' ) << std::setw( 4 ) << arr[i];\\n cout << endl;\\n\\n }\\n\\n};\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 );\\nBigInteger sub( BigInteger bi1, BigInteger bi2 );\\n\\nBigInteger add( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return sub( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n return sub( bi2, bi1 );\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n\\n BigInteger res;\\n ll up = 0;\\n for( int i = 0 ; i < max( bi1.digit, bi2.digit ) ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i];\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n res.arr.push_back( ( val1 + val2 + up ) % 10000 ); \\n up = ( val1 + val2 + up ) / 10000;\\n }\\n res.arr.push_back( up );\\n res.set_digit();\\n return res;\\n\\n}\\n\\nBigInteger sub( BigInteger bi1, BigInteger bi2 ){\\n\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n return add( bi1, bi2 );\\n }\\n else if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n BigInteger res = add( bi1, bi2 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.minus && bi2.minus ){\\n bi1.minus = false;\\n bi2.minus = false;\\n BigInteger res = sub( bi2, bi1 );\\n return res;\\n }\\n\\n if( bi1.digit < bi2.digit ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n else if( bi1.digit == bi2.digit ){\\n if( bi1.arr[bi1.digit-1] < bi2.arr[bi2.digit-1] ){\\n BigInteger res = sub( bi2, bi1 );\\n res.minus = true;\\n return res;\\n }\\n }\\n \\n BigInteger res;\\n ll down = 0;\\n for( int i = 0 ; i < bi1.digit ; i++ ){\\n ll val1 = 0, val2 = 0;\\n if( i < bi1.digit )\\n val1 = bi1.arr[i] - down;\\n if( i < bi2.digit )\\n val2 = bi2.arr[i];\\n if( val1 < val2 ){\\n down = 1;\\n val1 += 10000;\\n }\\n else \\n down = 0;\\n res.arr.push_back( val1 - val2 );\\n }\\n res.set_digit();\\n return res;\\n\\n}\\n\\nint main(){\\n\\n string val1, val2;\\n bool minus;\\n \\n cin >> val1;\\n if( val1[0] == '-' ){\\n minus = true;\\n val1 = val1.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi1( val1, minus );\\n\\n cin >> val2;\\n if( val2[0] == '-' ){\\n minus = true;\\n val2 = val2.substr( 1 );\\n }\\n else\\n minus = false;\\n BigInteger bi2( val2, minus );\\n \\n BigInteger res = add( bi1, bi2 );\\n res.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5448,\n \"score_of_the_acc\": -0.0804,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_9795740\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\ntemplate <int BASE>\\nclass BigDecimal {\\n public:\\n static constexpr std::string_view NUMERAL{\\n \\\"0123456789ABCDEF\\\"}; // 16進数まで対応\\n\\n private: // 静的関数\\n static int CompareIgnoreSign(const BigDecimal& a, const BigDecimal& b) {\\n // a-bの符号で覚えてもよいかも。\\n // a<b: -1\\n // a>b: +1\\n // a==b: 0\\n if (a._digit.size() != b._digit.size())\\n return a._digit.size() < b._digit.size() ? -1 : 1;\\n for (int i = a._digit.size() - 1; i >= 0; --i) {\\n if (a._digit[i] == b._digit[i]) continue;\\n return a._digit[i] < b._digit[i] ? -1 : 1;\\n }\\n return 0;\\n }\\n\\n static BigDecimal Karatsuba(const BigDecimal& a, const BigDecimal& b) {\\n // |a| >= |b|にする\\n if (a._digit.size() < b._digit.size()) return Karatsuba(b, a);\\n // 1桁に絞ったら直に計算して返す\\n if (b._digit.size() == 1) {\\n BigDecimal ret(a);\\n for (int i = 0; i < a._digit.size(); ++i) {\\n ret._digit[i] *= b._digit[0];\\n }\\n ret.carry_and_fix();\\n if (b._positive)\\n return ret;\\n else\\n return -ret;\\n }\\n int N = a._digit.size() / 2; // 下半分の桁数\\n bool sign = !(a._positive xor b._positive); // 符号を計算しておく\\n BigDecimal a0(a), a1(a), b0(b), b1(b); // x = concat(x0, x1)\\n // aの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (a1._digit.size() > N) a1._digit.pop_back();\\n // x0のデータを消去\\n a0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < a._digit.size(); ++i)\\n a0._digit.emplace_back(a._digit[N + i]);\\n if (a0._digit.size() == 0) a0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n a0._positive = a1._positive = true;\\n if (b._digit.size() < N) { // 一方が他方の半分もない\\n BigDecimal p0, c1;\\n p0 = Karatsuba(a0, b);\\n c1 = Karatsuba(a1, b);\\n BigDecimal c0;\\n for (int i = 0; i < N - 1; ++i) c0._digit.emplace_back(0);\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1;\\n ret._positive = sign;\\n return ret;\\n }\\n // bの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (b1._digit.size() > N) b1._digit.pop_back();\\n // x0のデータを消去\\n b0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < b._digit.size(); ++i)\\n b0._digit.emplace_back(b._digit[N + i]);\\n if (b0._digit.size() == 0) b0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n b0._positive = b1._positive = true;\\n // 3種類の積\\n BigDecimal p0, p1, p2;\\n p0 = Karatsuba(a0, b0);\\n p2 = Karatsuba(a1, b1);\\n p1 = Karatsuba(a0 + a1, b0 + b1) - p0 - p2;\\n // 積に対応する数\\n BigDecimal c0, c1, c2;\\n c0._digit.clear();\\n c1._digit.clear();\\n c2._digit.clear();\\n for (int i = 0; i < N; ++i) {\\n c0._digit.emplace_back(0);\\n c0._digit.emplace_back(0);\\n c1._digit.emplace_back(0);\\n }\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n for (const auto& d : p1._digit) c1._digit.emplace_back(d);\\n for (const auto& d : p2._digit) c2._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1 + c2;\\n ret._positive = sign;\\n return ret;\\n }\\n\\n private:\\n std::vector<int> _digit;\\n bool _positive;\\n\\n void carry_and_fix() {\\n // 新規の桁が発生しない範疇(最後の桁以外)を処理\\n for (int i = 0; i < _digit.size() - 1; ++i) {\\n if (_digit[i] >= BASE) {\\n // 桁の数が基数以上: 繰り上げる必要あり\\n int k = _digit[i] / BASE; // 繰り上がり発生回数\\n _digit[i] -= k * BASE;\\n _digit[i + 1] += k;\\n } else if (_digit[i] < 0) {\\n // 桁の数が負: 繰り下げが必要\\n int k = (-_digit[i] - 1) / BASE + 1;\\n _digit[i] += k * BASE;\\n _digit[i + 1] -= k;\\n }\\n }\\n // 最後の桁を処理する場合\\n while (_digit.back() >= BASE) {\\n int k = _digit.back() / BASE; // 繰り上がり発生回数\\n _digit.back() -= k * BASE;\\n _digit.emplace_back(k);\\n }\\n // 計算結果がマイナスなら全体に-1をかけて符号反転\\n if (_digit.back() < 0) {\\n this->_positive = !this->_positive;\\n for (int i = 0; i < _digit.size(); ++i) {\\n _digit[i] *= -1;\\n }\\n this->carry_and_fix();\\n }\\n // 0の桁を上から消す\\n while (_digit.size() >= 2 && _digit.back() == 0) _digit.pop_back();\\n // 0になったら正の数にしておく(-0表記は困るため)\\n if(_digit.size() == 1 && _digit[0] == 0) _positive = true;\\n }\\n\\n public:\\n // コンストラクタ\\n BigDecimal(int num = 0) : _digit(0), _positive(num >= 0) {\\n if (!_positive) num *= -1;\\n while (num > 0) {\\n _digit.emplace_back(num % BASE);\\n num /= BASE;\\n }\\n if (_digit.size() == 0) _digit.emplace_back(0);\\n }\\n BigDecimal(std::string s) {\\n if (s[0] == '-') {\\n s = s.substr(1);\\n _positive = false;\\n } else {\\n _positive = true;\\n }\\n while (s.size() > 0) {\\n int i = NUMERAL.find(s.back());\\n _digit.emplace_back(i);\\n s.pop_back();\\n }\\n }\\n // コピーコンストラクタ\\n BigDecimal(const BigDecimal& x)\\n : _digit(x._digit.size()), _positive(x._positive) {\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] = x._digit[i];\\n }\\n }\\n\\n // 比較演算子\\n bool operator==(const BigDecimal& x) const {\\n if (this->_positive != x._positive) return false;\\n if (this->_digit.size() != x._digit.size()) return false;\\n for (int i = 0; i < this->_digit.size(); ++i) {\\n if (this->_digit[i] != x._digit[i]) return false;\\n }\\n return true;\\n }\\n bool operator!=(const BigDecimal& x) const { return !(*this == x); }\\n bool operator<(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) < 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) > 0;\\n }\\n }\\n bool operator>(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) > 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) < 0;\\n }\\n }\\n bool operator<=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) <= 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) >= 0;\\n }\\n }\\n bool operator>=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) >= 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) <= 0;\\n }\\n }\\n\\n // 単項演算子\\n BigDecimal operator+() const { return *this; }\\n BigDecimal operator-() const {\\n BigDecimal ret = *this;\\n ret._positive = !ret._positive;\\n return ret;\\n }\\n // 複号代入演算子\\n BigDecimal& operator+=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて引き算に\\n if (this->_positive != x._positive) {\\n return *this -= (-x);\\n }\\n // 符号が同じ物にのみ足し算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] += x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator-=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて足し算に\\n if (this->_positive != x._positive) {\\n return *this += (-x);\\n }\\n // 符号が同じ物にのみ引き算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] -= x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator*=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator/=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator%=(const BigDecimal& x) { return *this; }\\n\\n // 二項演算子\\n BigDecimal operator+(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret += x);\\n }\\n BigDecimal operator-(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret -= x);\\n }\\n BigDecimal operator*(const BigDecimal& x) const {\\n return Karatsuba(*this, x);\\n }\\n BigDecimal operator/(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret /= x);\\n }\\n BigDecimal operator%(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret %= x);\\n }\\n\\n // キャスト\\n operator std::string() const {\\n std::string ret = \\\"\\\";\\n for (const auto& c : _digit) {\\n ret = NUMERAL.at(c) + ret;\\n }\\n if (!_positive) ret = \\\"-\\\" + ret;\\n return ret;\\n }\\n};\\n\\nint main() {\\n std::string A, B;\\n std::cin >> A >> B;\\n BigDecimal<10> a(A), b(B);\\n std::cout << std::string(a+b) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 5252,\n \"score_of_the_acc\": -0.1652,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_9288512\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n\\nint main() {\\n boost::multiprecision::cpp_int a, b;\\n cin >> a >> b;\\n cout << a+b << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -1.0005,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_9072897\",\n \"code_snippet\": \"#include <iostream>\\n\\n#include \\\"boost/multiprecision/cpp_int.hpp\\\"\\n\\nint main() {\\n boost::multiprecision::cpp_int a, b;\\n std::cin >> a >> b;\\n std::cout << a + b << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1.0004,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_8219544\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nint main() {\\n std::string rawA, rawB;\\n std::cin >> rawA >> rawB;\\n\\n int fa = 1, fb = 1;\\n std::string A = rawA, B = rawB;\\n if (A[0] == '-') {\\n fa = -1;\\n A.erase(0, 1);\\n }\\n if (B[0] == '-') {\\n fb = -1;\\n B.erase(0, 1);\\n }\\n // std::cout << A << \\\" , \\\" << B << std::endl;\\n\\n bool is_swap = A.size() < B.size();\\n if (A.size() == B.size()) {\\n for (int i = 0; i < A.size(); i++) {\\n if (A[i] == B[i]) {\\n continue;\\n }\\n is_swap = A[i] < B[i];\\n break;\\n }\\n }\\n\\n if (is_swap) {\\n std::swap(A, B);\\n std::swap(fa, fb);\\n std::swap(rawA, rawB);\\n }\\n\\n int diff = (A.size() - B.size());\\n for (int i = 0; i < diff; i++) {\\n B = '0' + B;\\n }\\n\\n int f = fa * fb;\\n int next = 0;\\n std::string s = \\\"\\\";\\n // std::cout << A << std::endl;\\n // std::cout << B << std::endl;\\n for (int i = 1; i <= A.size(); i++) {\\n int val = A[A.size() - i] - '0' + f * (B[B.size() - i] - '0') + next;\\n if (val > 9) {\\n next = 1;\\n val -= 10;\\n } else if (val < 0) {\\n next = -1;\\n val += 10;\\n } else {\\n next = 0;\\n }\\n s = std::to_string(val) + s;\\n }\\n if (next != 0) {\\n s = \\\"1\\\" + s;\\n }\\n\\n while (s.size() > 1 && s[0] == '0') {\\n s.erase(0, 1);\\n }\\n\\n if (s != \\\"0\\\" && fa < 0) {\\n s = \\\"-\\\" + s;\\n }\\n\\n std::cout << s << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.3711,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_7680352\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iomanip>\\n#include <iostream>\\n\\nusing namespace std;\\n\\ntypedef unsigned long long u64;\\ntypedef __uint128_t u128;\\n\\nstruct bignum {\\n u64 a[30005];\\n int n;\\n\\n int ctz() const {\\n for (int i = 0;; i++) {\\n if (a[i]) {\\n return i << 6 | __builtin_ctzll(a[i]);\\n }\\n }\\n }\\n\\n int lg() const {\\n return n << 6 | __lg(a[n]);\\n }\\n\\n bool operator<(const bignum &b) const {\\n if (n != b.n) {\\n return n < b.n;\\n }\\n for (int i = n; i != -1; i--) {\\n if (a[i] < b.a[i]) {\\n return 1;\\n }\\n if (a[i] > b.a[i]) {\\n return 0;\\n }\\n }\\n return 0;\\n }\\n\\n bool operator>(const bignum &b) const {\\n return b < *this;\\n }\\n\\n bool operator<=(const bignum &b) const {\\n return !(b < *this);\\n }\\n\\n bool operator>=(const bignum &b) const {\\n return !(*this < b);\\n }\\n\\n bool operator==(const bignum &b) const {\\n if (n != b.n) {\\n return 0;\\n }\\n for (int i = 0; i <= n; i++) {\\n if (a[i] != b.a[i]) {\\n return 0;\\n }\\n }\\n return 1;\\n }\\n\\n bool operator!=(const bignum &b) const {\\n return !(*this == b);\\n }\\n\\n bignum operator+(u64 x) const {\\n bignum c = *this;\\n int l = c.n;\\n\\n c.a[0] += x;\\n\\n bool o = c.a[0] < a[0];\\n if (o) {\\n for (int i = 1; i <= l; i++) {\\n if (a[i] == (u64)-1) {\\n c.a[i] = 0;\\n } else {\\n c.a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n c.a[++l] = 1;\\n }\\n }\\n c.n = l;\\n return c;\\n }\\n\\n bignum operator-(u64 x) const {\\n bignum c = *this;\\n int l = c.n;\\n\\n c.a[0] -= x;\\n\\n bool o = c.a[0] > a[0];\\n if (o) {\\n for (int i = 1; i <= l; i++) {\\n if (!a[i]) {\\n c.a[i] = -1;\\n } else {\\n c.a[i]--;\\n break;\\n }\\n }\\n while (l && !c.a[l]) {\\n l--;\\n c.n--;\\n }\\n }\\n return c;\\n }\\n\\n bignum operator*(u64 x) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int l = n;\\n u128 ad = 0;\\n\\n for (int i = 0; i <= l; i++) {\\n ad += (u128)a[i] * x;\\n c.a[i] = ad, ad >>= 64;\\n }\\n\\n if (ad) {\\n c.a[++l] = ad;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator/(int m) const {\\n if (m == 1) {\\n return *this;\\n }\\n\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int l = n;\\n int r = 0;\\n\\n for (int i = l; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n c.a[i] = r * b + q, r = gu;\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n int operator%(int m) const {\\n if (m == 1) {\\n return 0;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n int r = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n r = v - q * m;\\n if (r >= m) {\\n r -= m;\\n }\\n }\\n\\n return r;\\n }\\n\\n bignum operator+(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n bool o = 0;\\n int l = max(n, b.n);\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = a[i] + b.a[i] + o;\\n o = (c.a[i] < a[i]) || (b.a[i] == (u64)-1 && o);\\n }\\n if (o) {\\n c.a[++l] = 1;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator-(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n bool o = 0;\\n int l = n;\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = a[i] - b.a[i] - o;\\n o = (c.a[i] > a[i]) || (b.a[i] == (u64)-1 && o);\\n }\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator*(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n u128 r = 0;\\n int l = n + b.n;\\n for (int i = 0; i <= n + b.n; i++) {\\n u128 h = 0;\\n\\n for (int j = max(0, i - b.n); j <= min(i, n); j++) {\\n u128 tp = (u128)a[j] * b.a[i - j];\\n r += tp & ((u64)-1), h += tp >> 64;\\n }\\n\\n c.a[i] = r;\\n r = h + (r >> 64);\\n }\\n if (r) {\\n c.a[++l] = r;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator/(const bignum &b) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int n = lg(), m = b.lg();\\n if (n < m) {\\n return c;\\n }\\n\\n bignum tp = *this, qwq = b << (n - m);\\n int l = 0;\\n for (int i = n - m; i != -1; i--, qwq >>= 1) {\\n if (tp >= qwq) {\\n tp -= qwq;\\n c.a[i >> 6] |= 1ull << (i & 63);\\n if (!l) {\\n l = i;\\n }\\n }\\n }\\n\\n c.n = l >> 6;\\n return c;\\n }\\n\\n bignum operator%(const bignum &b) const {\\n bignum c = *this;\\n\\n int n = lg(), m = b.lg();\\n if (n < m) {\\n return c;\\n }\\n\\n bignum tp = b << (n - m);\\n for (int i = n; i >= m; i--, tp >>= 1) {\\n if (c >= tp) {\\n c -= tp;\\n }\\n }\\n\\n return c;\\n }\\n\\n bignum operator+=(u64 x) {\\n u64 tp = a[0];\\n a[0] += x;\\n bool o = a[0] < tp;\\n\\n if (o) {\\n for (int i = 1; i <= n; i++) {\\n if (a[i] == (u64)-1) {\\n a[i] = 0;\\n } else {\\n a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n a[++n] = 1;\\n }\\n }\\n return *this;\\n }\\n\\n bignum operator-=(u64 x) {\\n u64 tp = a[0];\\n a[0] -= x;\\n bool o = a[0] > tp;\\n\\n if (o) {\\n for (int i = 1; i <= n; i++) {\\n if (!a[i]) {\\n a[i] = -1;\\n } else {\\n a[i]--;\\n break;\\n }\\n }\\n while (n && !a[n]) {\\n n--;\\n }\\n }\\n return *this;\\n }\\n\\n bignum operator*=(u64 x) {\\n u128 ad = 0;\\n\\n for (int i = 0; i <= n; i++) {\\n ad += (u128)a[i] * x;\\n a[i] = ad, ad >>= 64;\\n }\\n\\n if (ad) {\\n a[++n] = ad;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator/=(int m) {\\n if (m == 1) {\\n return *this;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int r = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 v = (u128)r * rr + a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n a[i] = r * b + q, r = gu;\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator+=(const bignum &b) {\\n bool o = 0;\\n int l = max(n, b.n);\\n for (int i = 0; i <= l; i++) {\\n u64 tp = a[i];\\n a[i] += b.a[i] + o;\\n o = (a[i] < tp) || (b.a[i] == (u64)-1 && o);\\n }\\n if (o) {\\n a[++l] = 1;\\n }\\n n = l;\\n\\n return *this;\\n }\\n\\n bignum operator-=(const bignum &b) {\\n bool o = 0;\\n int l = n;\\n for (int i = 0; i <= l; i++) {\\n u64 tp = a[i];\\n a[i] -= b.a[i] + o;\\n o = (a[i] > tp) || (b.a[i] == (u64)-1 && o);\\n }\\n while (l && !a[l]) {\\n l--;\\n }\\n n = l;\\n\\n return *this;\\n }\\n\\n bignum operator*=(const bignum &b) {\\n return *this = *this * b;\\n }\\n\\n bignum operator/=(const bignum &b) {\\n return *this = *this / b;\\n }\\n\\n bignum operator%=(const bignum &b) {\\n return *this = *this % b;\\n }\\n\\n bignum operator<<(int k) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int t = k >> 6;\\n memcpy(c.a + t, a, (n + 1) << 3);\\n int l = n + t;\\n\\n t = k & 63;\\n if (t) {\\n for (int i = l + 1; i; i--) {\\n c.a[i] = (c.a[i] << t) | (c.a[i - 1] >> (64 - t));\\n }\\n c.a[0] <<= t;\\n\\n if (c.a[l + 1]) {\\n l++;\\n }\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator>>(int k) const {\\n bignum c;\\n memset(&c, 0, sizeof c);\\n\\n int t = k >> 6;\\n if (t > n) {\\n return c;\\n }\\n\\n memcpy(c.a, a + t, (n - t + 1) << 3);\\n\\n int l = n - t;\\n t = k & 63;\\n\\n if (t) {\\n for (int i = 0; i <= l; i++) {\\n c.a[i] = (c.a[i] >> t) | (c.a[i + 1] << (64 - t));\\n }\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator&(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] &= b.a[i];\\n }\\n for (int i = b.n + 1; i <= c.n; i++) {\\n c.a[i] = 0;\\n }\\n\\n int l = c.n;\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator|(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] |= b.a[i];\\n }\\n c.n = max(c.n, b.n);\\n\\n return c;\\n }\\n\\n bignum operator^(const bignum &b) const {\\n bignum c = *this;\\n\\n for (int i = 0; i <= b.n; i++) {\\n c.a[i] ^= b.a[i];\\n }\\n\\n int l = max(c.n, b.n);\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n return c;\\n }\\n\\n bignum operator<<=(int k) {\\n int t = k >> 6;\\n\\n if (t) {\\n for (int i = n; i != -1; i--) {\\n a[i + t] = a[i];\\n }\\n memset(a, 0, t << 3);\\n }\\n n += t;\\n\\n t = k & 63;\\n\\n if (t) {\\n for (int i = n + 1; i; i--) {\\n a[i] = (a[i] << t) | (a[i - 1] >> (64 - t));\\n }\\n a[0] <<= t;\\n }\\n\\n if (a[n + 1]) {\\n n++;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator>>=(int k) {\\n int t = k >> 6;\\n\\n if (t > n) {\\n memset(a, 0, (n + 1) << 3);\\n n = 0;\\n return *this;\\n }\\n\\n for (int i = t; i <= n; i++) {\\n a[i - t] = a[i];\\n }\\n memset(a + n - t + 1, 0, t << 3);\\n n -= t;\\n\\n t = k & 63;\\n\\n if (t) {\\n for (int i = 0; i <= n; i++) {\\n a[i] = (a[i] >> t) | (a[i + 1] << (64 - t));\\n }\\n }\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator&=(const bignum &b) {\\n for (int i = 0; i <= b.n; i++) {\\n a[i] &= b.a[i];\\n }\\n for (int i = b.n + 1; i <= n; i++) {\\n a[i] = 0;\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n\\n bignum operator|=(const bignum &b) {\\n for (int i = 0; i <= b.n; i++) {\\n a[i] |= b.a[i];\\n }\\n n = max(n, b.n);\\n\\n return *this;\\n }\\n\\n bignum operator^=(const bignum &b) {\\n n = max(n, b.n);\\n for (int i = 0; i <= b.n; i++) {\\n a[i] ^= b.a[i];\\n }\\n\\n while (n && !a[n]) {\\n n--;\\n }\\n\\n return *this;\\n }\\n};\\n\\nbool oa, ob;\\n\\nbignum read_bignum(bool &o) {\\n static char str[100005];\\n static u64 a[10005];\\n static u64 bs = 1000000000000000000ll;\\n\\n cin >> str;\\n int n = strlen(str);\\n if (str[0] == '-') {\\n o = 1;\\n n--;\\n for (int i = 0; i != n; i++) {\\n str[i] = str[i + 1];\\n }\\n }\\n reverse(str, str + n);\\n\\n for (int i = 0; i <= (n - 1) / 18; i++) {\\n u64 v = 0;\\n for (int j = min(n, (i + 1) * 18) - 1; j >= i * 18; j--) {\\n v = v * 10 + str[j] - '0';\\n }\\n a[i] = v;\\n }\\n n = (n - 1) / 18;\\n\\n bignum c;\\n memset(&c, 0, sizeof c);\\n int m = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 ad = 0;\\n for (int j = 0; j <= m; j++) {\\n ad += (u128)c.a[j] * bs;\\n c.a[j] = ad, ad >>= 64;\\n }\\n\\n while (ad) {\\n c.a[++m] = ad, ad >>= 64;\\n }\\n c.n = m;\\n\\n c += a[i], m = c.n;\\n }\\n\\n return c;\\n}\\n\\nvoid output(bignum a) {\\n static u64 v[30005];\\n const u64 bs = 1000000000000000000ll;\\n\\n int n = a.n, m = 0;\\n\\n for (int i = n; i != -1; i--) {\\n u128 ad = 0;\\n for (int j = 0; j <= m; j++) {\\n ad += (u128)v[j] << 64;\\n u128 gu = ad / bs;\\n v[j] = ad - gu * bs, ad = gu;\\n }\\n\\n while (ad) {\\n u128 gu = ad / bs;\\n v[++m] = ad - gu * bs, ad = gu;\\n }\\n\\n ad = a.a[i];\\n for (int j = 0; j <= m && ad; j++) {\\n ad += v[j];\\n u128 gu = ad / bs;\\n v[j] = ad - gu * bs, ad = gu;\\n }\\n while (ad) {\\n u128 gu = ad / bs;\\n v[++m] = ad - gu * bs, ad = gu;\\n }\\n }\\n\\n cout << v[m];\\n for (int i = m - 1; i != -1; i--) {\\n cout << setw(18) << setfill('0') << v[i];\\n }\\n memset(v, 0, sizeof v);\\n}\\n\\nbignum updiv(bignum &a, int m) {\\n static bignum c;\\n memset(&c, 0, sizeof c);\\n\\n if (m == 1) {\\n return a;\\n }\\n\\n u64 b = ((u128)1 << 64) / m, rr = ((u128)1 << 64) % m;\\n\\n int l = a.n;\\n int r = 0;\\n\\n for (int i = l; i != -1; i--) {\\n u128 v = (u128)r * rr + a.a[i];\\n u64 q = (v * b) >> 64;\\n int gu = v - (u128)q * m;\\n if (gu >= m) {\\n gu -= m, q++;\\n }\\n\\n c.a[i] = r * b + q, r = gu;\\n }\\n\\n while (l && !c.a[l]) {\\n l--;\\n }\\n c.n = l;\\n\\n if (r) {\\n bool o = 1;\\n for (int i = 0; i <= l; i++) {\\n if (c.a[i] == (u64)-1) {\\n c.a[i] = 0;\\n } else {\\n c.a[i]++;\\n o = 0;\\n break;\\n }\\n }\\n\\n if (o) {\\n c.a[++l] = 1;\\n }\\n }\\n\\n c.n = l;\\n\\n return c;\\n}\\n\\nbignum gcd(bignum a, bignum b) {\\n if (a > b) {\\n swap(a, b);\\n }\\n\\n if (a.n == 0 && !a.a[0]) {\\n return b;\\n }\\n\\n int l = min(a.ctz(), b.ctz());\\n a >>= a.ctz(), b >>= b.ctz();\\n\\n while (1) {\\n if (a.n == 0 && !a.a[0]) {\\n return b << l;\\n }\\n\\n if (!(a.a[0] & 1)) {\\n a >>= 1;\\n } else if (!(b.a[0] & 1)) {\\n b >>= 1;\\n } else {\\n if (a < b) {\\n swap(a, b);\\n }\\n a -= b;\\n }\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n\\n bignum a = read_bignum(oa), b = read_bignum(ob);\\n if (oa && ob) {\\n cout << '-';\\n oa = ob = 0;\\n }\\n\\n if (oa == 0 && ob == 0) {\\n output(a + b);\\n cout << endl;\\n return 0;\\n }\\n\\n if (oa) {\\n swap(a, b);\\n }\\n\\n if (a >= b) {\\n output(a - b);\\n cout << endl;\\n } else {\\n cout << '-';\\n output(b - a);\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 4732,\n \"score_of_the_acc\": -0.4639,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_7593476\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#include <boost/multiprecision/cpp_int.hpp>\\n\\nsigned main() {\\n boost::multiprecision::cpp_int A, B;\\n cin >> A >> B;\\n cout << A + B << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -1,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_7484494\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\\n#define pb push_back\\n#define f first\\n#define s second\\n\\nusing namespace std;\\ntypedef pair <int,int> pii;\\n\\nconst int maxn = 1e5 + 5;\\n\\nstring t(string a,string b)\\n{\\n string c = \\\"\\\";\\n int n1 = a.size();\\n int n2 = b.size();\\n if(n1 > n2) forr(i,1,n1 - n2) b = \\\"0\\\" + b;\\n if(n1 < n2)\\n {\\n forr(i,1,n2 - n1) a = \\\"0\\\" + a;\\n n1 = n2;\\n }\\n int nho = 0;\\n forw(i,n1 - 1,0)\\n {\\n int res = a[i] - '0' + b[i] - '0' + nho;\\n if(res > 9) nho = 1;\\n else nho = 0;\\n c = char(res%10 + 48) + c;\\n }\\n if(nho == 1) c = \\\"1\\\" + c;\\n return c;\\n}\\n\\nstring h(string a,string b)\\n{\\n string c = \\\"\\\";\\n int n1 = a.size();\\n int n2 = b.size();\\n if(n2 < n1) forr(i,1,n1 - n2) b = \\\"0\\\" + b;\\n int nho = 0;\\n forw(i,n1 - 1,0)\\n {\\n int res = a[i] - '0' - (b[i] - '0') - nho;\\n if(res < 0) nho = 1;\\n else nho = 0;\\n if(res < 0) c = char(res + 10 + 48) + c;\\n else c = char(res + 48) + c;\\n }\\n while(c.size() > 1 && c[0] == '0') c.erase(0,1);\\n return c;\\n}\\n\\nstring a,b;\\n\\nint main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n cin >> a >> b;\\n if(a[0] == '-')\\n {\\n if(b[0] == '-')\\n {\\n a.erase(0,1);\\n b.erase(0,1);\\n cout << \\\"-\\\" << t(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n a.erase(0,1);\\n if(b.size() > a.size() || (b.size() == a.size() && b >= a))\\n {\\n cout << h(b,a) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else\\n {\\n cout << \\\"-\\\" << h(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n else\\n {\\n if(b[0] == '-')\\n {\\n b.erase(0,1);\\n if(b.size() < a.size() || (b.size() == a.size() && b <= a))\\n {\\n cout << h(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else\\n {\\n cout << \\\"-\\\" << h(b,a) << \\\"\\\\n\\\";\\n return 0;\\n }\\n }\\n else cout << t(a,b) << \\\"\\\\n\\\";\\n //cout << \\\"Vandeeptry\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3988,\n \"score_of_the_acc\": -0.3544,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_7338655\",\n \"code_snippet\": \"#line 2 \\\"nachia\\\\\\\\math-modulo\\\\\\\\modulo-primitive-root.hpp\\\"\\n#include <vector>\\n#include <utility>\\n\\nnamespace nachia{\\n\\ntemplate<unsigned int MOD>\\nstruct PrimitiveRoot{\\n using u64 = unsigned long long;\\n static constexpr u64 powm(u64 a, u64 i) {\\n u64 res = 1, aa = a;\\n while(i){\\n if(i & 1) res = res * aa % MOD;\\n aa = aa * aa % MOD;\\n i /= 2;\\n }\\n return res;\\n }\\n static constexpr bool ExamineVal(unsigned int g){\\n unsigned int t = MOD - 1;\\n for(u64 d=2; d*d<=t; d++) if(t % d == 0){\\n if(powm(g, (MOD - 1) / d) == 1) return false;\\n while(t % d == 0) t /= d;\\n }\\n if(t != 1) if(powm(g, (MOD - 1) / t) == 1) return false;\\n return true;\\n }\\n static constexpr unsigned int GetVal(){\\n for(unsigned int x=2; x<MOD; x++) if(ExamineVal(x)) return x;\\n return 0;\\n }\\n static const unsigned int val = GetVal();\\n};\\n\\n} // namespace nachia\\n#line 1 \\\"nachia\\\\\\\\fps\\\\\\\\ntt-interface.hpp\\\"\\n#include <algorithm>\\n\\nnamespace nachia {\\n\\ntemplate<class mint>\\nstruct NttInterface{\\n\\ntemplate<class Iter>\\nvoid Butterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid IButterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid BitReversal(Iter a, int N) const {\\n for(int i=0, j=0; j<N; j++){\\n if(i < j) std::swap(a[i], a[j]);\\n for(int k = N>>1; k > (i^=k); k>>=1);\\n }\\n}\\n\\n};\\n\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\misc\\\\\\\\bit-operations.hpp\\\"\\n\\nnamespace nachia{\\n\\nint Popcount(unsigned long long c) noexcept {\\n#ifdef __GNUC__\\n return __builtin_popcountll(c);\\n#else\\n c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));\\n c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));\\n c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));\\n c = (c * (~0ull/257)) >> 56;\\n return c;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint MsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return 63 - __builtin_clzll(x);\\n#else\\n int res = 0;\\n for(int d=32; d>0; d>>=1) if(x >> d){ res |= d; x >>= d; }\\n return res;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint LsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return __builtin_ctzll(x);\\n#else\\n return MsbIndex(x & -x);\\n#endif\\n}\\n\\n}\\n\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <iterator>\\n#include <cassert>\\n#line 8 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <array>\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nconstexpr int bsf_constexpr(unsigned int n) {\\n\\tint x = 0;\\n\\twhile (!(n & (1 << x))) x++;\\n\\treturn x;\\n}\\n\\ntemplate <class mint>\\nstruct NttFromAcl : NttInterface<mint> {\\n\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\n \\nstatic int ceil_pow2(int n) {\\n\\tint x = 0;\\n\\twhile ((1U << x) < (u32)(n)) x++;\\n\\treturn x;\\n}\\n\\nstruct fft_info {\\n\\tstatic constexpr u32 g = nachia::PrimitiveRoot<mint::GetMod()>::val;\\n\\tstatic constexpr int rank2 = bsf_constexpr(mint::GetMod()-1);\\n\\tstd::array<mint, rank2+1> root;\\n\\tstd::array<mint, rank2+1> iroot;\\n\\n\\tstd::array<mint, std::max(0, rank2-1)> rate2;\\n\\tstd::array<mint, std::max(0, rank2-1)> irate2;\\n\\n\\tstd::array<mint, std::max(0, rank2-2)> rate3;\\n\\tstd::array<mint, std::max(0, rank2-2)> irate3;\\n\\n\\tfft_info(){\\n\\t\\troot[rank2] = mint(g).pow((mint::GetMod() - 1) >> rank2);\\n\\t\\tiroot[rank2] = root[rank2].inv();\\n\\t\\tfor(int i=rank2-1; i>=0; i--){\\n\\t\\t\\troot[i] = root[i+1] * root[i+1];\\n\\t\\t\\tiroot[i] = iroot[i+1] * iroot[i+1];\\n\\t\\t}\\n\\t\\tmint prod = 1u, iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-2; i++){\\n\\t\\t\\trate2[i] = root[i+2] * prod;\\n\\t\\t\\tirate2[i] = iroot[i+2] * iprod;\\n\\t\\t\\tprod *= iroot[i+2];\\n\\t\\t\\tiprod *= root[i+2];\\n\\t\\t}\\n\\t\\tprod = 1u; iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-3; i++){\\n\\t\\t\\trate3[i] = root[i+3] * prod;\\n\\t\\t\\tirate3[i] = iroot[i+3] * iprod;\\n\\t\\t\\tprod *= iroot[i+3];\\n\\t\\t\\tiprod *= root[i+3];\\n\\t\\t}\\n\\t}\\n};\\n\\ntemplate<class RandomAccessIterator>\\nvoid Butterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = 0;\\n\\twhile(len < h){\\n\\t\\tif(h-len == 1){\\n\\t\\t\\tint p = 1 << (h-len-1);\\n\\t\\t\\tmint rot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = l-r;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen++;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len-2);\\n\\t\\t\\tmint rot = 1u, imag = info.root[2];\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tmint rot2 = rot * rot;\\n\\t\\t\\t\\tmint rot3 = rot2 * rot;\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p] * rot2;\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p] * rot3;\\n\\t\\t\\t\\t\\tauto a0a2 = a0 + a2;\\n\\t\\t\\t\\t\\tauto a0b2 = a0 - a2;\\n\\t\\t\\t\\t\\tauto a1a3 = a1 + a3;\\n\\t\\t\\t\\t\\tauto a1na3imag = (a1 - a3) * imag;\\n\\t\\t\\t\\t\\ta[i+offset] = a0a2 + a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = a0a2 - a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = a0b2 + a1na3imag;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = a0b2 - a1na3imag;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen += 2;\\n\\t\\t}\\n\\t}\\n}\\n\\ntemplate<class RandomAccessIterator>\\nvoid IButterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = h;\\n\\twhile(len){\\n\\t\\tif(len == 1){\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<(len-1)); s++){\\n\\t\\t\\t\\tint offset = s << (h-len+1);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p];\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = (l-r)*irot;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-1))) irot *= info.irate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen--;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u, iimag = info.iroot[2];\\n\\t\\t\\tfor(int s=0; s<(1<<(len-2)); s++){\\n\\t\\t\\t\\tmint irot2 = irot * irot;\\n\\t\\t\\t\\tmint irot3 = irot2 * irot;\\n\\t\\t\\t\\tint offset = s << (h-len+2);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset+0*p];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+1*p];\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p];\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p];\\n\\t\\t\\t\\t\\tauto a0a1 = a0 + a1;\\n\\t\\t\\t\\t\\tauto a0b1 = a0 - a1;\\n\\t\\t\\t\\t\\tauto a2a3 = a2 + a3;\\n\\t\\t\\t\\t\\tauto a2na3iimag = (a2 - a3) * iimag;\\n\\n\\t\\t\\t\\t\\ta[i+offset] = a0a1 + a2a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = (a0b1 + a2na3iimag) * irot;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = (a0a1 - a2a3) * irot2;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = (a0b1 - a2na3iimag) * irot3;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-2))) irot *= info.irate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen -= 2;\\n\\t\\t}\\n\\t}\\n}\\n\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 3 \\\"nachia\\\\\\\\bigint\\\\\\\\static-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\ntemplate<unsigned int MxVal>\\nclass Montgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 u32inverse(u32 x){\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static constexpr u32 getMy(u32 mx){ return (-mx) % mx; }\\n static constexpr u32 powMod(u32 a, u32 i, u32 m){\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n static constexpr u32 Mx = MxVal;\\n static constexpr u32 iMx = u32inverse(Mx);\\n static constexpr u32 My1 = getMy(Mx);\\n static constexpr u32 My2 = powMod(getMy(Mx), 2, Mx);\\n static constexpr u32 My3 = powMod(getMy(Mx), 3, Mx);\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n static constexpr u32 red(u64 x){\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n};\\n\\ntemplate<unsigned int MOD>\\nclass StaticPModint{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\nprivate:\\n static constexpr u32 mod = MOD;\\n using Tool = Montgomery32Info<MOD>;\\n using MyType = StaticPModint;\\n u32 _v;\\n static MyType RAW(u32 v) { auto res = StaticPModint(); res._v = v; return res; }\\npublic:\\n StaticPModint() : _v(0) {}\\n StaticPModint(u32 v) : _v(Tool::red((u64)v * Tool::My2)) {}\\n StaticPModint(u64 v) : _v(Tool::red((u64)Tool::My3 * Tool::red(v))) {}\\n u32 val() const { return Tool::red(_v); }\\n u32 mrVal() const { return _v; }\\n MyType& operator-=(MyType r) { _v = _v - r._v + (_v < r._v ? mod : 0); return *this; }\\n MyType& operator+=(MyType r) { u32 t = mod - r._v; _v = _v - t + (_v < t ? mod : 0); return *this; }\\n MyType& operator*=(MyType r) { _v = Tool::red((u64)_v * r._v); return *this; }\\n MyType operator+(MyType r) const { auto v = *this; v += r; return v; }\\n MyType operator-(MyType r) const { auto v = *this; v -= r; return v; }\\n MyType operator*(MyType r) const { auto v = *this; v *= r; return v; }\\n MyType operator-() const { return RAW(_v ? mod - _v : (u32)0); }\\n MyType pow(unsigned long long i) const {\\n MyType x = *this, r = RAW(Tool::My1);\\n while(i){ if(i&1){ r *= x; } x*=x; i>>=1; }\\n return r;\\n }\\n MyType inv() const { return pow(mod-2); }\\n static constexpr u32 GetMod() { return mod; }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 2 \\\"nachia\\\\\\\\bigint\\\\\\\\dynamic-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nclass DynMontgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static u32 u32inverse(u32 x) {\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static u32 getMy(u32 mx) { return (-mx) % mx; }\\n static u32 powMod(u32 a, u32 i, u32 m) {\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n const u32 Mx;\\n const u32 iMx;\\n const u32 My1;\\n const u32 My2;\\n const u32 My3;\\n DynMontgomery32Info(u32 newMod)\\n : Mx(newMod)\\n , iMx(u32inverse(Mx))\\n , My1(getMy(Mx))\\n , My2((u64)My1 * My1 % Mx)\\n , My3((u64)My2 * My1 % Mx) {}\\n\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n u32 red(u64 x) const {\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n u32 add(u32 a, u32 b) const { b = Mx-b; return a - b + ((a < b) ? Mx : 0u); }\\n u32 sub(u32 a, u32 b) const { return a - b + ((a < b) ? Mx : 0u); }\\n u32 mul(u32 a, u32 b) const { return red((u64)a * b); }\\n u32 pow(u32 a, u32 i) const {\\n u32 x = a, r = My1;\\n while(i){ if(i&1){ r=mul(r,x); } x=mul(x,x); i>>=1; }\\n return r;\\n }\\n u32 inv(u32 a) const { return pow(a, Mx-2); }\\n u32 input64(u64 a) const { return mul(red(a), My3); }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\garner.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct GarnerU96{\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n std::vector<u32> mods;\\n std::vector<DynMontgomery32Info> dynmods;\\n std::vector<std::vector<u32>> table_coeff;\\n std::vector<u32> table_coeffinv;\\n\\n void precalc(std::vector<u32> new_mods){\\n mods = std::move(new_mods);\\n for(std::size_t i=0; i<mods.size(); i++) dynmods.emplace_back(mods[i]);\\n int nmods = mods.size();\\n table_coeff.assign(nmods+1, std::vector<u32>(nmods, 0));\\n for(int k=0; k<nmods; k++) table_coeff[0][k] = dynmods[k].My2;\\n for(int j=0; j<nmods; j++){\\n for(int k=0; k<nmods; k++) table_coeff[j+1][k] = table_coeff[j][k];\\n for(int k=j+1; k<nmods; k++) table_coeff[j+1][k] = dynmods[k].mul(table_coeff[j+1][k], dynmods[k].input64(mods[j]));\\n }\\n table_coeffinv.resize(nmods);\\n for(int i=0; i<nmods; i++) table_coeffinv[i] = dynmods[i].inv(table_coeff[i][i]);\\n }\\n\\n u64 calc(const std::vector<u32>& x){\\n int nmods = mods.size();\\n std::vector<u32> table_const(nmods);\\n u64 res = 0;\\n u64 res_coeff = 1;\\n for(int j=0; j<nmods; j++){\\n u32 t = dynmods[j].mul(dynmods[j].sub(x[j], table_const[j]), table_coeffinv[j]);\\n for(int k=j+1; k<nmods; k++){\\n table_const[k] = dynmods[k].add(dynmods[k].mul(t, table_coeff[j][k]), table_const[k]);\\n }\\n res += res_coeff * u64(t);\\n res_coeff *= mods[j];\\n }\\n return res;\\n }\\n\\n std::pair<std::vector<u32>, std::vector<u64>> calc(std::vector<std::vector<u32>> x){\\n int n = x[0].size(), m = x.size();\\n std::vector<u64> resl(n);\\n std::vector<u32> resh(n);\\n std::vector<u32> buf(m);\\n u32 inv64 = dynmods[0].inv(dynmods[0].mul(dynmods[0].My3, dynmods[0].My2));\\n for(int i=0; i<n; i++){\\n for(int j=0; j<m; j++) buf[j] = x[j][i];\\n resl[i] = calc(buf);\\n resh[i] = dynmods[0].mul(dynmods[0].sub(buf[0], dynmods[0].input64(resl[i])), inv64);\\n }\\n return std::make_pair(std::move(resh), std::move(resl));\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\convolution.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct MultiplySupply {\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 MODCNT = 3;\\n static constexpr u32 MOD[3] = { 3892314113, 3489660929, 3221225473 };\\n \\n GarnerU96 garner;\\n\\n MultiplySupply(){\\n garner.precalc(std::vector<u32>(MOD, MOD + MODCNT));\\n }\\n \\n template<unsigned int P>\\n static std::vector<u32> SubConvolution(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ) {\\n using Elem = StaticPModint<P>;\\n static NttFromAcl<Elem> ntt;\\n int z = a.size() + b.size() - 1;\\n int N = 1; while(N < z) N *= 2;\\n std::vector<Elem> A(N), B(N);\\n for(std::size_t i=0; i<a.size(); i++) A[i] = a[i];\\n for(std::size_t i=0; i<b.size(); i++) B[i] = b[i];\\n Elem iN = Elem((u32)N).inv();\\n ntt.Butterfly(A.begin(), N);\\n ntt.Butterfly(B.begin(), N);\\n for(int i=0; i<N; i++) A[i] = A[i] * B[i] * iN;\\n ntt.IButterfly(A.begin(), N);\\n std::vector<u32> res(z);\\n for(int i=0; i<z; i++) res[i] = A[i].mrVal();\\n return res;\\n }\\n \\n std::vector<u32> multiplyBin(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ){\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q = garner.calc(std::move(cx));\\n int n = q.first.size();\\n std::vector<u32> res(n + 2);\\n for(int i=0; i<n; i++) res[i] = q.second[i];\\n u64 c = 0;\\n for(int i=0; i<n; i++){ res[i+1] = c += (u64)res[i+1] + (q.second[i] >> 32); c >>= 32; }\\n res[n+1] = c; c = 0;\\n for(int i=0; i<n; i++){ res[i+2] = c += (u64)res[i+2] + q.first[i]; c >>= 32; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n \\n std::vector<u32> multiplyDec(\\n std::vector<u32> a,\\n std::vector<u32> b\\n ){\\n static constexpr u32 d = 1000000000;\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q0 = garner.calc(std::move(cx));\\n int n = q0.first.size();\\n std::vector<u64> buf(n + 2);\\n static constexpr u32 j11 = (1ull << 32) / d;\\n static constexpr u32 j10 = (-d) % d;\\n static constexpr u32 j22 = 1 + (0ull- 1ull * d * d) / d / d;\\n static constexpr u32 j21 = (-1ull * j22 * d * d) / d;\\n static constexpr u32 j20 = (0ull-d) % d;\\n for(int i=0; i<n; i++) buf[i] = q0.second[i] & ((1ull << 32) - 1);\\n for(int i=0; i<n; i++) buf[i] += 1ull * (q0.second[i] >> 32) * j10;\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * (q0.second[i] >> 32) * j11;\\n for(int i=0; i<n; i++) buf[i] += 1ull * q0.first[i] * j20; // q0.first[i] is small enough\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * q0.first[i] * j21;\\n for(int i=0; i<n; i++) buf[i+2] += 1ull * q0.first[i] * j22;\\n std::vector<u32> res(n + 2);\\n u64 c = 0;\\n for(int i=0; i<n+2; i++){ c += buf[i]; res[i] = c % d; c /= d; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\base-operators.hpp\\\"\\n#include <iostream>\\n\\nnamespace nachia {\\nnamespace bigint {\\n\\nclass UIntDec {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\nstatic constexpr u32 BASE = 1'000'000'000;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntDec() = default;\\nUIntDec(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntDec& operator+=(const UIntDec& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n if(c >= BASE){ x[i] = c - BASE; c = 1; }\\n else{ x[i] = c; c = 0; }\\n }\\n for(int i=b.x.size(); c; i++){\\n c += x[i];\\n if(c >= BASE){\\n x[i] = c - BASE;\\n c = 1;\\n } else {\\n x[i] = c;\\n c = 0;\\n break;\\n }\\n }\\n Regularize();\\n return *this;\\n}\\nUIntDec operator*(const UIntDec& b) const { return MultiplySupply().multiplyDec(x, b.x); }\\n\\nUIntDec Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulU32(unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ c += (u64)x[i] << 32; x[i] = c % BASE; c /= BASE; }\\n while(c){ x.push_back(c % BASE); c /= BASE; }\\n}\\n\\n};\\n\\nclass UIntBin {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntBin() = default;\\nUIntBin(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntBin& operator+=(const UIntBin& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n x[i] = c; c >>= 32;\\n }\\n for(int i=b.x.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n Regularize();\\n return *this;\\n}\\nUIntBin operator*(const UIntBin& b) const { return MultiplySupply().multiplyBin(x, b.x); }\\n\\nUIntBin Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulD(unsigned int d, unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ x[i] = (c += (u64)x[i] * d); c >>= 32; }\\n if(c) x.push_back(c);\\n}\\n\\n};\\n\\nstd::vector<unsigned int> DecToBin(std::string decstr){\\n std::vector<UIntBin> pdec;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntBin {\\n if(r - l <= 308){\\n UIntBin p;\\n for(int j=l; j<l+(r-l)%9; j++) p.mulD(10, decstr[j] - '0');\\n for(int j=l+(r-l)%9; j<r; j+=9) p.mulD(1000000000, std::stoi(decstr.substr(j, 9)));\\n return p;\\n }\\n if(pdec.empty()) pdec.push_back(UIntBin({10}).Pow(308));\\n int h = 0; while(((308*2)<<h) < r-l) h++;\\n while((int)pdec.size() < h+1) pdec.push_back(pdec.back() * pdec.back());\\n auto res = dfs(dfs, l, r-(308<<h)) * pdec[h];\\n res += dfs(dfs, r-(308<<h), r);\\n return res;\\n };\\n return std::move(dfs(dfs, 0, decstr.size()).x);\\n}\\n\\nstd::string BinToDec(std::vector<unsigned int> b){\\n while(!b.empty() && !b.back()) b.pop_back();\\n std::reverse(b.begin(), b.end());\\n if(b.empty()) return \\\"0\\\";\\n std::vector<UIntDec> pbin;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntDec {\\n if(r - l <= 29){\\n UIntDec p;\\n for(int j=l; j<r; j++) p.mulU32(b[j]);\\n return p;\\n }\\n if(pbin.empty()) pbin.push_back(UIntDec({2}).Pow(32*29));\\n int h = 0; while(((29*2)<<h) < r-l) h++;\\n while((int)pbin.size() < h+1) pbin.push_back(pbin.back() * pbin.back());\\n auto res = dfs(dfs, l, r-(29<<h)) * pbin[h];\\n res += dfs(dfs, r-(29<<h), r);\\n return res;\\n };\\n auto x = std::move(dfs(dfs, 0, b.size()).x);\\n while(!x.empty() && !x.back()) x.pop_back();\\n std::string res = std::to_string(x.back());\\n res.resize(res.size() + 9 * (int)(x.size()-1), '0');\\n for(int i=(int)x.size()-2; i>=0; i--){\\n int o = res.size() - i*9 - 9;\\n for(int j=o+8; j>=o; j--){ res[j] += x[i] % 10; x[i] /= 10; }\\n }\\n return res;\\n}\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\bigint\\\\\\\\integer.hpp\\\"\\n\\nnamespace nachia{\\n\\nclass UnsignedIntegerBin{\\npublic:\\n using MyType = UnsignedIntegerBin;\\n friend class SignedIntegerBin;\\nprivate:\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n std::vector<u32> x;\\n static inline bool Cflag;\\n static MyType FromVec(std::vector<u32> _x){ MyType res; res.x = std::move(_x); return res; }\\npublic:\\n UnsignedIntegerBin(){}\\n MyType operator>>(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() - h);\\n for(int i=h; i<size(); i++) res[i-h] = x[i] >> l;\\n if(l) for(int i=h+1; i<size(); i++) res[i-h-1] |= x[i] << (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType operator<<(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() + h + 1);\\n for(int i=0; i<size(); i++) res[i+h] = x[i] << l;\\n if(l) for(int i=0; i<size(); i++) res[i+h+1] |= x[i] >> (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType& operator>>=(int sh) { return (*this) = operator>>(sh); }\\n MyType& operator<<=(int sh) { return (*this) = operator<<(sh); }\\n MyType& operator%=(const MyType& d) { divInternal(d); return *this; }\\n MyType operator%(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType operator/(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType& operator/=(const MyType& d) { return (*this) = divInternal(d); }\\n MyType& operator+=(const MyType& v){\\n memreserve(std::max(size(), v.size()) + 1);\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){ x[i] = (c += (u64)x[i] + v[i]); c >>= 32; }\\n for(int i=v.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& v){\\n memreserve(std::max(size(), v.size()));\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){\\n c += v[i];\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n for(int i=v.size(); i<size() && c; i++){\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n Cflag = c;\\n if(c){ complement(); increment(); }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& v) const {\\n MyType res;\\n res.x = bigint::MultiplySupply().multiplyBin(x, v.x);\\n res.regularize();\\n return res;\\n }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) { auto p = *this; p -= r; return p; }\\n bool operator<(const MyType& r) const {\\n return (size() != r.size())\\n ? (size() < r.size())\\n : std::lexicographical_compare(x.rbegin(), x.rend(), r.x.rbegin(), r.x.rend());\\n }\\n bool operator>(const MyType& r) const { return r < (*this); }\\n bool operator<=(const MyType& r) const { return !(r < (*this)); }\\n bool operator>=(const MyType& r) const { return !operator<(r); }\\n bool operator==(const MyType& r) const { return x == r.x; }\\n bool operator!=(const MyType& r) const { return x != r.x; }\\n bool operator!() const { return size(); }\\n bool isZero() const { return size() == 0; }\\n std::string toStringBin() const {\\n std::string res;\\n for(int i=size()-1; i>=0; i--) for(int j=31; j>=0; j--) res.push_back('0' + (x[i]>>j) % 2);\\n return res;\\n }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n \\n //auto p = *this;\\n //std::string s;\\n //while(!p.isZero()) s.push_back('0' + p.div10());\\n //std::reverse(s.begin(), s.end());\\n //return s;\\n \\n return bigint::BinToDec(x);\\n }\\n static MyType FromStringDec(const std::string& s) {\\n return FromVec(bigint::DecToBin(s));\\n }\\n int lsb() const { for(int i=0; i<size(); i++){ if(x[i]) return nachia::LsbIndex(x[i]) + i * 32; } return -1; }\\n int msb() const { for(int i=size()-1; i>=0; i--){ if(x[i]) return nachia::MsbIndex(x[i]) + i * 32; } return -1; }\\nprivate:\\n int size() const { return x.size(); }\\n u32& operator[](int at) { return x[at]; }\\n u32 operator[](int at) const { return x[at]; }\\n void memreserve(int sz) { if((int)x.size() < sz) x.resize(sz); }\\n void setBit(int at, bool val){ memreserve(at/32+1); x[at/32] |= (u32)(val?1:0) << (at%32); regularize(); }\\n MyType divInternal(const MyType& d) {\\n if(d.isZero()) throw 1;\\n MyType res;\\n for(int s=(size()-d.size())*32+31; s>=0; s--){\\n MyType x = d << s;\\n if(operator>=(x)){\\n res.setBit(s, true); operator-=(x);\\n }\\n }\\n res.regularize();\\n return res;\\n }\\n void complement() { for(u32& y:x){ y = ~y; } }\\n void increment() { if(isZero()){ x = {1}; return; } int i=0; while(i < size() && !~x[i]){ x[i++]++; } if(i>=size()){ x.push_back(1); } else x[i]++; }\\n void decrement() { if(isZero()){ x = {1}; return; } int i=0; while(x[i]){ x[i++]--; } x[i]--; regularize(); }\\n void regularize() { while(!x.empty() && 0 == x.back()) x.pop_back(); }\\n int div10() {\\n u64 c = 0;\\n for(int i=size()-1; i>=0; i--){\\n c = (c << 32) | x[i];\\n x[i] = c / 10;\\n c %= 10;\\n }\\n regularize();\\n return c;\\n }\\n void mul10(int d) {\\n u64 c = d;\\n for(int i=0; i<size(); i++){ x[i] = (c += (u64)x[i] * 10); c >>= 32; }\\n if(c) x.push_back(c);\\n }\\n};\\n\\nclass SignedIntegerBin{\\n using MyType = SignedIntegerBin;\\n using UInt = UnsignedIntegerBin;\\nprivate:\\n UInt u;\\n int sign = 1;\\n void regularize(){ u.regularize(); if(u.isZero()) sign = 1; }\\n static MyType Raw(UInt u, int s){ MyType res; res.u = std::move(u); res.sign = s; res.regularize(); return res; }\\npublic:\\n bool isZero() const { return u.isZero(); }\\n MyType& operator+=(const MyType& r) {\\n if(sign == r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& r) {\\n if(sign != r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& r) const { return Raw(u*r.u, sign*r.sign); }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) const { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) const { auto p = *this; p -= r; return p; }\\n MyType operator-() const { return Raw(u, -sign); }\\n MyType& operator<<=(int sh) { u <<= sh; return *this; }\\n MyType& operator>>=(int sh) { u >>= sh; return *this; }\\n MyType operator<<(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator>>(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator/(const MyType& r) const { return Raw(u/r.u, sign*r.sign); }\\n MyType& operator/=(const MyType& r) { return (*this) = operator/(r); }\\n MyType operator%(const MyType& r) const { return Raw(u%r.u, sign*r.sign); }\\n MyType& operator%=(const MyType& r) { return (*this) = operator%(r); }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n return (sign>0 ? \\\"\\\" : \\\"-\\\") + u.toStringDec();\\n }\\n static MyType FromStringDec(const std::string& s) {\\n if(s.empty()) return MyType();\\n if(s[0] == '+') return Raw(UInt::FromStringDec(s.substr(1)), 1);\\n if(s[0] == '-') return Raw(UInt::FromStringDec(s.substr(1)), -1);\\n return Raw(UInt::FromStringDec(s), 1);\\n }\\n};\\n\\n} // namespace nachia\\n#line 2 \\\"Main.cpp\\\"\\n#include <cstdint>\\n#line 5 \\\"Main.cpp\\\"\\n#include <string>\\n#line 7 \\\"Main.cpp\\\"\\n\\n\\nint main() {\\n using Int = nachia::SignedIntegerBin;\\n std::string s;\\n std::cin >> s;\\n Int a = Int::FromStringDec(s);\\n std::cin >> s;\\n Int b = Int::FromStringDec(s);\\n Int c = a + b;\\n std::cout << c.toStringDec() << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.0825,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_7338649\",\n \"code_snippet\": \"#line 2 \\\"nachia\\\\\\\\math-modulo\\\\\\\\modulo-primitive-root.hpp\\\"\\n#include <vector>\\n#include <utility>\\n\\nnamespace nachia{\\n\\ntemplate<unsigned int MOD>\\nstruct PrimitiveRoot{\\n using u64 = unsigned long long;\\n static constexpr u64 powm(u64 a, u64 i) {\\n u64 res = 1, aa = a;\\n while(i){\\n if(i & 1) res = res * aa % MOD;\\n aa = aa * aa % MOD;\\n i /= 2;\\n }\\n return res;\\n }\\n static constexpr bool ExamineVal(unsigned int g){\\n unsigned int t = MOD - 1;\\n for(u64 d=2; d*d<=t; d++) if(t % d == 0){\\n if(powm(g, (MOD - 1) / d) == 1) return false;\\n while(t % d == 0) t /= d;\\n }\\n if(t != 1) if(powm(g, (MOD - 1) / t) == 1) return false;\\n return true;\\n }\\n static constexpr unsigned int GetVal(){\\n for(unsigned int x=2; x<MOD; x++) if(ExamineVal(x)) return x;\\n return 0;\\n }\\n static const unsigned int val = GetVal();\\n};\\n\\n} // namespace nachia\\n#line 1 \\\"nachia\\\\\\\\fps\\\\\\\\ntt-interface.hpp\\\"\\n#include <algorithm>\\n\\nnamespace nachia {\\n\\ntemplate<class mint>\\nstruct NttInterface{\\n\\ntemplate<class Iter>\\nvoid Butterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid IButterfly(Iter, int) const {}\\n\\ntemplate<class Iter>\\nvoid BitReversal(Iter a, int N) const {\\n for(int i=0, j=0; j<N; j++){\\n if(i < j) std::swap(a[i], a[j]);\\n for(int k = N>>1; k > (i^=k); k>>=1);\\n }\\n}\\n\\n};\\n\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\misc\\\\\\\\bit-operations.hpp\\\"\\n\\nnamespace nachia{\\n\\nint Popcount(unsigned long long c) noexcept {\\n#ifdef __GNUC__\\n return __builtin_popcountll(c);\\n#else\\n c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));\\n c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));\\n c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));\\n c = (c * (~0ull/257)) >> 56;\\n return c;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint MsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return 63 - __builtin_clzll(x);\\n#else\\n int res = 0;\\n for(int d=32; d>0; d>>=1) if(x >> d){ res |= d; x >>= d; }\\n return res;\\n#endif\\n}\\n\\n// please ensure x != 0\\nint LsbIndex(unsigned long long x) noexcept {\\n#ifdef __GNUC__\\n return __builtin_ctzll(x);\\n#else\\n return MsbIndex(x & -x);\\n#endif\\n}\\n\\n}\\n\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <iterator>\\n#include <cassert>\\n#line 8 \\\"nachia\\\\\\\\bigint\\\\\\\\ntt.hpp\\\"\\n#include <array>\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nconstexpr int bsf_constexpr(unsigned int n) {\\n\\tint x = 0;\\n\\twhile (!(n & (1 << x))) x++;\\n\\treturn x;\\n}\\n\\ntemplate <class mint>\\nstruct NttFromAcl : NttInterface<mint> {\\n\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\n \\nstatic int ceil_pow2(int n) {\\n\\tint x = 0;\\n\\twhile ((1U << x) < (u32)(n)) x++;\\n\\treturn x;\\n}\\n\\nstruct fft_info {\\n\\tstatic constexpr u32 g = nachia::PrimitiveRoot<mint::GetMod()>::val;\\n\\tstatic constexpr int rank2 = bsf_constexpr(mint::GetMod()-1);\\n\\tstd::array<mint, rank2+1> root;\\n\\tstd::array<mint, rank2+1> iroot;\\n\\n\\tstd::array<mint, std::max(0, rank2-1)> rate2;\\n\\tstd::array<mint, std::max(0, rank2-1)> irate2;\\n\\n\\tstd::array<mint, std::max(0, rank2-2)> rate3;\\n\\tstd::array<mint, std::max(0, rank2-2)> irate3;\\n\\n\\tfft_info(){\\n\\t\\troot[rank2] = mint(g).pow((mint::GetMod() - 1) >> rank2);\\n\\t\\tiroot[rank2] = root[rank2].inv();\\n\\t\\tfor(int i=rank2-1; i>=0; i--){\\n\\t\\t\\troot[i] = root[i+1] * root[i+1];\\n\\t\\t\\tiroot[i] = iroot[i+1] * iroot[i+1];\\n\\t\\t}\\n\\t\\tmint prod = 1u, iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-2; i++){\\n\\t\\t\\trate2[i] = root[i+2] * prod;\\n\\t\\t\\tirate2[i] = iroot[i+2] * iprod;\\n\\t\\t\\tprod *= iroot[i+2];\\n\\t\\t\\tiprod *= root[i+2];\\n\\t\\t}\\n\\t\\tprod = 1u; iprod = 1u;\\n\\t\\tfor(int i=0; i<=rank2-3; i++){\\n\\t\\t\\trate3[i] = root[i+3] * prod;\\n\\t\\t\\tirate3[i] = iroot[i+3] * iprod;\\n\\t\\t\\tprod *= iroot[i+3];\\n\\t\\t\\tiprod *= root[i+3];\\n\\t\\t}\\n\\t}\\n};\\n\\ntemplate<class RandomAccessIterator>\\nvoid Butterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = 0;\\n\\twhile(len < h){\\n\\t\\tif(h-len == 1){\\n\\t\\t\\tint p = 1 << (h-len-1);\\n\\t\\t\\tmint rot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = l-r;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen++;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len-2);\\n\\t\\t\\tmint rot = 1u, imag = info.root[2];\\n\\t\\t\\tfor(int s=0; s<(1<<len); s++){\\n\\t\\t\\t\\tmint rot2 = rot * rot;\\n\\t\\t\\t\\tmint rot3 = rot2 * rot;\\n\\t\\t\\t\\tint offset = s << (h-len);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+p] * rot;\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p] * rot2;\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p] * rot3;\\n\\t\\t\\t\\t\\tauto a0a2 = a0 + a2;\\n\\t\\t\\t\\t\\tauto a0b2 = a0 - a2;\\n\\t\\t\\t\\t\\tauto a1a3 = a1 + a3;\\n\\t\\t\\t\\t\\tauto a1na3imag = (a1 - a3) * imag;\\n\\t\\t\\t\\t\\ta[i+offset] = a0a2 + a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = a0a2 - a1a3;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = a0b2 + a1na3imag;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = a0b2 - a1na3imag;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<len)) rot *= info.rate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen += 2;\\n\\t\\t}\\n\\t}\\n}\\n\\ntemplate<class RandomAccessIterator>\\nvoid IButterfly(RandomAccessIterator a, int n) const {\\n\\tint h = ceil_pow2(n);\\n\\n\\tstatic const fft_info info;\\n\\n\\tint len = h;\\n\\twhile(len){\\n\\t\\tif(len == 1){\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u;\\n\\t\\t\\tfor(int s=0; s<(1<<(len-1)); s++){\\n\\t\\t\\t\\tint offset = s << (h-len+1);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto l = a[i+offset];\\n\\t\\t\\t\\t\\tauto r = a[i+offset+p];\\n\\t\\t\\t\\t\\ta[i+offset] = l+r;\\n\\t\\t\\t\\t\\ta[i+offset+p] = (l-r)*irot;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-1))) irot *= info.irate2[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen--;\\n\\t\\t} else {\\n\\t\\t\\tint p = 1 << (h-len);\\n\\t\\t\\tmint irot = 1u, iimag = info.iroot[2];\\n\\t\\t\\tfor(int s=0; s<(1<<(len-2)); s++){\\n\\t\\t\\t\\tmint irot2 = irot * irot;\\n\\t\\t\\t\\tmint irot3 = irot2 * irot;\\n\\t\\t\\t\\tint offset = s << (h-len+2);\\n\\t\\t\\t\\tfor(int i=0; i<p; i++){\\n\\t\\t\\t\\t\\tauto a0 = a[i+offset+0*p];\\n\\t\\t\\t\\t\\tauto a1 = a[i+offset+1*p];\\n\\t\\t\\t\\t\\tauto a2 = a[i+offset+2*p];\\n\\t\\t\\t\\t\\tauto a3 = a[i+offset+3*p];\\n\\t\\t\\t\\t\\tauto a0a1 = a0 + a1;\\n\\t\\t\\t\\t\\tauto a0b1 = a0 - a1;\\n\\t\\t\\t\\t\\tauto a2a3 = a2 + a3;\\n\\t\\t\\t\\t\\tauto a2na3iimag = (a2 - a3) * iimag;\\n\\n\\t\\t\\t\\t\\ta[i+offset] = a0a1 + a2a3;\\n\\t\\t\\t\\t\\ta[i+offset+1*p] = (a0b1 + a2na3iimag) * irot;\\n\\t\\t\\t\\t\\ta[i+offset+2*p] = (a0a1 - a2a3) * irot2;\\n\\t\\t\\t\\t\\ta[i+offset+3*p] = (a0b1 - a2na3iimag) * irot3;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(s+1 != (1<<(len-2))) irot *= info.irate3[LsbIndex(~(u32)(s))];\\n\\t\\t\\t}\\n\\t\\t\\tlen -= 2;\\n\\t\\t}\\n\\t}\\n}\\n\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 3 \\\"nachia\\\\\\\\bigint\\\\\\\\static-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\ntemplate<unsigned int MxVal>\\nclass Montgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 u32inverse(u32 x){\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static constexpr u32 getMy(u32 mx){ return (-mx) % mx; }\\n static constexpr u32 powMod(u32 a, u32 i, u32 m){\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n static constexpr u32 Mx = MxVal;\\n static constexpr u32 iMx = u32inverse(Mx);\\n static constexpr u32 My1 = getMy(Mx);\\n static constexpr u32 My2 = powMod(getMy(Mx), 2, Mx);\\n static constexpr u32 My3 = powMod(getMy(Mx), 3, Mx);\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n static constexpr u32 red(u64 x){\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n};\\n\\ntemplate<unsigned int MOD>\\nclass StaticPModint{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\nprivate:\\n static constexpr u32 mod = MOD;\\n using Tool = Montgomery32Info<MOD>;\\n using MyType = StaticPModint;\\n u32 _v;\\n static MyType RAW(u32 v) { auto res = StaticPModint(); res._v = v; return res; }\\npublic:\\n StaticPModint() : _v(0) {}\\n StaticPModint(u32 v) : _v(Tool::red((u64)v * Tool::My2)) {}\\n StaticPModint(u64 v) : _v(Tool::red((u64)Tool::My3 * Tool::red(v))) {}\\n u32 val() const { return Tool::red(_v); }\\n u32 mrVal() const { return _v; }\\n MyType& operator-=(MyType r) { _v = _v - r._v + (_v < r._v ? mod : 0); return *this; }\\n MyType& operator+=(MyType r) { u32 t = mod - r._v; _v = _v - t + (_v < t ? mod : 0); return *this; }\\n MyType& operator*=(MyType r) { _v = Tool::red((u64)_v * r._v); return *this; }\\n MyType operator+(MyType r) const { auto v = *this; v += r; return v; }\\n MyType operator-(MyType r) const { auto v = *this; v -= r; return v; }\\n MyType operator*(MyType r) const { auto v = *this; v *= r; return v; }\\n MyType operator-() const { return RAW(_v ? mod - _v : (u32)0); }\\n MyType pow(unsigned long long i) const {\\n MyType x = *this, r = RAW(Tool::My1);\\n while(i){ if(i&1){ r *= x; } x*=x; i>>=1; }\\n return r;\\n }\\n MyType inv() const { return pow(mod-2); }\\n static constexpr u32 GetMod() { return mod; }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 2 \\\"nachia\\\\\\\\bigint\\\\\\\\dynamic-p-modint.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nclass DynMontgomery32Info{\\npublic:\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static u32 u32inverse(u32 x) {\\n u32 v = 1;\\n for(int i=0; i<5; i++) v = v * ((u32)2 - v * x);\\n return v;\\n }\\n static u32 getMy(u32 mx) { return (-mx) % mx; }\\n static u32 powMod(u32 a, u32 i, u32 m) {\\n if(i == 0) return 1 % m;\\n if(i % 2 == 0) return powMod((u64)a*a%m, i/2, m);\\n return (u64)a*powMod((u64)a*a%m, i/2, m)%m;\\n }\\n const u32 Mx;\\n const u32 iMx;\\n const u32 My1;\\n const u32 My2;\\n const u32 My3;\\n DynMontgomery32Info(u32 newMod)\\n : Mx(newMod)\\n , iMx(u32inverse(Mx))\\n , My1(getMy(Mx))\\n , My2((u64)My1 * My1 % Mx)\\n , My3((u64)My2 * My1 % Mx) {}\\n\\n // return z\\n // + z % Mx == x % Mx\\n // + x <= max(x>>32, Mx-1)\\n u32 red(u64 x) const {\\n u32 z1 = x >> 32;\\n u32 z2 = ((u64)Mx * ((u32)x*iMx)) >> 32;\\n return z1 - z2 + (z1 < z2 ? Mx : 0);\\n }\\n u32 add(u32 a, u32 b) const { b = Mx-b; return a - b + ((a < b) ? Mx : 0u); }\\n u32 sub(u32 a, u32 b) const { return a - b + ((a < b) ? Mx : 0u); }\\n u32 mul(u32 a, u32 b) const { return red((u64)a * b); }\\n u32 pow(u32 a, u32 i) const {\\n u32 x = a, r = My1;\\n while(i){ if(i&1){ r=mul(r,x); } x=mul(x,x); i>>=1; }\\n return r;\\n }\\n u32 inv(u32 a) const { return pow(a, Mx-2); }\\n u32 input64(u64 a) const { return mul(red(a), My3); }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\garner.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct GarnerU96{\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n std::vector<u32> mods;\\n std::vector<DynMontgomery32Info> dynmods;\\n std::vector<std::vector<u32>> table_coeff;\\n std::vector<u32> table_coeffinv;\\n\\n void precalc(std::vector<u32> new_mods){\\n mods = std::move(new_mods);\\n for(std::size_t i=0; i<mods.size(); i++) dynmods.emplace_back(mods[i]);\\n int nmods = mods.size();\\n table_coeff.assign(nmods+1, std::vector<u32>(nmods, 0));\\n for(int k=0; k<nmods; k++) table_coeff[0][k] = dynmods[k].My2;\\n for(int j=0; j<nmods; j++){\\n for(int k=0; k<nmods; k++) table_coeff[j+1][k] = table_coeff[j][k];\\n for(int k=j+1; k<nmods; k++) table_coeff[j+1][k] = dynmods[k].mul(table_coeff[j+1][k], dynmods[k].input64(mods[j]));\\n }\\n table_coeffinv.resize(nmods);\\n for(int i=0; i<nmods; i++) table_coeffinv[i] = dynmods[i].inv(table_coeff[i][i]);\\n }\\n\\n u64 calc(const std::vector<u32>& x){\\n int nmods = mods.size();\\n std::vector<u32> table_const(nmods);\\n u64 res = 0;\\n u64 res_coeff = 1;\\n for(int j=0; j<nmods; j++){\\n u32 t = dynmods[j].mul(dynmods[j].sub(x[j], table_const[j]), table_coeffinv[j]);\\n for(int k=j+1; k<nmods; k++){\\n table_const[k] = dynmods[k].add(dynmods[k].mul(t, table_coeff[j][k]), table_const[k]);\\n }\\n res += res_coeff * u64(t);\\n res_coeff *= mods[j];\\n }\\n return res;\\n }\\n\\n std::pair<std::vector<u32>, std::vector<u64>> calc(std::vector<std::vector<u32>> x){\\n int n = x[0].size(), m = x.size();\\n std::vector<u64> resl(n);\\n std::vector<u32> resh(n);\\n std::vector<u32> buf(m);\\n u32 inv64 = dynmods[0].inv(dynmods[0].mul(dynmods[0].My3, dynmods[0].My2));\\n for(int i=0; i<n; i++){\\n for(int j=0; j<m; j++) buf[j] = x[j][i];\\n resl[i] = calc(buf);\\n resh[i] = dynmods[0].mul(dynmods[0].sub(buf[0], dynmods[0].input64(resl[i])), inv64);\\n }\\n return std::make_pair(std::move(resh), std::move(resl));\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\convolution.hpp\\\"\\n\\nnamespace nachia{\\nnamespace bigint{\\n\\nstruct MultiplySupply {\\n using u32 = unsigned int;\\n using u64 = unsigned long long;\\n static constexpr u32 MODCNT = 3;\\n static constexpr u32 MOD[3] = { 3892314113, 3489660929, 3221225473 };\\n \\n GarnerU96 garner;\\n\\n MultiplySupply(){\\n garner.precalc(std::vector<u32>(MOD, MOD + MODCNT));\\n }\\n \\n template<unsigned int P>\\n static std::vector<u32> SubConvolution(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ) {\\n using Elem = StaticPModint<P>;\\n static NttFromAcl<Elem> ntt;\\n int z = a.size() + b.size() - 1;\\n int N = 1; while(N < z) N *= 2;\\n std::vector<Elem> A(N), B(N);\\n for(std::size_t i=0; i<a.size(); i++) A[i] = a[i];\\n for(std::size_t i=0; i<b.size(); i++) B[i] = b[i];\\n Elem iN = Elem((u32)N).inv();\\n ntt.Butterfly(A.begin(), N);\\n ntt.Butterfly(B.begin(), N);\\n for(int i=0; i<N; i++) A[i] = A[i] * B[i] * iN;\\n ntt.IButterfly(A.begin(), N);\\n std::vector<u32> res(z);\\n for(int i=0; i<z; i++) res[i] = A[i].mrVal();\\n return res;\\n }\\n \\n std::vector<u32> multiplyBin(\\n const std::vector<u32>& a,\\n const std::vector<u32>& b\\n ){\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q = garner.calc(std::move(cx));\\n int n = q.first.size();\\n std::vector<u32> res(n + 2);\\n for(int i=0; i<n; i++) res[i] = q.second[i];\\n u64 c = 0;\\n for(int i=0; i<n; i++){ res[i+1] = c += (u64)res[i+1] + (q.second[i] >> 32); c >>= 32; }\\n res[n+1] = c; c = 0;\\n for(int i=0; i<n; i++){ res[i+2] = c += (u64)res[i+2] + q.first[i]; c >>= 32; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n \\n std::vector<u32> multiplyDec(\\n std::vector<u32> a,\\n std::vector<u32> b\\n ){\\n static constexpr u32 d = 1000000000;\\n if(a.empty() || b.empty()) return {};\\n std::vector<std::vector<u32>> cx(MODCNT);\\n cx[0] = SubConvolution<MOD[0]>(a, b);\\n cx[1] = SubConvolution<MOD[1]>(a, b);\\n cx[2] = SubConvolution<MOD[2]>(a, b);\\n auto q0 = garner.calc(std::move(cx));\\n int n = q0.first.size();\\n std::vector<u64> buf(n + 2);\\n static constexpr u32 j11 = (1ull << 32) / d;\\n static constexpr u32 j10 = (-d) % d;\\n static constexpr u32 j22 = 1 + (0ull- 1ull * d * d) / d / d;\\n static constexpr u32 j21 = (-1ull * j22 * d * d) / d;\\n static constexpr u32 j20 = (0ull-d) % d;\\n for(int i=0; i<n; i++) buf[i] = q0.second[i] & ((1ull << 32) - 1);\\n for(int i=0; i<n; i++) buf[i] += 1ull * (q0.second[i] >> 32) * j10;\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * (q0.second[i] >> 32) * j11;\\n for(int i=0; i<n; i++) buf[i] += 1ull * q0.first[i] * j20; // q0.first[i] is small enough\\n for(int i=0; i<n; i++) buf[i+1] += 1ull * q0.first[i] * j21;\\n for(int i=0; i<n; i++) buf[i+2] += 1ull * q0.first[i] * j22;\\n std::vector<u32> res(n + 2);\\n u64 c = 0;\\n for(int i=0; i<n+2; i++){ c += buf[i]; res[i] = c % d; c /= d; }\\n while(res.size() && res.back() == 0) res.pop_back();\\n return res;\\n }\\n};\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 5 \\\"nachia\\\\\\\\bigint\\\\\\\\base-operators.hpp\\\"\\n#include <iostream>\\n\\nnamespace nachia {\\nnamespace bigint {\\n\\nclass UIntDec {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\nstatic constexpr u32 BASE = 1'000'000'000;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntDec() = default;\\nUIntDec(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntDec& operator+=(const UIntDec& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n if(c >= BASE){ x[i] = c - BASE; c = 1; }\\n else{ x[i] = c; c = 0; }\\n }\\n for(int i=b.x.size(); c; i++){\\n x[i] = c += x[i];\\n if(c < BASE) break;\\n c = x[i] -= BASE;\\n }\\n Regularize();\\n return *this;\\n}\\nUIntDec operator*(const UIntDec& b) const { return MultiplySupply().multiplyDec(x, b.x); }\\n\\nUIntDec Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulU32(unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ c += (u64)x[i] << 32; x[i] = c % BASE; c /= BASE; }\\n while(c){ x.push_back(c % BASE); c /= BASE; }\\n}\\n\\n};\\n\\nclass UIntBin {\\npublic:\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nstd::vector<u32> x;\\n\\nvoid Regularize(){ while(!x.empty() & !x.back()) x.pop_back(); }\\n\\nUIntBin() = default;\\nUIntBin(std::vector<u32> _x) : x(std::move(_x)) {}\\nUIntBin& operator+=(const UIntBin& b){\\n x.resize(std::max(x.size(), b.x.size()) + 1);\\n u64 c = 0;\\n for(std::size_t i=0; i<b.x.size(); i++){\\n c += b.x[i]; c += x[i];\\n x[i] = c; c >>= 32;\\n }\\n for(int i=b.x.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n Regularize();\\n return *this;\\n}\\nUIntBin operator*(const UIntBin& b) const { return MultiplySupply().multiplyBin(x, b.x); }\\n\\nUIntBin Pow(u32 c) const {\\n if(c == 0) return std::vector<u32>{1};\\n if(c == 1) return *this;\\n auto aa = Pow(c/2);\\n aa = aa * aa;\\n return (c&1) ? aa * (*this) : aa;\\n}\\nvoid mulD(unsigned int d, unsigned int cx) {\\n u64 c = cx;\\n for(std::size_t i=0; i<x.size(); i++){ x[i] = (c += (u64)x[i] * d); c >>= 32; }\\n if(c) x.push_back(c);\\n}\\n\\n};\\n\\nstd::vector<unsigned int> DecToBin(std::string decstr){\\n std::vector<UIntBin> pdec;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntBin {\\n if(r - l <= 308){\\n UIntBin p;\\n for(int j=l; j<l+(r-l)%9; j++) p.mulD(10, decstr[j] - '0');\\n for(int j=l+(r-l)%9; j<r; j+=9) p.mulD(1000000000, std::stoi(decstr.substr(j, 9)));\\n return p;\\n }\\n if(pdec.empty()) pdec.push_back(UIntBin({10}).Pow(308));\\n int h = 0; while(((308*2)<<h) < r-l) h++;\\n while((int)pdec.size() < h+1) pdec.push_back(pdec.back() * pdec.back());\\n auto res = dfs(dfs, l, r-(308<<h)) * pdec[h];\\n res += dfs(dfs, r-(308<<h), r);\\n return res;\\n };\\n return std::move(dfs(dfs, 0, decstr.size()).x);\\n}\\n\\nstd::string BinToDec(std::vector<unsigned int> b){\\n while(!b.empty() && !b.back()) b.pop_back();\\n std::reverse(b.begin(), b.end());\\n if(b.empty()) return \\\"0\\\";\\n std::vector<UIntDec> pbin;\\n auto dfs = [&](auto& dfs, int l, int r) -> UIntDec {\\n if(r - l <= 29){\\n UIntDec p;\\n for(int j=l; j<r; j++) p.mulU32(b[j]);\\n return p;\\n }\\n if(pbin.empty()) pbin.push_back(UIntDec({2}).Pow(32*29));\\n int h = 0; while(((29*2)<<h) < r-l) h++;\\n while((int)pbin.size() < h+1) pbin.push_back(pbin.back() * pbin.back());\\n auto res = dfs(dfs, l, r-(29<<h)) * pbin[h];\\n res += dfs(dfs, r-(29<<h), r);\\n return res;\\n };\\n auto x = std::move(dfs(dfs, 0, b.size()).x);\\n while(!x.empty() && !x.back()) x.pop_back();\\n std::string res = std::to_string(x.back());\\n res.resize(res.size() + 9 * (int)(x.size()-1), '0');\\n for(int i=(int)x.size()-2; i>=0; i--){\\n int o = res.size() - i*9 - 9;\\n for(int j=o+8; j>=o; j--){ res[j] += x[i] % 10; x[i] /= 10; }\\n }\\n return res;\\n}\\n\\n} // namespace bigint\\n} // namespace nachia\\n#line 4 \\\"nachia\\\\\\\\bigint\\\\\\\\integer.hpp\\\"\\n\\nnamespace nachia{\\n\\nclass UnsignedIntegerBin{\\npublic:\\n using MyType = UnsignedIntegerBin;\\n friend class SignedIntegerBin;\\nprivate:\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n std::vector<u32> x;\\n static inline bool Cflag;\\n static MyType FromVec(std::vector<u32> _x){ MyType res; res.x = std::move(_x); return res; }\\npublic:\\n UnsignedIntegerBin(){}\\n MyType operator>>(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() - h);\\n for(int i=h; i<size(); i++) res[i-h] = x[i] >> l;\\n if(l) for(int i=h+1; i<size(); i++) res[i-h-1] |= x[i] << (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType operator<<(int sh) const {\\n int h = sh / 32, l = sh % 32;\\n MyType res; res.memreserve(size() + h + 1);\\n for(int i=0; i<size(); i++) res[i+h] = x[i] << l;\\n if(l) for(int i=0; i<size(); i++) res[i+h+1] |= x[i] >> (32-l);\\n res.regularize();\\n return res;\\n }\\n MyType& operator>>=(int sh) { return (*this) = operator>>(sh); }\\n MyType& operator<<=(int sh) { return (*this) = operator<<(sh); }\\n MyType& operator%=(const MyType& d) { divInternal(d); return *this; }\\n MyType operator%(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType operator/(const MyType& d) const { auto p = *this; return p.divInternal(d); }\\n MyType& operator/=(const MyType& d) { return (*this) = divInternal(d); }\\n MyType& operator+=(const MyType& v){\\n memreserve(std::max(size(), v.size()) + 1);\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){ x[i] = (c += (u64)x[i] + v[i]); c >>= 32; }\\n for(int i=v.size(); c; i++){ x[i] = c += x[i]; c >>= 32; }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& v){\\n memreserve(std::max(size(), v.size()));\\n u64 c = 0;\\n for(int i=0; i<v.size(); i++){\\n c += v[i];\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n for(int i=v.size(); i<size() && c; i++){\\n x[i] -= c;\\n c = (c + x[i]) >> 32;\\n }\\n Cflag = c;\\n if(c){ complement(); increment(); }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& v) const {\\n MyType res;\\n res.x = bigint::MultiplySupply().multiplyBin(x, v.x);\\n res.regularize();\\n return res;\\n }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) { auto p = *this; p -= r; return p; }\\n bool operator<(const MyType& r) const {\\n return (size() != r.size())\\n ? (size() < r.size())\\n : std::lexicographical_compare(x.rbegin(), x.rend(), r.x.rbegin(), r.x.rend());\\n }\\n bool operator>(const MyType& r) const { return r < (*this); }\\n bool operator<=(const MyType& r) const { return !(r < (*this)); }\\n bool operator>=(const MyType& r) const { return !operator<(r); }\\n bool operator==(const MyType& r) const { return x == r.x; }\\n bool operator!=(const MyType& r) const { return x != r.x; }\\n bool operator!() const { return size(); }\\n bool isZero() const { return size() == 0; }\\n std::string toStringBin() const {\\n std::string res;\\n for(int i=size()-1; i>=0; i--) for(int j=31; j>=0; j--) res.push_back('0' + (x[i]>>j) % 2);\\n return res;\\n }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n return bigint::BinToDec(x);\\n }\\n static MyType FromStringDec(const std::string& s) {\\n return FromVec(bigint::DecToBin(s));\\n }\\n int lsb() const { for(int i=0; i<size(); i++){ if(x[i]) return nachia::LsbIndex(x[i]) + i * 32; } return -1; }\\n int msb() const { for(int i=size()-1; i>=0; i--){ if(x[i]) return nachia::MsbIndex(x[i]) + i * 32; } return -1; }\\nprivate:\\n int size() const { return x.size(); }\\n u32& operator[](int at) { return x[at]; }\\n u32 operator[](int at) const { return x[at]; }\\n void memreserve(int sz) { if((int)x.size() < sz) x.resize(sz); }\\n void setBit(int at, bool val){ memreserve(at/32+1); x[at/32] |= (u32)(val?1:0) << (at%32); regularize(); }\\n MyType divInternal(const MyType& d) {\\n if(d.isZero()) throw 1;\\n MyType res;\\n for(int s=(size()-d.size())*32+31; s>=0; s--){\\n MyType x = d << s;\\n if(operator>=(x)){\\n res.setBit(s, true); operator-=(x);\\n }\\n }\\n res.regularize();\\n return res;\\n }\\n void complement() { for(u32& y:x){ y = ~y; } }\\n void increment() { if(isZero()){ x = {1}; return; } int i=0; while(i < size() && !~x[i]){ x[i++]++; } if(i>=size()){ x.push_back(1); } else x[i]++; }\\n void decrement() { if(isZero()){ x = {1}; return; } int i=0; while(x[i]){ x[i++]--; } x[i]--; regularize(); }\\n void regularize() { while(!x.empty() && 0 == x.back()) x.pop_back(); }\\n int div10() {\\n u64 c = 0;\\n for(int i=size()-1; i>=0; i--){\\n c = (c << 32) | x[i];\\n x[i] = c / 10;\\n c %= 10;\\n }\\n regularize();\\n return c;\\n }\\n void mul10(int d) {\\n u64 c = d;\\n for(int i=0; i<size(); i++){ x[i] = (c += (u64)x[i] * 10); c >>= 32; }\\n if(c) x.push_back(c);\\n }\\n};\\n\\nclass SignedIntegerBin{\\n using MyType = SignedIntegerBin;\\n using UInt = UnsignedIntegerBin;\\nprivate:\\n UInt u;\\n int sign = 1;\\n void regularize(){ u.regularize(); if(u.isZero()) sign = 1; }\\n static MyType Raw(UInt u, int s){ MyType res; res.u = std::move(u); res.sign = s; res.regularize(); return res; }\\npublic:\\n bool isZero() const { return u.isZero(); }\\n MyType& operator+=(const MyType& r) {\\n if(sign == r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType& operator-=(const MyType& r) {\\n if(sign != r.sign) u += r.u;\\n else{ u -= r.u; if(u.Cflag){ sign = -sign; } }\\n regularize();\\n return *this;\\n }\\n MyType operator*(const MyType& r) const { return Raw(u*r.u, sign*r.sign); }\\n MyType& operator*=(const MyType& r) { return (*this) = operator*(r); }\\n MyType operator+(const MyType& r) const { auto p = *this; p += r; return p; }\\n MyType operator-(const MyType& r) const { auto p = *this; p -= r; return p; }\\n MyType operator-() const { return Raw(u, -sign); }\\n MyType& operator<<=(int sh) { u <<= sh; return *this; }\\n MyType& operator>>=(int sh) { u >>= sh; return *this; }\\n MyType operator<<(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator>>(int sh) const { return Raw(u<<sh, sign); }\\n MyType operator/(const MyType& r) const { return Raw(u/r.u, sign*r.sign); }\\n MyType& operator/=(const MyType& r) { return (*this) = operator/(r); }\\n MyType operator%(const MyType& r) const { return Raw(u%r.u, sign*r.sign); }\\n MyType& operator%=(const MyType& r) { return (*this) = operator%(r); }\\n std::string toStringDec() const {\\n if(isZero()) return \\\"0\\\";\\n return (sign>0 ? \\\"\\\" : \\\"-\\\") + u.toStringDec();\\n }\\n static MyType FromStringDec(const std::string& s) {\\n if(s.empty()) return MyType();\\n if(s[0] == '+') return Raw(UInt::FromStringDec(s.substr(1)), 1);\\n if(s[0] == '-') return Raw(UInt::FromStringDec(s.substr(1)), -1);\\n return Raw(UInt::FromStringDec(s), 1);\\n }\\n};\\n\\n} // namespace nachia\\n#line 2 \\\"Main.cpp\\\"\\n#include <cstdint>\\n#line 5 \\\"Main.cpp\\\"\\n#include <string>\\n#line 7 \\\"Main.cpp\\\"\\n\\n\\nint main() {\\n using Int = nachia::SignedIntegerBin;\\n std::string s;\\n std::cin >> s;\\n Int a = Int::FromStringDec(s);\\n std::cin >> s;\\n Int b = Int::FromStringDec(s);\\n Int c = a + b;\\n std::cout << c.toStringDec() << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.84,\n \"time_ms\": 60,\n \"memory_kb\": 4204,\n \"score_of_the_acc\": -0.0814,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6975961\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n // sizeの再計算\\n void resize(){\\n\\n size = 0;\\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- ){\\n if( dat[i][j] != 0 ){\\n size = i;\\n return;\\n }\\n }\\n }\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.minus = l.minus;\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l.minus & r.minus ){\\n if( l < r ){\\n l.minus = false;\\n r.minus = false;\\n res = l - r;\\n res.minus = true;\\n }\\n else{\\n l.minus = false;\\n r.minus = false;\\n res = r - l;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n }\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt sum = a + b;\\n sum.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 95404,\n \"score_of_the_acc\": -1.1003,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6975930\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.size = ( up != 0 ? maxSize+1 : maxSize );\\n res.minus = l.minus;\\n }\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n res.size = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= res.size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n if( res.dat[res.size][0] == 0 && res.dat[res.size][1] == 0 && res.dat[res.size][2] == 0 && res.dat[res.size][3] == 0 )\\n res.size = max( res.size-1, 0 );\\n }\\n }\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt sum = a + b;\\n sum.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 95512,\n \"score_of_the_acc\": -1.1014,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6975926\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.size = ( up != 0 ? maxSize+1 : maxSize );\\n res.minus = l.minus;\\n }\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n res.size = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= res.size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n if( res.dat[res.size][0] == 0 && res.dat[res.size][1] == 0 && res.dat[res.size][2] == 0 && res.dat[res.size][3] == 0 )\\n res.size--;\\n }\\n }\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt sum = a + b;\\n sum.print();\\n\\n}\",\n \"accuracy\": 0.04,\n \"time_ms\": 20,\n \"memory_kb\": 38720,\n \"score_of_the_acc\": -0.398,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6975914\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<int> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = str[id++] - '0';\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<int> v( 8, 0 );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n int top = 0;\\n int order = 1;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += l.dat[l.size][i];\\n lVal *= 10;\\n rVal += r.dat[r.size][i];\\n rVal *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n int lVal = 0, rVal = 0;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += l.dat[l.size][i];\\n lVal *= 10;\\n rVal += r.dat[r.size][i];\\n rVal *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n int up = 0; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.size = ( up != 0 ? maxSize+1 : maxSize );\\n res.minus = l.minus;\\n }\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n res.size = max( l.size, r.size );\\n int down = 0; // 繰り下がり\\n for( int i = 0 ; i <= res.size ; i++ ){\\n if( i == res.size && down == 1 ){\\n res.size--;\\n break;\\n }\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n }\\n }\\n }\\n }\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt sum = a + b;\\n sum.print();\\n\\n}\",\n \"accuracy\": 0.06,\n \"time_ms\": 70,\n \"memory_kb\": 95232,\n \"score_of_the_acc\": -1.0839,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6814556\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\nint main(){\\n boost::multiprecision::cpp_int a,b;\\n std::cin>>a>>b;\\n std::cout<<a+b<<std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -1.0003,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6691773\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\ntypedef long long ll;\\nusing namespace boost::multiprecision;\\n\\nint main() {\\n cpp_int a,b;cin>>a>>b;\\n cpp_int ans=a+b;\\n cout<<ans<<endl;\\n return 0;\\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -1.0005,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6677813\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#include <boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\n\\nconst int mod=1e9+7;\\n\\nint32_t main()\\n{\\n boost::multiprecision::cpp_int a, b;\\n cin >> a >> b;\\n \\n cout << a+b << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.0008,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_NTL_2_A_6663111\",\n \"code_snippet\": \"// 多倍長整数\\n//#include <atcoder/convolution>\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\nstruct multiprecision{\\n private:\\n const long long base=100;\\n const int lg = 2;\\n std::vector<long long> num;\\n\\n void adjust(){\\n for(int i=0;i<num.size();i++){\\n long long z=num[i]/base;\\n num[i]%=base;\\n if(num[i]<0){\\n if(z!=0||i<num.size()-1){\\n z--;\\n num[i]+=base;\\n }\\n }\\n if(z==0)continue;\\n if(i==num.size()-1){\\n num.emplace_back(z);\\n }\\n else{\\n num[i+1]+=z;\\n }\\n }\\n\\n while(num.size()>0&&num[num.size()-1]==0)num.pop_back();\\n if(num.size()==0)num.emplace_back(0);\\n while(num[num.size()-1]==-1&&num.size()>1&&num[num.size()-2]!=0){\\n num[num.size()-2]-=base;\\n num.pop_back();\\n }\\n }\\n\\n public:\\n multiprecision(long long val){\\n if(val==0){\\n num.emplace_back(0);\\n }\\n else{\\n long long cpy=val;\\n while(cpy!=0){\\n num.emplace_back(cpy%base);\\n cpy/=base;\\n }\\n }\\n adjust();\\n }\\n\\n multiprecision(std::vector<long long> val){\\n num=val;\\n adjust();\\n }\\n\\n multiprecision(std::string s){\\n reverse(s.begin(),s.end());\\n bool neg=0;\\n if(s[s.size()-1]=='-'){\\n s[s.size()-1]='0';\\n neg=1;\\n }\\n while(s.size()%lg!=0){\\n s+='0';\\n }\\n\\n for(int i=0;i<s.size()/lg;i++){\\n std::string t=\\\"\\\";\\n for(int j=0;j<lg;j++){\\n t+=s[i*lg+j];\\n }\\n reverse(t.begin(),t.end());\\n num.emplace_back(std::stoll(t));\\n }\\n\\n if(neg){\\n multiprecision zero=multiprecision(0);\\n zero-=*this;\\n *this=zero;\\n }\\n\\n adjust();\\n }\\n\\n std::vector<long long> val(){\\n return num;\\n }\\n\\n std::string s_val(){\\n bool flg=0;\\n if(num[num.size()-1]<0){\\n flg=1;\\n for(int i=0;i<num.size();i++){\\n num[i]*=-1;\\n }\\n adjust();\\n }\\n std::string res=\\\"\\\";\\n if(flg)res+='-';\\n for(int i=num.size()-1;i>=0;i--){\\n std::string t=std::to_string(num[i]);\\n if(i==num.size()-1){\\n res+=t;\\n continue;\\n }\\n for(int j=0;j<lg-t.size();j++){\\n res+='0';\\n }\\n res+=t;\\n }\\n\\n if(flg){\\n for(int i=0;i<num.size();i++){\\n num[i]*=-1;\\n }\\n adjust();\\n }\\n\\n return res;\\n }\\n\\n multiprecision& operator =(const multiprecision& other){\\n this->num=other.num;\\n return *this;\\n }\\n\\n multiprecision& operator +=(const multiprecision& other){\\n for(int i=0;i<other.num.size();i++){\\n if(i>=this->num.size()){\\n this->num.emplace_back(other.num[i]);\\n }\\n else{\\n this->num[i]+=other.num[i];\\n }\\n }\\n this->adjust();\\n return *this;\\n }\\n\\n multiprecision& operator -=(const multiprecision& other){\\n for(int i=0;i<other.num.size();i++){\\n if(i>=this->num.size()){\\n this->num.emplace_back(-other.num[i]);\\n }\\n else{\\n this->num[i]-=other.num[i];\\n }\\n }\\n this->adjust();\\n return *this;\\n }\\n};\\n\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n \\nusing ll = long long;\\nusing ld = long double;\\n \\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vld = vector<ld>;\\nusing vvld = vector<vld>;\\nusing vst = vector<string>;\\nusing vvst = vector<vst>;\\n \\n#define fi first\\n#define se second\\n#define pb push_back\\n#define eb emplace_back\\n#define pq_big(T) priority_queue<T,vector<T>,less<T>>\\n#define pq_small(T) priority_queue<T,vector<T>,greater<T>>\\n#define all(a) a.begin(),a.end()\\n#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)\\n#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)\\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())\\n\\nint main(){\\n string a,b;\\n cin>>a>>b;\\n\\n multiprecision mp1(a),mp2(b);\\n mp1+=mp2;\\n\\n cout<<mp1.s_val()<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5012,\n \"score_of_the_acc\": -0.0177,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":89,"cells":{"group_id":{"kind":"string","value":"aoj_0030_cpp"},"problem_description":{"kind":"string","value":"整数の和\n0 から 9 の数字から異なる\nn\n個の数を取り出して合計が\ns\nとなる組み合わせの数を出力するプログラムを作成してください。\nn\n個の数はおのおの 0 から 9 までとし、１つの組み合わせに同じ数字は使えません。たとえば、\nn\nが 3 で\ns\nが 6 のとき、3 個の数字の合計が 6 になる組み合わせは、\n1 + 2 + 3 = 6\n0 + 1 + 5 = 6\n0 + 2 + 4 = 6\nの 3 通りとなります。\nInput\n複数のデータセットが与えられます。各データセットに\nn\n(1 ≤\nn\n≤ 9) と\ns\n(0 ≤\ns\n≤ 100) が１つのスペースで区切られて１行に与えられます。\nn\nと\ns\nが共に 0 のとき入力の最後とします（この場合は処理せずにプログラムを終了する）。\nデータセットの数は 50 を超えません。\nOutput\n各データセットに対して、\nn\n個の整数の和が\ns\nになる組み合わせの数を１行に出力して下さい。\nSample Input\n3 6\n3 1\n0 0\nOutput for the Sample Input\n3\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0030_7937516","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int lli;\nint n, s;\nbool used[10];\nlli dfs(bool used[10], int now, int sum) {\n if (sum > s)\n return 0;\n if (now == n) {\n if (sum == s)\n return 1;\n return 0;\n }\n int res = 0;\n for (int i = 0; i < 10; ++i) {\n if (used[i])\n continue;\n used[i] = true;\n res += dfs(used, now + 1, sum + i);\n used[i] = false;\n }\n return res;\n}\nlli fact(int n) {\n if (n <= 1)\n return 1;\n return n * fact(n - 1);\n}\nint main() {\n int f[10];\n for (int i = 1; i < 10; ++i)\n f[i] = fact(i);\n while (cin >> n >> s, n || s) {\n memset(used, false, sizeof(used));\n cout << dfs(used, 0, 0) / f[n] << endl;\n }\n}","accuracy":1,"time_ms":100,"memory_kb":3096,"score_of_the_acc":-0.1054,"final_rank":3},{"submission_id":"aoj_0030_7937514","code_snippet":"#include <iostream>\nusing namespace std;\nint n, s, spn;\nvoid sp(int ne, int ns, bool *flag) {\n if (ne > n)\n return;\n if (ne == n && ns == s)\n spn++;\n for (int i = 0; i < 10; ++i) {\n if (!flag[i]) {\n flag[i] = true;\n sp(ne + 1, ns + i, flag);\n flag[i] = false;\n }\n }\n}\nint perm(int n) { return (n ? n * perm(n - 1) : 1); }\nint main() {\n while (1) {\n cin >> n >> s;\n if (!n)\n return 0;\n spn = 0;\n bool flag[10] = {false};\n sp(0, 0, flag);\n spn /= perm(n);\n cout << spn << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":3084,"score_of_the_acc":-0.2791,"final_rank":4},{"submission_id":"aoj_0030_5975808","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint xx(int a,int b,int c,int d){\n if(c == 1){\n if(d - b > a && d - b <= 9) return 1;\n else return 0;\n }\n else{\n if(d - b <= a) return 0;\n else{\n int sum=0;\n for(int i = a+1;i <= d-b;i++){\n sum += xx(i,b+i,c-1,d);\n }\n return sum;\n }\n } \n}\n\nint main(){\n while(true){\n int n,x;\n cin >> n >> x;\n if(n == 0 && x == 0){\n return 0;\n }\n cout << xx(-1,0,n,x) << endl;\n } \n}","accuracy":1,"time_ms":10,"memory_kb":3080,"score_of_the_acc":-0.0105,"final_rank":2},{"submission_id":"aoj_0030_5216656","code_snippet":"#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nvoid sub(int n, int s, vector<bool> used, int& cnt) {\n\tif (!n) {\n\t\tif (!s) cnt++;\n\t\treturn;\n\t}\n\telse {\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (used[i]) continue;\n\t\t\tused[i] = 1;\n\t\t\tsub(n - 1, s - i, used, cnt);\n\t\t\tused[i] = 0;\n\t\t}\n\t}\n\treturn;\n}\n\nint main() {\n\tint n, s;\n\twhile (cin >> n >> s) {\n\t\tif (!n && !s) break;\n\t\tint cnt = 0;\n\t\tvector<bool> used(10);\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (used[i]) continue;\n\t\t\tused[i] = 1;\n\t\t\tsub(n - 1, s - i, used, cnt);\n\t\t\tused[i] = 0;\n\t\t}\n\t\tint m = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tm *= (n - i);\n\t\t}\n\t\t//cout << m << endl;\n\t\tcout << cnt / m << endl;\n\t}\n}","accuracy":1,"time_ms":980,"memory_kb":3000,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_0030_5070224","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<iomanip>\n#include <string>\n#include <math.h>\nusing namespace std;\nint main(){\n long long int n,s,q=0;\n vector<int>a={0,1,2,3,4,5,6,7,8,9};\n vector<long long int>c(100);\n c[0]=1;\n vector<vector<long long int>> b(1000,vector<long long int>(1000));\n for(int i=0;i<10;i++){\n c[i+1]=c[i]*(i+1);\n }\n do {\n for(int i=0;i<10;i++){\n q+=a[i];\n b[i+1][q]++;\n }\n q=0;\n } while (next_permutation(a.begin(), a.end()));\n cin>>n;\n while(n!=0){\n cin>>s;\n cout<<b[n][s]/(c[10-n]*c[n])<<endl;\n cin>>n;\n }\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":10592,"score_of_the_acc":-1.0309,"final_rank":7},{"submission_id":"aoj_0030_3727596","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<stdio.h>\n#include<queue>\n#include <climits>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\nconst int mod = 1e9 + 7;\nconst long long INF = 1LL << 60;\n\nbool notuse[10];\nint cnt;\n\nvoid dfs(int n,int k)\n{\n if(n==0 && k == 0){\n cnt++;\n return ;\n }else{\n for(int i = 0; i < 10; i++){\n if(notuse[i] && k - i >= 0){\n notuse[i] = false;\n dfs(n-1,k-i);\n notuse[i] = true;\n }\n }\n }\n}\n\nint main() \n{\n ll div[9] = {1};\n for(int i = 1; i < 9; i++){\n div[i]=div[i-1]*(i+1);\n }\n while(true){\n int n,s; cin >> n >> s;\n if(n==0 && s == 0) break;\n for(int i = 0; i < 10; i++){\n notuse[i] = true;\n }\n cnt = 0;\n dfs(n,s);\n cout << cnt/div[n-1] << endl;\n }\n}","accuracy":1,"time_ms":500,"memory_kb":3064,"score_of_the_acc":-0.5136,"final_rank":5},{"submission_id":"aoj_0030_3598222","code_snippet":"#include<iostream>\n\nusing namespace std;\n\nint count(int n, int s, int a) {\n if (n == 1) {\n if (0 <= s && s <= 9 && a <= s) {\n return 1;\n } else {\n return 0;\n }\n }\n else {\n int c = 0;\n for (int b = a; s - b > 0; b++) {\n c += count(n - 1, s - b, b + 1);\n }\n return c;\n}\n}\nint main() {\n int n, s;\n while (cin >> n >> s, n || s) {\n cout << count(n, s, 0) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3044,"score_of_the_acc":-0.0058,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_0030_7937516\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int lli;\\nint n, s;\\nbool used[10];\\nlli dfs(bool used[10], int now, int sum) {\\n if (sum > s)\\n return 0;\\n if (now == n) {\\n if (sum == s)\\n return 1;\\n return 0;\\n }\\n int res = 0;\\n for (int i = 0; i < 10; ++i) {\\n if (used[i])\\n continue;\\n used[i] = true;\\n res += dfs(used, now + 1, sum + i);\\n used[i] = false;\\n }\\n return res;\\n}\\nlli fact(int n) {\\n if (n <= 1)\\n return 1;\\n return n * fact(n - 1);\\n}\\nint main() {\\n int f[10];\\n for (int i = 1; i < 10; ++i)\\n f[i] = fact(i);\\n while (cin >> n >> s, n || s) {\\n memset(used, false, sizeof(used));\\n cout << dfs(used, 0, 0) / f[n] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.1054,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0030_7937514\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint n, s, spn;\\nvoid sp(int ne, int ns, bool *flag) {\\n if (ne > n)\\n return;\\n if (ne == n && ns == s)\\n spn++;\\n for (int i = 0; i < 10; ++i) {\\n if (!flag[i]) {\\n flag[i] = true;\\n sp(ne + 1, ns + i, flag);\\n flag[i] = false;\\n }\\n }\\n}\\nint perm(int n) { return (n ? n * perm(n - 1) : 1); }\\nint main() {\\n while (1) {\\n cin >> n >> s;\\n if (!n)\\n return 0;\\n spn = 0;\\n bool flag[10] = {false};\\n sp(0, 0, flag);\\n spn /= perm(n);\\n cout << spn << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.2791,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0030_5975808\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint xx(int a,int b,int c,int d){\\n if(c == 1){\\n if(d - b > a && d - b <= 9) return 1;\\n else return 0;\\n }\\n else{\\n if(d - b <= a) return 0;\\n else{\\n int sum=0;\\n for(int i = a+1;i <= d-b;i++){\\n sum += xx(i,b+i,c-1,d);\\n }\\n return sum;\\n }\\n } \\n}\\n\\nint main(){\\n while(true){\\n int n,x;\\n cin >> n >> x;\\n if(n == 0 && x == 0){\\n return 0;\\n }\\n cout << xx(-1,0,n,x) << endl;\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.0105,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0030_5216656\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define NIL (-1)\\n#define LL long long\\nusing namespace std;\\nconst int64_t MOD = 1e9 + 7;\\nconst int INF = INT_MAX;\\nconst double PI = acos(-1.0);\\n\\nvoid sub(int n, int s, vector<bool> used, int& cnt) {\\n\\tif (!n) {\\n\\t\\tif (!s) cnt++;\\n\\t\\treturn;\\n\\t}\\n\\telse {\\n\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\tif (used[i]) continue;\\n\\t\\t\\tused[i] = 1;\\n\\t\\t\\tsub(n - 1, s - i, used, cnt);\\n\\t\\t\\tused[i] = 0;\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\n\\nint main() {\\n\\tint n, s;\\n\\twhile (cin >> n >> s) {\\n\\t\\tif (!n && !s) break;\\n\\t\\tint cnt = 0;\\n\\t\\tvector<bool> used(10);\\n\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\tif (used[i]) continue;\\n\\t\\t\\tused[i] = 1;\\n\\t\\t\\tsub(n - 1, s - i, used, cnt);\\n\\t\\t\\tused[i] = 0;\\n\\t\\t}\\n\\t\\tint m = 1;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tm *= (n - i);\\n\\t\\t}\\n\\t\\t//cout << m << endl;\\n\\t\\tcout << cnt / m << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 980,\n \"memory_kb\": 3000,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0030_5070224\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<queue>\\n#include<iomanip>\\n#include <string>\\n#include <math.h>\\nusing namespace std;\\nint main(){\\n long long int n,s,q=0;\\n vector<int>a={0,1,2,3,4,5,6,7,8,9};\\n vector<long long int>c(100);\\n c[0]=1;\\n vector<vector<long long int>> b(1000,vector<long long int>(1000));\\n for(int i=0;i<10;i++){\\n c[i+1]=c[i]*(i+1);\\n }\\n do {\\n for(int i=0;i<10;i++){\\n q+=a[i];\\n b[i+1][q]++;\\n }\\n q=0;\\n } while (next_permutation(a.begin(), a.end()));\\n cin>>n;\\n while(n!=0){\\n cin>>s;\\n cout<<b[n][s]/(c[10-n]*c[n])<<endl;\\n cin>>n;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 10592,\n \"score_of_the_acc\": -1.0309,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0030_3727596\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\n#include<cmath>\\n#include<stdio.h>\\n#include<queue>\\n#include <climits>\\n#include <map>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\nconst int mod = 1e9 + 7;\\nconst long long INF = 1LL << 60;\\n\\nbool notuse[10];\\nint cnt;\\n\\nvoid dfs(int n,int k)\\n{\\n if(n==0 && k == 0){\\n cnt++;\\n return ;\\n }else{\\n for(int i = 0; i < 10; i++){\\n if(notuse[i] && k - i >= 0){\\n notuse[i] = false;\\n dfs(n-1,k-i);\\n notuse[i] = true;\\n }\\n }\\n }\\n}\\n\\nint main() \\n{\\n ll div[9] = {1};\\n for(int i = 1; i < 9; i++){\\n div[i]=div[i-1]*(i+1);\\n }\\n while(true){\\n int n,s; cin >> n >> s;\\n if(n==0 && s == 0) break;\\n for(int i = 0; i < 10; i++){\\n notuse[i] = true;\\n }\\n cnt = 0;\\n dfs(n,s);\\n cout << cnt/div[n-1] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 3064,\n \"score_of_the_acc\": -0.5136,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0030_3598222\",\n \"code_snippet\": \"#include<iostream>\\n\\nusing namespace std;\\n\\nint count(int n, int s, int a) {\\n if (n == 1) {\\n if (0 <= s && s <= 9 && a <= s) {\\n return 1;\\n } else {\\n return 0;\\n }\\n }\\n else {\\n int c = 0;\\n for (int b = a; s - b > 0; b++) {\\n c += count(n - 1, s - b, b + 1);\\n }\\n return c;\\n}\\n}\\nint main() {\\n int n, s;\\n while (cin >> n >> s, n || s) {\\n cout << count(n, s, 0) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.0058,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":90,"cells":{"group_id":{"kind":"string","value":"aoj_NTL_2_C_cpp"},"problem_description":{"kind":"string","value":"Multiplication of Big Integers\nGiven two integers $A$ and $B$, compute the product, $A \\times B$.\nInput\nTwo integers $A$ and $B$ separated by a space character are given in a line.\nOutput\nPrint the product in a line.\nConstraints\n$-1 \\times 10^{1000} \\leq A, B \\leq 10^{1000}$\nSample Input 1\n5 8\nSample Output 1\n40\nSample Input 2\n100 25\nSample Output 2\n2500\nSample Input 3\n-1 0\nSample Output 3\n0\nSample Input 4\n12 -3\nSample Output 4\n-36"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_NTL_2_C_10940298","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n\nstring fixedNum( string a )\n{\n if( a.size() == 1 )\n return a;\n for( int i = 0; i < a.size(); i++ )\n if( '1'<= a[i] && a[i] <= '9' )\n return a.substr( i, a.size() );\n return \"0\";\n}\n\nstring calcAddition( string a, string b )\n{\n a = fixedNum(a); b = fixedNum(b);\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\n string s = \"0\", t = \"0\";\n for( int i = 0; i < d; i++ )\n as > bs ? t += \"0\" : s += \"0\";\n s += a; t += b;\n\n for( int i = s.size() - 1; i >= 1; i-- )\n {\n s[i] += t[i] - '0';\n if( s[i] > '9' )\n {\n s[i] -= 10;\n s[i-1]++;\n }\n }\n\n return s[0] == '0' ? s.substr( 1, s.size() ) : s;\n}\n\nstring calcMultiplication( string a, string b )\n{\n a = fixedNum(a); b = fixedNum(b);\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\n string s = \"0\", t = \"0\", x = \"\", sum = \"\", zero = \"\", digit = \"\";\n for( int i = 0; i < d; i++ )\n as > bs ? t += \"0\" : s += \"0\";\n s += a; t += b;\n\n for( int i = 0; i < s.size(); i++ )\n zero += \"0\";\n \n x = zero;\n sum = zero;\n\n for( int i = s.size() - 1; i >= 1; i-- )\n {\n for( int j = s.size() - 1; j >= 1; j-- )\n x[j] = ( t[i] - '0' ) * ( s[j] - '0' );\n for( int j = s.size() - 1; j >= 1; j-- )\n {\n int f = x[j] / 10;\n x[j-1] += f;\n x[j] = x[j] - 10 * f + '0';\n }\n x += digit;\n sum = calcAddition( x, sum );\n digit += \"0\";\n x = zero;\n }\n return sum;\n}\n\nint main()\n{\n string a, b;\n\n cin >> a >> b;\n\n int as = a.size(), bs = b.size();\n string s = a.substr( 1, as ), t = b.substr( 1, bs );\n\n if( a[0] == '-' && b[0] == '-' )\n cout << calcMultiplication( s, t ) << endl;\n else if( a[0] >= '0' && b[0] >= '0' )\n cout << calcMultiplication( a, b ) << endl;\n else\n {\n if( a == \"0\" || b == \"0\" )\n cout << \"0\" << endl;\n else if( a[0] == '-' )\n cout << '-' << calcMultiplication( s, b ) << endl;\n else\n cout << '-' << calcMultiplication( a, t ) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3512,"score_of_the_acc":-0.0031,"final_rank":2},{"submission_id":"aoj_NTL_2_C_9796169","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n\ntemplate <int BASE>\nclass BigDecimal {\n public:\n static constexpr std::string_view NUMERAL{\n \"0123456789ABCDEF\"}; // 16進数まで対応\n\n private: // 静的関数\n static int CompareIgnoreSign(const BigDecimal& a, const BigDecimal& b) {\n // a-bの符号で覚えてもよいかも。\n // a<b: -1\n // a>b: +1\n // a==b: 0\n if (a._digit.size() != b._digit.size())\n return a._digit.size() < b._digit.size() ? -1 : 1;\n for (int i = a._digit.size() - 1; i >= 0; --i) {\n if (a._digit[i] == b._digit[i]) continue;\n return a._digit[i] < b._digit[i] ? -1 : 1;\n }\n return 0;\n }\n\n static BigDecimal Karatsuba(const BigDecimal& a, const BigDecimal& b) {\n // |a| >= |b|にする\n if (a._digit.size() < b._digit.size()) return Karatsuba(b, a);\n // 1桁に絞ったら直に計算して返す\n if (b._digit.size() == 1) {\n BigDecimal ret(a);\n for (int i = 0; i < a._digit.size(); ++i) {\n ret._digit[i] *= b._digit[0];\n }\n ret.carry_and_fix();\n if (b._positive)\n return ret;\n else\n return -ret;\n }\n int N = a._digit.size() / 2; // 下半分の桁数\n bool sign = !(a._positive xor b._positive); // 符号を計算しておく\n BigDecimal a0(a), a1(a), b0(b), b1(b); // x = concat(x0, x1)\n // aの処理\n // x1の下N桁を残す形で上の桁を取り除く\n while (a1._digit.size() > N) a1._digit.pop_back();\n // x0のデータを消去\n a0._digit.clear();\n // x0に下N桁より上の桁を保存しなおす\n for (int i = 0; N + i < a._digit.size(); ++i)\n a0._digit.emplace_back(a._digit[N + i]);\n if (a0._digit.size() == 0) a0._digit.emplace_back(0);\n // x0, x1の符号を取り除く\n a0._positive = a1._positive = true;\n if (b._digit.size() < N) { // 一方が他方の半分もない\n BigDecimal p0, c1;\n p0 = Karatsuba(a0, b);\n c1 = Karatsuba(a1, b);\n BigDecimal c0;\n for (int i = 0; i < N - 1; ++i) c0._digit.emplace_back(0);\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\n BigDecimal ret = c0 + c1;\n ret._positive = sign;\n return ret;\n }\n // bの処理\n // x1の下N桁を残す形で上の桁を取り除く\n while (b1._digit.size() > N) b1._digit.pop_back();\n // x0のデータを消去\n b0._digit.clear();\n // x0に下N桁より上の桁を保存しなおす\n for (int i = 0; N + i < b._digit.size(); ++i)\n b0._digit.emplace_back(b._digit[N + i]);\n if (b0._digit.size() == 0) b0._digit.emplace_back(0);\n // x0, x1の符号を取り除く\n b0._positive = b1._positive = true;\n // 3種類の積\n BigDecimal p0, p1, p2;\n p0 = Karatsuba(a0, b0);\n p2 = Karatsuba(a1, b1);\n p1 = Karatsuba(a0 + a1, b0 + b1) - p0 - p2;\n // 積に対応する数\n BigDecimal c0, c1, c2;\n c0._digit.clear();\n c1._digit.clear();\n c2._digit.clear();\n for (int i = 0; i < N; ++i) {\n c0._digit.emplace_back(0);\n c0._digit.emplace_back(0);\n c1._digit.emplace_back(0);\n }\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\n for (const auto& d : p1._digit) c1._digit.emplace_back(d);\n for (const auto& d : p2._digit) c2._digit.emplace_back(d);\n BigDecimal ret = c0 + c1 + c2;\n ret._positive = sign;\n return ret;\n }\n\n private:\n std::vector<int> _digit;\n bool _positive;\n bool is_zero() const { return _digit.size() == 1 && _digit[0] == 0; }\n\n void carry_and_fix() {\n // 新規の桁が発生しない範疇(最後の桁以外)を処理\n for (int i = 0; i < _digit.size() - 1; ++i) {\n if (_digit[i] >= BASE) {\n // 桁の数が基数以上: 繰り上げる必要あり\n int k = _digit[i] / BASE; // 繰り上がり発生回数\n _digit[i] -= k * BASE;\n _digit[i + 1] += k;\n } else if (_digit[i] < 0) {\n // 桁の数が負: 繰り下げが必要\n int k = (-_digit[i] - 1) / BASE + 1;\n _digit[i] += k * BASE;\n _digit[i + 1] -= k;\n }\n }\n // 最後の桁を処理する場合\n while (_digit.back() >= BASE) {\n int k = _digit.back() / BASE; // 繰り上がり発生回数\n _digit.back() -= k * BASE;\n _digit.emplace_back(k);\n }\n // 計算結果がマイナスなら全体に-1をかけて符号反転\n if (_digit.back() < 0) {\n this->_positive = !this->_positive;\n for (int i = 0; i < _digit.size(); ++i) {\n _digit[i] *= -1;\n }\n this->carry_and_fix();\n }\n // 0の桁を上から消す\n while (_digit.size() >= 2 && _digit.back() == 0) _digit.pop_back();\n // 0になったら正の数にしておく(-0表記は困るため)\n if (this->is_zero()) _positive = true;\n }\n\n public:\n // コンストラクタ\n BigDecimal(int num = 0) : _digit(0), _positive(num >= 0) {\n if (!_positive) num *= -1;\n while (num > 0) {\n _digit.emplace_back(num % BASE);\n num /= BASE;\n }\n if (_digit.size() == 0) _digit.emplace_back(0);\n }\n BigDecimal(std::string s) {\n if (s[0] == '-') {\n s = s.substr(1);\n _positive = false;\n } else {\n _positive = true;\n }\n while (s.size() > 0) {\n int i = NUMERAL.find(s.back());\n _digit.emplace_back(i);\n s.pop_back();\n }\n }\n // コピーコンストラクタ\n BigDecimal(const BigDecimal& x)\n : _digit(x._digit.size()), _positive(x._positive) {\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] = x._digit[i];\n }\n }\n\n // 比較演算子\n bool operator==(const BigDecimal& x) const {\n if (this->_positive != x._positive) return false;\n if (this->_digit.size() != x._digit.size()) return false;\n for (int i = 0; i < this->_digit.size(); ++i) {\n if (this->_digit[i] != x._digit[i]) return false;\n }\n return true;\n }\n bool operator!=(const BigDecimal& x) const { return !(*this == x); }\n bool operator<(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return false; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) < 0;\n } else {\n if (x._positive) return true; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) > 0;\n }\n }\n bool operator>(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return true; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) > 0;\n } else {\n if (x._positive) return false; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) < 0;\n }\n }\n bool operator<=(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return false; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) <= 0;\n } else {\n if (x._positive) return true; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) >= 0;\n }\n }\n bool operator>=(const BigDecimal& x) const {\n if (this->_positive) {\n if (!x._positive) return true; // x < 0 <= this -> this>x\n return CompareIgnoreSign(*this, x) >= 0;\n } else {\n if (x._positive) return false; // this < 0 <= x -> this<x\n return CompareIgnoreSign(*this, x) <= 0;\n }\n }\n\n // 単項演算子\n BigDecimal operator+() const { return *this; }\n BigDecimal operator-() const {\n BigDecimal ret = *this;\n if (!this->is_zero()) ret._positive = !ret._positive;\n return ret;\n }\n // 複号代入演算子\n BigDecimal& operator+=(const BigDecimal& x) {\n // 符号が異なる場合は符号をそろえて引き算に\n if (this->_positive != x._positive) {\n return *this -= (-x);\n }\n // 符号が同じ物にのみ足し算を行う\n while (this->_digit.size() < x._digit.size()) {\n this->_digit.emplace_back(0);\n }\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] += x._digit[i];\n }\n this->carry_and_fix();\n return *this;\n }\n BigDecimal& operator-=(const BigDecimal& x) {\n // 符号が異なる場合は符号をそろえて足し算に\n if (this->_positive != x._positive) {\n return *this += (-x);\n }\n // 符号が同じ物にのみ引き算を行う\n while (this->_digit.size() < x._digit.size()) {\n this->_digit.emplace_back(0);\n }\n for (int i = 0; i < x._digit.size(); ++i) {\n this->_digit[i] -= x._digit[i];\n }\n this->carry_and_fix();\n return *this;\n }\n BigDecimal& operator*=(const BigDecimal& x) { return *this; }\n BigDecimal& operator/=(const BigDecimal& x) { return *this; }\n BigDecimal& operator%=(const BigDecimal& x) { return *this; }\n\n // 二項演算子\n BigDecimal operator+(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret += x);\n }\n BigDecimal operator-(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret -= x);\n }\n BigDecimal operator*(const BigDecimal& x) const {\n return Karatsuba(*this, x);\n }\n BigDecimal operator/(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret /= x);\n }\n BigDecimal operator%(const BigDecimal& x) const {\n BigDecimal ret(*this);\n return (ret %= x);\n }\n\n // キャスト\n operator std::string() const {\n std::string ret = \"\";\n for (const auto& c : _digit) {\n ret = NUMERAL.at(c) + ret;\n }\n if (!_positive) ret = \"-\" + ret;\n return ret;\n }\n};\n\nint main() {\n std::string A, B;\n std::cin >> A >> B;\n BigDecimal<10> a(A), b(B);\n std::cout << std::string(a*b) << std::endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3608,"score_of_the_acc":-0.0782,"final_rank":7},{"submission_id":"aoj_NTL_2_C_8873472","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\n\nstruct BigInteger{\n\n bool minus;\n int size;\n vector<int> val;\n\n BigInteger(){\n\n minus = false;\n size = 0;\n\n }\n\n BigInteger( string str ){\n\n minus = ( str[0] == '-' );\n if( minus )\n str = str.substr( 1 );\n size = str.length();\n for( int i = size-1 ; i >= 0 ; i-- )\n val.push_back( str[i] - '0' );\n adjust();\n\n }\n\n void adjust(){\n\n while( size != 0 && val[size-1] == 0 ){\n size--;\n val.pop_back();\n }\n if( size == 0 )\n minus = false;\n\n }\n\n bool same( BigInteger bi ){\n\n if( size != bi.size ) return false;\n for( int i = 0 ; i < size ; i++ ){\n if( val[i] != bi.val[i] )\n return false;\n }\n return true;\n\n }\n\n bool greater( BigInteger bi ){\n\n if( size > bi.size ) return true;\n else if( size < bi.size ) return false;\n if( size == 0 ) return true;\n int id = size - 1;\n while( id >= 0 ){\n if( val[id] > bi.val[id] ) return true;\n else if( val[id] < bi.val[id] ) return false;\n id--;\n }\n return true;\n \n }\n\n\n\n void print(){\n\n if( size == 0 ){\n minus = false;\n cout << \"0\" << endl;\n return;\n } \n if( minus ) cout << \"-\";\n for( int i = size-1 ; i >= 0 ; i-- )\n cout << val[i];\n cout << endl;\n\n }\n\n};\n\nBigInteger operator+( BigInteger bi1, BigInteger bi2 );\nBigInteger operator-( BigInteger bi1, BigInteger bi2 );\nBigInteger operator*( BigInteger bi1, BigInteger bi2 );\nBigInteger operator/( BigInteger bi1, BigInteger bi2 );\nBigInteger operator%( BigInteger bi1, BigInteger bi2 );\n\n\nBigInteger operator+( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n if( bi1.minus && !bi2.minus ){\n bi1.minus = false;\n res = bi2 - bi1;\n return res;\n }\n if( !bi1.minus && bi2.minus ){\n bi2.minus = false;\n res = bi1 - bi2;\n return res;\n }\n res.minus = bi1.minus;\n res.size = max( bi1.size, bi2.size );\n vector<int> a;\n vector<int> b;\n for( int i = 0 ; i < res.size ; i++ ){\n if( i < bi1.size )\n a.push_back( bi1.val[i] );\n else\n a.push_back( 0 );\n if( i < bi2.size )\n b.push_back( bi2.val[i] );\n else\n b.push_back( 0 );\n }\n\n int up = 0;\n for( int i = 0 ; i < res.size ; i++ ){\n int sum = a[i] + b[i];\n sum += up;\n up = sum / 10;\n sum %= 10;\n res.val.push_back( sum );\n }\n while( up != 0 ){\n res.size++;\n res.val.push_back( up % 10 );\n up /= 10;\n }\n\n res.adjust();\n return res;\n\n}\n\nBigInteger operator-( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ){\n bi2.minus = !bi2.minus;\n return bi1 + bi2;\n }\n res.size = max( bi1.size, bi2.size );\n if( bi1.greater( bi2 ) )\n res.minus = bi1.minus;\n else{\n res = bi2 - bi1;\n res.minus = !res.minus;\n return res;\n }\n vector<int> a;\n vector<int> b;\n for( int i = 0 ; i < res.size ; i++ ){\n if( i < bi1.size )\n a.push_back( bi1.val[i] );\n else\n a.push_back( 0 );\n if( i < bi2.size )\n b.push_back( bi2.val[i] );\n else\n b.push_back( 0 );\n }\n\n int down = 0;\n for( int i = 0 ; i < res.size ; i++ ){\n int diff = a[i] - b[i];\n diff -= down;\n if( diff >= 0 ){\n down = -( diff / 10 );\n diff %= 10;\n }\n else{\n down = ( -diff + 9 ) / 10;\n diff = ( 10 - ( -diff % 10 ) ) % 10;\n }\n res.val.push_back( diff );\n }\n \n res.adjust();\n return res;\n\n}\n\n/*\nBigInteger operator*( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\n bi1.minus = bi2.minus = false;\n res.size = bi1.size + bi2.size - 1;\n for( int i = 0 ; i < res.size ; i++ )\n res.val.push_back( 0 );\n \n for( int i = 0 ; i < bi1.size ; i++ ){\n for( int j = 0 ; j < bi2.size ; j++ )\n res.val[i+j] += bi1.val[i] * bi2.val[j];\n }\n int up = 0;\n for( int i = 0 ; i < res.size ; i++ ){\n res.val[i] += up;\n up = res.val[i] / 10;\n res.val[i] %= 10;\n }\n while( up != 0 ){\n res.size++;\n res.val.push_back( up % 10 );\n up /= 10;\n }\n\n res.adjust();\n return res;\n \n}\n*/\n\nBigInteger operator*( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n if( bi1.size == 0 || bi2.size == 0 ) return res;\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\n bi1.minus = bi2.minus = false;\n if( bi1.size == 1 && bi2.size == 1 ){\n int m = bi1.val[0] * bi2.val[0];\n BigInteger mult( to_string( m ) );\n mult.minus = res.minus;\n mult.adjust();\n return mult;\n }\n int digit = 1;\n while( digit < max( bi1.size, bi2.size ) ) \n digit *= 2;\n res.size = 2 * digit;\n for( int i = 0 ; i < res.size ; i++ )\n res.val.push_back( 0 );\n vector<int> a;\n vector<int> b;\n for( int i = 0 ; i < digit ; i++ ){\n if( i < bi1.size )\n a.push_back( bi1.val[i] );\n else\n a.push_back( 0 );\n if( i < bi2.size )\n b.push_back( bi2.val[i] );\n else\n b.push_back( 0 );\n }\n\n BigInteger num1, num2, num3, num4;\n num1.size = num2.size = num3.size = num4.size = digit / 2;\n for( int i = 0 ; i < digit / 2 ; i++ ){\n num1.val.push_back( a[ i + digit / 2 ] );\n num2.val.push_back( a[i]);\n num3.val.push_back( b[ i + digit / 2 ] );\n num4.val.push_back( b[i] );\n }\n num1.adjust();\n num2.adjust();\n num3.adjust();\n num4.adjust();\n BigInteger num5 = num1 * num3;\n BigInteger num6 = num2 * num4;\n BigInteger num7 = ( num1 + num2 ) * ( num3 + num4 ) - num5 - num6;\n\n for( int i = 0 ; i < num6.size ; i++ )\n res.val[i] += num6.val[i];\n for( int i = 0 ; i < num7.size; i++ )\n res.val[ i + digit / 2 ] += num7.val[i];\n for( int i = 0 ; i < num5.size ; i++ )\n res.val[ i + digit ] += num5.val[i];\n int up = 0;\n for( int i = 0 ; i < res.size ; i++ ){\n res.val[i] += up;\n up = res.val[i] / 10;\n res.val[i] %= 10;\n }\n\n res.adjust();\n return res;\n \n}\n\nBigInteger operator/( BigInteger bi1, BigInteger bi2 ){\n\n BigInteger res;\n if( !bi1.greater( bi2 ) ) return res;\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\n bi1.minus = bi2.minus = false;\n res.size = bi1.size - bi2.size + 1;\n\n BigInteger num;\n int id = bi1.size;\n while( id >= 0 ){\n BigInteger tmp;\n for( int i = 1 ; i <= 10 ; i++ ){\n tmp = tmp + bi2;\n if( tmp.greater( num ) ){\n if( tmp.same( num ) ){ \n res.val.insert( res.val.begin(), i );\n }\n else{\n tmp = tmp - bi2;\n res.val.insert( res.val.begin(), i - 1 );\n }\n num = num - tmp;\n id--;\n if( id >= 0 ){\n num.val.insert( num.val.begin(), bi1.val[id] );\n num.size++;\n }\n break;\n }\n }\n }\n\n res.adjust();\n return res;\n\n}\n\nBigInteger operator%( BigInteger bi1, BigInteger bi2 ){\n\n return bi1 - bi2 * ( bi1 / bi2 );\n\n}\n\n\n\nint main(){\n\n string A, B;\n cin >> A >> B;\n \n BigInteger a( A );\n BigInteger b( B );\n BigInteger c = a * b;\n c.print();\n\n}","accuracy":1,"time_ms":280,"memory_kb":3720,"score_of_the_acc":-1.0053,"final_rank":14},{"submission_id":"aoj_NTL_2_C_7525143","code_snippet":"#include <bits/stdc++.h>\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\n#define pb push_back\n#define f first\n#define s second\n\nusing namespace std;\ntypedef pair <int,int> pii;\n\nconst int maxn = 1e5 + 5;\n\nstring t(string a, string b)\n{\n string c;\n long n1= a.length(), n2=b.length(),t,n=0;\n if(n1>n2) b.insert(0,n1-n2,'0');\n if(n2>n1) a.insert(0,n2-n1,'0');\n c=a;\n for(int i=a.length()-1;i>=0;i--)\n {\n t=(a[i]-48)+(b[i]-48)+n;\n n=t/10;\n t=t%10;\n c[i]=char(t+48);\n }\n if(n>0) c= char(n+48) +c;\n return c;\n}\n\nstring h(string a, string b)\n{\n string c;\n long n1= a.length(), n2=b.length(),t,n=0;\n if(n1>n2) b.insert(0,n1-n2,'0');\n c=\"\";\n for(int i=n1-1;i>=0;i--)\n {\n t=(a[i]-48)-(b[i]-48)-n;\n if(t<0)\n {\n t+=10;\n n=1;\n }\n else n=0;\n c=char(t+48)+c;\n }\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\n return c;\n}\n\nstring n1(string a,int k)\n{\n string b;\n long i,n=0,t;\n for(i=a.length()-1;i>=0;i--)\n {\n t=n+(a[i]-48)*k;\n n=t/10;\n t=t%10;\n b=char(t+48) + b;\n }\n if(n!=0) b=char(n+48)+b;\n while(b.length()>1&&b[0]=='0') b.erase(0,1);\n return b;\n}\n\nstring nhan(string a, string b)\n{\n string x,tg1=\"0\",tg2,c;\n long i,j=0;\n for(i=b.length()-1;i>=0;i--)\n {\n tg2=n1(a,(b[i]-48));\n tg2.insert(tg2.length(),j,'0');\n j++;\n c=t(tg2,tg1);\n tg1=c;\n }\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\n return c;\n}\nstring a,b;\n\nint main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> a >> b;\n if(a[0] == '-' && b[0] == '-')\n {\n a.erase(0,1);\n b.erase(0,1);\n cout << nhan(a,b) << \"\\n\";\n return 0;\n }\n else if(a[0] == '-' && b[0] != '-')\n {\n a.erase(0,1);\n string s1 = nhan(a,b);\n if(s1 != \"0\") s1 = \"-\" + s1;\n cout << s1 << \"\\n\";\n return 0;\n }\n else if(a[0] != '-' && b[0] == '-')\n {\n b.erase(0,1);\n string s1 = nhan(a,b);\n if(s1 != \"0\") s1 = \"-\" + s1;\n cout << s1 << \"\\n\";\n return 0;\n }\n cout << nhan(a,b) << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3580,"score_of_the_acc":-0.0779,"final_rank":6},{"submission_id":"aoj_NTL_2_C_7525139","code_snippet":"#include <bits/stdc++.h>\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\n#define pb push_back\n#define f first\n#define s second\n\nusing namespace std;\ntypedef pair <int,int> pii;\n\nconst int maxn = 1e5 + 5;\n\nstring t(string a, string b)\n{\n string c;\n long n1= a.length(), n2=b.length(),t,n=0;\n if(n1>n2) b.insert(0,n1-n2,'0');\n if(n2>n1) a.insert(0,n2-n1,'0');\n c=a;\n for(int i=a.length()-1;i>=0;i--)\n {\n t=(a[i]-48)+(b[i]-48)+n;\n n=t/10;\n t=t%10;\n c[i]=char(t+48);\n }\n if(n>0) c= char(n+48) +c;\n return c;\n}\n\nstring h(string a, string b)\n{\n string c;\n long n1= a.length(), n2=b.length(),t,n=0;\n if(n1>n2) b.insert(0,n1-n2,'0');\n c=\"\";\n for(int i=n1-1;i>=0;i--)\n {\n t=(a[i]-48)-(b[i]-48)-n;\n if(t<0)\n {\n t+=10;\n n=1;\n }\n else n=0;\n c=char(t+48)+c;\n }\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\n return c;\n}\n\nstring n1(string a,int k)\n{\n string b;\n long i,n=0,t;\n for(i=a.length()-1;i>=0;i--)\n {\n t=n+(a[i]-48)*k;\n n=t/10;\n t=t%10;\n b=char(t+48) + b;\n }\n if(n!=0) b=char(n+48)+b;\n while(b.length()>1&&b[0]=='0') b.erase(0,1);\n return b;\n}\n\nstring nhan(string a, string b)\n{\n string x,tg1=\"0\",tg2,c;\n long i,j=0;\n for(i=b.length()-1;i>=0;i--)\n {\n tg2=n1(a,(b[i]-48));\n tg2.insert(tg2.length(),j,'0');\n j++;\n c=t(tg2,tg1);\n tg1=c;\n }\n return c;\n}\nstring a,b;\n\nint main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> a >> b;\n if(a[0] == '-' && b[0] == '-')\n {\n a.erase(0,1);\n b.erase(0,1);\n cout << nhan(a,b) << \"\\n\";\n return 0;\n }\n else if(a[0] == '-' && b[0] != '-')\n {\n a.erase(0,1);\n string s1 = nhan(a,b);\n if(s1 != \"0\") s1 = \"-\" + s1;\n cout << s1 << \"\\n\";\n return 0;\n }\n else if(a[0] != '-' && b[0] == '-')\n {\n b.erase(0,1);\n string s1 = nhan(a,b);\n if(s1 != \"0\") s1 = \"-\" + s1;\n cout << s1 << \"\\n\";\n return 0;\n }\n cout << nhan(a,b) << \"\\n\";\n return 0;\n}","accuracy":0.84,"time_ms":30,"memory_kb":3612,"score_of_the_acc":-0.0783,"final_rank":16},{"submission_id":"aoj_NTL_2_C_6978051","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\nbigInt operator* ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<ll> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = (ll)( str[id++] - '0' );\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<ll> v( 4, 0LL );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n ll top = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n if( minus && ( size != 0 || top != 0LL ) )\n cout << '-';\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n // sizeの再計算\n void resize(){\n\n size = 0;\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- ){\n if( dat[i][j] != 0 ){\n size = i;\n return;\n }\n }\n }\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n ll lVal = 0LL, rVal = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n ll lVal = 0LL, rVal = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n ll up = 0LL; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.minus = l.minus;\n }\n res.resize();\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l.minus & r.minus ){\n if( l < r ){\n l.minus = false;\n r.minus = false;\n res = l - r;\n res.minus = true;\n }\n else{\n l.minus = false;\n r.minus = false;\n res = r - l;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n int maxSize = max( l.size, r.size );\n ll down = 0LL; // 繰り下がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n else\n down = 0;\n }\n }\n }\n }\n }\n res.resize();\n return res;\n\n}\n\nbigInt operator* ( bigInt l, bigInt r ){\n\n bigInt res;\n res.minus = l.minus ^ r.minus;\n for( int li = 0 ; li <= l.size ; li++ ){\n for( int lj = 0 ; lj < 4 ; lj++ ){\n for( int ri = 0 ; ri <= r.size ; ri++ ){\n for( int rj = 0 ; rj < 4 ; rj++ )\n res.dat[li+ri+((lj+rj)/4)][(lj+rj)%4] += l.dat[li][lj] * r.dat[ri][rj];\n }\n }\n }\n ll up = 0LL; // 繰り上がり\n for( int i = 0 ; i < res.dat.size() ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n ll now = res.dat[i][j] + up;\n res.dat[i][j] = now % 10;\n up = now / 10;\n }\n }\n res.resize();\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt mult = a * b;\n mult.print();\n\n}","accuracy":1,"time_ms":30,"memory_kb":39140,"score_of_the_acc":-0.4569,"final_rank":13},{"submission_id":"aoj_NTL_2_C_6978050","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ld EPS = 1e-10;\nconst ll MOD = 1000000007LL;\nconst ll INF = 1LL << 60;\nconst double PI = M_PI;\n\n/////////////////////////////////\n// 多倍長整数\n// [-10^400000,10^400000] を表せる\n\nstruct bigInt;\nbool operator< ( bigInt l, bigInt r );\nbigInt operator+ ( bigInt l, bigInt r );\nbigInt operator- ( bigInt l, bigInt r );\nbigInt operator* ( bigInt l, bigInt r );\n\nstruct bigInt{\n\n bool minus;\n int size;\n vector< vector<ll> > dat;\n\n // コンストラクタ\n bigInt(){\n\n Init();\n\n }\n\n bigInt( string str ){\n\n Init();\n if( str[0] == '-' ){\n minus = true;\n str = str.substr(1);\n }\n size = ( str.length() - 1 ) / 4;\n reverse( str.begin(), str.end() );\n int id = 0;\n for( int i = 0 ; i <= size ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n if( id < str.length() ){\n dat[i][j] = (ll)( str[id++] - '0' );\n }\n }\n }\n\n }\n\n // 初期化\n void Init(){\n\n minus = false;\n size = 0;\n for( int i = 0 ; i < 100000 ; i++ ){\n vector<ll> v( 4, 0LL );\n dat.push_back( v );\n }\n\n }\n\n // 表示\n void print(){\n\n if( minus )\n cout << '-';\n ll top = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n top += dat[size][i] * order;\n order *= 10;\n }\n cout << top;\n for( int i = size-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- )\n cout << dat[i][j];\n }\n cout << endl;\n\n }\n\n // sizeの再計算\n void resize(){\n\n size = 0;\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\n for( int j = 3 ; j >= 0 ; j-- ){\n if( dat[i][j] != 0 ){\n size = i;\n return;\n }\n }\n }\n\n }\n\n};\n\n/////////////////////////////////////////////\n// 演算子の定義\nbool operator< ( bigInt l, bigInt r ){\n\n if( l.minus ){\n if( !r.minus ) return true;\n if( l.size == r.size ){\n ll lVal = 0LL, rVal = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal > rVal;\n }\n return l.size > r.size;\n }\n else{\n if( r.minus ) return false;\n if( l.size == r.size ){\n ll lVal = 0LL, rVal = 0LL;\n ll order = 1LL;\n for( int i = 0 ; i < 4 ; i++ ){\n lVal += order * l.dat[l.size][i];\n rVal += order * r.dat[r.size][i];\n order *= 10;\n }\n return lVal < rVal;\n }\n return l.size < r.size;\n }\n\n}\n\nbigInt operator+ ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = r - l;\n }\n else{\n r.minus = false;\n res = l - r;\n }\n }\n else{\n int maxSize = max( l.size, r.size );\n ll up = 0LL; // 繰り上がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\n }\n }\n res.dat[maxSize+1][0] = up;\n res.minus = l.minus;\n }\n res.resize();\n return res;\n\n}\n\nbigInt operator- ( bigInt l, bigInt r ){\n\n bigInt res;\n if( l.minus ^ r.minus ){\n if( l.minus ){\n l.minus = false;\n res = l + r;\n res.minus = true;\n }\n else{\n r.minus = false;\n res = l + r;\n }\n }\n else{\n if( l.minus & r.minus ){\n if( l < r ){\n l.minus = false;\n r.minus = false;\n res = l - r;\n res.minus = true;\n }\n else{\n l.minus = false;\n r.minus = false;\n res = r - l;\n }\n }\n else{\n if( l < r ){\n res = r - l;\n res.minus = true;\n }\n else{\n int maxSize = max( l.size, r.size );\n ll down = 0LL; // 繰り下がり\n for( int i = 0 ; i <= maxSize ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\n if( res.dat[i][j] < 0 ){\n res.dat[i][j] += 10;\n down = 1;\n }\n else\n down = 0;\n }\n }\n }\n }\n }\n res.resize();\n return res;\n\n}\n\nbigInt operator* ( bigInt l, bigInt r ){\n\n bigInt res;\n res.minus = l.minus ^ r.minus;\n for( int li = 0 ; li <= l.size ; li++ ){\n for( int lj = 0 ; lj < 4 ; lj++ ){\n for( int ri = 0 ; ri <= r.size ; ri++ ){\n for( int rj = 0 ; rj < 4 ; rj++ )\n res.dat[li+ri+((lj+rj)/4)][(lj+rj)%4] += l.dat[li][lj] * r.dat[ri][rj];\n }\n }\n }\n ll up = 0LL; // 繰り上がり\n for( int i = 0 ; i < res.dat.size() ; i++ ){\n for( int j = 0 ; j < 4 ; j++ ){\n ll now = res.dat[i][j] + up;\n res.dat[i][j] = now % 10;\n up = now / 10;\n }\n }\n res.resize();\n return res;\n\n}\n\n/////////////////////////////////////////////////\n\nint main(){\n\n string strA, strB;\n cin >> strA >> strB;\n bigInt a( strA );\n bigInt b( strB );\n bigInt mult = a * b;\n mult.print();\n\n}","accuracy":0.04,"time_ms":20,"memory_kb":39072,"score_of_the_acc":-0.4191,"final_rank":20},{"submission_id":"aoj_NTL_2_C_6679630","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n\n#define all(x) (x).begin(),(x).end()\n#define print(x) cout << (x) << '\\n'\ntypedef long long ll;\ntypedef long double ld;\nusing P = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing Graph = vector<vector<int>>;\n\n//const ll MOD = 1000000007;\n//const ll MOD = 998244353;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {return a < b ? a = b, true : false;}\ntemplate <typename T> inline bool chmin(T &a, T b) {return a > b ? a = b, true : false;}\n\ntemplate <typename T>\nvoid vin(vector<T> &v) {\n int l = v.size();\n for(int i = 0; i < l; i++) cin >> v[i];\n}\n\ntemplate <typename T>\nvoid vout(vector<T> &v) {\n int l = v.size();\n for(int i = 0; i < l; i++) cout << v[i] << (i < l - 1 ? ' ' : '\\n');\n}\n\nstring calc1(string x, string y, int la, int lb) {\n string ret = \"\";\n int nex = 0;\n for(int i = la - 1; i >= la - lb; i--) {\n int t = x[i] - '0' + y[i - la + lb] - '0' + nex;\n if(t >= 10) {\n nex = t / 10;\n ret += char('0' + t % 10);\n } else {\n nex = 0;\n ret += char('0' + t);\n }\n }\n for(int i = la - lb - 1; i >= 0; i--) {\n int t = x[i] - '0' + nex;\n if(t >= 10) {\n nex = t / 10;\n ret += char('0' + t % 10);\n } else {\n nex = 0;\n ret += char('0' + t);\n }\n }\n if(nex > 0) {\n ret += char('0' + nex);\n }\n reverse(all(ret));\n int L = ret.length();\n int zero = 0;\n for(int i = 0; i < L; i++) {\n if(ret[i] == '0') {\n zero++;\n } else {\n break;\n }\n }\n ret = ret.substr(zero, L - zero);\n if(ret == \"\") {\n ret = \"0\";\n }\n return ret;\n}\n\nstring calc2(string x, string y, int la, int lb) {\n bool p = true;\n if(la < lb) {\n p = false;\n } else if(la == lb && x < y) {\n p = false;\n }\n if(!p) {\n swap(x, y);\n swap(la, lb);\n }\n\n string ret = \"\";\n int nex = 0;\n for(int i = la - 1; i >= la - lb; i--) {\n int t = x[i] - '0' - (y[i - (la - lb)] - '0') - nex;\n if(t < 0) {\n nex = 1;\n ret += char('0' + t + 10);\n } else {\n ret += char('0' + t);\n nex = 0;\n }\n }\n for(int i = la - lb - 1; i >= 0; i--) {\n int t = x[i] - '0' - nex;\n if(t < 0) {\n nex = 1;\n ret += char('0' + t + 10);\n } else {\n nex = 0;\n ret += char('0' + t);\n }\n }\n reverse(all(ret));\n int L = ret.length();\n int zero = 0;\n for(int i = 0; i < L; i++) {\n if(ret[i] == '0') {\n zero++;\n } else {\n break;\n }\n }\n ret = ret.substr(zero, L - zero);\n if(p) {\n ret = \"-\" + ret;\n }\n if(ret == \"-\") {\n ret = \"0\";\n }\n return ret;\n}\n\nstring calc(string A, string B) {\n int la = A.length();\n int lb = B.length();\n\n string RET;\n if(A[0] == '-' && B[0] == '-') {\n A = A.substr(1, la - 1);\n B = B.substr(1, lb - 1);\n la--;\n lb--;\n if(la < lb) {\n swap(A, B);\n swap(la, lb);\n }\n RET = calc1(A, B, la, lb);\n RET = \"-\" + RET;\n } else if(A[0] == '-') {\n A = A.substr(1, la - 1);\n la--;\n RET = calc2(A, B, la, lb);\n } else if(B[0] == '-') {\n swap(A, B);\n swap(la, lb);\n A = A.substr(1, la - 1);\n la--;\n RET = calc2(A, B, la, lb);\n } else {\n if(la < lb) {\n swap(A, B);\n swap(la, lb);\n }\n RET = calc1(A, B, la, lb);\n }\n return RET;\n}\n\nstring Mcalc2(string A, char b, int la) {\n string ret = \"\";\n int nex = 0;\n for(int i = la - 1; i >= 0; i--) {\n int t = int(A[i] - '0') * int(b - '0') + nex;\n nex = t / 10;\n ret += char('0' + t % 10);\n\n }\n while(nex > 0) {\n ret += char('0' + nex % 10);\n nex /= 10;\n }\n reverse(all(ret));\n int L = ret.length();\n int zero = 0;\n for(int i = 0; i < L; i++) {\n if(ret[i] == '0') {\n zero++;\n } else {\n break;\n }\n }\n ret = ret.substr(zero, L - zero);\n if(ret == \"\") {\n ret = \"0\";\n }\n return ret;\n}\n\nstring Mcalc1(string A, string B, int la, int lb) {\n string ret = \"0\";\n for(int i = lb - 1; i >= 0; i--) {\n string tmp = Mcalc2(A, B[i], la);\n for(int j = 0; j < lb - 1 - i; j++) {\n tmp += '0';\n }\n ret = calc(ret, tmp);\n }\n return ret;\n}\n\nstring Mcalc(string A, string B) {\n int la = A.length();\n int lb = B.length();\n string Mret;\n if(A[0] == '-' && B[0] == '-') {\n A = A.substr(1, la - 1);\n B = B.substr(1, lb - 1);\n la--;\n lb--;\n Mret = Mcalc1(A, B, la, lb);\n } else if(A[0] == '-') {\n A = A.substr(1, la - 1);\n la--;\n Mret = Mcalc1(A, B, la, lb);\n if(Mret != \"0\") {\n Mret = \"-\" + Mret;\n }\n } else if(B[0] == '-') {\n B = B.substr(1, lb - 1);\n lb--;\n Mret = Mcalc1(A, B, la, lb);\n if(Mret != \"0\") {\n Mret = \"-\" + Mret;\n }\n } else {\n Mret = Mcalc1(A, B, la, lb);\n }\n return Mret;\n}\n\nint main() {\n cin.tie(0); cout.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n\n string A, B;\n cin >> A >> B;\n string ans = Mcalc(A, B);\n print(ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3556,"score_of_the_acc":-0.0036,"final_rank":3},{"submission_id":"aoj_NTL_2_C_6679022","code_snippet":"#include <bits/stdc++.h>\n\n\n// #include <atcoder/convolution>\n#include <iostream>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace rklib {\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nbool chmin_non_negative(T &a, const T &b) {\n if (a < 0 || a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\n\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a *= -1, b *= -1;\n return a > 0 ? (a - 1) / b + 1 : a / b;\n}\n\n} // namespace rklib\n\n#include <string>\n#include <type_traits>\n#include <vector>\n\nnamespace rklib {\n\nstruct BigInt {\n public:\n BigInt() : BigInt(0) {}\n template <typename T, std::enable_if_t<std::is_integral<T>::value,\n std::nullptr_t> = nullptr>\n BigInt(T x) : BigInt(std::vector<T>(1, x)) {}\n template <typename T, std::enable_if_t<std::is_integral<T>::value,\n std::nullptr_t> = nullptr>\n BigInt(std::vector<T> a) {\n while (a.size() >= 2 && a.back() == 0) a.pop_back();\n if (a.size() == 1 && a[0] == 0) {\n sgn = 0;\n return;\n }\n sgn = (a.back() > 0 ? 1 : -1);\n if (sgn < 0) {\n std::transform(a.begin(), a.end(), a.begin(),\n [](T x) { return -x; });\n }\n v = normalize(a);\n }\n BigInt(std::string s) : sgn(1) {\n if (s[0] == '-') {\n s.erase(s.begin());\n sgn = -1;\n }\n if (s == \"0\") {\n sgn = 0;\n v = {0};\n return;\n }\n for (int r = int(s.size()), l = std::max(0, r - log10_base); r > 0;\n r = l, l = std::max(0, r - log10_base)) {\n int tmp = 0;\n for (int i = l; i < r; ++i) {\n tmp = tmp * 10 + (s[i] - '0');\n }\n v.push_back(tmp);\n }\n }\n\n BigInt& operator+=(const BigInt& rhs) {\n int r_sgn = rhs.sgn;\n if (r_sgn == 0) return *this;\n if (sgn == 0) return *this = rhs;\n if (v.size() < rhs.v.size()) v.resize(rhs.v.size(), 0);\n for (size_t i = 0; i < rhs.v.size(); i++) {\n if (sgn == r_sgn)\n v[i] += rhs.v[i];\n else\n v[i] -= rhs.v[i];\n }\n normalize();\n return *this;\n }\n BigInt& operator-=(const BigInt& rhs) {\n int r_sgn = rhs.sgn;\n if (r_sgn == 0) return *this;\n if (sgn == 0) return *this = -rhs;\n if (v.size() < rhs.v.size()) v.resize(rhs.v.size(), 0);\n for (size_t i = 0; i < rhs.v.size(); i++) {\n if (sgn == r_sgn)\n v[i] -= rhs.v[i];\n else\n v[i] += rhs.v[i];\n }\n normalize();\n return *this;\n }\n BigInt& operator*=(const BigInt& rhs) {\n int r_sgn = rhs.sgn;\n if (sgn == 0) return *this;\n if (r_sgn == 0) return *this = rhs;\n\n int res_sgn = sgn * r_sgn;\n\n // if (v.size() <= 10 || rhs.v.size() <= 10) {\n // v = multiply_naive(v, rhs.v);\n // } else if (v.size() + rhs.v.size() - 1 <= (1 << 24)) {\n // v = multiply_ntt(v, rhs.v);\n // }\n\n if (v.size() <= 2 || rhs.v.size() <= 2) {\n v = multiply_naive(v, rhs.v);\n } else {\n BigInt a = *this, b = rhs;\n a.sgn = b.sgn = 1;\n *this = multiply_karatsuba(a, b);\n }\n\n this->sgn = res_sgn;\n\n return *this;\n }\n\n friend BigInt operator+(const BigInt& lhs, const BigInt& rhs) {\n return BigInt(lhs) += rhs;\n }\n friend BigInt operator-(const BigInt& lhs, const BigInt& rhs) {\n return BigInt(lhs) -= rhs;\n }\n friend BigInt operator*(const BigInt& lhs, const BigInt& rhs) {\n return BigInt(lhs) *= rhs;\n }\n\n BigInt operator+() const { return *this; }\n BigInt operator-() const { return {-sgn, v}; }\n\n friend std::istream& operator>>(std::istream& is, BigInt& rhs) {\n std::string s;\n is >> s;\n rhs = BigInt(s);\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const BigInt& rhs) {\n if (rhs.sgn < 0) os << \"-\";\n for (int i = int(rhs.v.size()) - 1; i >= 0; i--) {\n if (i == int(rhs.v.size()) - 1) {\n os << rhs.v[i];\n } else {\n os << std::to_string(rhs.v[i] + base).substr(1, log10_base);\n }\n }\n return os;\n }\n\n private:\n static constexpr int base = 10, log10_base = 1;\n int sgn;\n std::vector<int> v;\n\n BigInt(int sgn, std::vector<int> v) : sgn(sgn), v(v) {}\n\n void normalize() {\n if (v.back() < 0) {\n sgn = -sgn;\n std::transform(v.begin(), v.end(), v.begin(),\n [](int x) { return -x; });\n }\n int carry = 0;\n for (size_t i = 0; i < v.size(); i++) {\n v[i] += carry;\n if (0 <= v[i] && v[i] < base) {\n carry = 0;\n continue;\n }\n carry = div_floor(v[i], base);\n v[i] -= carry * base;\n if (i == v.size() - 1 && carry != 0) {\n v.push_back(carry % base);\n carry /= base;\n }\n }\n\n while (v.size() >= 2 && v.back() == 0) v.pop_back();\n if (v.size() == 1 && v[0] == 0) sgn = 0;\n }\n\n template <class T>\n static std::vector<int> normalize(const std::vector<T>& c) {\n std::vector<int> res(c.size());\n T carry = 0;\n for (size_t i = 0; i < c.size(); i++) {\n T tmp = c[i];\n tmp += carry;\n if (0 <= tmp && tmp < T(base)) {\n carry = 0;\n res[i] = int(tmp);\n continue;\n }\n carry = div_floor(tmp, T(base));\n res[i] = int(tmp - carry * base);\n }\n while (carry > 0) {\n res.push_back(int(carry % base));\n carry /= base;\n }\n\n while (res.size() >= 2 && res.back() == 0) res.pop_back();\n\n return res;\n }\n\n static std::vector<int> multiply_naive(const std::vector<int>& a,\n const std::vector<int>& b) {\n std::vector<long long> c(a.size() + b.size() - 1, 0);\n for (size_t i = 0; i < a.size(); i++) {\n for (size_t j = 0; j < b.size(); j++) {\n c[i + j] += a[i] * b[j];\n }\n }\n\n return normalize(c);\n }\n // static std::vector<int> multiply_ntt(const std::vector<int>& a,\n // const std::vector<int>& b) {\n // std::vector<long long> al(a.size()), bl(b.size());\n // for (size_t i = 0; i < a.size(); i++) {\n // al[i] = (long long)a[i];\n // }\n // for (size_t i = 0; i < b.size(); i++) {\n // bl[i] = (long long)b[i];\n // }\n\n // std::vector<long long> c = atcoder::convolution_ll(al, bl);\n\n // return normalize(c);\n // }\n static BigInt multiply_karatsuba(BigInt a, BigInt b) {\n // std::cout << a << \" \" << b << std::endl;\n int na = a.v.size(), nb = b.v.size();\n if (na <= 2 || nb <= 2) return a * b;\n\n int n = std::max(na, nb);\n if (na < n) a.v.resize(n, 0);\n if (nb < n) b.v.resize(n, 0);\n\n int k = n / 2;\n BigInt x(std::vector<int>(a.v.begin() + k, a.v.end()));\n BigInt y(std::vector<int>(a.v.begin(), a.v.begin() + k));\n BigInt z(std::vector<int>(b.v.begin() + k, b.v.end()));\n BigInt w(std::vector<int>(b.v.begin(), b.v.begin() + k));\n\n BigInt xz = multiply_karatsuba(x, z);\n BigInt yw = multiply_karatsuba(y, w);\n BigInt t = multiply_karatsuba(x + y, z + w) - xz - yw;\n\n a.v = std::vector<int>(2 * k, 0);\n a.v.insert(a.v.end(), xz.v.begin(), xz.v.end());\n b.v = std::vector<int>(k, 0);\n b.v.insert(b.v.end(), t.v.begin(), t.v.end());\n\n return a + b + yw;\n }\n};\n\n} // namespace rklib\n\n\n#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))\n#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))\n#define rep(i, n) For(i, 0, n)\n#define rrep(i, n) rFor(i, n, 0)\n#define fi first\n#define se second\n\nusing namespace std;\nusing namespace rklib;\n\nusing lint = long long;\nusing pii = pair<int, int>;\nusing pll = pair<lint, lint>;\n\nint main() {\n BigInt a, b;\n cin >> a >> b;\n cout << a * b << \"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":3660,"score_of_the_acc":-0.0047,"final_rank":4},{"submission_id":"aoj_NTL_2_C_6347786","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstruct BigIntTiny {\n int sign;\n std::vector<int> v;\n\n BigIntTiny() : sign(1) {}\n BigIntTiny(const std::string& s) { *this = s; }\n BigIntTiny(int v) {\n char buf[21];\n sprintf(buf, \"%d\", v);\n *this = buf;\n }\n void zip(int unzip) {\n if (unzip == 0) {\n for (int i = 0; i < (int)v.size(); i++)\n v[i] = get_pos(i * 4) + get_pos(i * 4 + 1) * 10 + get_pos(i * 4 + 2) * 100 + get_pos(i * 4 + 3) * 1000;\n }\n else\n for (int i = (v.resize(v.size() * 4), (int)v.size() - 1), a; i >= 0; i--)\n a = (i % 4 >= 2) ? v[i / 4] / 100 : v[i / 4] % 100, v[i] = (i & 1) ? a / 10 : a % 10;\n setsign(1, 1);\n }\n int get_pos(unsigned pos) const { return pos >= v.size() ? 0 : v[pos]; }\n BigIntTiny& setsign(int newsign, int rev) {\n for (int i = (int)v.size() - 1; i > 0 && v[i] == 0; i--)\n v.erase(v.begin() + i);\n sign = (v.size() == 0 || (v.size() == 1 && v[0] == 0)) ? 1 : (rev ? newsign * sign : newsign);\n return *this;\n }\n std::string to_str() const {\n BigIntTiny b = *this;\n std::string s;\n for (int i = (b.zip(1), 0); i < (int)b.v.size(); ++i)\n s += char(*(b.v.rbegin() + i) + '0');\n return (sign < 0 ? \"-\" : \"\") + (s.empty() ? std::string(\"0\") : s);\n }\n bool absless(const BigIntTiny& b) const {\n if (v.size() != b.v.size()) return v.size() < b.v.size();\n for (int i = (int)v.size() - 1; i >= 0; i--)\n if (v[i] != b.v[i]) return v[i] < b.v[i];\n return false;\n }\n BigIntTiny operator-() const {\n BigIntTiny c = *this;\n c.sign = (v.size() > 1 || v[0]) ? -c.sign : 1;\n return c;\n }\n BigIntTiny& operator=(const std::string& s) {\n if (s[0] == '-')\n *this = s.substr(1);\n else {\n for (int i = (v.clear(), 0); i < (int)s.size(); ++i)\n v.push_back(*(s.rbegin() + i) - '0');\n zip(0);\n }\n return setsign(s[0] == '-' ? -1 : 1, sign = 1);\n }\n bool operator<(const BigIntTiny& b) const {\n return sign != b.sign ? sign < b.sign : (sign == 1 ? absless(b) : b.absless(*this));\n }\n bool operator==(const BigIntTiny& b) const { return v == b.v && sign == b.sign; }\n BigIntTiny& operator+=(const BigIntTiny& b) {\n if (sign != b.sign) return *this = (*this) - -b;\n v.resize(std::max(v.size(), b.v.size()) + 1);\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\n carry += v[i] + b.get_pos(i);\n v[i] = carry % 10000, carry /= 10000;\n }\n return setsign(sign, 0);\n }\n BigIntTiny operator+(const BigIntTiny& b) const {\n BigIntTiny c = *this;\n return c += b;\n }\n void add_mul(const BigIntTiny& b, int mul) {\n v.resize(std::max(v.size(), b.v.size()) + 2);\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\n carry += v[i] + b.get_pos(i) * mul;\n v[i] = carry % 10000, carry /= 10000;\n }\n }\n BigIntTiny operator-(const BigIntTiny& b) const {\n if (sign != b.sign) return (*this) + -b;\n if (absless(b)) return -(b - *this);\n BigIntTiny c;\n for (int i = 0, borrow = 0; i < (int)v.size(); i++) {\n borrow += v[i] - b.get_pos(i);\n c.v.push_back(borrow);\n c.v.back() -= 10000 * (borrow >>= 31);\n }\n return c.setsign(sign, 0);\n }\n BigIntTiny operator*(const BigIntTiny& b) const {\n if (b < *this) return b * *this;\n BigIntTiny c, d = b;\n for (int i = 0; i < (int)v.size(); i++, d.v.insert(d.v.begin(), 0))\n c.add_mul(d, v[i]);\n return c.setsign(sign * b.sign, 0);\n }\n BigIntTiny operator/(const BigIntTiny& b) const {\n BigIntTiny c, d;\n d.v.resize(v.size());\n double db = 1.0 / (b.v.back() + (b.get_pos((unsigned)b.v.size() - 2) / 1e4) +\n (b.get_pos((unsigned)b.v.size() - 3) + 1) / 1e8);\n for (int i = (int)v.size() - 1; i >= 0; i--) {\n c.v.insert(c.v.begin(), v[i]);\n int m = (int)((c.get_pos((int)b.v.size()) * 10000 + c.get_pos((int)b.v.size() - 1)) * db);\n c = c - b * m, d.v[i] += m;\n while (!(c < b))\n c = c - b, d.v[i] += 1;\n }\n return d.setsign(sign * b.sign, 0);\n }\n BigIntTiny operator%(const BigIntTiny& b) const { return *this - *this / b * b; }\n bool operator>(const BigIntTiny& b) const { return b < *this; }\n bool operator<=(const BigIntTiny& b) const { return !(b < *this); }\n bool operator>=(const BigIntTiny& b) const { return !(*this < b); }\n bool operator!=(const BigIntTiny& b) const { return !(*this == b); }\n};\n//FFT部分 \nconst double PI = acos(-1);\ntypedef complex<double> Complex;\nconst int maxn = 3e6 + 10;\n\nComplex a[maxn], b[maxn];\nint m, n;\nint bit = 2, rev[maxn];\nint ans[maxn];\n\nvoid get_rev() {\n memset(rev, 0, sizeof(rev));\n while (bit <= n + m) bit <<= 1;\n for (int i = 0; i < bit; ++i) {\n rev[i] = (rev[i >> 1] >> 1) | (bit >> 1) * (i & 1);\n }\n}\n\nvoid FFT(Complex* a, int op) {\n for (int i = 0; i < bit; ++i) {\n if (i < rev[i]) swap(a[i], a[rev[i]]);\n }\n for (int mid = 1; mid < bit; mid <<= 1) {\n Complex wn = Complex(cos(PI / mid), op * sin(PI / mid));\n for (int j = 0; j < bit; j += mid << 1) {\n Complex w(1, 0);\n for (int k = 0; k < mid; ++k, w = w * wn) {\n Complex x = a[j + k], y = w * a[j + k + mid];\n a[j + k] = x + y, a[j + k + mid] = x - y;\n }\n }\n }\n}\n\nstring fftmul(string s1, string s2) {\n //cout<<s1<<endl<<s2<<endl;\n n = s1.size(), m = s2.size();\n memset(a, 0, sizeof(a));\n memset(b, 0, sizeof(b));\n for (int i = 0; i < n; ++i) {\n a[i] = s1[n - i - 1] - '0';\n }\n for (int i = 0; i < m; ++i) {\n b[i] = s2[m - i - 1] - '0';\n }\n get_rev();\n FFT(a, 1);\n FFT(b, 1);\n for (int i = 0; i <= bit; ++i) {\n a[i] *= b[i];\n }\n FFT(a, -1);\n for (int i = 0; i < n + m; ++i) {\n ans[i] = (int)(a[i].real() / bit + 0.5);\n }\n for (int i = 1; i < n + m; ++i) {\n ans[i] = ans[i] + ans[i - 1] / 10;\n ans[i - 1] = ans[i - 1] % 10;\n }\n int s = n + m - 1;\n for (; s >= 0; --s) {\n if (ans[s]) break;\n }\n string ret;\n if (s < 0) ret.push_back('0');//printf(\"0\\n\");\n else {\n for (int i = s; i >= 0; --i) {\n ret.push_back(ans[i] + '0');//printf(\"%d\", ans[i]);\n }\n //printf(\"\\n\");\n }\n return ret;\n}\n\nBigIntTiny fastmul(BigIntTiny b1, BigIntTiny b2) {\n //cout<<b1.to_str()<<'\\n'<<b2.to_str()<<endl;\n //cout<<fftmul(b1.to_str(),b2.to_str())<<endl;\n bool flag = 0;//要不要变负,1负\n if (b1 < 0)b1 = -b1, flag ^= 1;\n if (b2 < 0)b2 = -b2, flag ^= 1;\n BigIntTiny ans = fftmul(b1.to_str(), b2.to_str());\n return flag ? -ans : ans;\n}\nconst int p = 998244353;\nBigIntTiny qpow(BigIntTiny a, BigIntTiny n, BigIntTiny p) {\n BigIntTiny res = 1;\n while (n>0) {\n if (n % 2 == 1) res = res * a % p;\n a = a * a % p;\n n = n / 2;\n }\n return res;\n}\nBigIntTiny qpow1(BigIntTiny a, BigIntTiny n) {\n BigIntTiny res = 1;\n while (n > 0) {\n if (n % 2 == 1) res = res * a;\n a = a * a;\n n = n / 2;\n }\n return res;\n}\nBigIntTiny v[51], sum[51];\nint main(){\n string a, b;\n cin>>a>>b;\n cout<<(BigIntTiny(a)*BigIntTiny(b)).to_str()<<'\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":97060,"score_of_the_acc":-1.037,"final_rank":15},{"submission_id":"aoj_NTL_2_C_5535128","code_snippet":"#include <bits/stdc++.h>\n#include <sstream>\n\nusing namespace std;\n\n//#define InputOutputOperatorOverload\n\nclass BigData {\npublic:\n\tBigData() {\n\t\tthis->data = \"\";\n\t\tthis->minFlag = false;\n\t}\n\n#ifdef InputOutputOperatorOverload\n\tfriend istream& operator >>(istream& in, BigData& bigdata) {\n\t\tin >> bigdata.data;\n\t\treturn in;\n\t}\n\n\tfriend ostream& operator <<(ostream& out, BigData& bigdata) {\n\t\tout << bigdata.data;\n\t\treturn out;\n\t}\n#else\n\tstring getValue() {\n\t\treturn this->data;\n\t}\n\n\tvoid setValue(string value) {\n\t\tthis->data = value;\n\t}\n#endif\n\n\tBigData operator +(const BigData& add) {\n\t\tstring add1, add2;\n\t\tBigData ans;\n\n\t\tadd1 = this->data;\n\t\tadd2 = add.data;\n\t\tif (add1[0] != '-' && add2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = getAdd(add1, add2);\n\t\t}\n\t\telse if (add1[0] == '-' && add2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tadd1 = add1.substr(1);\n\t\t\tadd2 = add2.substr(1);\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = getAdd(add1, add2);\n\t\t}\n\t\telse if (add1[0] == '-' && add2[0] != '-') {\n\t\t\tadd1 = add1.substr(1);\n\t\t\tminFlag = compareAndChange(add1, add2) ? false : true;\n\t\t\tif (add1 == add2) {\n\t\t\t\tminFlag = false;\n\t\t\t}\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = calculate(add1, add2);\n\t\t}\n\t\telse if (add1[0] != '-' && add2[0] == '-') {\n\t\t\tadd2 = add2.substr(1);\n\t\t\tminFlag = compareAndChange(add1, add2);\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = calculate(add1, add2);\n\t\t}\n\n\t\tif (minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\tBigData operator -(const BigData& sub) {\n\t\tstring sub1, sub2;\n\t\tBigData ans;\n\n\t\tsub1 = this->data;\n\t\tsub2 = sub.data;\n\t\tif (sub1[0] != '-' && sub2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tsub2 = sub2.substr(1);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = getAdd(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] == '-' && sub2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tsub1 = sub1.substr(1);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = getAdd(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] != '-' && sub2[0] != '-') {\n\t\t\tminFlag = compareAndChange(sub1, sub2);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = calculate(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] == '-' && sub2[0] == '-') {\n\t\t\tsub1 = sub1.substr(1);\n\t\t\tsub2 = sub2.substr(1);\n\t\t\tminFlag = compareAndChange(sub1, sub2) ? false : true;\n\t\t\tif (sub1 == sub2) {\n\t\t\t\tminFlag = false;\n\t\t\t}\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = calculate(sub1, sub2);\n\t\t}\n\n\t\tif (minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\tBigData operator *(const BigData& mul) {\n\t\tstring mul1, mul2;\n\t\tBigData ans;\n\n\t\tmul1 = this->data;\n\t\tmul2 = mul.data;\n\t\tif (mul1[0] != '-' && mul2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t}\n\t\telse if (mul1[0] == '-' && mul2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tmul1 = mul1.substr(1);\n\t\t\tmul2 = mul2.substr(1);\n\t\t}\n\t\telse if (mul1[0] == '-' && mul2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tmul1 = mul1.substr(1);\n\t\t}\n\t\telse if (mul1[0] != '-' && mul2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tmul2 = mul2.substr(1);\n\t\t}\n\n\t\treverse(mul1.begin(), mul1.end());\n\t\treverse(mul2.begin(), mul2.end());\n\t\tans.data = getMul(mul1, mul2);\n\n\t\tif (ans.data != \"0\" && minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\tBigData operator /(const BigData& div) {\n\t\tstring div1, div2, rem;\n\t\tBigData ans;\n\n\t\tdiv1 = this->data;\n\t\tdiv2 = div.data;\n\t\tif (div1[0] != '-' && div2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t}\n\t\telse if (div1[0] == '-' && div2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tdiv1 = div1.substr(1);\n\t\t\tdiv2 = div2.substr(1);\n\t\t}\n\t\telse if (div1[0] == '-' && div2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tdiv1 = div1.substr(1);\n\t\t}\n\t\telse if (div1[0] != '-' && div2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tdiv2 = div2.substr(1);\n\t\t}\n\t\t\n\t\tans.data = getDiv(div1, div2, rem);\n\t\tif (ans.data != \"0\" && minFlag) {\n\t\t\tans.data = \"-\" + ans.data;\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tBigData operator %(const BigData& div) {\n\t\tstring div1, div2, rem;\n\t\tBigData ans;\n\n\t\tdiv1 = this->data;\n\t\tdiv2 = div.data;\n\t\tif (div1[0] != '-' && div2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t}\n\t\telse if (div1[0] == '-' && div2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tdiv1 = div1.substr(1);\n\t\t\tdiv2 = div2.substr(1);\n\t\t}\n\t\telse if (div1[0] == '-' && div2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tdiv1 = div1.substr(1);\n\t\t}\n\t\telse if (div1[0] != '-' && div2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tdiv2 = div2.substr(1);\n\t\t}\n\n\t\tans.data = getDiv(div1, div2, rem);\n\t\tans.data = rem;\n\t\tif (ans.data != \"0\" && minFlag) {\n\t\t\tans.data = \"-\" + ans.data;\n\t\t}\n\t\t\n\t\treturn ans;\n\t}\n\n\nprivate:\n\tstring data;\n\tbool minFlag;\n\n\tbool compareAndChange(string& d1, string& d2) {\n\t\tunsigned int len1, len2;\n\n\t\tlen1 = d1.size();\n\t\tlen2 = d2.size();\n\t\tif (len1 > len2) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (len1 < len2 || d1 < d2) {\n\t\t\td1.swap(d2);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool compare(const string& d1, const string& d2) {\n\t\tunsigned int len1, len2;\n\n\t\tlen1 = d1.size();\n\t\tlen2 = d2.size();\n\t\tif (len1 > len2) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (len1 < len2 || d1 < d2) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tstring getAdd(const string& add1, const string& add2) {\n\t\tunsigned int len1, len2, i;\n\t\tint acc, sum;\n\t\tstringstream ss;\n\n\t\tlen1 = add1.size();\n\t\tlen2 = add2.size();\n\t\t//cout << add1 << endl << add2 << endl;\n\n\t\ti = 0;\n\t\tacc = 0;\n\t\tss.clear();\n\t\tss.str(\"\");\n\t\twhile (i < len1 && i < len2) {\n\t\t\tsum = (add1[i] - '0') + (add2[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len1) {\n\t\t\tsum = (add1[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len2) {\n\t\t\tsum = (add2[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\tif (acc == 1) {\n\t\t\tss << 1;\n\t\t}\n\n\t\treturn ss.str();\n\t}\n\n\tstring getSub(const string& sub1, const string& sub2) {\n\t\tunsigned int len1, len2, i;\n\t\tint acc, sum;\n\t\tstringstream ss;\n\n\t\tlen1 = sub1.size();\n\t\tlen2 = sub2.size();\n\t\t//cout << sub1 << endl << sub2 << endl;\n\n\t\ti = 0;\n\t\tacc = 0;\n\t\tss.clear();\n\t\tss.str(\"\");\n\t\twhile (i < len1 && i < len2) {\n\t\t\tsum = (sub1[i] - '0') - acc - (sub2[i] - '0');\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len1) {\n\t\t\tsum = (sub1[i] - '0') - acc;\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len2) {\n\t\t\tsum = (sub2[i] - '0') - acc;\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\treturn ss.str();\n\t}\n\n\tstring calculate(const string& data1, const string& data2) {\n\t\tstring ans;\n\n\t\tans = getSub(data1, data2);\n\t\twhile (true) {\n\t\t\tauto it = ans.rbegin();\n\t\t\tif (ans.size() == 1 || *it != '0') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tans.pop_back();\n\t\t}\n\t\treturn ans;\n\t}\n\n\tstring getMul(const string& mul1, const string& mul2) {\n\t\tunsigned int len1, len2;\n\t\tint acc, sum, base;\n\t\tstringstream ss;\n\t\tstring curSum;\n\n\t\tif (mul1 == \"0\" || mul2 == \"0\") {\n\t\t\treturn \"0\";\n\t\t}\n\n\t\tlen1 = mul1.size();\n\t\tlen2 = mul2.size();\n\t\t//cout << mul1 << endl << mul2 << endl;\n\n\t\tcurSum = \"\";\n\t\tfor (unsigned int i = 0; i < len2; ++i) {\n\t\t\tstring temp(\"\"), res(\"\");\n\t\t\tfor (unsigned int k = 0; k < i; ++k) {\n\t\t\t\ttemp += \"0\";\n\t\t\t}\n\t\t\tbase = mul2[i] - '0';\n\t\t\tacc = 0;\n\t\t\tss.clear();\n\t\t\tss.str(\"\");\n\t\t\tfor (unsigned int j = 0; j < len1; ++j) {\n\t\t\t\tsum = base * (mul1[j] - '0') + acc;\n\t\t\t\tacc = sum / 10;\n\t\t\t\tsum %= 10;\n\t\t\t\tss << sum;\n\t\t\t}\n\t\t\tif (acc != 0) {\n\t\t\t\tss << acc;\n\t\t\t}\n\t\t\tres = temp + ss.str();\n\t\t\t//cout << \"res=\" << res << endl;\n\t\t\tcurSum = getAdd(curSum, res);\n\t\t\t//cout << \"curSum=\" << curSum << endl;\n\t\t}\n\n\t\treturn curSum;\n\t}\n\n\tstring getDiv(const string& div1, const string& div2, string &rem) {\n\t\tunsigned int len1, len2, i;\n\t\tunsigned int k;\n\t\tstringstream ss;\n\t\tstring curSum, curSumTmp, curNum, div2Tmp, ans;\n\n\t\tif (compare(div1, div2)) {\n\t\t\trem = \"0\";\n\t\t\treturn \"0\";\n\t\t}\n\n\t\tlen1 = div1.size();\n\t\tlen2 = div2.size();\n\t\t//cout << div1 << endl << div2 << endl;\n\n\t\tans = \"\";\n\t\tcurSum = div1.substr(0, len2);\n\t\ti = len2 - 1;\n\t\tif (curSum < div2) {\n\t\t\tcurSum += div1[len2];\n\t\t\ti = len2;\n\t\t}\n\t\t//cout << \"curSum=\" << curSum << endl;\n\t\tfor (; i < len1; ++i) {\n\t\t\tif (compare(curSum, div2)) {\n\t\t\t\tcurSum += div1[i];\n\t\t\t}\n\t\t\t//cout << \"1:curSum=\" << curSum << endl;\n\t\t\tcurSumTmp = curSum;\n\t\t\tdiv2Tmp = div2;\n\t\t\treverse(curSumTmp.begin(), curSumTmp.end());\n\t\t\treverse(div2Tmp.begin(), div2Tmp.end());\n\t\t\tfor (k = 0; k < 10; ++k) {\n\t\t\t\tss.clear();\n\t\t\t\tss.str(\"\");\n\t\t\t\tss << k;\n\t\t\t\tcurNum = ss.str();\n\t\t\t\tstring res = getMul(div2Tmp, curNum);\n\t\t\t\t//cout << \" 1:res=\" << res << endl;\n\t\t\t\tres = calculate(curSumTmp, res);\n\t\t\t\t//cout << \" 2:res=\" << res << endl;\n\t\t\t\treverse(res.begin(), res.end());\n\t\t\t\t//cout << \" 3:res=\" << res << endl;\n\t\t\t\tif (compare(res, div2)) {\n\t\t\t\t\tans += curNum;\n\t\t\t\t\tcurSum = res;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trem = curSum;\n\t\t//cout << \" rem=\" << rem << endl;\n\t\treturn ans;\n\t}\n};\n\n\n\nint main(void) {\n\n\tios::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout.tie(NULL);\n\n\tBigData data1, data2;\n\n#ifdef InputOutputOperatorOverload\n\tcin >> data1 >> data2;\n\n\t//cout << \"data1=\" << data1 << endl << \"data2=\" << data2 << endl;\n\tcout << data1 + data2 << endl;\n\tcout << data1 - data2 << endl;\n\tcout << data1 * data2 << endl;\n\tcout << data1 / data2 << endl;\n\tcout << data1 % data2 << endl;\n#else\n\tstring d1, d2;\n\tcin >> d1 >> d2;\n\tdata1.setValue(d1);\n\tdata2.setValue(d2);\n\n\t//cout << \"data1=\" << data1.getValue() << endl << \"data2=\" << data2.getValue() << endl;\n\t//cout << (data1 + data2).getValue() << endl;\n\t//cout << (data1 - data2).getValue() << endl;\n\tcout << (data1 * data2).getValue() << endl;\n\t//cout << (data1 / data2).getValue() << endl;\n\t//cout << (data1 % data2).getValue() << endl;\n#endif\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3508,"score_of_the_acc":-0.2253,"final_rank":11},{"submission_id":"aoj_NTL_2_C_5518695","code_snippet":"#include <bits/stdc++.h>\n#include <sstream>\n\nusing namespace std;\n\n//#define InputOutputOperatorOverload\n\nclass BigData {\npublic:\n#ifdef InputOutputOperatorOverload\n\tfriend istream& operator >>(istream& in, BigData& bigdata) {\n\t\tin >> bigdata.data;\n\t\treturn in;\n\t}\n\n\tfriend ostream& operator <<(ostream& out, BigData& bigdata) {\n\t\tout << bigdata.data;\n\t\treturn out;\n\t}\n#else\n\tstring getValue() {\n\t\treturn this->data;\n\t}\n\n\tvoid setValue(string value) {\n\t\tthis->data = value;\n\t}\n#endif\n\n\tBigData operator +(const BigData& add) {\n\t\tstring add1, add2;\n\t\tBigData ans;\n\n\t\tadd1 = this->data;\n\t\tadd2 = add.data;\n\t\tif (add1[0] != '-' && add2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = getAdd(add1, add2);\n\t\t}\n\t\telse if (add1[0] == '-' && add2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tadd1 = add1.substr(1);\n\t\t\tadd2 = add2.substr(1);\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = getAdd(add1, add2);\n\t\t}\n\t\telse if (add1[0] == '-' && add2[0] != '-') {\n\t\t\tadd1 = add1.substr(1);\n\t\t\tminFlag = compare(add1, add2) ? false : true;\n\t\t\tif (add1 == add2) {\n\t\t\t\tminFlag = false;\n\t\t\t}\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = calculate(add1, add2);\n\t\t}\n\t\telse if (add1[0] != '-' && add2[0] == '-') {\n\t\t\tadd2 = add2.substr(1);\n\t\t\tminFlag = compare(add1, add2);\n\t\t\treverse(add1.begin(), add1.end());\n\t\t\treverse(add2.begin(), add2.end());\n\t\t\tans.data = calculate(add1, add2);\n\t\t}\n\n\t\tif (minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\tBigData operator -(const BigData& sub) {\n\t\tstring sub1, sub2;\n\t\tBigData ans;\n\n\t\tsub1 = this->data;\n\t\tsub2 = sub.data;\n\t\tif (sub1[0] != '-' && sub2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tsub2 = sub2.substr(1);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = getAdd(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] == '-' && sub2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tsub1 = sub1.substr(1);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = getAdd(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] != '-' && sub2[0] != '-') {\n\t\t\tminFlag = compare(sub1, sub2);\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = calculate(sub1, sub2);\n\t\t}\n\t\telse if (sub1[0] == '-' && sub2[0] == '-') {\n\t\t\tsub1 = sub1.substr(1);\n\t\t\tsub2 = sub2.substr(1);\n\t\t\tminFlag = compare(sub1, sub2) ? false : true;\n\t\t\tif (sub1 == sub2) {\n\t\t\t\tminFlag = false;\n\t\t\t}\n\t\t\treverse(sub1.begin(), sub1.end());\n\t\t\treverse(sub2.begin(), sub2.end());\n\t\t\tans.data = calculate(sub1, sub2);\n\t\t}\n\n\t\tif (minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\tBigData operator *(const BigData& mul) {\n\t\tstring mul1, mul2;\n\t\tBigData ans;\n\n\t\tmul1 = this->data;\n\t\tmul2 = mul.data;\n\t\tif (mul1[0] != '-' && mul2[0] != '-') {\n\t\t\tminFlag = false;\n\t\t}\n\t\telse if (mul1[0] == '-' && mul2[0] == '-') {\n\t\t\tminFlag = false;\n\t\t\tmul1 = mul1.substr(1);\n\t\t\tmul2 = mul2.substr(1);\n\t\t}\n\t\telse if (mul1[0] == '-' && mul2[0] != '-') {\n\t\t\tminFlag = true;\n\t\t\tmul1 = mul1.substr(1);\n\t\t}\n\t\telse if (mul1[0] != '-' && mul2[0] == '-') {\n\t\t\tminFlag = true;\n\t\t\tmul2 = mul2.substr(1);\n\t\t}\n\t\tif (mul1 == \"0\" || mul2 == \"0\") {\n\t\t\tans.data = \"0\";\n\t\t\treturn ans;\n\t\t}\n\n\t\treverse(mul1.begin(), mul1.end());\n\t\treverse(mul2.begin(), mul2.end());\n\t\tans.data = getMul(mul1, mul2);\n\n\t\tif (minFlag) {\n\t\t\tans.data += \"-\";\n\t\t}\n\t\treverse(ans.data.begin(), ans.data.end());\n\n\t\treturn ans;\n\t}\n\n\nprivate:\n\tstring data;\n\tbool minFlag;\n\n\tbool compare(string& d1, string& d2) {\n\t\tunsigned int len1, len2;\n\n\t\tlen1 = d1.size();\n\t\tlen2 = d2.size();\n\t\tif (len1 > len2) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (len1 < len2 || d1 < d2) {\n\t\t\td1.swap(d2);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tstring getAdd(string& add1, string& add2) {\n\t\tunsigned int len1, len2, i;\n\t\tint acc, sum;\n\t\tstringstream ss;\n\n\t\tlen1 = add1.size();\n\t\tlen2 = add2.size();\n\t\t//cout << add1 << endl << add2 << endl;\n\n\t\ti = 0;\n\t\tacc = 0;\n\t\tss.clear();\n\t\tss.str(\"\");\n\t\twhile (i < len1 && i < len2) {\n\t\t\tsum = (add1[i] - '0') + (add2[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len1) {\n\t\t\tsum = (add1[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len2) {\n\t\t\tsum = (add2[i] - '0') + acc;\n\t\t\tacc = sum / 10;\n\t\t\tsum %= 10;\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\tif (acc == 1) {\n\t\t\tss << 1;\n\t\t}\n\n\t\treturn ss.str();\n\t}\n\n\tstring getSub(string& sub1, string& sub2) {\n\t\tunsigned int len1, len2, i;\n\t\tint acc, sum;\n\t\tstringstream ss;\n\n\t\tlen1 = sub1.size();\n\t\tlen2 = sub2.size();\n\t\t//cout << sub1 << endl << sub2 << endl;\n\n\t\ti = 0;\n\t\tacc = 0;\n\t\tss.clear();\n\t\tss.str(\"\");\n\t\twhile (i < len1 && i < len2) {\n\t\t\tsum = (sub1[i] - '0') - acc - (sub2[i] - '0');\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len1) {\n\t\t\tsum = (sub1[i] - '0') - acc;\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\twhile (i < len2) {\n\t\t\tsum = (sub2[i] - '0') - acc;\n\t\t\tif (sum < 0) {\n\t\t\t\tacc = 1;\n\t\t\t\tsum += 10;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tacc = 0;\n\t\t\t}\n\t\t\tss << sum;\n\t\t\t++i;\n\t\t}\n\n\t\treturn ss.str();\n\t}\n\n\tstring calculate(string& data1, string& data2) {\n\t\tstring ans;\n\n\t\tans = getSub(data1, data2);\n\t\twhile (true) {\n\t\t\tauto it = ans.rbegin();\n\t\t\tif (ans.size() == 1 || *it != '0') {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tans.pop_back();\n\t\t}\n\t\treturn ans;\n\t}\n\n\tstring getMul(string& mul1, string& mul2) {\n\t\tunsigned int len1, len2;\n\t\tint acc, sum, base;\n\t\tstringstream ss;\n\t\tstring curSum;\n\n\t\tlen1 = mul1.size();\n\t\tlen2 = mul2.size();\n\t\t//cout << mul1 << endl << mul2 << endl;\n\n\t\tcurSum = \"\";\n\t\tfor (unsigned int i = 0; i < len2; ++i) {\n\t\t\tstring temp(\"\"), res(\"\");\n\t\t\tfor (unsigned int k = 0; k < i; ++k) {\n\t\t\t\ttemp += \"0\";\n\t\t\t}\n\t\t\tbase = mul2[i] - '0';\n\t\t\tacc = 0;\n\t\t\tss.clear();\n\t\t\tss.str(\"\");\n\t\t\tfor (unsigned int j = 0; j < len1; ++j) {\n\t\t\t\tsum = base * (mul1[j] - '0') + acc;\n\t\t\t\tacc = sum / 10;\n\t\t\t\tsum %= 10;\n\t\t\t\tss << sum;\n\t\t\t}\n\t\t\tif (acc != 0) {\n\t\t\t\tss << acc;\n\t\t\t}\n\t\t\tres = temp + ss.str();\n\t\t\t//cout << \"res=\" << res << endl;\n\t\t\tcurSum = getAdd(curSum, res);\n\t\t\t//cout << \"curSum=\" << curSum << endl;\n\t\t}\n\n\t\treturn curSum;\n\t}\n};\n\n\n\nint main(void) {\n\n\tios::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout.tie(NULL);\n\n\tBigData data1, data2;\n\n#ifdef InputOutputOperatorOverload\n\tcin >> data1 >> data2;\n\n\t//cout << \"data1=\" << data1 << endl << \"data2=\" << data2 << endl;\n\t//cout << data1 + data2 << endl;\n\t//cout << data1 - data2 << endl;\n\t//cout << data1 * data2 << endl;\n#else\n\tstring d1, d2;\n\tcin >> d1 >> d2;\n\tdata1.setValue(d1);\n\tdata2.setValue(d2);\n\n\t//cout << \"data1=\" << data1.getValue() << endl << \"data2=\" << data2.getValue() << endl;\n\t//cout << (data1 + data2).getValue() << endl;\n\t//cout << (data1 - data2).getValue() << endl;\n\tcout << (data1 * data2).getValue() << endl;\n#endif\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3504,"score_of_the_acc":-0.1512,"final_rank":9},{"submission_id":"aoj_NTL_2_C_4589998","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n//template\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(v) (v).begin(),(v).end()\ntypedef long long int ll;\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\n//end\n\ntemplate<typename T>struct FFT{\n struct C{\n T x,y;\n C(T _x=0,T _y=0):x(_x),y(_y){}\n C operator~()const{return {x,-y};}\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\n };\n vector<C> rt;\n FFT(int lg=20){\n rt.resize(1<<lg,1);\n rep(k,1,lg){\n int d=1<<k;\n rep(i,0,d){\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\n else rt[d+i]=rt[(d+i)>>1];\n }\n }\n }\n void fft(vector<C>& a,bool inv=0){\n int n=a.size(); assert((n&(n-1))==0);\n if(inv){\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\n }\n else{\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\n }\n }\n for(int i=0,j=1;j<n-1;j++){\n for(int k=n>>1;k>(i^=k);k>>=1);\n if(j<i)swap(a[i],a[j]);\n }\n }\n vector<ll> conv(vector<ll> a,vector<ll> b){\n if(a.empty() or b.empty())return vector<ll>();\n int n=a.size()+b.size()-1,m=1; vector<ll> res(n); while(m<n)m<<=1;\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\n fft(c); C rad(0,-0.25/m);\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\n c[i]=z;\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\n }\n};\n\nFFT<double> fft;\ntemplate<int D=4>struct bigint{\n int B,sign; vector<ll> v;\n bigint(ll x=0){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(x<0)x*=-1,sign=0;\n do{v.push_back(x%B); x/=B;\n }while(x);\n }\n bigint(string s){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(s[0]=='-')s.erase(s.begin()),sign=0;\n int add=0,cnt=0,base=1;\n while(s.size()){\n if(cnt==D){\n v.push_back(add);\n cnt=0; add=0; base=1;\n }\n add=(s.back()-'0')*base+add;\n cnt++; base*=10;\n s.pop_back();\n }\n if(add)v.push_back(add);\n }\n bigint operator-()const{\n bigint res=*this;\n res.sign^=1; return res;\n }\n bigint abs()const{\n bigint res=*this;\n res.sign=1; return res;\n }\n ll& operator[](const int i){return v[i];}\n int size()const{return v.size();}\n void norm(){\n rep(i,0,v.size()-1){\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\n else{\n int c=(-v[i]+B-1)/B;\n v[i]+=c*B; v[i+1]-=c;\n }\n }\n while(!v.empty() and v.back()>=B){\n int c=v.back()/B;\n v.back()%=B; v.push_back(c);\n }\n while(v.size()>1 and v.back()==0)v.pop_back();\n }\n friend istream& operator>>(istream& is,bigint<D>& x){\n string tmp; is>>tmp;\n x=bigint(tmp); return is;\n }\n friend ostream& operator<<(ostream& os,bigint<D> x){\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\"0\";\n else{\n if(!x.sign)os<<\"-\";\n string res=to_string(x.v.back());\n for(int i=x.size()-2;i>=0;i--){\n string add; int w=x[i];\n rep(_,0,D){\n add+=('0'+(w%10)); w/=10;\n } reverse(ALL(add)); res+=add;\n } os<<res;\n }\n return os;\n }\n bigint& operator+=(const bigint& x){\n if(sign!=x.sign){*this-=(-x); return *this;}\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\n rep(i,0,x.size())v[i]+=x.v[i];\n norm(); return *this;\n }\n bigint& operator-=(const bigint& x){\n if(sign!=x.sign){*this+=(-x); return *this;}\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\n rep(i,0,x.size())v[i]-=x.v[i];\n norm(); return *this;\n }\n bigint& operator*=(const bigint& x){\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\n norm(); return *this;\n } /*\n bigint& operator/=(const bigint& x){\n \n } */\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\n bool operator<(const bigint& x)const{\n if(sign!=x.sign)return sign<x.sign;\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\n return false;\n }\n bool operator>(const bigint& x)const{return x<*this;}\n bool operator<=(const bigint& x)const{return !(x>*this);}\n bool operator>=(const bigint& x)const{return !(x<*this);}\n};\ntypedef bigint<4> Bigint;\n\nint main(){\n Bigint x,y;\n cin>>x>>y;\n cout<<x*y<<endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":19040,"score_of_the_acc":-0.2056,"final_rank":10},{"submission_id":"aoj_NTL_2_C_4589996","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n//template\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(v) (v).begin(),(v).end()\ntypedef long long int ll;\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\n//end\n\ntemplate<typename T>struct FFT{\n struct C{\n T x,y;\n C(T _x=0,T _y=0):x(_x),y(_y){}\n C operator~()const{return {x,-y};}\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\n };\n vector<C> rt;\n FFT(int lg=20){\n rt.resize(1<<lg,1);\n rep(k,1,lg){\n int d=1<<k;\n rep(i,0,d){\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\n else rt[d+i]=rt[(d+i)>>1];\n }\n }\n }\n void fft(vector<C>& a,bool inv=0){\n int n=a.size(); assert((n&(n-1))==0);\n if(inv){\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\n }\n else{\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\n }\n }\n for(int i=0,j=1;j<n-1;j++){\n for(int k=n>>1;k>(i^=k);k>>=1);\n if(j<i)swap(a[i],a[j]);\n }\n }\n vector<int> conv(vector<int> a,vector<int> b){\n if(a.empty() or b.empty())return vector<int>();\n int n=a.size()+b.size()-1,m=1; vector<int> res(n); while(m<n)m<<=1;\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\n fft(c); C rad(0,-0.25/m);\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\n c[i]=z;\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\n }\n};\n\nFFT<double> fft;\ntemplate<int D=4>struct bigint{\n int B,sign; vector<int> v;\n bigint(ll x=0){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(x<0)x*=-1,sign=0;\n do{v.push_back(x%B); x/=B;\n }while(x);\n }\n bigint(string s){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(s[0]=='-')s.erase(s.begin()),sign=0;\n int add=0,cnt=0,base=1;\n while(s.size()){\n if(cnt==D){\n v.push_back(add);\n cnt=0; add=0; base=1;\n }\n add=(s.back()-'0')*base+add;\n cnt++; base*=10;\n s.pop_back();\n }\n if(add)v.push_back(add);\n }\n bigint operator-()const{\n bigint res=*this;\n res.sign^=1; return res;\n }\n bigint abs()const{\n bigint res=*this;\n res.sign=1; return res;\n }\n int& operator[](const int i){return v[i];}\n int size()const{return v.size();}\n void norm(){\n rep(i,0,v.size()-1){\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\n else{\n int c=(-v[i]+B-1)/B;\n v[i]+=c*B; v[i+1]-=c;\n }\n }\n if(!v.empty() and v.back()>=B){\n int c=v.back()/B;\n v.back()%=B; v.push_back(c);\n }\n while(v.size()>1 and v.back()==0)v.pop_back();\n }\n friend istream& operator>>(istream& is,bigint<D>& x){\n string tmp; is>>tmp;\n x=bigint(tmp); return is;\n }\n friend ostream& operator<<(ostream& os,bigint<D> x){\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\"0\";\n else{\n if(!x.sign)os<<\"-\";\n string res=to_string(x.v.back());\n for(int i=x.size()-2;i>=0;i--){\n string add; int w=x[i];\n rep(_,0,D){\n add+=('0'+(w%10)); w/=10;\n } reverse(ALL(add)); res+=add;\n } os<<res;\n }\n return os;\n }\n bigint& operator+=(const bigint& x){\n if(sign!=x.sign){*this-=(-x); return *this;}\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\n rep(i,0,x.size())v[i]+=x.v[i];\n norm(); return *this;\n }\n bigint& operator-=(const bigint& x){\n if(sign!=x.sign){*this+=(-x); return *this;}\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\n rep(i,0,x.size())v[i]-=x.v[i];\n norm(); return *this;\n }\n bigint& operator*=(const bigint& x){\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\n norm(); return *this;\n } /*\n bigint& operator/=(const bigint& x){\n \n } */\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\n bool operator<(const bigint& x)const{\n if(sign!=x.sign)return sign<x.sign;\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\n return false;\n }\n bool operator>(const bigint& x)const{return x<*this;}\n bool operator<=(const bigint& x)const{return !(x>*this);}\n bool operator>=(const bigint& x)const{return !(x<*this);}\n};\ntypedef bigint<4> Bigint;\n\nint main(){\n Bigint x,y;\n cin>>x>>y;\n cout<<x*y<<endl;\n return 0;\n}","accuracy":0.64,"time_ms":20,"memory_kb":19040,"score_of_the_acc":-0.2056,"final_rank":18},{"submission_id":"aoj_NTL_2_C_4589990","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\n//template\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(v) (v).begin(),(v).end()\ntypedef long long int ll;\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\n//end\n\ntemplate<typename T>struct FFT{\n struct C{\n T x,y;\n C(T _x=0,T _y=0):x(_x),y(_y){}\n C operator~()const{return {x,-y};}\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\n };\n vector<C> rt;\n FFT(int lg=20){\n rt.resize(1<<lg,1);\n rep(k,1,lg){\n int d=1<<k;\n rep(i,0,d){\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\n else rt[d+i]=rt[(d+i)>>1];\n }\n }\n }\n void fft(vector<C>& a,bool inv=0){\n int n=a.size(); assert((n&(n-1))==0);\n if(inv){\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\n }\n else{\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\n C tmp=a[j+k]-a[i+j+k];\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\n }\n }\n for(int i=0,j=1;j<n-1;j++){\n for(int k=n>>1;k>(i^=k);k>>=1);\n if(j<i)swap(a[i],a[j]);\n }\n }\n vector<int> conv(vector<int> a,vector<int> b){\n int n=a.size()+b.size()-1,m=1; vector<int> res(n); while(m<n)m<<=1;\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\n fft(c); C rad(0,-0.25/m);\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\n c[i]=z;\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\n }\n};\n\nFFT<double> fft;\ntemplate<int D=4>struct bigint{\n int B,sign; vector<int> v;\n bigint(ll x=0){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(x<0)x*=-1,sign=0;\n do{v.push_back(x%B); x/=B;\n }while(x);\n }\n bigint(string s){\n B=1; rep(_,0,D)B*=10; sign=1;\n if(s[0]=='-')s.erase(s.begin()),sign=0;\n int add=0,cnt=0,base=1;\n while(s.size()){\n if(cnt==D){\n v.push_back(add);\n cnt=0; add=0; base=1;\n }\n add=(s.back()-'0')*base+add;\n cnt++; base*=10;\n s.pop_back();\n }\n if(add)v.push_back(add);\n }\n bigint operator-()const{\n bigint res=*this;\n res.sign^=1; return res;\n }\n bigint abs()const{\n bigint res=*this;\n res.sign=1; return res;\n }\n int& operator[](const int i){return v[i];}\n int size()const{return v.size();}\n void norm(){\n rep(i,0,v.size()-1){\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\n else{\n int c=(-v[i]+B-1)/B;\n v[i]+=c*B; v[i+1]-=c;\n }\n }\n if(!v.empty() and v.back()>=B){\n int c=v.back()/B;\n v.back()%=B; v.push_back(c);\n }\n while(v.size()>1 and v.back()==0)v.pop_back();\n }\n friend istream& operator>>(istream& is,bigint<D>& x){\n string tmp; is>>tmp;\n x=bigint(tmp); return is;\n }\n friend ostream& operator<<(ostream& os,bigint<D> x){\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\"0\";\n else{\n if(!x.sign)os<<\"-\";\n string res=to_string(x.v.back());\n for(int i=x.size()-2;i>=0;i--){\n string add; int w=x[i];\n rep(_,0,D){\n add+=('0'+(w%10)); w/=10;\n } reverse(ALL(add)); res+=add;\n } os<<res;\n }\n return os;\n }\n bigint& operator+=(const bigint& x){\n if(sign!=x.sign){*this-=(-x); return *this;}\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\n rep(i,0,x.size())v[i]+=x.v[i];\n norm(); return *this;\n }\n bigint& operator-=(const bigint& x){\n if(sign!=x.sign){*this+=(-x); return *this;}\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\n rep(i,0,x.size())v[i]-=x.v[i];\n norm(); return *this;\n }\n bigint& operator*=(const bigint& x){\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\n norm(); return *this;\n } /*\n bigint& operator/=(const bigint& x){\n \n } */\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\n bool operator<(const bigint& x)const{\n if(sign!=x.sign)return sign<x.sign;\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\n return false;\n }\n bool operator>(const bigint& x)const{return x<*this;}\n bool operator<=(const bigint& x)const{return !(x>*this);}\n bool operator>=(const bigint& x)const{return !(x<*this);}\n};\ntypedef bigint<4> Bigint;\n\nint main(){\n Bigint x,y;\n cin>>x>>y;\n cout<<x*y<<endl;\n return 0;\n}","accuracy":0.08,"time_ms":20,"memory_kb":19008,"score_of_the_acc":-0.2053,"final_rank":19},{"submission_id":"aoj_NTL_2_C_4498645","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nstruct fast_io {\n\tfast_io(){\n\t\tstd::cin.tie(nullptr);\n\t\tstd::ios::sync_with_stdio(false);\n\t};\n} fio;\n\nclass Karatsuba{\n\tint base = 10; // base > 1\n\tvector<int> num;\n\tbool sign; // true : + false : -\n\t\npublic:\n\t\n\tKaratsuba(){\n\t\tsign = false;\n\t\tnum.push_back(0);\n\t}\n\t\n\tKaratsuba(size_t size){\n\t\tsign = false;\n\t\tnum.resize(size);\n\t}\n\t\n\t~Karatsuba(){\n\t}\n\t\n\tKaratsuba operator+(const Karatsuba &k) const {\n\t\tKaratsuba res;\n\t\t\n\t\tif(k.sign^sign) {\n\t\t\tint maxs = max(k.num.size(), num.size());\n\t\t\tbool com = true; // num >= k.num\n\t\t\tint index = -1;\n\t\t\t\n\t\t\tfor(int i = maxs-1; i >= 0; i--){\n\t\t\t\tint a = 0, b = 0;\n\t\t\t\tif(i < num.size()) a = num[i];\n\t\t\t\tif(i < k.num.size()) b = k.num[i];\n\t\t\t\t\n\t\t\t\tif(a < b) {\n\t\t\t\t\tcom = false;\n\t\t\t\t\tindex = i;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if(a > b) {\n\t\t\t\t\tcom = true;\n\t\t\t\t\tindex = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(index == -1){\n\t\t\t\tres.sign = false;\n\t\t\t\tres.num.push_back(0);\n\t\t\t} else if(com) {\n\t\t\t\tres.num.resize(index+1);\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i <= index; i++){\n\t\t\t\t\tif(i < num.size()) res.num[i] += num[i];\n\t\t\t\t\tif(i < k.num.size()) res.num[i] -= k.num[i];\n\t\t\t\t\t\n\t\t\t\t\tif(res.num[i] < 0) {\n\t\t\t\t\t\tres.num[i] += base;\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor(int j = i+1; ; j++){\n\t\t\t\t\t\t\tif(num[j]) {\n\t\t\t\t\t\t\t\tres.num[j]--;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tres.num[j] = base-1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(sign == true) res.sign = true;\n\t\t\t} else {\n\t\t\t\tres.num.resize(index+1);\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i <= index; i++){\n\t\t\t\t\tif(i < num.size()) res.num[i] -= num[i];\n\t\t\t\t\tif(i < k.num.size()) res.num[i] += k.num[i];\n\t\t\t\t\t\n\t\t\t\t\tif(res.num[i] < 0) {\n\t\t\t\t\t\tres.num[i] += base;\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor(int j = i+1; ; j++){\n\t\t\t\t\t\t\tif(k.num[j]) {\n\t\t\t\t\t\t\t\tres.num[j]--;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tres.num[j] = base-1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(k.sign == true) res.sign = true;\n\t\t\t}\n\t\t\t\n\t\t\twhile(res.num.back() == 0 && res.num.size() >= 2){\n\t\t\t\tres.num.pop_back();\n\t\t\t}\n\t\t\t\n\t\t} else {\n\t\t\tres.num.resize(max(k.num.size(), num.size()));\n\t\t\tres.sign = sign;\n\t\t\t\n\t\t\tfor(int i = 0; i < res.num.size(); i++){\n\t\t\t\tif(i < k.num.size()) res.num[i] += k.num[i];\n\t\t\t\tif(i < num.size()) res.num[i] += num[i];\n\t\t\t\tif(res.num[i] >= base) {\n\t\t\t\t\tif(i + 1 == res.num.size()) {\n\t\t\t\t\t\tres.num.push_back(1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tres.num[i+1] += 1;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tres.num[i] %= base;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn res;\n\t}\n\t\n\tKaratsuba operator-(const Karatsuba &k) const {\n\t\tKaratsuba res;\n\t\t\n\t\tif(k.sign^sign^1) {\n\t\t\tint maxs = max(k.num.size(), num.size());\n\t\t\tbool com = true; // num >= k.num\n\t\t\tint index = -1;\n\t\t\t\n\t\t\tfor(int i = maxs-1; i >= 0; i--){\n\t\t\t\tint a = 0, b = 0;\n\t\t\t\tif(i < num.size()) a = num[i];\n\t\t\t\tif(i < k.num.size()) b = k.num[i];\n\t\t\t\t\n\t\t\t\tif(a < b) {\n\t\t\t\t\tcom = false;\n\t\t\t\t\tindex = i;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if(a > b) {\n\t\t\t\t\tcom = true;\n\t\t\t\t\tindex = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(index == -1){\n\t\t\t\tres.sign = false;\n\t\t\t\tres.num.push_back(0);\n\t\t\t} else if(com) {\n\t\t\t\tres.num.resize(index+1);\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i <= index; i++){\n\t\t\t\t\tif(i < num.size()) res.num[i] += num[i];\n\t\t\t\t\tif(i < k.num.size()) res.num[i] -= k.num[i];\n\t\t\t\t\t\n\t\t\t\t\tif(res.num[i] < 0) {\n\t\t\t\t\t\tres.num[i] += base;\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor(int j = i+1; ; j++){\n\t\t\t\t\t\t\tif(num[j]) {\n\t\t\t\t\t\t\t\tres.num[j]--;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tres.num[j] = base-1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(sign == true) res.sign = true;\n\t\t\t} else {\n\t\t\t\tres.num.resize(index+1);\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i <= index; i++){\n\t\t\t\t\tif(i < num.size()) res.num[i] -= num[i];\n\t\t\t\t\tif(i < k.num.size()) res.num[i] += k.num[i];\n\t\t\t\t\t\n\t\t\t\t\tif(res.num[i] < 0) {\n\t\t\t\t\t\tres.num[i] += base;\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor(int j = i+1; ; j++){\n\t\t\t\t\t\t\tif(k.num[j]) {\n\t\t\t\t\t\t\t\tres.num[j]--;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tres.num[j] = base-1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(k.sign == false) res.sign = true;\n\t\t\t}\n\t\t\t\n\t\t\twhile(res.num.back() == 0 && res.num.size() >= 2){\n\t\t\t\tres.num.pop_back();\n\t\t\t}\n\t\t\t\n\t\t} else {\n\t\t\tres.num.resize(max(k.num.size(), num.size()));\n\t\t\tres.sign = sign;\n\t\t\t\n\t\t\tfor(int i = 0; i < res.num.size(); i++){\n\t\t\t\tif(i < k.num.size()) res.num[i] += k.num[i];\n\t\t\t\tif(i < num.size()) res.num[i] += num[i];\n\t\t\t\tif(res.num[i] >= base) {\n\t\t\t\t\tif(i + 1 == res.num.size()) {\n\t\t\t\t\t\tres.num.push_back(1);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tres.num[i+1] += 1;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tres.num[i] %= base;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn res;\n\t}\n\t\n\tKaratsuba operator*(const Karatsuba &k) const {\n\t\tKaratsuba res;\n\t\t\n\t\tint maxs = max(k.num.size(), num.size());\n\t\t\n\t\tres.sign = sign^k.sign;\n\t\t\n\t\tif(maxs <= 1) {\n\t\t\tint z0;\n\t\t\tres.num.resize(1,0);\n\t\t\tz0 = num[0] * k.num[0];\n\t\t\tres.num[0] = z0 % base;\n\t\t\tif(z0/base) res.num.push_back(z0/base);\n\t\t} else {\n\t\t\tint b = (maxs+1)/2;\n\t\t\tKaratsuba z0, z1, z2;\n\t\t\tKaratsuba x0(b), x1, y0(b), y1;\n\t\t\t\n\t\t\tif(num.size() <= b) x1.resize(1);\n\t\t\telse x1.resize(b);\n\t\t\t\n\t\t\tif(k.num.size() <= b) y1.resize(1);\n\t\t\telse y1.resize(b);\n\t\t\t\n\t\t\tfor(int i = 0; i < b; i++){\n\t\t\t\tif(i < num.size()) x0.num[i] = num[i];\n\t\t\t\tif(i < k.num.size()) y0.num[i] = k.num[i];\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i = b; i < 2*b; i++){\n\t\t\t\tif(i < num.size()) x1.num[i-b] = num[i];\n\t\t\t\tif(i < k.num.size()) y1.num[i-b] = k.num[i];\n\t\t\t}\n\t\t\t\n\t\t\twhile(x0.num.back() == 0 && x0.num.size() >= 2){\n\t\t\t\tx0.num.pop_back();\n\t\t\t}\n\t\t\twhile(x1.num.back() == 0 && x1.num.size() >= 2){\n\t\t\t\tx1.num.pop_back();\n\t\t\t}\n\t\t\twhile(y0.num.back() == 0 && y0.num.size() >= 2){\n\t\t\t\ty0.num.pop_back();\n\t\t\t}\n\t\t\twhile(y1.num.back() == 0 && y1.num.size() >= 2){\n\t\t\t\ty1.num.pop_back();\n\t\t\t}\n\t\t\t\n\t\t\tz2 = x1 * y1;\n\t\t\tz0 = x0 * y0;\n\t\t\tz1 = z2 + z0 - (x1 - x0) * (y1 - y0);\n\t\t\t\n\t\t\tres.resize(max({z0.size(), z1.size()+b, z2.size()+b*2}));\n\t\t\t\n\t\t\tfor(int i = 0; i < res.size(); i++){\n\t\t\t\tif(i < z0.size()) res.num[i] += z0.num[i];\n\t\t\t\tif(i >= b && i-b < z1.size()) res.num[i] += z1.num[i-b];\n\t\t\t\tif(i >= 2*b && i-b*2 < z2.size()) res.num[i] += z2.num[i-b*2];\n\t\t\t\t\n\t\t\t\tif(res.num[i] >= base) {\n\t\t\t\t\tif(i + 1 < res.num.size()) {\n\t\t\t\t\t\tres.num[i+1] += res.num[i] / base;\n\t\t\t\t\t\tres.num[i] %= base;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tres.num.push_back(res.num[i] / base);\n\t\t\t\t\t\tres.num[i] %= base;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\twhile(res.num.back() == 0 && res.num.size() >= 2){\n\t\t\t\tres.num.pop_back();\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(res.num.size() == 1 && res.num[0] == 0) res.sign = false;\n\t\t\n\t\treturn res;\n\t}\n\t\n\t\n\tKaratsuba& operator=(const Karatsuba& k) & {\n\t\tthis->num = k.num;\n\t\tthis->sign = k.sign;\n\t\t\n\t\treturn *this;\n\t}\n\t\n\tbool operator<(const Karatsuba &k) const {\n\t\tif(k.sign^sign) {\n\t\t\tif(sign == false) return false;\n\t\t\tif(k.sign == false) return true;\n\t\t} else if(sign){\n\t\t\tif(num.size() > k.num.size()) return true;\n\t\t\tif(num.size() < k.num.size()) return false;\n\t\t\t\n\t\t\tfor(int i = (int)num.size()-1; i >= 0; i--){\n\t\t\t\tint a = num[i];\n\t\t\t\tint b = k.num[i];\n\t\t\t\t\n\t\t\t\tif(b < a) {\n\t\t\t\t\treturn true;\n\t\t\t\t} else if(b > a) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tif(num.size() > k.num.size()) return false;\n\t\t\tif(num.size() < k.num.size()) return true;\n\t\t\t\n\t\t\tfor(int i = (int)num.size()-1; i >= 0; i--){\n\t\t\t\tint a = num[i];\n\t\t\t\tint b = k.num[i];\n\t\t\t\t\n\t\t\t\tif(b < a) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else if(b > a) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\n\tsize_t size() const {\n\t\treturn num.size();\n\t}\n\t\n\tvoid resize(size_t size) {\n\t\tnum.resize(size);\n\t}\n\t\n\t\n\tstring to_string() const {\n\t\tstring res;\n\t\t\n\t\tif(sign == true) res += \"-\";\n\t\t\n\t\tfor(int i = (int)num.size()-1; i >= 0; i--){\n\t\t\tres += '0' + num[i];\n\t\t}\n\t\t\n\t\treturn res;\n\t}\n\t\n\tvoid string_to(string s){\n\t\tint b = 0;\n\t\t\n\t\tsign = false;\n\t\t\n\t\tif(s[0] == '-') {\n\t\t\tsign = true;\n\t\t\tb++;\n\t\t}\n\t\t\n\t\tnum.clear();\n\t\t\n\t\tfor(int i = (int)s.size()-1; i >= b; i--){\n\t\t\tnum.push_back(s[i] - '0');\n\t\t}\n\t\t\n\t\twhile(num.back() == 0 && num.size() >= 1){\n\t\t\tnum.pop_back();\n\t\t}\n\t\n\t\tif(num.size() == 0) {\n\t\t\tsign = false;\n\t\t\tnum.push_back(0);\n\t\t}\n\t}\n};\n\nstd::ostream& operator<<(std::ostream& lhs, const Karatsuba& rhs) {\n\t\n\tlhs << rhs.to_string();\n\treturn lhs;\n}\n\nstd::istream& operator>>(std::istream& lhs, Karatsuba& rhs) {\n\tstring str;\n\t\n\tcin>>str;\n\t\n\trhs.string_to(str);\n\t\n\treturn lhs;\n}\n\nsigned main(){\n\t\n\tKaratsuba a, b;\n\t\n\tcin>>a>>b;\n\t\n\tcout<<a * b<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3304,"score_of_the_acc":-0.0379,"final_rank":5},{"submission_id":"aoj_NTL_2_C_4446987","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nvector<int> stoa(string const& s){\n vector<int> a(s.size());\n for(int i=(s[0]=='-'?1:0);i<s.size();++i){\n a[i] = s[i]-'0';\n }\n return a;\n}\nstring atos(vector<int> const& a){\n string s;\n for(auto ai:a)s+=(ai+'0');\n return s;\n}\n\nstring product(string const& lhs,string const& rhs){\n if(lhs==\"0\"||rhs==\"0\")return \"0\";\n string sign = (lhs[0]=='-'^rhs[0]=='-'?\"-\":\"\");\n auto a = stoa(lhs);\n reverse(a.begin(),a.end());\n auto b = stoa(rhs);\n reverse(b.begin(),b.end());\n int n = a.size();\n int m = b.size();\n vector<vector<int>> tmp(m,vector<int>(n+m));\n for(int i=0;i<n;++i){\n for(int j=0;j<m;++j){\n tmp[j][i+j] += a[i]*b[j]%10;\n tmp[j][i+j+1] += a[i]*b[j]/10;\n }\n }\n vector<int> res(n+m+1);\n for(int i=0;i<n+m;++i){\n for(int j=0;j<m;++j){\n res[i] += tmp[j][i];\n res[i+1] += res[i]/10;\n res[i] %= 10;\n }\n }\n while(res.size()>1&&res.back()==0)res.pop_back();\n reverse(res.begin(),res.end());\n return sign+atos(res);\n}\n\nsigned main(){\n\n string a,b;\n cin>>a>>b;\n\n cout<<product(a,b)<<endl;\n\n}","accuracy":1,"time_ms":10,"memory_kb":10796,"score_of_the_acc":-0.0807,"final_rank":8},{"submission_id":"aoj_NTL_2_C_4375298","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(long long i=0; i<(n); i++)\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\n\nbool compare(string a, string b) {\n if (a.size() > b.size()) return true;\n else if (a.size() < b.size()) return false;\n else {\n for (long long i = 0; i < a.size(); i++) {\n if (a[i] > b[i]) return true;\n else if (a[i] < b[i]) return false;\n }\n }\n return true;\n}\n\n\nstring add(string a, string b) {\n bool x = false, y = false;\n if (a[0] == '-') x = true;\n if (b[0] == '-') y = true;\n\n if (x && y) return '-' + add(a.substr(1, a.size()-1), b.substr(1, b.size()-1));\n else if (x) return add(b, a);\n // 'a - b' or 'a + b'\n\n if (y) b = b.substr(1, b.size()-1);\n if (y && !compare(a, b)) {\n return '-' + add(b, '-' + a);\n }\n\n reverse(a.begin(), a.end());\n reverse(b.begin(), b.end());\n\n string res = \"\";\n long long up = 0;\n\n for (long long i = 0; i < max(a.size(), b.size()); i++) {\n long long tmp = up;\n if (i < a.size()) {\n tmp += (a[i] - '0');\n }\n if (i < b.size() && b[i] != '-') {\n if (y) tmp -= (b[i] - '0');\n else tmp += (b[i] - '0');\n }\n\n if (tmp < 0) {\n res.push_back((10 + tmp) + '0');\n up = -1;\n }\n else if (tmp > 9) {\n res.push_back((tmp - 10) + '0');\n up = 1;\n }\n else {\n res.push_back(tmp + '0');\n up = 0;\n }\n }\n\n if (up > 0) res.push_back(up + '0');\n\n reverse(res.begin(), res.end());\n\n long long begin = 0;\n while (res[begin] == '0') begin++;\n \n if (res.size() == begin) return \"0\";\n else return res.substr(begin, res.size() - begin);\n}\n\nstring mult(string a, string b) {\n if (a == \"0\" || b == \"0\") return \"0\";\n string res = \"0\";\n bool ifminus = false;\n if (a[0] == '-' && b[0] == '-') return mult(a.substr(1, a.size()-1), b.substr(1, b.size()-1));\n else if (a[0] == '-') return '-' + mult(a.substr(1, a.size()-1), b);\n else if (b[0] == '-') return '-' + mult(a, b.substr(1, b.size()-1));\n\n reverse(b.begin(), b.end());\n\n for (long long i = 0; i < b.size(); i++) {\n string tmp = \"0\";\n for (long long j = 0; j < (b[i] - '0'); j++) {\n tmp = add(tmp, a);\n }\n for (long long j = 0; j < i; j++) {\n tmp = tmp + '0';\n }\n res = add(res, tmp);\n }\n\n return res;\n}\n\n\nint main(){\n string a, b;\n cin >> a >> b;\n cout << mult(a, b) << endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3220,"score_of_the_acc":-0.2593,"final_rank":12},{"submission_id":"aoj_NTL_2_C_4289840","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n\nstring fixedNum( string a )\n{\n if( a.size() == 1 )\n return a;\n for( int i = 0; i < a.size(); i++ )\n if( '1'<= a[i] && a[i] <= '9' )\n return a.substr( i, a.size() );\n return \"0\";\n}\n\nstring calcAddition( string a, string b )\n{\n a = fixedNum(a); b = fixedNum(b);\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\n string s = \"0\", t = \"0\";\n for( int i = 0; i < d; i++ )\n as > bs ? t += \"0\" : s += \"0\";\n s += a; t += b;\n\n for( int i = s.size() - 1; i >= 1; i-- )\n {\n s[i] += t[i] - '0';\n if( s[i] > '9' )\n {\n s[i] -= 10;\n s[i-1]++;\n }\n }\n\n return s[0] == '0' ? s.substr( 1, s.size() ) : s;\n}\n\nstring calcMultiplication( string a, string b )\n{\n a = fixedNum(a); b = fixedNum(b);\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\n string s = \"0\", t = \"0\", x = \"\", sum = \"\", zero = \"\", digit = \"\";\n for( int i = 0; i < d; i++ )\n as > bs ? t += \"0\" : s += \"0\";\n s += a; t += b;\n\n for( int i = 0; i < s.size(); i++ )\n zero += \"0\";\n \n x = zero;\n sum = zero;\n\n for( int i = s.size() - 1; i >= 1; i-- )\n {\n for( int j = s.size() - 1; j >= 1; j-- )\n x[j] = ( t[i] - '0' ) * ( s[j] - '0' );\n for( int j = s.size() - 1; j >= 1; j-- )\n {\n int f = x[j] / 10;\n x[j-1] += f;\n x[j] = x[j] - 10 * f + '0';\n }\n x += digit;\n sum = calcAddition( x, sum );\n digit += \"0\";\n x = zero;\n }\n return sum;\n}\n\nint main()\n{\n string a, b;\n\n cin >> a >> b;\n\n int as = a.size(), bs = b.size();\n string s = a.substr( 1, as ), t = b.substr( 1, bs );\n\n if( a[0] == '-' && b[0] == '-' )\n cout << calcMultiplication( s, t ) << endl;\n else if( a[0] >= '0' && b[0] >= '0' )\n cout << calcMultiplication( a, b ) << endl;\n else\n {\n if( a == \"0\" || b == \"0\" )\n cout << \"0\" << endl;\n else if( a[0] == '-' )\n cout << '-' << calcMultiplication( s, b ) << endl;\n else\n cout << '-' << calcMultiplication( a, t ) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.0001,"final_rank":1},{"submission_id":"aoj_NTL_2_C_3619231","code_snippet":"// includes\n#include <bits/stdc++.h>\n\n// macros\n#define ll long long int\n#define pb emplace_back\n#define mk make_pair\n#define pq priority_queue\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define rep(i, n) FOR(i, 0, n)\n#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)\n#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)\n#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)\n#define vrep(v, i) for(int i = 0; i < (v).size(); i++)\n#define all(x) (x).begin(),(x).end()\n#define sz(x) ((int)(x).size())\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\n#define FI first\n#define SE second\n#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << \"\\n \"[i + 1 != n];\n#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << \"\\n \"[j + 1 != m];\n#define bit(n) (1LL<<(n))\n#define INT(n) int n; cin >> n;\n#define LL(n) ll n; cin >> n;\n#define DOUBLE(n) double n; cin >> n;\nusing namespace std;\n\n// types\ntypedef pair<int, int> P;\ntypedef pair<ll, int> Pl;\ntypedef pair<ll, ll> Pll;\ntypedef pair<double, double> Pd;\ntypedef complex<double> cd;\n \n// constants\nconst int inf = 1e9;\nconst ll linf = 1LL << 50;\nconst double EPS = 1e-10;\nconst int mod = 1e9 + 7;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n\n// solve\ntemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}\ntemplate <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \" \";} return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << \" \" << p.second; return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \":\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \" \"; } return os;}\n\ntemplate <typename T>\nT power(T a, T n, T mod) {\n T res = 1;\n T tmp = n;\n T curr = a;\n while(tmp){\n if(tmp % 2 == 1){\n res = (T)((ll)res * curr % mod);\n }\n curr = (T)((ll)curr * curr % mod);\n tmp >>= 1;\n }\n return res;\n}\n\ntemplate<typename T>\nT extgcd(T a, T b, T &x, T &y){\n T d = a;\n if(b != 0){\n d = extgcd(b, a % b, y, x);\n y -= (a / b) * x;\n }else{\n x = 1, y = 0;\n }\n return d;\n}\n\ntemplate <typename T>\nT modinv(T a, T m){\n long long x = 0, y = 0;\n extgcd<long long>(a, m, x, y);\n x %= m;\n if(x < 0)x += m;\n return x;\n}\n\ntemplate <typename T>\nlong long garner(vector<T> b, vector<T> m, T MOD){\n m.emplace_back(MOD);\n vector<long long> coef(m.size(), 1);\n vector<long long> consts(m.size(), 0);\n for(int i = 0; i < b.size(); i++){\n long long t = ((b[i] - consts[i]) % m[i]) * modinv<long long>(coef[i], m[i]) % m[i];\n for(int j = i + 1; j < m.size(); j++){\n consts[j] = (consts[j] + t * coef[j] % m[j]) % m[j];\n coef[j] = coef[j] * m[i] % m[j];\n }\n }\n return consts.back();\n}\n\ntemplate <int MOD, int g>\nstruct NTT{\n int get_mod(){\n return MOD;\n }\n void _ntt(vector<long long> &f, bool inv=false){\n int n = f.size(), mask = n - 1;\n int h = power<long long>(g, (MOD - 1) / n, MOD);\n if(inv)h = modinv(h, MOD);\n vector<long long> tmp(n);\n for(int i = n >> 1; i >= 1; i >>= 1){\n long long zeta = power<long long>(h, i, MOD);\n long long w = 1;\n for(int j = 0; j < n; j += i){\n for(int k = 0; k < i; k++){\n tmp[j+k] = (f[((j<<1)&mask)+k] + w * f[(((j<<1)+i)&mask)+k] % MOD) % MOD;\n }\n w = w * zeta % MOD;\n }\n swap(f, tmp);\n }\n }\n void ntt(vector<long long> &f){\n _ntt(f, false);\n }\n void intt(vector<long long> &f){\n _ntt(f, true);\n int n = f.size();\n int ni = modinv(n, MOD);\n for(int i = 0; i < n; i++)f[i] = f[i] * ni % MOD;\n }\n vector<long long> convolution(vector<long long> f, vector<long long> h){\n int n = 1;\n while(n < int(f.size() + h.size()))n *= 2;\n f.resize(n, 0); h.resize(n, 0);\n ntt(f);\n ntt(h);\n for(int i = 0; i < n; i++)f[i] = f[i] * h[i] % MOD;\n intt(f);\n return f;\n }\n};\n\nusing NTT1 = NTT<167772161, 3>;\nusing NTT2 = NTT<469762049, 3>;\nusing NTT3 = NTT<1224736769, 3>;\n\nvector<long long> arbitrary_mod_convolution(vector<long long> f, vector<long long> g, long long MOD){\n for(size_t i = 0; i < f.size(); i++)f[i] %= MOD;\n for(size_t i = 0; i < g.size(); i++)g[i] %= MOD;\n NTT1 ntt1;\n NTT2 ntt2;\n NTT3 ntt3;\n auto x1 = ntt1.convolution(f, g);\n auto x2 = ntt2.convolution(f, g);\n auto x3 = ntt3.convolution(f, g);\n\n vector<long long> res(x1.size());\n vector<long long> b(3), m(3);\n m[0] = ntt1.get_mod();\n m[1] = ntt2.get_mod();\n m[2] = ntt3.get_mod();\n for(size_t i = 0; i < x1.size(); i++){\n b[0] = x1[i];\n b[1] = x2[i];\n b[2] = x3[i];\n res[i] = garner<long long>(b, m, MOD);\n }\n return res;\n}\n\nconst ll B = 10000;\nconst int BW = 4;\nstruct BigInt{\n vector<ll> digit;\n BigInt(ll a = 0){\n digit.emplace_back(a);\n normalize();\n }\n BigInt(const string &s){\n from_string(s);\n }\n void from_string(const string &s){\n digit.clear();\n int i;\n for(i = (int)s.size() - BW; i >= 0; i-=BW){\n digit.emplace_back(stol(s.substr(i, BW)));\n }\n i += BW;\n if(i > 0)digit.emplace_back(stol(s.substr(0, i)));\n }\n void normalize(){\n ll c = 0;\n for(int i = 0; i < digit.size(); i++){\n while(digit[i] < 0){\n if(i + 1 == digit.size())digit.emplace_back(0);\n digit[i+1]--;\n digit[i] += B;\n }\n ll a = digit[i] + c;\n digit[i] = a % B;\n c = a / B;\n }\n while(c){\n digit.emplace_back(c % B);\n c /= B;\n }\n for(int i = (int)digit.size() - 1; i >= 1; i--){\n if(digit[i] == 0){\n digit.pop_back();\n }else{\n break;\n }\n }\n }\n size_t size(){\n return digit.size();\n }\n BigInt& operator=(ll a){\n digit.resize(1, a);\n normalize();\n return *this;\n }\n BigInt& operator=(const string &s){\n from_string(s);\n return *this;\n }\n} ZERO(0), ONE(1);\n\nostream &operator<<(ostream &os, const BigInt &b){\n os << b.digit[b.digit.size() - 1];\n for(int i = (int)b.digit.size() - 2; i >= 0; i--){\n os << setw(BW) << setfill('0') << b.digit[i];\n }\n return os;\n}\n\nistream & operator>>(istream &is, BigInt &b){\n string s;\n is >> s;\n b.from_string(s);\n return is;\n}\n\nbool operator<(const BigInt &x, const BigInt &y){\n if(x.digit.size() != y.digit.size())return x.digit.size() < y.digit.size();\n for(int i = x.digit.size() - 1; i >= 0; i--){\n if(x.digit[i] != y.digit[i])return x.digit[i] < y.digit[i];\n }\n return false;\n}\n\nbool operator>(const BigInt &x, const BigInt y){\n return y < x;\n}\n\nbool operator<=(const BigInt &x, const BigInt &y){\n return !(y < x);\n}\n\nbool operator>=(const BigInt &x, const BigInt &y){\n return !(x < y);\n}\n\nbool operator!=(const BigInt &x, const BigInt &y){\n return x < y || y < x;\n}\n\nbool operator==(const BigInt &x, const BigInt &y){\n return !(x < y) && !(y < x);\n}\n\nBigInt operator+(const BigInt &x, ll a){\n BigInt res = x;\n res.digit[0] += a;\n res.normalize();\n return res;\n}\n\nBigInt operator+(const BigInt &x, const BigInt &y){\n BigInt res = x;\n while(res.digit.size() < y.digit.size())res.digit.emplace_back(0);\n for(int i = 0; i < y.digit.size(); i++)res.digit[i] += y.digit[i];\n res.normalize();\n return res;\n}\n\nBigInt operator-(const BigInt &x, const BigInt &y){\n BigInt res = x;\n assert(res.digit.size() >= y.digit.size());\n for(int i = 0; i < y.digit.size(); i++)res.digit[i] -= y.digit[i];\n res.normalize();\n return res;\n}\n\nBigInt operator*(const BigInt &x, const BigInt &y){\n BigInt z;\n //NTT3 ntt;\n vector<long long> xc = x.digit, yc = y.digit;\n /*z.digit.assign(x.digit.size() + y.digit.size(), 0);\n for(int i = 0; i < x.digit.size(); i++){\n for(int j = 0; j < y.digit.size(); j++){\n z.digit[i+j] += x.digit[i] * y.digit[j];\n }\n }*/\n //z.digit = ntt.convolution(xc, yc);\n z.digit = arbitrary_mod_convolution(xc, yc, (ll)mod * 10);\n z.normalize();\n return z;\n}\n\nBigInt operator*(const BigInt &x, ll a){\n BigInt res = x;\n for(int i = 0; i < res.digit.size(); i++)res.digit[i] *= a;\n res.normalize();\n return res;\n}\n\npair<BigInt, ll> divmod(const BigInt &x, ll a){\n ll c = 0;\n BigInt res = x;\n for(int i = (int)res.digit.size() - 1; i >= 0; i--){\n ll t = B * c + res.digit[i];\n res.digit[i] = t / a;\n c = t % a;\n }\n res.normalize();\n return make_pair(res, c);\n}\n\nBigInt operator/(const BigInt &x, ll a){\n return divmod(x, a).first;\n}\n\nBigInt operator%(const BigInt &x, ll a){\n return divmod(x, a).second;\n}\n\npair<BigInt, BigInt> divmod(const BigInt &x, const BigInt &y){\n BigInt rx = x, ry = y;\n if(x.digit.size() < y.digit.size())return make_pair(ZERO, x);\n int F = B / (y.digit[y.digit.size() - 1] + 1);\n rx = rx * F; ry = ry * F;\n BigInt z;\n z.digit.assign(rx.digit.size() - ry.digit.size() + 1, 0);\n for(int k = (int)z.digit.size() - 1, i = (int)rx.digit.size() - 1; k >= 0; k--, i--){\n z.digit[k] = (i + 1 < rx.digit.size() ? rx.digit[i+1]: 0) * B + rx.digit[i];\n z.digit[k] /= ry.digit[ry.digit.size() - 1];\n BigInt t;\n t.digit.assign(k + ry.digit.size(), 0);\n for(int m = 0; m < ry.digit.size(); m++){\n t.digit[k+m] = z.digit[k] * ry.digit[m];\n }\n t.normalize();\n while(rx < t){\n z.digit[k] -= 1;\n for(int m = 0; m < ry.digit.size(); m++){\n t.digit[k+m] -= ry.digit[m];\n }\n t.normalize();\n }\n rx = rx - t;\n }\n z.normalize();\n return make_pair(z, rx / F);\n}\n\nBigInt operator/(const BigInt &x, const BigInt &y){\n return divmod(x, y).first;\n}\n\nBigInt operator%(const BigInt &x, const BigInt &y){\n return divmod(x, y).second;\n}\n\nBigInt& operator+=(BigInt &x, ll a){\n x = x + a;\n return x;\n}\n\nBigInt &operator+=(BigInt &x, const BigInt &y){\n x = x + y;\n return x;\n}\n\nBigInt &operator-=(BigInt &x, const BigInt &y){\n x = x - y;\n return x;\n}\n\nBigInt& operator*=(BigInt &x, const BigInt &y){\n x = x * y;\n return x;\n}\n\nBigInt& operator/=(BigInt &x, const BigInt &y){\n x = x / y;\n return x;\n}\n\nBigInt& operator%=(BigInt &x, const BigInt &y){\n x = x % y;\n return x;\n}\n\nBigInt& operator/=(BigInt &x, ll a){\n x = x / a;\n return x;\n}\n\nBigInt& operator%=(BigInt &x, ll a){\n x = x % a;\n return x;\n}\n\nBigInt sqrt(const BigInt &x){\n BigInt l = 1;\n BigInt r = x;\n while(r - l > BigInt(1)){\n BigInt m = (r + l) / 2;\n if(m * m > x)r = m;\n else l = m;\n }\n return l;\n}\n\nstruct SBigInt{\n bool neg = false;\n BigInt b = 0;\n SBigInt(){}\n SBigInt(ll a): b(BigInt(abs(a))){\n if(a < 0)neg = true;\n }\n SBigInt(const string &s){\n string t = s;\n if(t[0] == '-'){\n neg = true;\n t = t.substr(1, t.size() - 1);\n }\n b = BigInt(t);\n }\n void check_zero(){\n if(b == ZERO)neg = false;\n }\n bool operator==(const SBigInt &r) const{\n return (neg == r.neg) && (b == r.b);\n }\n bool operator!=(const SBigInt &r) const{\n return (neg != r.neg) || (b != r.b);\n }\n SBigInt operator-() const{\n SBigInt res = *this;\n res.neg = !res.neg;\n res.check_zero();\n return res;\n }\n};\n\nSBigInt operator+(const SBigInt &x, const SBigInt &y){\n SBigInt res;\n if(x.neg == y.neg){\n res.b = x.b + y.b;\n res.neg = x.neg;\n }else{\n if(x.b > y.b){\n res.b = x.b - y.b;\n res.neg = x.neg;\n }else{\n res.b = y.b - x.b;\n res.neg = y.neg;\n }\n }\n res.check_zero();\n return res;\n}\n\nSBigInt operator-(const SBigInt &x, const SBigInt &y){\n SBigInt res = x + (- y);\n res.check_zero();\n return res;\n}\n\nSBigInt operator*(const SBigInt &x, const SBigInt &y){\n SBigInt res;\n res.neg = !(x.neg == y.neg);\n res.b = x.b * y.b;\n res.check_zero();\n return res;\n}\n\nSBigInt operator/(const SBigInt &x, const SBigInt &y){\n SBigInt res;\n res.neg = !(x.neg == y.neg);\n res.b = x.b / y.b;\n res.check_zero();\n return res;\n}\n\nostream &operator<<(ostream &os, const SBigInt &b){\n if(b.neg)os << \"-\";\n os << b.b;\n return os;\n}\n\nint main(int argc, char const* argv[])\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n string a, b;\n cin >> a >> b;\n SBigInt A(a), B(b);\n cout << A * B << endl;\n return 0;\n}","accuracy":0.64,"time_ms":20,"memory_kb":3308,"score_of_the_acc":-0.038,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_NTL_2_C_10940298\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n\\nstring fixedNum( string a )\\n{\\n if( a.size() == 1 )\\n return a;\\n for( int i = 0; i < a.size(); i++ )\\n if( '1'<= a[i] && a[i] <= '9' )\\n return a.substr( i, a.size() );\\n return \\\"0\\\";\\n}\\n\\nstring calcAddition( string a, string b )\\n{\\n a = fixedNum(a); b = fixedNum(b);\\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\\n string s = \\\"0\\\", t = \\\"0\\\";\\n for( int i = 0; i < d; i++ )\\n as > bs ? t += \\\"0\\\" : s += \\\"0\\\";\\n s += a; t += b;\\n\\n for( int i = s.size() - 1; i >= 1; i-- )\\n {\\n s[i] += t[i] - '0';\\n if( s[i] > '9' )\\n {\\n s[i] -= 10;\\n s[i-1]++;\\n }\\n }\\n\\n return s[0] == '0' ? s.substr( 1, s.size() ) : s;\\n}\\n\\nstring calcMultiplication( string a, string b )\\n{\\n a = fixedNum(a); b = fixedNum(b);\\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\\n string s = \\\"0\\\", t = \\\"0\\\", x = \\\"\\\", sum = \\\"\\\", zero = \\\"\\\", digit = \\\"\\\";\\n for( int i = 0; i < d; i++ )\\n as > bs ? t += \\\"0\\\" : s += \\\"0\\\";\\n s += a; t += b;\\n\\n for( int i = 0; i < s.size(); i++ )\\n zero += \\\"0\\\";\\n \\n x = zero;\\n sum = zero;\\n\\n for( int i = s.size() - 1; i >= 1; i-- )\\n {\\n for( int j = s.size() - 1; j >= 1; j-- )\\n x[j] = ( t[i] - '0' ) * ( s[j] - '0' );\\n for( int j = s.size() - 1; j >= 1; j-- )\\n {\\n int f = x[j] / 10;\\n x[j-1] += f;\\n x[j] = x[j] - 10 * f + '0';\\n }\\n x += digit;\\n sum = calcAddition( x, sum );\\n digit += \\\"0\\\";\\n x = zero;\\n }\\n return sum;\\n}\\n\\nint main()\\n{\\n string a, b;\\n\\n cin >> a >> b;\\n\\n int as = a.size(), bs = b.size();\\n string s = a.substr( 1, as ), t = b.substr( 1, bs );\\n\\n if( a[0] == '-' && b[0] == '-' )\\n cout << calcMultiplication( s, t ) << endl;\\n else if( a[0] >= '0' && b[0] >= '0' )\\n cout << calcMultiplication( a, b ) << endl;\\n else\\n {\\n if( a == \\\"0\\\" || b == \\\"0\\\" )\\n cout << \\\"0\\\" << endl;\\n else if( a[0] == '-' )\\n cout << '-' << calcMultiplication( s, b ) << endl;\\n else\\n cout << '-' << calcMultiplication( a, t ) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_9796169\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\ntemplate <int BASE>\\nclass BigDecimal {\\n public:\\n static constexpr std::string_view NUMERAL{\\n \\\"0123456789ABCDEF\\\"}; // 16進数まで対応\\n\\n private: // 静的関数\\n static int CompareIgnoreSign(const BigDecimal& a, const BigDecimal& b) {\\n // a-bの符号で覚えてもよいかも。\\n // a<b: -1\\n // a>b: +1\\n // a==b: 0\\n if (a._digit.size() != b._digit.size())\\n return a._digit.size() < b._digit.size() ? -1 : 1;\\n for (int i = a._digit.size() - 1; i >= 0; --i) {\\n if (a._digit[i] == b._digit[i]) continue;\\n return a._digit[i] < b._digit[i] ? -1 : 1;\\n }\\n return 0;\\n }\\n\\n static BigDecimal Karatsuba(const BigDecimal& a, const BigDecimal& b) {\\n // |a| >= |b|にする\\n if (a._digit.size() < b._digit.size()) return Karatsuba(b, a);\\n // 1桁に絞ったら直に計算して返す\\n if (b._digit.size() == 1) {\\n BigDecimal ret(a);\\n for (int i = 0; i < a._digit.size(); ++i) {\\n ret._digit[i] *= b._digit[0];\\n }\\n ret.carry_and_fix();\\n if (b._positive)\\n return ret;\\n else\\n return -ret;\\n }\\n int N = a._digit.size() / 2; // 下半分の桁数\\n bool sign = !(a._positive xor b._positive); // 符号を計算しておく\\n BigDecimal a0(a), a1(a), b0(b), b1(b); // x = concat(x0, x1)\\n // aの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (a1._digit.size() > N) a1._digit.pop_back();\\n // x0のデータを消去\\n a0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < a._digit.size(); ++i)\\n a0._digit.emplace_back(a._digit[N + i]);\\n if (a0._digit.size() == 0) a0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n a0._positive = a1._positive = true;\\n if (b._digit.size() < N) { // 一方が他方の半分もない\\n BigDecimal p0, c1;\\n p0 = Karatsuba(a0, b);\\n c1 = Karatsuba(a1, b);\\n BigDecimal c0;\\n for (int i = 0; i < N - 1; ++i) c0._digit.emplace_back(0);\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1;\\n ret._positive = sign;\\n return ret;\\n }\\n // bの処理\\n // x1の下N桁を残す形で上の桁を取り除く\\n while (b1._digit.size() > N) b1._digit.pop_back();\\n // x0のデータを消去\\n b0._digit.clear();\\n // x0に下N桁より上の桁を保存しなおす\\n for (int i = 0; N + i < b._digit.size(); ++i)\\n b0._digit.emplace_back(b._digit[N + i]);\\n if (b0._digit.size() == 0) b0._digit.emplace_back(0);\\n // x0, x1の符号を取り除く\\n b0._positive = b1._positive = true;\\n // 3種類の積\\n BigDecimal p0, p1, p2;\\n p0 = Karatsuba(a0, b0);\\n p2 = Karatsuba(a1, b1);\\n p1 = Karatsuba(a0 + a1, b0 + b1) - p0 - p2;\\n // 積に対応する数\\n BigDecimal c0, c1, c2;\\n c0._digit.clear();\\n c1._digit.clear();\\n c2._digit.clear();\\n for (int i = 0; i < N; ++i) {\\n c0._digit.emplace_back(0);\\n c0._digit.emplace_back(0);\\n c1._digit.emplace_back(0);\\n }\\n for (const auto& d : p0._digit) c0._digit.emplace_back(d);\\n for (const auto& d : p1._digit) c1._digit.emplace_back(d);\\n for (const auto& d : p2._digit) c2._digit.emplace_back(d);\\n BigDecimal ret = c0 + c1 + c2;\\n ret._positive = sign;\\n return ret;\\n }\\n\\n private:\\n std::vector<int> _digit;\\n bool _positive;\\n bool is_zero() const { return _digit.size() == 1 && _digit[0] == 0; }\\n\\n void carry_and_fix() {\\n // 新規の桁が発生しない範疇(最後の桁以外)を処理\\n for (int i = 0; i < _digit.size() - 1; ++i) {\\n if (_digit[i] >= BASE) {\\n // 桁の数が基数以上: 繰り上げる必要あり\\n int k = _digit[i] / BASE; // 繰り上がり発生回数\\n _digit[i] -= k * BASE;\\n _digit[i + 1] += k;\\n } else if (_digit[i] < 0) {\\n // 桁の数が負: 繰り下げが必要\\n int k = (-_digit[i] - 1) / BASE + 1;\\n _digit[i] += k * BASE;\\n _digit[i + 1] -= k;\\n }\\n }\\n // 最後の桁を処理する場合\\n while (_digit.back() >= BASE) {\\n int k = _digit.back() / BASE; // 繰り上がり発生回数\\n _digit.back() -= k * BASE;\\n _digit.emplace_back(k);\\n }\\n // 計算結果がマイナスなら全体に-1をかけて符号反転\\n if (_digit.back() < 0) {\\n this->_positive = !this->_positive;\\n for (int i = 0; i < _digit.size(); ++i) {\\n _digit[i] *= -1;\\n }\\n this->carry_and_fix();\\n }\\n // 0の桁を上から消す\\n while (_digit.size() >= 2 && _digit.back() == 0) _digit.pop_back();\\n // 0になったら正の数にしておく(-0表記は困るため)\\n if (this->is_zero()) _positive = true;\\n }\\n\\n public:\\n // コンストラクタ\\n BigDecimal(int num = 0) : _digit(0), _positive(num >= 0) {\\n if (!_positive) num *= -1;\\n while (num > 0) {\\n _digit.emplace_back(num % BASE);\\n num /= BASE;\\n }\\n if (_digit.size() == 0) _digit.emplace_back(0);\\n }\\n BigDecimal(std::string s) {\\n if (s[0] == '-') {\\n s = s.substr(1);\\n _positive = false;\\n } else {\\n _positive = true;\\n }\\n while (s.size() > 0) {\\n int i = NUMERAL.find(s.back());\\n _digit.emplace_back(i);\\n s.pop_back();\\n }\\n }\\n // コピーコンストラクタ\\n BigDecimal(const BigDecimal& x)\\n : _digit(x._digit.size()), _positive(x._positive) {\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] = x._digit[i];\\n }\\n }\\n\\n // 比較演算子\\n bool operator==(const BigDecimal& x) const {\\n if (this->_positive != x._positive) return false;\\n if (this->_digit.size() != x._digit.size()) return false;\\n for (int i = 0; i < this->_digit.size(); ++i) {\\n if (this->_digit[i] != x._digit[i]) return false;\\n }\\n return true;\\n }\\n bool operator!=(const BigDecimal& x) const { return !(*this == x); }\\n bool operator<(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) < 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) > 0;\\n }\\n }\\n bool operator>(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) > 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) < 0;\\n }\\n }\\n bool operator<=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return false; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) <= 0;\\n } else {\\n if (x._positive) return true; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) >= 0;\\n }\\n }\\n bool operator>=(const BigDecimal& x) const {\\n if (this->_positive) {\\n if (!x._positive) return true; // x < 0 <= this -> this>x\\n return CompareIgnoreSign(*this, x) >= 0;\\n } else {\\n if (x._positive) return false; // this < 0 <= x -> this<x\\n return CompareIgnoreSign(*this, x) <= 0;\\n }\\n }\\n\\n // 単項演算子\\n BigDecimal operator+() const { return *this; }\\n BigDecimal operator-() const {\\n BigDecimal ret = *this;\\n if (!this->is_zero()) ret._positive = !ret._positive;\\n return ret;\\n }\\n // 複号代入演算子\\n BigDecimal& operator+=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて引き算に\\n if (this->_positive != x._positive) {\\n return *this -= (-x);\\n }\\n // 符号が同じ物にのみ足し算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] += x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator-=(const BigDecimal& x) {\\n // 符号が異なる場合は符号をそろえて足し算に\\n if (this->_positive != x._positive) {\\n return *this += (-x);\\n }\\n // 符号が同じ物にのみ引き算を行う\\n while (this->_digit.size() < x._digit.size()) {\\n this->_digit.emplace_back(0);\\n }\\n for (int i = 0; i < x._digit.size(); ++i) {\\n this->_digit[i] -= x._digit[i];\\n }\\n this->carry_and_fix();\\n return *this;\\n }\\n BigDecimal& operator*=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator/=(const BigDecimal& x) { return *this; }\\n BigDecimal& operator%=(const BigDecimal& x) { return *this; }\\n\\n // 二項演算子\\n BigDecimal operator+(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret += x);\\n }\\n BigDecimal operator-(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret -= x);\\n }\\n BigDecimal operator*(const BigDecimal& x) const {\\n return Karatsuba(*this, x);\\n }\\n BigDecimal operator/(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret /= x);\\n }\\n BigDecimal operator%(const BigDecimal& x) const {\\n BigDecimal ret(*this);\\n return (ret %= x);\\n }\\n\\n // キャスト\\n operator std::string() const {\\n std::string ret = \\\"\\\";\\n for (const auto& c : _digit) {\\n ret = NUMERAL.at(c) + ret;\\n }\\n if (!_positive) ret = \\\"-\\\" + ret;\\n return ret;\\n }\\n};\\n\\nint main() {\\n std::string A, B;\\n std::cin >> A >> B;\\n BigDecimal<10> a(A), b(B);\\n std::cout << std::string(a*b) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.0782,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_8873472\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n#define SWAP( A, B ) { auto tmp = A; A = B; B = tmp; }\\n\\nstruct BigInteger{\\n\\n bool minus;\\n int size;\\n vector<int> val;\\n\\n BigInteger(){\\n\\n minus = false;\\n size = 0;\\n\\n }\\n\\n BigInteger( string str ){\\n\\n minus = ( str[0] == '-' );\\n if( minus )\\n str = str.substr( 1 );\\n size = str.length();\\n for( int i = size-1 ; i >= 0 ; i-- )\\n val.push_back( str[i] - '0' );\\n adjust();\\n\\n }\\n\\n void adjust(){\\n\\n while( size != 0 && val[size-1] == 0 ){\\n size--;\\n val.pop_back();\\n }\\n if( size == 0 )\\n minus = false;\\n\\n }\\n\\n bool same( BigInteger bi ){\\n\\n if( size != bi.size ) return false;\\n for( int i = 0 ; i < size ; i++ ){\\n if( val[i] != bi.val[i] )\\n return false;\\n }\\n return true;\\n\\n }\\n\\n bool greater( BigInteger bi ){\\n\\n if( size > bi.size ) return true;\\n else if( size < bi.size ) return false;\\n if( size == 0 ) return true;\\n int id = size - 1;\\n while( id >= 0 ){\\n if( val[id] > bi.val[id] ) return true;\\n else if( val[id] < bi.val[id] ) return false;\\n id--;\\n }\\n return true;\\n \\n }\\n\\n\\n\\n void print(){\\n\\n if( size == 0 ){\\n minus = false;\\n cout << \\\"0\\\" << endl;\\n return;\\n } \\n if( minus ) cout << \\\"-\\\";\\n for( int i = size-1 ; i >= 0 ; i-- )\\n cout << val[i];\\n cout << endl;\\n\\n }\\n\\n};\\n\\nBigInteger operator+( BigInteger bi1, BigInteger bi2 );\\nBigInteger operator-( BigInteger bi1, BigInteger bi2 );\\nBigInteger operator*( BigInteger bi1, BigInteger bi2 );\\nBigInteger operator/( BigInteger bi1, BigInteger bi2 );\\nBigInteger operator%( BigInteger bi1, BigInteger bi2 );\\n\\n\\nBigInteger operator+( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n if( bi1.minus && !bi2.minus ){\\n bi1.minus = false;\\n res = bi2 - bi1;\\n return res;\\n }\\n if( !bi1.minus && bi2.minus ){\\n bi2.minus = false;\\n res = bi1 - bi2;\\n return res;\\n }\\n res.minus = bi1.minus;\\n res.size = max( bi1.size, bi2.size );\\n vector<int> a;\\n vector<int> b;\\n for( int i = 0 ; i < res.size ; i++ ){\\n if( i < bi1.size )\\n a.push_back( bi1.val[i] );\\n else\\n a.push_back( 0 );\\n if( i < bi2.size )\\n b.push_back( bi2.val[i] );\\n else\\n b.push_back( 0 );\\n }\\n\\n int up = 0;\\n for( int i = 0 ; i < res.size ; i++ ){\\n int sum = a[i] + b[i];\\n sum += up;\\n up = sum / 10;\\n sum %= 10;\\n res.val.push_back( sum );\\n }\\n while( up != 0 ){\\n res.size++;\\n res.val.push_back( up % 10 );\\n up /= 10;\\n }\\n\\n res.adjust();\\n return res;\\n\\n}\\n\\nBigInteger operator-( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ){\\n bi2.minus = !bi2.minus;\\n return bi1 + bi2;\\n }\\n res.size = max( bi1.size, bi2.size );\\n if( bi1.greater( bi2 ) )\\n res.minus = bi1.minus;\\n else{\\n res = bi2 - bi1;\\n res.minus = !res.minus;\\n return res;\\n }\\n vector<int> a;\\n vector<int> b;\\n for( int i = 0 ; i < res.size ; i++ ){\\n if( i < bi1.size )\\n a.push_back( bi1.val[i] );\\n else\\n a.push_back( 0 );\\n if( i < bi2.size )\\n b.push_back( bi2.val[i] );\\n else\\n b.push_back( 0 );\\n }\\n\\n int down = 0;\\n for( int i = 0 ; i < res.size ; i++ ){\\n int diff = a[i] - b[i];\\n diff -= down;\\n if( diff >= 0 ){\\n down = -( diff / 10 );\\n diff %= 10;\\n }\\n else{\\n down = ( -diff + 9 ) / 10;\\n diff = ( 10 - ( -diff % 10 ) ) % 10;\\n }\\n res.val.push_back( diff );\\n }\\n \\n res.adjust();\\n return res;\\n\\n}\\n\\n/*\\nBigInteger operator*( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\\n bi1.minus = bi2.minus = false;\\n res.size = bi1.size + bi2.size - 1;\\n for( int i = 0 ; i < res.size ; i++ )\\n res.val.push_back( 0 );\\n \\n for( int i = 0 ; i < bi1.size ; i++ ){\\n for( int j = 0 ; j < bi2.size ; j++ )\\n res.val[i+j] += bi1.val[i] * bi2.val[j];\\n }\\n int up = 0;\\n for( int i = 0 ; i < res.size ; i++ ){\\n res.val[i] += up;\\n up = res.val[i] / 10;\\n res.val[i] %= 10;\\n }\\n while( up != 0 ){\\n res.size++;\\n res.val.push_back( up % 10 );\\n up /= 10;\\n }\\n\\n res.adjust();\\n return res;\\n \\n}\\n*/\\n\\nBigInteger operator*( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n if( bi1.size == 0 || bi2.size == 0 ) return res;\\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\\n bi1.minus = bi2.minus = false;\\n if( bi1.size == 1 && bi2.size == 1 ){\\n int m = bi1.val[0] * bi2.val[0];\\n BigInteger mult( to_string( m ) );\\n mult.minus = res.minus;\\n mult.adjust();\\n return mult;\\n }\\n int digit = 1;\\n while( digit < max( bi1.size, bi2.size ) ) \\n digit *= 2;\\n res.size = 2 * digit;\\n for( int i = 0 ; i < res.size ; i++ )\\n res.val.push_back( 0 );\\n vector<int> a;\\n vector<int> b;\\n for( int i = 0 ; i < digit ; i++ ){\\n if( i < bi1.size )\\n a.push_back( bi1.val[i] );\\n else\\n a.push_back( 0 );\\n if( i < bi2.size )\\n b.push_back( bi2.val[i] );\\n else\\n b.push_back( 0 );\\n }\\n\\n BigInteger num1, num2, num3, num4;\\n num1.size = num2.size = num3.size = num4.size = digit / 2;\\n for( int i = 0 ; i < digit / 2 ; i++ ){\\n num1.val.push_back( a[ i + digit / 2 ] );\\n num2.val.push_back( a[i]);\\n num3.val.push_back( b[ i + digit / 2 ] );\\n num4.val.push_back( b[i] );\\n }\\n num1.adjust();\\n num2.adjust();\\n num3.adjust();\\n num4.adjust();\\n BigInteger num5 = num1 * num3;\\n BigInteger num6 = num2 * num4;\\n BigInteger num7 = ( num1 + num2 ) * ( num3 + num4 ) - num5 - num6;\\n\\n for( int i = 0 ; i < num6.size ; i++ )\\n res.val[i] += num6.val[i];\\n for( int i = 0 ; i < num7.size; i++ )\\n res.val[ i + digit / 2 ] += num7.val[i];\\n for( int i = 0 ; i < num5.size ; i++ )\\n res.val[ i + digit ] += num5.val[i];\\n int up = 0;\\n for( int i = 0 ; i < res.size ; i++ ){\\n res.val[i] += up;\\n up = res.val[i] / 10;\\n res.val[i] %= 10;\\n }\\n\\n res.adjust();\\n return res;\\n \\n}\\n\\nBigInteger operator/( BigInteger bi1, BigInteger bi2 ){\\n\\n BigInteger res;\\n if( !bi1.greater( bi2 ) ) return res;\\n if( ( bi1.minus && !bi2.minus ) || ( !bi1.minus && bi2.minus ) ) res.minus = true;\\n bi1.minus = bi2.minus = false;\\n res.size = bi1.size - bi2.size + 1;\\n\\n BigInteger num;\\n int id = bi1.size;\\n while( id >= 0 ){\\n BigInteger tmp;\\n for( int i = 1 ; i <= 10 ; i++ ){\\n tmp = tmp + bi2;\\n if( tmp.greater( num ) ){\\n if( tmp.same( num ) ){ \\n res.val.insert( res.val.begin(), i );\\n }\\n else{\\n tmp = tmp - bi2;\\n res.val.insert( res.val.begin(), i - 1 );\\n }\\n num = num - tmp;\\n id--;\\n if( id >= 0 ){\\n num.val.insert( num.val.begin(), bi1.val[id] );\\n num.size++;\\n }\\n break;\\n }\\n }\\n }\\n\\n res.adjust();\\n return res;\\n\\n}\\n\\nBigInteger operator%( BigInteger bi1, BigInteger bi2 ){\\n\\n return bi1 - bi2 * ( bi1 / bi2 );\\n\\n}\\n\\n\\n\\nint main(){\\n\\n string A, B;\\n cin >> A >> B;\\n \\n BigInteger a( A );\\n BigInteger b( B );\\n BigInteger c = a * b;\\n c.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -1.0053,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_7525143\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\\n#define pb push_back\\n#define f first\\n#define s second\\n\\nusing namespace std;\\ntypedef pair <int,int> pii;\\n\\nconst int maxn = 1e5 + 5;\\n\\nstring t(string a, string b)\\n{\\n string c;\\n long n1= a.length(), n2=b.length(),t,n=0;\\n if(n1>n2) b.insert(0,n1-n2,'0');\\n if(n2>n1) a.insert(0,n2-n1,'0');\\n c=a;\\n for(int i=a.length()-1;i>=0;i--)\\n {\\n t=(a[i]-48)+(b[i]-48)+n;\\n n=t/10;\\n t=t%10;\\n c[i]=char(t+48);\\n }\\n if(n>0) c= char(n+48) +c;\\n return c;\\n}\\n\\nstring h(string a, string b)\\n{\\n string c;\\n long n1= a.length(), n2=b.length(),t,n=0;\\n if(n1>n2) b.insert(0,n1-n2,'0');\\n c=\\\"\\\";\\n for(int i=n1-1;i>=0;i--)\\n {\\n t=(a[i]-48)-(b[i]-48)-n;\\n if(t<0)\\n {\\n t+=10;\\n n=1;\\n }\\n else n=0;\\n c=char(t+48)+c;\\n }\\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\\n return c;\\n}\\n\\nstring n1(string a,int k)\\n{\\n string b;\\n long i,n=0,t;\\n for(i=a.length()-1;i>=0;i--)\\n {\\n t=n+(a[i]-48)*k;\\n n=t/10;\\n t=t%10;\\n b=char(t+48) + b;\\n }\\n if(n!=0) b=char(n+48)+b;\\n while(b.length()>1&&b[0]=='0') b.erase(0,1);\\n return b;\\n}\\n\\nstring nhan(string a, string b)\\n{\\n string x,tg1=\\\"0\\\",tg2,c;\\n long i,j=0;\\n for(i=b.length()-1;i>=0;i--)\\n {\\n tg2=n1(a,(b[i]-48));\\n tg2.insert(tg2.length(),j,'0');\\n j++;\\n c=t(tg2,tg1);\\n tg1=c;\\n }\\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\\n return c;\\n}\\nstring a,b;\\n\\nint main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n cin >> a >> b;\\n if(a[0] == '-' && b[0] == '-')\\n {\\n a.erase(0,1);\\n b.erase(0,1);\\n cout << nhan(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else if(a[0] == '-' && b[0] != '-')\\n {\\n a.erase(0,1);\\n string s1 = nhan(a,b);\\n if(s1 != \\\"0\\\") s1 = \\\"-\\\" + s1;\\n cout << s1 << \\\"\\\\n\\\";\\n return 0;\\n }\\n else if(a[0] != '-' && b[0] == '-')\\n {\\n b.erase(0,1);\\n string s1 = nhan(a,b);\\n if(s1 != \\\"0\\\") s1 = \\\"-\\\" + s1;\\n cout << s1 << \\\"\\\\n\\\";\\n return 0;\\n }\\n cout << nhan(a,b) << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.0779,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_7525139\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define forr(i,a,b) for(int i = (a); i <= (b); i++)\\n#define forw(i,a,b) for(int i = (a); i >= (b); i--)\\n#define pb push_back\\n#define f first\\n#define s second\\n\\nusing namespace std;\\ntypedef pair <int,int> pii;\\n\\nconst int maxn = 1e5 + 5;\\n\\nstring t(string a, string b)\\n{\\n string c;\\n long n1= a.length(), n2=b.length(),t,n=0;\\n if(n1>n2) b.insert(0,n1-n2,'0');\\n if(n2>n1) a.insert(0,n2-n1,'0');\\n c=a;\\n for(int i=a.length()-1;i>=0;i--)\\n {\\n t=(a[i]-48)+(b[i]-48)+n;\\n n=t/10;\\n t=t%10;\\n c[i]=char(t+48);\\n }\\n if(n>0) c= char(n+48) +c;\\n return c;\\n}\\n\\nstring h(string a, string b)\\n{\\n string c;\\n long n1= a.length(), n2=b.length(),t,n=0;\\n if(n1>n2) b.insert(0,n1-n2,'0');\\n c=\\\"\\\";\\n for(int i=n1-1;i>=0;i--)\\n {\\n t=(a[i]-48)-(b[i]-48)-n;\\n if(t<0)\\n {\\n t+=10;\\n n=1;\\n }\\n else n=0;\\n c=char(t+48)+c;\\n }\\n while(c.length()>1&&c[0]=='0') c.erase(0,1);\\n return c;\\n}\\n\\nstring n1(string a,int k)\\n{\\n string b;\\n long i,n=0,t;\\n for(i=a.length()-1;i>=0;i--)\\n {\\n t=n+(a[i]-48)*k;\\n n=t/10;\\n t=t%10;\\n b=char(t+48) + b;\\n }\\n if(n!=0) b=char(n+48)+b;\\n while(b.length()>1&&b[0]=='0') b.erase(0,1);\\n return b;\\n}\\n\\nstring nhan(string a, string b)\\n{\\n string x,tg1=\\\"0\\\",tg2,c;\\n long i,j=0;\\n for(i=b.length()-1;i>=0;i--)\\n {\\n tg2=n1(a,(b[i]-48));\\n tg2.insert(tg2.length(),j,'0');\\n j++;\\n c=t(tg2,tg1);\\n tg1=c;\\n }\\n return c;\\n}\\nstring a,b;\\n\\nint main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n cout.tie(0);\\n cin >> a >> b;\\n if(a[0] == '-' && b[0] == '-')\\n {\\n a.erase(0,1);\\n b.erase(0,1);\\n cout << nhan(a,b) << \\\"\\\\n\\\";\\n return 0;\\n }\\n else if(a[0] == '-' && b[0] != '-')\\n {\\n a.erase(0,1);\\n string s1 = nhan(a,b);\\n if(s1 != \\\"0\\\") s1 = \\\"-\\\" + s1;\\n cout << s1 << \\\"\\\\n\\\";\\n return 0;\\n }\\n else if(a[0] != '-' && b[0] == '-')\\n {\\n b.erase(0,1);\\n string s1 = nhan(a,b);\\n if(s1 != \\\"0\\\") s1 = \\\"-\\\" + s1;\\n cout << s1 << \\\"\\\\n\\\";\\n return 0;\\n }\\n cout << nhan(a,b) << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 0.84,\n \"time_ms\": 30,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.0783,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_6978051\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\nbigInt operator* ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<ll> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = (ll)( str[id++] - '0' );\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<ll> v( 4, 0LL );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n ll top = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n if( minus && ( size != 0 || top != 0LL ) )\\n cout << '-';\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n // sizeの再計算\\n void resize(){\\n\\n size = 0;\\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- ){\\n if( dat[i][j] != 0 ){\\n size = i;\\n return;\\n }\\n }\\n }\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n ll lVal = 0LL, rVal = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n ll lVal = 0LL, rVal = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n ll up = 0LL; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.minus = l.minus;\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l.minus & r.minus ){\\n if( l < r ){\\n l.minus = false;\\n r.minus = false;\\n res = l - r;\\n res.minus = true;\\n }\\n else{\\n l.minus = false;\\n r.minus = false;\\n res = r - l;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n ll down = 0LL; // 繰り下がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n }\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator* ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n res.minus = l.minus ^ r.minus;\\n for( int li = 0 ; li <= l.size ; li++ ){\\n for( int lj = 0 ; lj < 4 ; lj++ ){\\n for( int ri = 0 ; ri <= r.size ; ri++ ){\\n for( int rj = 0 ; rj < 4 ; rj++ )\\n res.dat[li+ri+((lj+rj)/4)][(lj+rj)%4] += l.dat[li][lj] * r.dat[ri][rj];\\n }\\n }\\n }\\n ll up = 0LL; // 繰り上がり\\n for( int i = 0 ; i < res.dat.size() ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n ll now = res.dat[i][j] + up;\\n res.dat[i][j] = now % 10;\\n up = now / 10;\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt mult = a * b;\\n mult.print();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 39140,\n \"score_of_the_acc\": -0.4569,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_6978050\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<string>\\n#include<cmath>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<set>\\n#include<deque>\\n#include<list>\\n#include<bitset>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\n\\nconst ld EPS = 1e-10;\\nconst ll MOD = 1000000007LL;\\nconst ll INF = 1LL << 60;\\nconst double PI = M_PI;\\n\\n/////////////////////////////////\\n// 多倍長整数\\n// [-10^400000,10^400000] を表せる\\n\\nstruct bigInt;\\nbool operator< ( bigInt l, bigInt r );\\nbigInt operator+ ( bigInt l, bigInt r );\\nbigInt operator- ( bigInt l, bigInt r );\\nbigInt operator* ( bigInt l, bigInt r );\\n\\nstruct bigInt{\\n\\n bool minus;\\n int size;\\n vector< vector<ll> > dat;\\n\\n // コンストラクタ\\n bigInt(){\\n\\n Init();\\n\\n }\\n\\n bigInt( string str ){\\n\\n Init();\\n if( str[0] == '-' ){\\n minus = true;\\n str = str.substr(1);\\n }\\n size = ( str.length() - 1 ) / 4;\\n reverse( str.begin(), str.end() );\\n int id = 0;\\n for( int i = 0 ; i <= size ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n if( id < str.length() ){\\n dat[i][j] = (ll)( str[id++] - '0' );\\n }\\n }\\n }\\n\\n }\\n\\n // 初期化\\n void Init(){\\n\\n minus = false;\\n size = 0;\\n for( int i = 0 ; i < 100000 ; i++ ){\\n vector<ll> v( 4, 0LL );\\n dat.push_back( v );\\n }\\n\\n }\\n\\n // 表示\\n void print(){\\n\\n if( minus )\\n cout << '-';\\n ll top = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n top += dat[size][i] * order;\\n order *= 10;\\n }\\n cout << top;\\n for( int i = size-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- )\\n cout << dat[i][j];\\n }\\n cout << endl;\\n\\n }\\n\\n // sizeの再計算\\n void resize(){\\n\\n size = 0;\\n for( int i = dat.size()-1 ; i >= 0 ; i-- ){\\n for( int j = 3 ; j >= 0 ; j-- ){\\n if( dat[i][j] != 0 ){\\n size = i;\\n return;\\n }\\n }\\n }\\n\\n }\\n\\n};\\n\\n/////////////////////////////////////////////\\n// 演算子の定義\\nbool operator< ( bigInt l, bigInt r ){\\n\\n if( l.minus ){\\n if( !r.minus ) return true;\\n if( l.size == r.size ){\\n ll lVal = 0LL, rVal = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal > rVal;\\n }\\n return l.size > r.size;\\n }\\n else{\\n if( r.minus ) return false;\\n if( l.size == r.size ){\\n ll lVal = 0LL, rVal = 0LL;\\n ll order = 1LL;\\n for( int i = 0 ; i < 4 ; i++ ){\\n lVal += order * l.dat[l.size][i];\\n rVal += order * r.dat[r.size][i];\\n order *= 10;\\n }\\n return lVal < rVal;\\n }\\n return l.size < r.size;\\n }\\n\\n}\\n\\nbigInt operator+ ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = r - l;\\n }\\n else{\\n r.minus = false;\\n res = l - r;\\n }\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n ll up = 0LL; // 繰り上がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = ( l.dat[i][j] + r.dat[i][j] + up ) % 10;\\n up = ( l.dat[i][j] + r.dat[i][j] + up ) / 10;\\n }\\n }\\n res.dat[maxSize+1][0] = up;\\n res.minus = l.minus;\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator- ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n if( l.minus ^ r.minus ){\\n if( l.minus ){\\n l.minus = false;\\n res = l + r;\\n res.minus = true;\\n }\\n else{\\n r.minus = false;\\n res = l + r;\\n }\\n }\\n else{\\n if( l.minus & r.minus ){\\n if( l < r ){\\n l.minus = false;\\n r.minus = false;\\n res = l - r;\\n res.minus = true;\\n }\\n else{\\n l.minus = false;\\n r.minus = false;\\n res = r - l;\\n }\\n }\\n else{\\n if( l < r ){\\n res = r - l;\\n res.minus = true;\\n }\\n else{\\n int maxSize = max( l.size, r.size );\\n ll down = 0LL; // 繰り下がり\\n for( int i = 0 ; i <= maxSize ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n res.dat[i][j] = l.dat[i][j] - down - r.dat[i][j];\\n if( res.dat[i][j] < 0 ){\\n res.dat[i][j] += 10;\\n down = 1;\\n }\\n else\\n down = 0;\\n }\\n }\\n }\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\nbigInt operator* ( bigInt l, bigInt r ){\\n\\n bigInt res;\\n res.minus = l.minus ^ r.minus;\\n for( int li = 0 ; li <= l.size ; li++ ){\\n for( int lj = 0 ; lj < 4 ; lj++ ){\\n for( int ri = 0 ; ri <= r.size ; ri++ ){\\n for( int rj = 0 ; rj < 4 ; rj++ )\\n res.dat[li+ri+((lj+rj)/4)][(lj+rj)%4] += l.dat[li][lj] * r.dat[ri][rj];\\n }\\n }\\n }\\n ll up = 0LL; // 繰り上がり\\n for( int i = 0 ; i < res.dat.size() ; i++ ){\\n for( int j = 0 ; j < 4 ; j++ ){\\n ll now = res.dat[i][j] + up;\\n res.dat[i][j] = now % 10;\\n up = now / 10;\\n }\\n }\\n res.resize();\\n return res;\\n\\n}\\n\\n/////////////////////////////////////////////////\\n\\nint main(){\\n\\n string strA, strB;\\n cin >> strA >> strB;\\n bigInt a( strA );\\n bigInt b( strB );\\n bigInt mult = a * b;\\n mult.print();\\n\\n}\",\n \"accuracy\": 0.04,\n \"time_ms\": 20,\n \"memory_kb\": 39072,\n \"score_of_the_acc\": -0.4191,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_6679630\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n\\n#define all(x) (x).begin(),(x).end()\\n#define print(x) cout << (x) << '\\\\n'\\ntypedef long long ll;\\ntypedef long double ld;\\nusing P = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing Graph = vector<vector<int>>;\\n\\n//const ll MOD = 1000000007;\\n//const ll MOD = 998244353;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {return a < b ? a = b, true : false;}\\ntemplate <typename T> inline bool chmin(T &a, T b) {return a > b ? a = b, true : false;}\\n\\ntemplate <typename T>\\nvoid vin(vector<T> &v) {\\n int l = v.size();\\n for(int i = 0; i < l; i++) cin >> v[i];\\n}\\n\\ntemplate <typename T>\\nvoid vout(vector<T> &v) {\\n int l = v.size();\\n for(int i = 0; i < l; i++) cout << v[i] << (i < l - 1 ? ' ' : '\\\\n');\\n}\\n\\nstring calc1(string x, string y, int la, int lb) {\\n string ret = \\\"\\\";\\n int nex = 0;\\n for(int i = la - 1; i >= la - lb; i--) {\\n int t = x[i] - '0' + y[i - la + lb] - '0' + nex;\\n if(t >= 10) {\\n nex = t / 10;\\n ret += char('0' + t % 10);\\n } else {\\n nex = 0;\\n ret += char('0' + t);\\n }\\n }\\n for(int i = la - lb - 1; i >= 0; i--) {\\n int t = x[i] - '0' + nex;\\n if(t >= 10) {\\n nex = t / 10;\\n ret += char('0' + t % 10);\\n } else {\\n nex = 0;\\n ret += char('0' + t);\\n }\\n }\\n if(nex > 0) {\\n ret += char('0' + nex);\\n }\\n reverse(all(ret));\\n int L = ret.length();\\n int zero = 0;\\n for(int i = 0; i < L; i++) {\\n if(ret[i] == '0') {\\n zero++;\\n } else {\\n break;\\n }\\n }\\n ret = ret.substr(zero, L - zero);\\n if(ret == \\\"\\\") {\\n ret = \\\"0\\\";\\n }\\n return ret;\\n}\\n\\nstring calc2(string x, string y, int la, int lb) {\\n bool p = true;\\n if(la < lb) {\\n p = false;\\n } else if(la == lb && x < y) {\\n p = false;\\n }\\n if(!p) {\\n swap(x, y);\\n swap(la, lb);\\n }\\n\\n string ret = \\\"\\\";\\n int nex = 0;\\n for(int i = la - 1; i >= la - lb; i--) {\\n int t = x[i] - '0' - (y[i - (la - lb)] - '0') - nex;\\n if(t < 0) {\\n nex = 1;\\n ret += char('0' + t + 10);\\n } else {\\n ret += char('0' + t);\\n nex = 0;\\n }\\n }\\n for(int i = la - lb - 1; i >= 0; i--) {\\n int t = x[i] - '0' - nex;\\n if(t < 0) {\\n nex = 1;\\n ret += char('0' + t + 10);\\n } else {\\n nex = 0;\\n ret += char('0' + t);\\n }\\n }\\n reverse(all(ret));\\n int L = ret.length();\\n int zero = 0;\\n for(int i = 0; i < L; i++) {\\n if(ret[i] == '0') {\\n zero++;\\n } else {\\n break;\\n }\\n }\\n ret = ret.substr(zero, L - zero);\\n if(p) {\\n ret = \\\"-\\\" + ret;\\n }\\n if(ret == \\\"-\\\") {\\n ret = \\\"0\\\";\\n }\\n return ret;\\n}\\n\\nstring calc(string A, string B) {\\n int la = A.length();\\n int lb = B.length();\\n\\n string RET;\\n if(A[0] == '-' && B[0] == '-') {\\n A = A.substr(1, la - 1);\\n B = B.substr(1, lb - 1);\\n la--;\\n lb--;\\n if(la < lb) {\\n swap(A, B);\\n swap(la, lb);\\n }\\n RET = calc1(A, B, la, lb);\\n RET = \\\"-\\\" + RET;\\n } else if(A[0] == '-') {\\n A = A.substr(1, la - 1);\\n la--;\\n RET = calc2(A, B, la, lb);\\n } else if(B[0] == '-') {\\n swap(A, B);\\n swap(la, lb);\\n A = A.substr(1, la - 1);\\n la--;\\n RET = calc2(A, B, la, lb);\\n } else {\\n if(la < lb) {\\n swap(A, B);\\n swap(la, lb);\\n }\\n RET = calc1(A, B, la, lb);\\n }\\n return RET;\\n}\\n\\nstring Mcalc2(string A, char b, int la) {\\n string ret = \\\"\\\";\\n int nex = 0;\\n for(int i = la - 1; i >= 0; i--) {\\n int t = int(A[i] - '0') * int(b - '0') + nex;\\n nex = t / 10;\\n ret += char('0' + t % 10);\\n\\n }\\n while(nex > 0) {\\n ret += char('0' + nex % 10);\\n nex /= 10;\\n }\\n reverse(all(ret));\\n int L = ret.length();\\n int zero = 0;\\n for(int i = 0; i < L; i++) {\\n if(ret[i] == '0') {\\n zero++;\\n } else {\\n break;\\n }\\n }\\n ret = ret.substr(zero, L - zero);\\n if(ret == \\\"\\\") {\\n ret = \\\"0\\\";\\n }\\n return ret;\\n}\\n\\nstring Mcalc1(string A, string B, int la, int lb) {\\n string ret = \\\"0\\\";\\n for(int i = lb - 1; i >= 0; i--) {\\n string tmp = Mcalc2(A, B[i], la);\\n for(int j = 0; j < lb - 1 - i; j++) {\\n tmp += '0';\\n }\\n ret = calc(ret, tmp);\\n }\\n return ret;\\n}\\n\\nstring Mcalc(string A, string B) {\\n int la = A.length();\\n int lb = B.length();\\n string Mret;\\n if(A[0] == '-' && B[0] == '-') {\\n A = A.substr(1, la - 1);\\n B = B.substr(1, lb - 1);\\n la--;\\n lb--;\\n Mret = Mcalc1(A, B, la, lb);\\n } else if(A[0] == '-') {\\n A = A.substr(1, la - 1);\\n la--;\\n Mret = Mcalc1(A, B, la, lb);\\n if(Mret != \\\"0\\\") {\\n Mret = \\\"-\\\" + Mret;\\n }\\n } else if(B[0] == '-') {\\n B = B.substr(1, lb - 1);\\n lb--;\\n Mret = Mcalc1(A, B, la, lb);\\n if(Mret != \\\"0\\\") {\\n Mret = \\\"-\\\" + Mret;\\n }\\n } else {\\n Mret = Mcalc1(A, B, la, lb);\\n }\\n return Mret;\\n}\\n\\nint main() {\\n cin.tie(0); cout.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n\\n string A, B;\\n cin >> A >> B;\\n string ans = Mcalc(A, B);\\n print(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.0036,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_6679022\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n// #include <atcoder/convolution>\\n#include <iostream>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace rklib {\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nbool chmin_non_negative(T &a, const T &b) {\\n if (a < 0 || a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\n\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a *= -1, b *= -1;\\n return a > 0 ? (a - 1) / b + 1 : a / b;\\n}\\n\\n} // namespace rklib\\n\\n#include <string>\\n#include <type_traits>\\n#include <vector>\\n\\nnamespace rklib {\\n\\nstruct BigInt {\\n public:\\n BigInt() : BigInt(0) {}\\n template <typename T, std::enable_if_t<std::is_integral<T>::value,\\n std::nullptr_t> = nullptr>\\n BigInt(T x) : BigInt(std::vector<T>(1, x)) {}\\n template <typename T, std::enable_if_t<std::is_integral<T>::value,\\n std::nullptr_t> = nullptr>\\n BigInt(std::vector<T> a) {\\n while (a.size() >= 2 && a.back() == 0) a.pop_back();\\n if (a.size() == 1 && a[0] == 0) {\\n sgn = 0;\\n return;\\n }\\n sgn = (a.back() > 0 ? 1 : -1);\\n if (sgn < 0) {\\n std::transform(a.begin(), a.end(), a.begin(),\\n [](T x) { return -x; });\\n }\\n v = normalize(a);\\n }\\n BigInt(std::string s) : sgn(1) {\\n if (s[0] == '-') {\\n s.erase(s.begin());\\n sgn = -1;\\n }\\n if (s == \\\"0\\\") {\\n sgn = 0;\\n v = {0};\\n return;\\n }\\n for (int r = int(s.size()), l = std::max(0, r - log10_base); r > 0;\\n r = l, l = std::max(0, r - log10_base)) {\\n int tmp = 0;\\n for (int i = l; i < r; ++i) {\\n tmp = tmp * 10 + (s[i] - '0');\\n }\\n v.push_back(tmp);\\n }\\n }\\n\\n BigInt& operator+=(const BigInt& rhs) {\\n int r_sgn = rhs.sgn;\\n if (r_sgn == 0) return *this;\\n if (sgn == 0) return *this = rhs;\\n if (v.size() < rhs.v.size()) v.resize(rhs.v.size(), 0);\\n for (size_t i = 0; i < rhs.v.size(); i++) {\\n if (sgn == r_sgn)\\n v[i] += rhs.v[i];\\n else\\n v[i] -= rhs.v[i];\\n }\\n normalize();\\n return *this;\\n }\\n BigInt& operator-=(const BigInt& rhs) {\\n int r_sgn = rhs.sgn;\\n if (r_sgn == 0) return *this;\\n if (sgn == 0) return *this = -rhs;\\n if (v.size() < rhs.v.size()) v.resize(rhs.v.size(), 0);\\n for (size_t i = 0; i < rhs.v.size(); i++) {\\n if (sgn == r_sgn)\\n v[i] -= rhs.v[i];\\n else\\n v[i] += rhs.v[i];\\n }\\n normalize();\\n return *this;\\n }\\n BigInt& operator*=(const BigInt& rhs) {\\n int r_sgn = rhs.sgn;\\n if (sgn == 0) return *this;\\n if (r_sgn == 0) return *this = rhs;\\n\\n int res_sgn = sgn * r_sgn;\\n\\n // if (v.size() <= 10 || rhs.v.size() <= 10) {\\n // v = multiply_naive(v, rhs.v);\\n // } else if (v.size() + rhs.v.size() - 1 <= (1 << 24)) {\\n // v = multiply_ntt(v, rhs.v);\\n // }\\n\\n if (v.size() <= 2 || rhs.v.size() <= 2) {\\n v = multiply_naive(v, rhs.v);\\n } else {\\n BigInt a = *this, b = rhs;\\n a.sgn = b.sgn = 1;\\n *this = multiply_karatsuba(a, b);\\n }\\n\\n this->sgn = res_sgn;\\n\\n return *this;\\n }\\n\\n friend BigInt operator+(const BigInt& lhs, const BigInt& rhs) {\\n return BigInt(lhs) += rhs;\\n }\\n friend BigInt operator-(const BigInt& lhs, const BigInt& rhs) {\\n return BigInt(lhs) -= rhs;\\n }\\n friend BigInt operator*(const BigInt& lhs, const BigInt& rhs) {\\n return BigInt(lhs) *= rhs;\\n }\\n\\n BigInt operator+() const { return *this; }\\n BigInt operator-() const { return {-sgn, v}; }\\n\\n friend std::istream& operator>>(std::istream& is, BigInt& rhs) {\\n std::string s;\\n is >> s;\\n rhs = BigInt(s);\\n return is;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const BigInt& rhs) {\\n if (rhs.sgn < 0) os << \\\"-\\\";\\n for (int i = int(rhs.v.size()) - 1; i >= 0; i--) {\\n if (i == int(rhs.v.size()) - 1) {\\n os << rhs.v[i];\\n } else {\\n os << std::to_string(rhs.v[i] + base).substr(1, log10_base);\\n }\\n }\\n return os;\\n }\\n\\n private:\\n static constexpr int base = 10, log10_base = 1;\\n int sgn;\\n std::vector<int> v;\\n\\n BigInt(int sgn, std::vector<int> v) : sgn(sgn), v(v) {}\\n\\n void normalize() {\\n if (v.back() < 0) {\\n sgn = -sgn;\\n std::transform(v.begin(), v.end(), v.begin(),\\n [](int x) { return -x; });\\n }\\n int carry = 0;\\n for (size_t i = 0; i < v.size(); i++) {\\n v[i] += carry;\\n if (0 <= v[i] && v[i] < base) {\\n carry = 0;\\n continue;\\n }\\n carry = div_floor(v[i], base);\\n v[i] -= carry * base;\\n if (i == v.size() - 1 && carry != 0) {\\n v.push_back(carry % base);\\n carry /= base;\\n }\\n }\\n\\n while (v.size() >= 2 && v.back() == 0) v.pop_back();\\n if (v.size() == 1 && v[0] == 0) sgn = 0;\\n }\\n\\n template <class T>\\n static std::vector<int> normalize(const std::vector<T>& c) {\\n std::vector<int> res(c.size());\\n T carry = 0;\\n for (size_t i = 0; i < c.size(); i++) {\\n T tmp = c[i];\\n tmp += carry;\\n if (0 <= tmp && tmp < T(base)) {\\n carry = 0;\\n res[i] = int(tmp);\\n continue;\\n }\\n carry = div_floor(tmp, T(base));\\n res[i] = int(tmp - carry * base);\\n }\\n while (carry > 0) {\\n res.push_back(int(carry % base));\\n carry /= base;\\n }\\n\\n while (res.size() >= 2 && res.back() == 0) res.pop_back();\\n\\n return res;\\n }\\n\\n static std::vector<int> multiply_naive(const std::vector<int>& a,\\n const std::vector<int>& b) {\\n std::vector<long long> c(a.size() + b.size() - 1, 0);\\n for (size_t i = 0; i < a.size(); i++) {\\n for (size_t j = 0; j < b.size(); j++) {\\n c[i + j] += a[i] * b[j];\\n }\\n }\\n\\n return normalize(c);\\n }\\n // static std::vector<int> multiply_ntt(const std::vector<int>& a,\\n // const std::vector<int>& b) {\\n // std::vector<long long> al(a.size()), bl(b.size());\\n // for (size_t i = 0; i < a.size(); i++) {\\n // al[i] = (long long)a[i];\\n // }\\n // for (size_t i = 0; i < b.size(); i++) {\\n // bl[i] = (long long)b[i];\\n // }\\n\\n // std::vector<long long> c = atcoder::convolution_ll(al, bl);\\n\\n // return normalize(c);\\n // }\\n static BigInt multiply_karatsuba(BigInt a, BigInt b) {\\n // std::cout << a << \\\" \\\" << b << std::endl;\\n int na = a.v.size(), nb = b.v.size();\\n if (na <= 2 || nb <= 2) return a * b;\\n\\n int n = std::max(na, nb);\\n if (na < n) a.v.resize(n, 0);\\n if (nb < n) b.v.resize(n, 0);\\n\\n int k = n / 2;\\n BigInt x(std::vector<int>(a.v.begin() + k, a.v.end()));\\n BigInt y(std::vector<int>(a.v.begin(), a.v.begin() + k));\\n BigInt z(std::vector<int>(b.v.begin() + k, b.v.end()));\\n BigInt w(std::vector<int>(b.v.begin(), b.v.begin() + k));\\n\\n BigInt xz = multiply_karatsuba(x, z);\\n BigInt yw = multiply_karatsuba(y, w);\\n BigInt t = multiply_karatsuba(x + y, z + w) - xz - yw;\\n\\n a.v = std::vector<int>(2 * k, 0);\\n a.v.insert(a.v.end(), xz.v.begin(), xz.v.end());\\n b.v = std::vector<int>(k, 0);\\n b.v.insert(b.v.end(), t.v.begin(), t.v.end());\\n\\n return a + b + yw;\\n }\\n};\\n\\n} // namespace rklib\\n\\n\\n#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))\\n#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))\\n#define rep(i, n) For(i, 0, n)\\n#define rrep(i, n) rFor(i, n, 0)\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\nusing namespace rklib;\\n\\nusing lint = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<lint, lint>;\\n\\nint main() {\\n BigInt a, b;\\n cin >> a >> b;\\n cout << a * b << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3660,\n \"score_of_the_acc\": -0.0047,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_6347786\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstruct BigIntTiny {\\n int sign;\\n std::vector<int> v;\\n\\n BigIntTiny() : sign(1) {}\\n BigIntTiny(const std::string& s) { *this = s; }\\n BigIntTiny(int v) {\\n char buf[21];\\n sprintf(buf, \\\"%d\\\", v);\\n *this = buf;\\n }\\n void zip(int unzip) {\\n if (unzip == 0) {\\n for (int i = 0; i < (int)v.size(); i++)\\n v[i] = get_pos(i * 4) + get_pos(i * 4 + 1) * 10 + get_pos(i * 4 + 2) * 100 + get_pos(i * 4 + 3) * 1000;\\n }\\n else\\n for (int i = (v.resize(v.size() * 4), (int)v.size() - 1), a; i >= 0; i--)\\n a = (i % 4 >= 2) ? v[i / 4] / 100 : v[i / 4] % 100, v[i] = (i & 1) ? a / 10 : a % 10;\\n setsign(1, 1);\\n }\\n int get_pos(unsigned pos) const { return pos >= v.size() ? 0 : v[pos]; }\\n BigIntTiny& setsign(int newsign, int rev) {\\n for (int i = (int)v.size() - 1; i > 0 && v[i] == 0; i--)\\n v.erase(v.begin() + i);\\n sign = (v.size() == 0 || (v.size() == 1 && v[0] == 0)) ? 1 : (rev ? newsign * sign : newsign);\\n return *this;\\n }\\n std::string to_str() const {\\n BigIntTiny b = *this;\\n std::string s;\\n for (int i = (b.zip(1), 0); i < (int)b.v.size(); ++i)\\n s += char(*(b.v.rbegin() + i) + '0');\\n return (sign < 0 ? \\\"-\\\" : \\\"\\\") + (s.empty() ? std::string(\\\"0\\\") : s);\\n }\\n bool absless(const BigIntTiny& b) const {\\n if (v.size() != b.v.size()) return v.size() < b.v.size();\\n for (int i = (int)v.size() - 1; i >= 0; i--)\\n if (v[i] != b.v[i]) return v[i] < b.v[i];\\n return false;\\n }\\n BigIntTiny operator-() const {\\n BigIntTiny c = *this;\\n c.sign = (v.size() > 1 || v[0]) ? -c.sign : 1;\\n return c;\\n }\\n BigIntTiny& operator=(const std::string& s) {\\n if (s[0] == '-')\\n *this = s.substr(1);\\n else {\\n for (int i = (v.clear(), 0); i < (int)s.size(); ++i)\\n v.push_back(*(s.rbegin() + i) - '0');\\n zip(0);\\n }\\n return setsign(s[0] == '-' ? -1 : 1, sign = 1);\\n }\\n bool operator<(const BigIntTiny& b) const {\\n return sign != b.sign ? sign < b.sign : (sign == 1 ? absless(b) : b.absless(*this));\\n }\\n bool operator==(const BigIntTiny& b) const { return v == b.v && sign == b.sign; }\\n BigIntTiny& operator+=(const BigIntTiny& b) {\\n if (sign != b.sign) return *this = (*this) - -b;\\n v.resize(std::max(v.size(), b.v.size()) + 1);\\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\\n carry += v[i] + b.get_pos(i);\\n v[i] = carry % 10000, carry /= 10000;\\n }\\n return setsign(sign, 0);\\n }\\n BigIntTiny operator+(const BigIntTiny& b) const {\\n BigIntTiny c = *this;\\n return c += b;\\n }\\n void add_mul(const BigIntTiny& b, int mul) {\\n v.resize(std::max(v.size(), b.v.size()) + 2);\\n for (int i = 0, carry = 0; i < (int)b.v.size() || carry; i++) {\\n carry += v[i] + b.get_pos(i) * mul;\\n v[i] = carry % 10000, carry /= 10000;\\n }\\n }\\n BigIntTiny operator-(const BigIntTiny& b) const {\\n if (sign != b.sign) return (*this) + -b;\\n if (absless(b)) return -(b - *this);\\n BigIntTiny c;\\n for (int i = 0, borrow = 0; i < (int)v.size(); i++) {\\n borrow += v[i] - b.get_pos(i);\\n c.v.push_back(borrow);\\n c.v.back() -= 10000 * (borrow >>= 31);\\n }\\n return c.setsign(sign, 0);\\n }\\n BigIntTiny operator*(const BigIntTiny& b) const {\\n if (b < *this) return b * *this;\\n BigIntTiny c, d = b;\\n for (int i = 0; i < (int)v.size(); i++, d.v.insert(d.v.begin(), 0))\\n c.add_mul(d, v[i]);\\n return c.setsign(sign * b.sign, 0);\\n }\\n BigIntTiny operator/(const BigIntTiny& b) const {\\n BigIntTiny c, d;\\n d.v.resize(v.size());\\n double db = 1.0 / (b.v.back() + (b.get_pos((unsigned)b.v.size() - 2) / 1e4) +\\n (b.get_pos((unsigned)b.v.size() - 3) + 1) / 1e8);\\n for (int i = (int)v.size() - 1; i >= 0; i--) {\\n c.v.insert(c.v.begin(), v[i]);\\n int m = (int)((c.get_pos((int)b.v.size()) * 10000 + c.get_pos((int)b.v.size() - 1)) * db);\\n c = c - b * m, d.v[i] += m;\\n while (!(c < b))\\n c = c - b, d.v[i] += 1;\\n }\\n return d.setsign(sign * b.sign, 0);\\n }\\n BigIntTiny operator%(const BigIntTiny& b) const { return *this - *this / b * b; }\\n bool operator>(const BigIntTiny& b) const { return b < *this; }\\n bool operator<=(const BigIntTiny& b) const { return !(b < *this); }\\n bool operator>=(const BigIntTiny& b) const { return !(*this < b); }\\n bool operator!=(const BigIntTiny& b) const { return !(*this == b); }\\n};\\n//FFT部分 \\nconst double PI = acos(-1);\\ntypedef complex<double> Complex;\\nconst int maxn = 3e6 + 10;\\n\\nComplex a[maxn], b[maxn];\\nint m, n;\\nint bit = 2, rev[maxn];\\nint ans[maxn];\\n\\nvoid get_rev() {\\n memset(rev, 0, sizeof(rev));\\n while (bit <= n + m) bit <<= 1;\\n for (int i = 0; i < bit; ++i) {\\n rev[i] = (rev[i >> 1] >> 1) | (bit >> 1) * (i & 1);\\n }\\n}\\n\\nvoid FFT(Complex* a, int op) {\\n for (int i = 0; i < bit; ++i) {\\n if (i < rev[i]) swap(a[i], a[rev[i]]);\\n }\\n for (int mid = 1; mid < bit; mid <<= 1) {\\n Complex wn = Complex(cos(PI / mid), op * sin(PI / mid));\\n for (int j = 0; j < bit; j += mid << 1) {\\n Complex w(1, 0);\\n for (int k = 0; k < mid; ++k, w = w * wn) {\\n Complex x = a[j + k], y = w * a[j + k + mid];\\n a[j + k] = x + y, a[j + k + mid] = x - y;\\n }\\n }\\n }\\n}\\n\\nstring fftmul(string s1, string s2) {\\n //cout<<s1<<endl<<s2<<endl;\\n n = s1.size(), m = s2.size();\\n memset(a, 0, sizeof(a));\\n memset(b, 0, sizeof(b));\\n for (int i = 0; i < n; ++i) {\\n a[i] = s1[n - i - 1] - '0';\\n }\\n for (int i = 0; i < m; ++i) {\\n b[i] = s2[m - i - 1] - '0';\\n }\\n get_rev();\\n FFT(a, 1);\\n FFT(b, 1);\\n for (int i = 0; i <= bit; ++i) {\\n a[i] *= b[i];\\n }\\n FFT(a, -1);\\n for (int i = 0; i < n + m; ++i) {\\n ans[i] = (int)(a[i].real() / bit + 0.5);\\n }\\n for (int i = 1; i < n + m; ++i) {\\n ans[i] = ans[i] + ans[i - 1] / 10;\\n ans[i - 1] = ans[i - 1] % 10;\\n }\\n int s = n + m - 1;\\n for (; s >= 0; --s) {\\n if (ans[s]) break;\\n }\\n string ret;\\n if (s < 0) ret.push_back('0');//printf(\\\"0\\\\n\\\");\\n else {\\n for (int i = s; i >= 0; --i) {\\n ret.push_back(ans[i] + '0');//printf(\\\"%d\\\", ans[i]);\\n }\\n //printf(\\\"\\\\n\\\");\\n }\\n return ret;\\n}\\n\\nBigIntTiny fastmul(BigIntTiny b1, BigIntTiny b2) {\\n //cout<<b1.to_str()<<'\\\\n'<<b2.to_str()<<endl;\\n //cout<<fftmul(b1.to_str(),b2.to_str())<<endl;\\n bool flag = 0;//要不要变负,1负\\n if (b1 < 0)b1 = -b1, flag ^= 1;\\n if (b2 < 0)b2 = -b2, flag ^= 1;\\n BigIntTiny ans = fftmul(b1.to_str(), b2.to_str());\\n return flag ? -ans : ans;\\n}\\nconst int p = 998244353;\\nBigIntTiny qpow(BigIntTiny a, BigIntTiny n, BigIntTiny p) {\\n BigIntTiny res = 1;\\n while (n>0) {\\n if (n % 2 == 1) res = res * a % p;\\n a = a * a % p;\\n n = n / 2;\\n }\\n return res;\\n}\\nBigIntTiny qpow1(BigIntTiny a, BigIntTiny n) {\\n BigIntTiny res = 1;\\n while (n > 0) {\\n if (n % 2 == 1) res = res * a;\\n a = a * a;\\n n = n / 2;\\n }\\n return res;\\n}\\nBigIntTiny v[51], sum[51];\\nint main(){\\n string a, b;\\n cin>>a>>b;\\n cout<<(BigIntTiny(a)*BigIntTiny(b)).to_str()<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 97060,\n \"score_of_the_acc\": -1.037,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_5535128\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <sstream>\\n\\nusing namespace std;\\n\\n//#define InputOutputOperatorOverload\\n\\nclass BigData {\\npublic:\\n\\tBigData() {\\n\\t\\tthis->data = \\\"\\\";\\n\\t\\tthis->minFlag = false;\\n\\t}\\n\\n#ifdef InputOutputOperatorOverload\\n\\tfriend istream& operator >>(istream& in, BigData& bigdata) {\\n\\t\\tin >> bigdata.data;\\n\\t\\treturn in;\\n\\t}\\n\\n\\tfriend ostream& operator <<(ostream& out, BigData& bigdata) {\\n\\t\\tout << bigdata.data;\\n\\t\\treturn out;\\n\\t}\\n#else\\n\\tstring getValue() {\\n\\t\\treturn this->data;\\n\\t}\\n\\n\\tvoid setValue(string value) {\\n\\t\\tthis->data = value;\\n\\t}\\n#endif\\n\\n\\tBigData operator +(const BigData& add) {\\n\\t\\tstring add1, add2;\\n\\t\\tBigData ans;\\n\\n\\t\\tadd1 = this->data;\\n\\t\\tadd2 = add.data;\\n\\t\\tif (add1[0] != '-' && add2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = getAdd(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] == '-' && add2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tadd1 = add1.substr(1);\\n\\t\\t\\tadd2 = add2.substr(1);\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = getAdd(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] == '-' && add2[0] != '-') {\\n\\t\\t\\tadd1 = add1.substr(1);\\n\\t\\t\\tminFlag = compareAndChange(add1, add2) ? false : true;\\n\\t\\t\\tif (add1 == add2) {\\n\\t\\t\\t\\tminFlag = false;\\n\\t\\t\\t}\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = calculate(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] != '-' && add2[0] == '-') {\\n\\t\\t\\tadd2 = add2.substr(1);\\n\\t\\t\\tminFlag = compareAndChange(add1, add2);\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = calculate(add1, add2);\\n\\t\\t}\\n\\n\\t\\tif (minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator -(const BigData& sub) {\\n\\t\\tstring sub1, sub2;\\n\\t\\tBigData ans;\\n\\n\\t\\tsub1 = this->data;\\n\\t\\tsub2 = sub.data;\\n\\t\\tif (sub1[0] != '-' && sub2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tsub2 = sub2.substr(1);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = getAdd(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] == '-' && sub2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tsub1 = sub1.substr(1);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = getAdd(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] != '-' && sub2[0] != '-') {\\n\\t\\t\\tminFlag = compareAndChange(sub1, sub2);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = calculate(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] == '-' && sub2[0] == '-') {\\n\\t\\t\\tsub1 = sub1.substr(1);\\n\\t\\t\\tsub2 = sub2.substr(1);\\n\\t\\t\\tminFlag = compareAndChange(sub1, sub2) ? false : true;\\n\\t\\t\\tif (sub1 == sub2) {\\n\\t\\t\\t\\tminFlag = false;\\n\\t\\t\\t}\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = calculate(sub1, sub2);\\n\\t\\t}\\n\\n\\t\\tif (minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator *(const BigData& mul) {\\n\\t\\tstring mul1, mul2;\\n\\t\\tBigData ans;\\n\\n\\t\\tmul1 = this->data;\\n\\t\\tmul2 = mul.data;\\n\\t\\tif (mul1[0] != '-' && mul2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t}\\n\\t\\telse if (mul1[0] == '-' && mul2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tmul1 = mul1.substr(1);\\n\\t\\t\\tmul2 = mul2.substr(1);\\n\\t\\t}\\n\\t\\telse if (mul1[0] == '-' && mul2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tmul1 = mul1.substr(1);\\n\\t\\t}\\n\\t\\telse if (mul1[0] != '-' && mul2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tmul2 = mul2.substr(1);\\n\\t\\t}\\n\\n\\t\\treverse(mul1.begin(), mul1.end());\\n\\t\\treverse(mul2.begin(), mul2.end());\\n\\t\\tans.data = getMul(mul1, mul2);\\n\\n\\t\\tif (ans.data != \\\"0\\\" && minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator /(const BigData& div) {\\n\\t\\tstring div1, div2, rem;\\n\\t\\tBigData ans;\\n\\n\\t\\tdiv1 = this->data;\\n\\t\\tdiv2 = div.data;\\n\\t\\tif (div1[0] != '-' && div2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t}\\n\\t\\telse if (div1[0] == '-' && div2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tdiv1 = div1.substr(1);\\n\\t\\t\\tdiv2 = div2.substr(1);\\n\\t\\t}\\n\\t\\telse if (div1[0] == '-' && div2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tdiv1 = div1.substr(1);\\n\\t\\t}\\n\\t\\telse if (div1[0] != '-' && div2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tdiv2 = div2.substr(1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tans.data = getDiv(div1, div2, rem);\\n\\t\\tif (ans.data != \\\"0\\\" && minFlag) {\\n\\t\\t\\tans.data = \\\"-\\\" + ans.data;\\n\\t\\t}\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator %(const BigData& div) {\\n\\t\\tstring div1, div2, rem;\\n\\t\\tBigData ans;\\n\\n\\t\\tdiv1 = this->data;\\n\\t\\tdiv2 = div.data;\\n\\t\\tif (div1[0] != '-' && div2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t}\\n\\t\\telse if (div1[0] == '-' && div2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tdiv1 = div1.substr(1);\\n\\t\\t\\tdiv2 = div2.substr(1);\\n\\t\\t}\\n\\t\\telse if (div1[0] == '-' && div2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tdiv1 = div1.substr(1);\\n\\t\\t}\\n\\t\\telse if (div1[0] != '-' && div2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tdiv2 = div2.substr(1);\\n\\t\\t}\\n\\n\\t\\tans.data = getDiv(div1, div2, rem);\\n\\t\\tans.data = rem;\\n\\t\\tif (ans.data != \\\"0\\\" && minFlag) {\\n\\t\\t\\tans.data = \\\"-\\\" + ans.data;\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn ans;\\n\\t}\\n\\n\\nprivate:\\n\\tstring data;\\n\\tbool minFlag;\\n\\n\\tbool compareAndChange(string& d1, string& d2) {\\n\\t\\tunsigned int len1, len2;\\n\\n\\t\\tlen1 = d1.size();\\n\\t\\tlen2 = d2.size();\\n\\t\\tif (len1 > len2) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tif (len1 < len2 || d1 < d2) {\\n\\t\\t\\td1.swap(d2);\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\n\\tbool compare(const string& d1, const string& d2) {\\n\\t\\tunsigned int len1, len2;\\n\\n\\t\\tlen1 = d1.size();\\n\\t\\tlen2 = d2.size();\\n\\t\\tif (len1 > len2) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tif (len1 < len2 || d1 < d2) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\n\\tstring getAdd(const string& add1, const string& add2) {\\n\\t\\tunsigned int len1, len2, i;\\n\\t\\tint acc, sum;\\n\\t\\tstringstream ss;\\n\\n\\t\\tlen1 = add1.size();\\n\\t\\tlen2 = add2.size();\\n\\t\\t//cout << add1 << endl << add2 << endl;\\n\\n\\t\\ti = 0;\\n\\t\\tacc = 0;\\n\\t\\tss.clear();\\n\\t\\tss.str(\\\"\\\");\\n\\t\\twhile (i < len1 && i < len2) {\\n\\t\\t\\tsum = (add1[i] - '0') + (add2[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len1) {\\n\\t\\t\\tsum = (add1[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len2) {\\n\\t\\t\\tsum = (add2[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\tif (acc == 1) {\\n\\t\\t\\tss << 1;\\n\\t\\t}\\n\\n\\t\\treturn ss.str();\\n\\t}\\n\\n\\tstring getSub(const string& sub1, const string& sub2) {\\n\\t\\tunsigned int len1, len2, i;\\n\\t\\tint acc, sum;\\n\\t\\tstringstream ss;\\n\\n\\t\\tlen1 = sub1.size();\\n\\t\\tlen2 = sub2.size();\\n\\t\\t//cout << sub1 << endl << sub2 << endl;\\n\\n\\t\\ti = 0;\\n\\t\\tacc = 0;\\n\\t\\tss.clear();\\n\\t\\tss.str(\\\"\\\");\\n\\t\\twhile (i < len1 && i < len2) {\\n\\t\\t\\tsum = (sub1[i] - '0') - acc - (sub2[i] - '0');\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len1) {\\n\\t\\t\\tsum = (sub1[i] - '0') - acc;\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len2) {\\n\\t\\t\\tsum = (sub2[i] - '0') - acc;\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\treturn ss.str();\\n\\t}\\n\\n\\tstring calculate(const string& data1, const string& data2) {\\n\\t\\tstring ans;\\n\\n\\t\\tans = getSub(data1, data2);\\n\\t\\twhile (true) {\\n\\t\\t\\tauto it = ans.rbegin();\\n\\t\\t\\tif (ans.size() == 1 || *it != '0') {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tstring getMul(const string& mul1, const string& mul2) {\\n\\t\\tunsigned int len1, len2;\\n\\t\\tint acc, sum, base;\\n\\t\\tstringstream ss;\\n\\t\\tstring curSum;\\n\\n\\t\\tif (mul1 == \\\"0\\\" || mul2 == \\\"0\\\") {\\n\\t\\t\\treturn \\\"0\\\";\\n\\t\\t}\\n\\n\\t\\tlen1 = mul1.size();\\n\\t\\tlen2 = mul2.size();\\n\\t\\t//cout << mul1 << endl << mul2 << endl;\\n\\n\\t\\tcurSum = \\\"\\\";\\n\\t\\tfor (unsigned int i = 0; i < len2; ++i) {\\n\\t\\t\\tstring temp(\\\"\\\"), res(\\\"\\\");\\n\\t\\t\\tfor (unsigned int k = 0; k < i; ++k) {\\n\\t\\t\\t\\ttemp += \\\"0\\\";\\n\\t\\t\\t}\\n\\t\\t\\tbase = mul2[i] - '0';\\n\\t\\t\\tacc = 0;\\n\\t\\t\\tss.clear();\\n\\t\\t\\tss.str(\\\"\\\");\\n\\t\\t\\tfor (unsigned int j = 0; j < len1; ++j) {\\n\\t\\t\\t\\tsum = base * (mul1[j] - '0') + acc;\\n\\t\\t\\t\\tacc = sum / 10;\\n\\t\\t\\t\\tsum %= 10;\\n\\t\\t\\t\\tss << sum;\\n\\t\\t\\t}\\n\\t\\t\\tif (acc != 0) {\\n\\t\\t\\t\\tss << acc;\\n\\t\\t\\t}\\n\\t\\t\\tres = temp + ss.str();\\n\\t\\t\\t//cout << \\\"res=\\\" << res << endl;\\n\\t\\t\\tcurSum = getAdd(curSum, res);\\n\\t\\t\\t//cout << \\\"curSum=\\\" << curSum << endl;\\n\\t\\t}\\n\\n\\t\\treturn curSum;\\n\\t}\\n\\n\\tstring getDiv(const string& div1, const string& div2, string &rem) {\\n\\t\\tunsigned int len1, len2, i;\\n\\t\\tunsigned int k;\\n\\t\\tstringstream ss;\\n\\t\\tstring curSum, curSumTmp, curNum, div2Tmp, ans;\\n\\n\\t\\tif (compare(div1, div2)) {\\n\\t\\t\\trem = \\\"0\\\";\\n\\t\\t\\treturn \\\"0\\\";\\n\\t\\t}\\n\\n\\t\\tlen1 = div1.size();\\n\\t\\tlen2 = div2.size();\\n\\t\\t//cout << div1 << endl << div2 << endl;\\n\\n\\t\\tans = \\\"\\\";\\n\\t\\tcurSum = div1.substr(0, len2);\\n\\t\\ti = len2 - 1;\\n\\t\\tif (curSum < div2) {\\n\\t\\t\\tcurSum += div1[len2];\\n\\t\\t\\ti = len2;\\n\\t\\t}\\n\\t\\t//cout << \\\"curSum=\\\" << curSum << endl;\\n\\t\\tfor (; i < len1; ++i) {\\n\\t\\t\\tif (compare(curSum, div2)) {\\n\\t\\t\\t\\tcurSum += div1[i];\\n\\t\\t\\t}\\n\\t\\t\\t//cout << \\\"1:curSum=\\\" << curSum << endl;\\n\\t\\t\\tcurSumTmp = curSum;\\n\\t\\t\\tdiv2Tmp = div2;\\n\\t\\t\\treverse(curSumTmp.begin(), curSumTmp.end());\\n\\t\\t\\treverse(div2Tmp.begin(), div2Tmp.end());\\n\\t\\t\\tfor (k = 0; k < 10; ++k) {\\n\\t\\t\\t\\tss.clear();\\n\\t\\t\\t\\tss.str(\\\"\\\");\\n\\t\\t\\t\\tss << k;\\n\\t\\t\\t\\tcurNum = ss.str();\\n\\t\\t\\t\\tstring res = getMul(div2Tmp, curNum);\\n\\t\\t\\t\\t//cout << \\\" 1:res=\\\" << res << endl;\\n\\t\\t\\t\\tres = calculate(curSumTmp, res);\\n\\t\\t\\t\\t//cout << \\\" 2:res=\\\" << res << endl;\\n\\t\\t\\t\\treverse(res.begin(), res.end());\\n\\t\\t\\t\\t//cout << \\\" 3:res=\\\" << res << endl;\\n\\t\\t\\t\\tif (compare(res, div2)) {\\n\\t\\t\\t\\t\\tans += curNum;\\n\\t\\t\\t\\t\\tcurSum = res;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trem = curSum;\\n\\t\\t//cout << \\\" rem=\\\" << rem << endl;\\n\\t\\treturn ans;\\n\\t}\\n};\\n\\n\\n\\nint main(void) {\\n\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\tcout.tie(NULL);\\n\\n\\tBigData data1, data2;\\n\\n#ifdef InputOutputOperatorOverload\\n\\tcin >> data1 >> data2;\\n\\n\\t//cout << \\\"data1=\\\" << data1 << endl << \\\"data2=\\\" << data2 << endl;\\n\\tcout << data1 + data2 << endl;\\n\\tcout << data1 - data2 << endl;\\n\\tcout << data1 * data2 << endl;\\n\\tcout << data1 / data2 << endl;\\n\\tcout << data1 % data2 << endl;\\n#else\\n\\tstring d1, d2;\\n\\tcin >> d1 >> d2;\\n\\tdata1.setValue(d1);\\n\\tdata2.setValue(d2);\\n\\n\\t//cout << \\\"data1=\\\" << data1.getValue() << endl << \\\"data2=\\\" << data2.getValue() << endl;\\n\\t//cout << (data1 + data2).getValue() << endl;\\n\\t//cout << (data1 - data2).getValue() << endl;\\n\\tcout << (data1 * data2).getValue() << endl;\\n\\t//cout << (data1 / data2).getValue() << endl;\\n\\t//cout << (data1 % data2).getValue() << endl;\\n#endif\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.2253,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_5518695\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <sstream>\\n\\nusing namespace std;\\n\\n//#define InputOutputOperatorOverload\\n\\nclass BigData {\\npublic:\\n#ifdef InputOutputOperatorOverload\\n\\tfriend istream& operator >>(istream& in, BigData& bigdata) {\\n\\t\\tin >> bigdata.data;\\n\\t\\treturn in;\\n\\t}\\n\\n\\tfriend ostream& operator <<(ostream& out, BigData& bigdata) {\\n\\t\\tout << bigdata.data;\\n\\t\\treturn out;\\n\\t}\\n#else\\n\\tstring getValue() {\\n\\t\\treturn this->data;\\n\\t}\\n\\n\\tvoid setValue(string value) {\\n\\t\\tthis->data = value;\\n\\t}\\n#endif\\n\\n\\tBigData operator +(const BigData& add) {\\n\\t\\tstring add1, add2;\\n\\t\\tBigData ans;\\n\\n\\t\\tadd1 = this->data;\\n\\t\\tadd2 = add.data;\\n\\t\\tif (add1[0] != '-' && add2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = getAdd(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] == '-' && add2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tadd1 = add1.substr(1);\\n\\t\\t\\tadd2 = add2.substr(1);\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = getAdd(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] == '-' && add2[0] != '-') {\\n\\t\\t\\tadd1 = add1.substr(1);\\n\\t\\t\\tminFlag = compare(add1, add2) ? false : true;\\n\\t\\t\\tif (add1 == add2) {\\n\\t\\t\\t\\tminFlag = false;\\n\\t\\t\\t}\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = calculate(add1, add2);\\n\\t\\t}\\n\\t\\telse if (add1[0] != '-' && add2[0] == '-') {\\n\\t\\t\\tadd2 = add2.substr(1);\\n\\t\\t\\tminFlag = compare(add1, add2);\\n\\t\\t\\treverse(add1.begin(), add1.end());\\n\\t\\t\\treverse(add2.begin(), add2.end());\\n\\t\\t\\tans.data = calculate(add1, add2);\\n\\t\\t}\\n\\n\\t\\tif (minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator -(const BigData& sub) {\\n\\t\\tstring sub1, sub2;\\n\\t\\tBigData ans;\\n\\n\\t\\tsub1 = this->data;\\n\\t\\tsub2 = sub.data;\\n\\t\\tif (sub1[0] != '-' && sub2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tsub2 = sub2.substr(1);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = getAdd(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] == '-' && sub2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tsub1 = sub1.substr(1);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = getAdd(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] != '-' && sub2[0] != '-') {\\n\\t\\t\\tminFlag = compare(sub1, sub2);\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = calculate(sub1, sub2);\\n\\t\\t}\\n\\t\\telse if (sub1[0] == '-' && sub2[0] == '-') {\\n\\t\\t\\tsub1 = sub1.substr(1);\\n\\t\\t\\tsub2 = sub2.substr(1);\\n\\t\\t\\tminFlag = compare(sub1, sub2) ? false : true;\\n\\t\\t\\tif (sub1 == sub2) {\\n\\t\\t\\t\\tminFlag = false;\\n\\t\\t\\t}\\n\\t\\t\\treverse(sub1.begin(), sub1.end());\\n\\t\\t\\treverse(sub2.begin(), sub2.end());\\n\\t\\t\\tans.data = calculate(sub1, sub2);\\n\\t\\t}\\n\\n\\t\\tif (minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tBigData operator *(const BigData& mul) {\\n\\t\\tstring mul1, mul2;\\n\\t\\tBigData ans;\\n\\n\\t\\tmul1 = this->data;\\n\\t\\tmul2 = mul.data;\\n\\t\\tif (mul1[0] != '-' && mul2[0] != '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t}\\n\\t\\telse if (mul1[0] == '-' && mul2[0] == '-') {\\n\\t\\t\\tminFlag = false;\\n\\t\\t\\tmul1 = mul1.substr(1);\\n\\t\\t\\tmul2 = mul2.substr(1);\\n\\t\\t}\\n\\t\\telse if (mul1[0] == '-' && mul2[0] != '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tmul1 = mul1.substr(1);\\n\\t\\t}\\n\\t\\telse if (mul1[0] != '-' && mul2[0] == '-') {\\n\\t\\t\\tminFlag = true;\\n\\t\\t\\tmul2 = mul2.substr(1);\\n\\t\\t}\\n\\t\\tif (mul1 == \\\"0\\\" || mul2 == \\\"0\\\") {\\n\\t\\t\\tans.data = \\\"0\\\";\\n\\t\\t\\treturn ans;\\n\\t\\t}\\n\\n\\t\\treverse(mul1.begin(), mul1.end());\\n\\t\\treverse(mul2.begin(), mul2.end());\\n\\t\\tans.data = getMul(mul1, mul2);\\n\\n\\t\\tif (minFlag) {\\n\\t\\t\\tans.data += \\\"-\\\";\\n\\t\\t}\\n\\t\\treverse(ans.data.begin(), ans.data.end());\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\nprivate:\\n\\tstring data;\\n\\tbool minFlag;\\n\\n\\tbool compare(string& d1, string& d2) {\\n\\t\\tunsigned int len1, len2;\\n\\n\\t\\tlen1 = d1.size();\\n\\t\\tlen2 = d2.size();\\n\\t\\tif (len1 > len2) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tif (len1 < len2 || d1 < d2) {\\n\\t\\t\\td1.swap(d2);\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\\n\\n\\tstring getAdd(string& add1, string& add2) {\\n\\t\\tunsigned int len1, len2, i;\\n\\t\\tint acc, sum;\\n\\t\\tstringstream ss;\\n\\n\\t\\tlen1 = add1.size();\\n\\t\\tlen2 = add2.size();\\n\\t\\t//cout << add1 << endl << add2 << endl;\\n\\n\\t\\ti = 0;\\n\\t\\tacc = 0;\\n\\t\\tss.clear();\\n\\t\\tss.str(\\\"\\\");\\n\\t\\twhile (i < len1 && i < len2) {\\n\\t\\t\\tsum = (add1[i] - '0') + (add2[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len1) {\\n\\t\\t\\tsum = (add1[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len2) {\\n\\t\\t\\tsum = (add2[i] - '0') + acc;\\n\\t\\t\\tacc = sum / 10;\\n\\t\\t\\tsum %= 10;\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\tif (acc == 1) {\\n\\t\\t\\tss << 1;\\n\\t\\t}\\n\\n\\t\\treturn ss.str();\\n\\t}\\n\\n\\tstring getSub(string& sub1, string& sub2) {\\n\\t\\tunsigned int len1, len2, i;\\n\\t\\tint acc, sum;\\n\\t\\tstringstream ss;\\n\\n\\t\\tlen1 = sub1.size();\\n\\t\\tlen2 = sub2.size();\\n\\t\\t//cout << sub1 << endl << sub2 << endl;\\n\\n\\t\\ti = 0;\\n\\t\\tacc = 0;\\n\\t\\tss.clear();\\n\\t\\tss.str(\\\"\\\");\\n\\t\\twhile (i < len1 && i < len2) {\\n\\t\\t\\tsum = (sub1[i] - '0') - acc - (sub2[i] - '0');\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len1) {\\n\\t\\t\\tsum = (sub1[i] - '0') - acc;\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\twhile (i < len2) {\\n\\t\\t\\tsum = (sub2[i] - '0') - acc;\\n\\t\\t\\tif (sum < 0) {\\n\\t\\t\\t\\tacc = 1;\\n\\t\\t\\t\\tsum += 10;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tacc = 0;\\n\\t\\t\\t}\\n\\t\\t\\tss << sum;\\n\\t\\t\\t++i;\\n\\t\\t}\\n\\n\\t\\treturn ss.str();\\n\\t}\\n\\n\\tstring calculate(string& data1, string& data2) {\\n\\t\\tstring ans;\\n\\n\\t\\tans = getSub(data1, data2);\\n\\t\\twhile (true) {\\n\\t\\t\\tauto it = ans.rbegin();\\n\\t\\t\\tif (ans.size() == 1 || *it != '0') {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tstring getMul(string& mul1, string& mul2) {\\n\\t\\tunsigned int len1, len2;\\n\\t\\tint acc, sum, base;\\n\\t\\tstringstream ss;\\n\\t\\tstring curSum;\\n\\n\\t\\tlen1 = mul1.size();\\n\\t\\tlen2 = mul2.size();\\n\\t\\t//cout << mul1 << endl << mul2 << endl;\\n\\n\\t\\tcurSum = \\\"\\\";\\n\\t\\tfor (unsigned int i = 0; i < len2; ++i) {\\n\\t\\t\\tstring temp(\\\"\\\"), res(\\\"\\\");\\n\\t\\t\\tfor (unsigned int k = 0; k < i; ++k) {\\n\\t\\t\\t\\ttemp += \\\"0\\\";\\n\\t\\t\\t}\\n\\t\\t\\tbase = mul2[i] - '0';\\n\\t\\t\\tacc = 0;\\n\\t\\t\\tss.clear();\\n\\t\\t\\tss.str(\\\"\\\");\\n\\t\\t\\tfor (unsigned int j = 0; j < len1; ++j) {\\n\\t\\t\\t\\tsum = base * (mul1[j] - '0') + acc;\\n\\t\\t\\t\\tacc = sum / 10;\\n\\t\\t\\t\\tsum %= 10;\\n\\t\\t\\t\\tss << sum;\\n\\t\\t\\t}\\n\\t\\t\\tif (acc != 0) {\\n\\t\\t\\t\\tss << acc;\\n\\t\\t\\t}\\n\\t\\t\\tres = temp + ss.str();\\n\\t\\t\\t//cout << \\\"res=\\\" << res << endl;\\n\\t\\t\\tcurSum = getAdd(curSum, res);\\n\\t\\t\\t//cout << \\\"curSum=\\\" << curSum << endl;\\n\\t\\t}\\n\\n\\t\\treturn curSum;\\n\\t}\\n};\\n\\n\\n\\nint main(void) {\\n\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\tcout.tie(NULL);\\n\\n\\tBigData data1, data2;\\n\\n#ifdef InputOutputOperatorOverload\\n\\tcin >> data1 >> data2;\\n\\n\\t//cout << \\\"data1=\\\" << data1 << endl << \\\"data2=\\\" << data2 << endl;\\n\\t//cout << data1 + data2 << endl;\\n\\t//cout << data1 - data2 << endl;\\n\\t//cout << data1 * data2 << endl;\\n#else\\n\\tstring d1, d2;\\n\\tcin >> d1 >> d2;\\n\\tdata1.setValue(d1);\\n\\tdata2.setValue(d2);\\n\\n\\t//cout << \\\"data1=\\\" << data1.getValue() << endl << \\\"data2=\\\" << data2.getValue() << endl;\\n\\t//cout << (data1 + data2).getValue() << endl;\\n\\t//cout << (data1 - data2).getValue() << endl;\\n\\tcout << (data1 * data2).getValue() << endl;\\n#endif\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.1512,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4589998\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//template\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define ALL(v) (v).begin(),(v).end()\\ntypedef long long int ll;\\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\n//end\\n\\ntemplate<typename T>struct FFT{\\n struct C{\\n T x,y;\\n C(T _x=0,T _y=0):x(_x),y(_y){}\\n C operator~()const{return {x,-y};}\\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\\n };\\n vector<C> rt;\\n FFT(int lg=20){\\n rt.resize(1<<lg,1);\\n rep(k,1,lg){\\n int d=1<<k;\\n rep(i,0,d){\\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\\n else rt[d+i]=rt[(d+i)>>1];\\n }\\n }\\n }\\n void fft(vector<C>& a,bool inv=0){\\n int n=a.size(); assert((n&(n-1))==0);\\n if(inv){\\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\\n }\\n else{\\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\\n }\\n }\\n for(int i=0,j=1;j<n-1;j++){\\n for(int k=n>>1;k>(i^=k);k>>=1);\\n if(j<i)swap(a[i],a[j]);\\n }\\n }\\n vector<ll> conv(vector<ll> a,vector<ll> b){\\n if(a.empty() or b.empty())return vector<ll>();\\n int n=a.size()+b.size()-1,m=1; vector<ll> res(n); while(m<n)m<<=1;\\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\\n fft(c); C rad(0,-0.25/m);\\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\\n c[i]=z;\\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\\n }\\n};\\n\\nFFT<double> fft;\\ntemplate<int D=4>struct bigint{\\n int B,sign; vector<ll> v;\\n bigint(ll x=0){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(x<0)x*=-1,sign=0;\\n do{v.push_back(x%B); x/=B;\\n }while(x);\\n }\\n bigint(string s){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(s[0]=='-')s.erase(s.begin()),sign=0;\\n int add=0,cnt=0,base=1;\\n while(s.size()){\\n if(cnt==D){\\n v.push_back(add);\\n cnt=0; add=0; base=1;\\n }\\n add=(s.back()-'0')*base+add;\\n cnt++; base*=10;\\n s.pop_back();\\n }\\n if(add)v.push_back(add);\\n }\\n bigint operator-()const{\\n bigint res=*this;\\n res.sign^=1; return res;\\n }\\n bigint abs()const{\\n bigint res=*this;\\n res.sign=1; return res;\\n }\\n ll& operator[](const int i){return v[i];}\\n int size()const{return v.size();}\\n void norm(){\\n rep(i,0,v.size()-1){\\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\\n else{\\n int c=(-v[i]+B-1)/B;\\n v[i]+=c*B; v[i+1]-=c;\\n }\\n }\\n while(!v.empty() and v.back()>=B){\\n int c=v.back()/B;\\n v.back()%=B; v.push_back(c);\\n }\\n while(v.size()>1 and v.back()==0)v.pop_back();\\n }\\n friend istream& operator>>(istream& is,bigint<D>& x){\\n string tmp; is>>tmp;\\n x=bigint(tmp); return is;\\n }\\n friend ostream& operator<<(ostream& os,bigint<D> x){\\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\\\"0\\\";\\n else{\\n if(!x.sign)os<<\\\"-\\\";\\n string res=to_string(x.v.back());\\n for(int i=x.size()-2;i>=0;i--){\\n string add; int w=x[i];\\n rep(_,0,D){\\n add+=('0'+(w%10)); w/=10;\\n } reverse(ALL(add)); res+=add;\\n } os<<res;\\n }\\n return os;\\n }\\n bigint& operator+=(const bigint& x){\\n if(sign!=x.sign){*this-=(-x); return *this;}\\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\\n rep(i,0,x.size())v[i]+=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator-=(const bigint& x){\\n if(sign!=x.sign){*this+=(-x); return *this;}\\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\\n rep(i,0,x.size())v[i]-=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator*=(const bigint& x){\\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\\n norm(); return *this;\\n } /*\\n bigint& operator/=(const bigint& x){\\n \\n } */\\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\\n bool operator<(const bigint& x)const{\\n if(sign!=x.sign)return sign<x.sign;\\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\\n return false;\\n }\\n bool operator>(const bigint& x)const{return x<*this;}\\n bool operator<=(const bigint& x)const{return !(x>*this);}\\n bool operator>=(const bigint& x)const{return !(x<*this);}\\n};\\ntypedef bigint<4> Bigint;\\n\\nint main(){\\n Bigint x,y;\\n cin>>x>>y;\\n cout<<x*y<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 19040,\n \"score_of_the_acc\": -0.2056,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4589996\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//template\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define ALL(v) (v).begin(),(v).end()\\ntypedef long long int ll;\\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\n//end\\n\\ntemplate<typename T>struct FFT{\\n struct C{\\n T x,y;\\n C(T _x=0,T _y=0):x(_x),y(_y){}\\n C operator~()const{return {x,-y};}\\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\\n };\\n vector<C> rt;\\n FFT(int lg=20){\\n rt.resize(1<<lg,1);\\n rep(k,1,lg){\\n int d=1<<k;\\n rep(i,0,d){\\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\\n else rt[d+i]=rt[(d+i)>>1];\\n }\\n }\\n }\\n void fft(vector<C>& a,bool inv=0){\\n int n=a.size(); assert((n&(n-1))==0);\\n if(inv){\\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\\n }\\n else{\\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\\n }\\n }\\n for(int i=0,j=1;j<n-1;j++){\\n for(int k=n>>1;k>(i^=k);k>>=1);\\n if(j<i)swap(a[i],a[j]);\\n }\\n }\\n vector<int> conv(vector<int> a,vector<int> b){\\n if(a.empty() or b.empty())return vector<int>();\\n int n=a.size()+b.size()-1,m=1; vector<int> res(n); while(m<n)m<<=1;\\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\\n fft(c); C rad(0,-0.25/m);\\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\\n c[i]=z;\\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\\n }\\n};\\n\\nFFT<double> fft;\\ntemplate<int D=4>struct bigint{\\n int B,sign; vector<int> v;\\n bigint(ll x=0){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(x<0)x*=-1,sign=0;\\n do{v.push_back(x%B); x/=B;\\n }while(x);\\n }\\n bigint(string s){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(s[0]=='-')s.erase(s.begin()),sign=0;\\n int add=0,cnt=0,base=1;\\n while(s.size()){\\n if(cnt==D){\\n v.push_back(add);\\n cnt=0; add=0; base=1;\\n }\\n add=(s.back()-'0')*base+add;\\n cnt++; base*=10;\\n s.pop_back();\\n }\\n if(add)v.push_back(add);\\n }\\n bigint operator-()const{\\n bigint res=*this;\\n res.sign^=1; return res;\\n }\\n bigint abs()const{\\n bigint res=*this;\\n res.sign=1; return res;\\n }\\n int& operator[](const int i){return v[i];}\\n int size()const{return v.size();}\\n void norm(){\\n rep(i,0,v.size()-1){\\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\\n else{\\n int c=(-v[i]+B-1)/B;\\n v[i]+=c*B; v[i+1]-=c;\\n }\\n }\\n if(!v.empty() and v.back()>=B){\\n int c=v.back()/B;\\n v.back()%=B; v.push_back(c);\\n }\\n while(v.size()>1 and v.back()==0)v.pop_back();\\n }\\n friend istream& operator>>(istream& is,bigint<D>& x){\\n string tmp; is>>tmp;\\n x=bigint(tmp); return is;\\n }\\n friend ostream& operator<<(ostream& os,bigint<D> x){\\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\\\"0\\\";\\n else{\\n if(!x.sign)os<<\\\"-\\\";\\n string res=to_string(x.v.back());\\n for(int i=x.size()-2;i>=0;i--){\\n string add; int w=x[i];\\n rep(_,0,D){\\n add+=('0'+(w%10)); w/=10;\\n } reverse(ALL(add)); res+=add;\\n } os<<res;\\n }\\n return os;\\n }\\n bigint& operator+=(const bigint& x){\\n if(sign!=x.sign){*this-=(-x); return *this;}\\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\\n rep(i,0,x.size())v[i]+=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator-=(const bigint& x){\\n if(sign!=x.sign){*this+=(-x); return *this;}\\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\\n rep(i,0,x.size())v[i]-=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator*=(const bigint& x){\\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\\n norm(); return *this;\\n } /*\\n bigint& operator/=(const bigint& x){\\n \\n } */\\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\\n bool operator<(const bigint& x)const{\\n if(sign!=x.sign)return sign<x.sign;\\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\\n return false;\\n }\\n bool operator>(const bigint& x)const{return x<*this;}\\n bool operator<=(const bigint& x)const{return !(x>*this);}\\n bool operator>=(const bigint& x)const{return !(x<*this);}\\n};\\ntypedef bigint<4> Bigint;\\n\\nint main(){\\n Bigint x,y;\\n cin>>x>>y;\\n cout<<x*y<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.64,\n \"time_ms\": 20,\n \"memory_kb\": 19040,\n \"score_of_the_acc\": -0.2056,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4589990\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//template\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define ALL(v) (v).begin(),(v).end()\\ntypedef long long int ll;\\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\n//end\\n\\ntemplate<typename T>struct FFT{\\n struct C{\\n T x,y;\\n C(T _x=0,T _y=0):x(_x),y(_y){}\\n C operator~()const{return {x,-y};}\\n C operator+(const C& c)const{return {x+c.x,y+c.y};}\\n C operator-(const C& c)const{return {x-c.x,y-c.y};}\\n C operator*(const C& c)const{return {x*c.x-y*c.y,x*c.y+y*c.x};}\\n };\\n vector<C> rt;\\n FFT(int lg=20){\\n rt.resize(1<<lg,1);\\n rep(k,1,lg){\\n int d=1<<k;\\n rep(i,0,d){\\n if(i&1)rt[d+i]=C(cos(2*M_PI*i/d),sin(2*M_PI*i/d));\\n else rt[d+i]=rt[(d+i)>>1];\\n }\\n }\\n }\\n void fft(vector<C>& a,bool inv=0){\\n int n=a.size(); assert((n&(n-1))==0);\\n if(inv){\\n for(int i=1;i<n;i<<=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n a[i+j+k]=a[i+j+k]*~rt[i*2+k]; C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp;\\n } rep(i,0,n)a[i].x/=n,a[i].y/=n;\\n }\\n else{\\n for(int i=n>>1;i;i>>=1)for(int j=0;j<n;j+=i*2)for(int k=0;k<i;k++){\\n C tmp=a[j+k]-a[i+j+k];\\n a[j+k]=a[j+k]+a[i+j+k]; a[i+j+k]=tmp*rt[i*2+k];\\n }\\n }\\n for(int i=0,j=1;j<n-1;j++){\\n for(int k=n>>1;k>(i^=k);k>>=1);\\n if(j<i)swap(a[i],a[j]);\\n }\\n }\\n vector<int> conv(vector<int> a,vector<int> b){\\n int n=a.size()+b.size()-1,m=1; vector<int> res(n); while(m<n)m<<=1;\\n vector<C> c(m); rep(i,0,a.size())c[i].x=a[i]; rep(i,0,b.size())c[i].y=b[i];\\n fft(c); C rad(0,-0.25/m);\\n for(int i=0,j=0;i<=m/2;i++,j=(m-i)&(m-1)){\\n C z=(c[j]*c[j]-~(c[i]*c[i]))*rad;\\n if(i!=j)c[j]=(c[i]*c[i]-~(c[j]*c[j]))*rad;\\n c[i]=z;\\n } fft(c); rep(i,0,n)res[i]=c[i].x+0.5; return res;\\n }\\n};\\n\\nFFT<double> fft;\\ntemplate<int D=4>struct bigint{\\n int B,sign; vector<int> v;\\n bigint(ll x=0){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(x<0)x*=-1,sign=0;\\n do{v.push_back(x%B); x/=B;\\n }while(x);\\n }\\n bigint(string s){\\n B=1; rep(_,0,D)B*=10; sign=1;\\n if(s[0]=='-')s.erase(s.begin()),sign=0;\\n int add=0,cnt=0,base=1;\\n while(s.size()){\\n if(cnt==D){\\n v.push_back(add);\\n cnt=0; add=0; base=1;\\n }\\n add=(s.back()-'0')*base+add;\\n cnt++; base*=10;\\n s.pop_back();\\n }\\n if(add)v.push_back(add);\\n }\\n bigint operator-()const{\\n bigint res=*this;\\n res.sign^=1; return res;\\n }\\n bigint abs()const{\\n bigint res=*this;\\n res.sign=1; return res;\\n }\\n int& operator[](const int i){return v[i];}\\n int size()const{return v.size();}\\n void norm(){\\n rep(i,0,v.size()-1){\\n if(v[i]>=0){v[i+1]+=v[i]/B; v[i]%=B;}\\n else{\\n int c=(-v[i]+B-1)/B;\\n v[i]+=c*B; v[i+1]-=c;\\n }\\n }\\n if(!v.empty() and v.back()>=B){\\n int c=v.back()/B;\\n v.back()%=B; v.push_back(c);\\n }\\n while(v.size()>1 and v.back()==0)v.pop_back();\\n }\\n friend istream& operator>>(istream& is,bigint<D>& x){\\n string tmp; is>>tmp;\\n x=bigint(tmp); return is;\\n }\\n friend ostream& operator<<(ostream& os,bigint<D> x){\\n if(x.v.empty() or ((int)x.size()==1 and x[0]==0))os<<\\\"0\\\";\\n else{\\n if(!x.sign)os<<\\\"-\\\";\\n string res=to_string(x.v.back());\\n for(int i=x.size()-2;i>=0;i--){\\n string add; int w=x[i];\\n rep(_,0,D){\\n add+=('0'+(w%10)); w/=10;\\n } reverse(ALL(add)); res+=add;\\n } os<<res;\\n }\\n return os;\\n }\\n bigint& operator+=(const bigint& x){\\n if(sign!=x.sign){*this-=(-x); return *this;}\\n if((int)v.size()<(int)x.size())v.resize(x.size(),0);\\n rep(i,0,x.size())v[i]+=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator-=(const bigint& x){\\n if(sign!=x.sign){*this+=(-x); return *this;}\\n if(abs()<x.abs()){*this=x-(*this); sign^=1; return *this;}\\n rep(i,0,x.size())v[i]-=x.v[i];\\n norm(); return *this;\\n }\\n bigint& operator*=(const bigint& x){\\n if(!x.sign)sign^=1; v=fft.conv(v,x.v);\\n norm(); return *this;\\n } /*\\n bigint& operator/=(const bigint& x){\\n \\n } */\\n bigint operator+(const bigint& x)const{return bigint(*this)+=x;}\\n bigint operator-(const bigint& x)const{return bigint(*this)-=x;}\\n bigint operator*(const bigint& x)const{return bigint(*this)*=x;}\\n bigint operator/(const bigint& x)const{return bigint(*this)/=x;}\\n bool operator<(const bigint& x)const{\\n if(sign!=x.sign)return sign<x.sign;\\n if((int)v.size()!=(int)x.size())return (int)v.size()*sign<(int)x.size()*x.sign;\\n for(int i=v.size()-1;i>=0;i--)if(v[i]!=x.v[i])return v[i]*sign<x.v[i]*x.sign;\\n return false;\\n }\\n bool operator>(const bigint& x)const{return x<*this;}\\n bool operator<=(const bigint& x)const{return !(x>*this);}\\n bool operator>=(const bigint& x)const{return !(x<*this);}\\n};\\ntypedef bigint<4> Bigint;\\n\\nint main(){\\n Bigint x,y;\\n cin>>x>>y;\\n cout<<x*y<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.08,\n \"time_ms\": 20,\n \"memory_kb\": 19008,\n \"score_of_the_acc\": -0.2053,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4498645\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nstruct fast_io {\\n\\tfast_io(){\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t};\\n} fio;\\n\\nclass Karatsuba{\\n\\tint base = 10; // base > 1\\n\\tvector<int> num;\\n\\tbool sign; // true : + false : -\\n\\t\\npublic:\\n\\t\\n\\tKaratsuba(){\\n\\t\\tsign = false;\\n\\t\\tnum.push_back(0);\\n\\t}\\n\\t\\n\\tKaratsuba(size_t size){\\n\\t\\tsign = false;\\n\\t\\tnum.resize(size);\\n\\t}\\n\\t\\n\\t~Karatsuba(){\\n\\t}\\n\\t\\n\\tKaratsuba operator+(const Karatsuba &k) const {\\n\\t\\tKaratsuba res;\\n\\t\\t\\n\\t\\tif(k.sign^sign) {\\n\\t\\t\\tint maxs = max(k.num.size(), num.size());\\n\\t\\t\\tbool com = true; // num >= k.num\\n\\t\\t\\tint index = -1;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = maxs-1; i >= 0; i--){\\n\\t\\t\\t\\tint a = 0, b = 0;\\n\\t\\t\\t\\tif(i < num.size()) a = num[i];\\n\\t\\t\\t\\tif(i < k.num.size()) b = k.num[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(a < b) {\\n\\t\\t\\t\\t\\tcom = false;\\n\\t\\t\\t\\t\\tindex = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t} else if(a > b) {\\n\\t\\t\\t\\t\\tcom = true;\\n\\t\\t\\t\\t\\tindex = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(index == -1){\\n\\t\\t\\t\\tres.sign = false;\\n\\t\\t\\t\\tres.num.push_back(0);\\n\\t\\t\\t} else if(com) {\\n\\t\\t\\t\\tres.num.resize(index+1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(int i = 0; i <= index; i++){\\n\\t\\t\\t\\t\\tif(i < num.size()) res.num[i] += num[i];\\n\\t\\t\\t\\t\\tif(i < k.num.size()) res.num[i] -= k.num[i];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(res.num[i] < 0) {\\n\\t\\t\\t\\t\\t\\tres.num[i] += base;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tfor(int j = i+1; ; j++){\\n\\t\\t\\t\\t\\t\\t\\tif(num[j]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j]--;\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j] = base-1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(sign == true) res.sign = true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tres.num.resize(index+1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(int i = 0; i <= index; i++){\\n\\t\\t\\t\\t\\tif(i < num.size()) res.num[i] -= num[i];\\n\\t\\t\\t\\t\\tif(i < k.num.size()) res.num[i] += k.num[i];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(res.num[i] < 0) {\\n\\t\\t\\t\\t\\t\\tres.num[i] += base;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tfor(int j = i+1; ; j++){\\n\\t\\t\\t\\t\\t\\t\\tif(k.num[j]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j]--;\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j] = base-1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(k.sign == true) res.sign = true;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile(res.num.back() == 0 && res.num.size() >= 2){\\n\\t\\t\\t\\tres.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t} else {\\n\\t\\t\\tres.num.resize(max(k.num.size(), num.size()));\\n\\t\\t\\tres.sign = sign;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < res.num.size(); i++){\\n\\t\\t\\t\\tif(i < k.num.size()) res.num[i] += k.num[i];\\n\\t\\t\\t\\tif(i < num.size()) res.num[i] += num[i];\\n\\t\\t\\t\\tif(res.num[i] >= base) {\\n\\t\\t\\t\\t\\tif(i + 1 == res.num.size()) {\\n\\t\\t\\t\\t\\t\\tres.num.push_back(1);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tres.num[i+1] += 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tres.num[i] %= base;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn res;\\n\\t}\\n\\t\\n\\tKaratsuba operator-(const Karatsuba &k) const {\\n\\t\\tKaratsuba res;\\n\\t\\t\\n\\t\\tif(k.sign^sign^1) {\\n\\t\\t\\tint maxs = max(k.num.size(), num.size());\\n\\t\\t\\tbool com = true; // num >= k.num\\n\\t\\t\\tint index = -1;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = maxs-1; i >= 0; i--){\\n\\t\\t\\t\\tint a = 0, b = 0;\\n\\t\\t\\t\\tif(i < num.size()) a = num[i];\\n\\t\\t\\t\\tif(i < k.num.size()) b = k.num[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(a < b) {\\n\\t\\t\\t\\t\\tcom = false;\\n\\t\\t\\t\\t\\tindex = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t} else if(a > b) {\\n\\t\\t\\t\\t\\tcom = true;\\n\\t\\t\\t\\t\\tindex = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(index == -1){\\n\\t\\t\\t\\tres.sign = false;\\n\\t\\t\\t\\tres.num.push_back(0);\\n\\t\\t\\t} else if(com) {\\n\\t\\t\\t\\tres.num.resize(index+1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(int i = 0; i <= index; i++){\\n\\t\\t\\t\\t\\tif(i < num.size()) res.num[i] += num[i];\\n\\t\\t\\t\\t\\tif(i < k.num.size()) res.num[i] -= k.num[i];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(res.num[i] < 0) {\\n\\t\\t\\t\\t\\t\\tres.num[i] += base;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tfor(int j = i+1; ; j++){\\n\\t\\t\\t\\t\\t\\t\\tif(num[j]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j]--;\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j] = base-1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(sign == true) res.sign = true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tres.num.resize(index+1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(int i = 0; i <= index; i++){\\n\\t\\t\\t\\t\\tif(i < num.size()) res.num[i] -= num[i];\\n\\t\\t\\t\\t\\tif(i < k.num.size()) res.num[i] += k.num[i];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(res.num[i] < 0) {\\n\\t\\t\\t\\t\\t\\tres.num[i] += base;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tfor(int j = i+1; ; j++){\\n\\t\\t\\t\\t\\t\\t\\tif(k.num[j]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j]--;\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tres.num[j] = base-1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(k.sign == false) res.sign = true;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile(res.num.back() == 0 && res.num.size() >= 2){\\n\\t\\t\\t\\tres.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t} else {\\n\\t\\t\\tres.num.resize(max(k.num.size(), num.size()));\\n\\t\\t\\tres.sign = sign;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < res.num.size(); i++){\\n\\t\\t\\t\\tif(i < k.num.size()) res.num[i] += k.num[i];\\n\\t\\t\\t\\tif(i < num.size()) res.num[i] += num[i];\\n\\t\\t\\t\\tif(res.num[i] >= base) {\\n\\t\\t\\t\\t\\tif(i + 1 == res.num.size()) {\\n\\t\\t\\t\\t\\t\\tres.num.push_back(1);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tres.num[i+1] += 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tres.num[i] %= base;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn res;\\n\\t}\\n\\t\\n\\tKaratsuba operator*(const Karatsuba &k) const {\\n\\t\\tKaratsuba res;\\n\\t\\t\\n\\t\\tint maxs = max(k.num.size(), num.size());\\n\\t\\t\\n\\t\\tres.sign = sign^k.sign;\\n\\t\\t\\n\\t\\tif(maxs <= 1) {\\n\\t\\t\\tint z0;\\n\\t\\t\\tres.num.resize(1,0);\\n\\t\\t\\tz0 = num[0] * k.num[0];\\n\\t\\t\\tres.num[0] = z0 % base;\\n\\t\\t\\tif(z0/base) res.num.push_back(z0/base);\\n\\t\\t} else {\\n\\t\\t\\tint b = (maxs+1)/2;\\n\\t\\t\\tKaratsuba z0, z1, z2;\\n\\t\\t\\tKaratsuba x0(b), x1, y0(b), y1;\\n\\t\\t\\t\\n\\t\\t\\tif(num.size() <= b) x1.resize(1);\\n\\t\\t\\telse x1.resize(b);\\n\\t\\t\\t\\n\\t\\t\\tif(k.num.size() <= b) y1.resize(1);\\n\\t\\t\\telse y1.resize(b);\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < b; i++){\\n\\t\\t\\t\\tif(i < num.size()) x0.num[i] = num[i];\\n\\t\\t\\t\\tif(i < k.num.size()) y0.num[i] = k.num[i];\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = b; i < 2*b; i++){\\n\\t\\t\\t\\tif(i < num.size()) x1.num[i-b] = num[i];\\n\\t\\t\\t\\tif(i < k.num.size()) y1.num[i-b] = k.num[i];\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile(x0.num.back() == 0 && x0.num.size() >= 2){\\n\\t\\t\\t\\tx0.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\twhile(x1.num.back() == 0 && x1.num.size() >= 2){\\n\\t\\t\\t\\tx1.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\twhile(y0.num.back() == 0 && y0.num.size() >= 2){\\n\\t\\t\\t\\ty0.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\twhile(y1.num.back() == 0 && y1.num.size() >= 2){\\n\\t\\t\\t\\ty1.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tz2 = x1 * y1;\\n\\t\\t\\tz0 = x0 * y0;\\n\\t\\t\\tz1 = z2 + z0 - (x1 - x0) * (y1 - y0);\\n\\t\\t\\t\\n\\t\\t\\tres.resize(max({z0.size(), z1.size()+b, z2.size()+b*2}));\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < res.size(); i++){\\n\\t\\t\\t\\tif(i < z0.size()) res.num[i] += z0.num[i];\\n\\t\\t\\t\\tif(i >= b && i-b < z1.size()) res.num[i] += z1.num[i-b];\\n\\t\\t\\t\\tif(i >= 2*b && i-b*2 < z2.size()) res.num[i] += z2.num[i-b*2];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(res.num[i] >= base) {\\n\\t\\t\\t\\t\\tif(i + 1 < res.num.size()) {\\n\\t\\t\\t\\t\\t\\tres.num[i+1] += res.num[i] / base;\\n\\t\\t\\t\\t\\t\\tres.num[i] %= base;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tres.num.push_back(res.num[i] / base);\\n\\t\\t\\t\\t\\t\\tres.num[i] %= base;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile(res.num.back() == 0 && res.num.size() >= 2){\\n\\t\\t\\t\\tres.num.pop_back();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(res.num.size() == 1 && res.num[0] == 0) res.sign = false;\\n\\t\\t\\n\\t\\treturn res;\\n\\t}\\n\\t\\n\\t\\n\\tKaratsuba& operator=(const Karatsuba& k) & {\\n\\t\\tthis->num = k.num;\\n\\t\\tthis->sign = k.sign;\\n\\t\\t\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tbool operator<(const Karatsuba &k) const {\\n\\t\\tif(k.sign^sign) {\\n\\t\\t\\tif(sign == false) return false;\\n\\t\\t\\tif(k.sign == false) return true;\\n\\t\\t} else if(sign){\\n\\t\\t\\tif(num.size() > k.num.size()) return true;\\n\\t\\t\\tif(num.size() < k.num.size()) return false;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = (int)num.size()-1; i >= 0; i--){\\n\\t\\t\\t\\tint a = num[i];\\n\\t\\t\\t\\tint b = k.num[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(b < a) {\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t} else if(b > a) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tif(num.size() > k.num.size()) return false;\\n\\t\\t\\tif(num.size() < k.num.size()) return true;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = (int)num.size()-1; i >= 0; i--){\\n\\t\\t\\t\\tint a = num[i];\\n\\t\\t\\t\\tint b = k.num[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(b < a) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t} else if(b > a) {\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn false;\\n\\t}\\n\\n\\tsize_t size() const {\\n\\t\\treturn num.size();\\n\\t}\\n\\t\\n\\tvoid resize(size_t size) {\\n\\t\\tnum.resize(size);\\n\\t}\\n\\t\\n\\t\\n\\tstring to_string() const {\\n\\t\\tstring res;\\n\\t\\t\\n\\t\\tif(sign == true) res += \\\"-\\\";\\n\\t\\t\\n\\t\\tfor(int i = (int)num.size()-1; i >= 0; i--){\\n\\t\\t\\tres += '0' + num[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn res;\\n\\t}\\n\\t\\n\\tvoid string_to(string s){\\n\\t\\tint b = 0;\\n\\t\\t\\n\\t\\tsign = false;\\n\\t\\t\\n\\t\\tif(s[0] == '-') {\\n\\t\\t\\tsign = true;\\n\\t\\t\\tb++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tnum.clear();\\n\\t\\t\\n\\t\\tfor(int i = (int)s.size()-1; i >= b; i--){\\n\\t\\t\\tnum.push_back(s[i] - '0');\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile(num.back() == 0 && num.size() >= 1){\\n\\t\\t\\tnum.pop_back();\\n\\t\\t}\\n\\t\\n\\t\\tif(num.size() == 0) {\\n\\t\\t\\tsign = false;\\n\\t\\t\\tnum.push_back(0);\\n\\t\\t}\\n\\t}\\n};\\n\\nstd::ostream& operator<<(std::ostream& lhs, const Karatsuba& rhs) {\\n\\t\\n\\tlhs << rhs.to_string();\\n\\treturn lhs;\\n}\\n\\nstd::istream& operator>>(std::istream& lhs, Karatsuba& rhs) {\\n\\tstring str;\\n\\t\\n\\tcin>>str;\\n\\t\\n\\trhs.string_to(str);\\n\\t\\n\\treturn lhs;\\n}\\n\\nsigned main(){\\n\\t\\n\\tKaratsuba a, b;\\n\\t\\n\\tcin>>a>>b;\\n\\t\\n\\tcout<<a * b<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.0379,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4446987\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nvector<int> stoa(string const& s){\\n vector<int> a(s.size());\\n for(int i=(s[0]=='-'?1:0);i<s.size();++i){\\n a[i] = s[i]-'0';\\n }\\n return a;\\n}\\nstring atos(vector<int> const& a){\\n string s;\\n for(auto ai:a)s+=(ai+'0');\\n return s;\\n}\\n\\nstring product(string const& lhs,string const& rhs){\\n if(lhs==\\\"0\\\"||rhs==\\\"0\\\")return \\\"0\\\";\\n string sign = (lhs[0]=='-'^rhs[0]=='-'?\\\"-\\\":\\\"\\\");\\n auto a = stoa(lhs);\\n reverse(a.begin(),a.end());\\n auto b = stoa(rhs);\\n reverse(b.begin(),b.end());\\n int n = a.size();\\n int m = b.size();\\n vector<vector<int>> tmp(m,vector<int>(n+m));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<m;++j){\\n tmp[j][i+j] += a[i]*b[j]%10;\\n tmp[j][i+j+1] += a[i]*b[j]/10;\\n }\\n }\\n vector<int> res(n+m+1);\\n for(int i=0;i<n+m;++i){\\n for(int j=0;j<m;++j){\\n res[i] += tmp[j][i];\\n res[i+1] += res[i]/10;\\n res[i] %= 10;\\n }\\n }\\n while(res.size()>1&&res.back()==0)res.pop_back();\\n reverse(res.begin(),res.end());\\n return sign+atos(res);\\n}\\n\\nsigned main(){\\n\\n string a,b;\\n cin>>a>>b;\\n\\n cout<<product(a,b)<<endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 10796,\n \"score_of_the_acc\": -0.0807,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4375298\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i,n) for(long long i=0; i<(n); i++)\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\n\\nbool compare(string a, string b) {\\n if (a.size() > b.size()) return true;\\n else if (a.size() < b.size()) return false;\\n else {\\n for (long long i = 0; i < a.size(); i++) {\\n if (a[i] > b[i]) return true;\\n else if (a[i] < b[i]) return false;\\n }\\n }\\n return true;\\n}\\n\\n\\nstring add(string a, string b) {\\n bool x = false, y = false;\\n if (a[0] == '-') x = true;\\n if (b[0] == '-') y = true;\\n\\n if (x && y) return '-' + add(a.substr(1, a.size()-1), b.substr(1, b.size()-1));\\n else if (x) return add(b, a);\\n // 'a - b' or 'a + b'\\n\\n if (y) b = b.substr(1, b.size()-1);\\n if (y && !compare(a, b)) {\\n return '-' + add(b, '-' + a);\\n }\\n\\n reverse(a.begin(), a.end());\\n reverse(b.begin(), b.end());\\n\\n string res = \\\"\\\";\\n long long up = 0;\\n\\n for (long long i = 0; i < max(a.size(), b.size()); i++) {\\n long long tmp = up;\\n if (i < a.size()) {\\n tmp += (a[i] - '0');\\n }\\n if (i < b.size() && b[i] != '-') {\\n if (y) tmp -= (b[i] - '0');\\n else tmp += (b[i] - '0');\\n }\\n\\n if (tmp < 0) {\\n res.push_back((10 + tmp) + '0');\\n up = -1;\\n }\\n else if (tmp > 9) {\\n res.push_back((tmp - 10) + '0');\\n up = 1;\\n }\\n else {\\n res.push_back(tmp + '0');\\n up = 0;\\n }\\n }\\n\\n if (up > 0) res.push_back(up + '0');\\n\\n reverse(res.begin(), res.end());\\n\\n long long begin = 0;\\n while (res[begin] == '0') begin++;\\n \\n if (res.size() == begin) return \\\"0\\\";\\n else return res.substr(begin, res.size() - begin);\\n}\\n\\nstring mult(string a, string b) {\\n if (a == \\\"0\\\" || b == \\\"0\\\") return \\\"0\\\";\\n string res = \\\"0\\\";\\n bool ifminus = false;\\n if (a[0] == '-' && b[0] == '-') return mult(a.substr(1, a.size()-1), b.substr(1, b.size()-1));\\n else if (a[0] == '-') return '-' + mult(a.substr(1, a.size()-1), b);\\n else if (b[0] == '-') return '-' + mult(a, b.substr(1, b.size()-1));\\n\\n reverse(b.begin(), b.end());\\n\\n for (long long i = 0; i < b.size(); i++) {\\n string tmp = \\\"0\\\";\\n for (long long j = 0; j < (b[i] - '0'); j++) {\\n tmp = add(tmp, a);\\n }\\n for (long long j = 0; j < i; j++) {\\n tmp = tmp + '0';\\n }\\n res = add(res, tmp);\\n }\\n\\n return res;\\n}\\n\\n\\nint main(){\\n string a, b;\\n cin >> a >> b;\\n cout << mult(a, b) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.2593,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_4289840\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n\\nstring fixedNum( string a )\\n{\\n if( a.size() == 1 )\\n return a;\\n for( int i = 0; i < a.size(); i++ )\\n if( '1'<= a[i] && a[i] <= '9' )\\n return a.substr( i, a.size() );\\n return \\\"0\\\";\\n}\\n\\nstring calcAddition( string a, string b )\\n{\\n a = fixedNum(a); b = fixedNum(b);\\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\\n string s = \\\"0\\\", t = \\\"0\\\";\\n for( int i = 0; i < d; i++ )\\n as > bs ? t += \\\"0\\\" : s += \\\"0\\\";\\n s += a; t += b;\\n\\n for( int i = s.size() - 1; i >= 1; i-- )\\n {\\n s[i] += t[i] - '0';\\n if( s[i] > '9' )\\n {\\n s[i] -= 10;\\n s[i-1]++;\\n }\\n }\\n\\n return s[0] == '0' ? s.substr( 1, s.size() ) : s;\\n}\\n\\nstring calcMultiplication( string a, string b )\\n{\\n a = fixedNum(a); b = fixedNum(b);\\n int as = a.size(), bs = b.size(), d = as > bs ? as - bs : bs - as;\\n string s = \\\"0\\\", t = \\\"0\\\", x = \\\"\\\", sum = \\\"\\\", zero = \\\"\\\", digit = \\\"\\\";\\n for( int i = 0; i < d; i++ )\\n as > bs ? t += \\\"0\\\" : s += \\\"0\\\";\\n s += a; t += b;\\n\\n for( int i = 0; i < s.size(); i++ )\\n zero += \\\"0\\\";\\n \\n x = zero;\\n sum = zero;\\n\\n for( int i = s.size() - 1; i >= 1; i-- )\\n {\\n for( int j = s.size() - 1; j >= 1; j-- )\\n x[j] = ( t[i] - '0' ) * ( s[j] - '0' );\\n for( int j = s.size() - 1; j >= 1; j-- )\\n {\\n int f = x[j] / 10;\\n x[j-1] += f;\\n x[j] = x[j] - 10 * f + '0';\\n }\\n x += digit;\\n sum = calcAddition( x, sum );\\n digit += \\\"0\\\";\\n x = zero;\\n }\\n return sum;\\n}\\n\\nint main()\\n{\\n string a, b;\\n\\n cin >> a >> b;\\n\\n int as = a.size(), bs = b.size();\\n string s = a.substr( 1, as ), t = b.substr( 1, bs );\\n\\n if( a[0] == '-' && b[0] == '-' )\\n cout << calcMultiplication( s, t ) << endl;\\n else if( a[0] >= '0' && b[0] >= '0' )\\n cout << calcMultiplication( a, b ) << endl;\\n else\\n {\\n if( a == \\\"0\\\" || b == \\\"0\\\" )\\n cout << \\\"0\\\" << endl;\\n else if( a[0] == '-' )\\n cout << '-' << calcMultiplication( s, b ) << endl;\\n else\\n cout << '-' << calcMultiplication( a, t ) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_NTL_2_C_3619231\",\n \"code_snippet\": \"// includes\\n#include <bits/stdc++.h>\\n\\n// macros\\n#define ll long long int\\n#define pb emplace_back\\n#define mk make_pair\\n#define pq priority_queue\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)\\n#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)\\n#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)\\n#define vrep(v, i) for(int i = 0; i < (v).size(); i++)\\n#define all(x) (x).begin(),(x).end()\\n#define sz(x) ((int)(x).size())\\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())\\n#define FI first\\n#define SE second\\n#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << \\\"\\\\n \\\"[i + 1 != n];\\n#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << \\\"\\\\n \\\"[j + 1 != m];\\n#define bit(n) (1LL<<(n))\\n#define INT(n) int n; cin >> n;\\n#define LL(n) ll n; cin >> n;\\n#define DOUBLE(n) double n; cin >> n;\\nusing namespace std;\\n\\n// types\\ntypedef pair<int, int> P;\\ntypedef pair<ll, int> Pl;\\ntypedef pair<ll, ll> Pll;\\ntypedef pair<double, double> Pd;\\ntypedef complex<double> cd;\\n \\n// constants\\nconst int inf = 1e9;\\nconst ll linf = 1LL << 50;\\nconst double EPS = 1e-10;\\nconst int mod = 1e9 + 7;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, -1, 0, 1};\\n\\n// solve\\ntemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}\\ntemplate <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}\\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << \\\" \\\";} return os;}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \\\" \\\";} return os;}\\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \\\" \\\";} return os;}\\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \\\" \\\";} return os;}\\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << \\\" \\\";} return os;}\\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << \\\" \\\" << p.second; return os;}\\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \\\":\\\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \\\" \\\"; } return os;}\\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << \\\":\\\" << itr->second; auto titr = itr; if(++titr != mp.end())os << \\\" \\\"; } return os;}\\n\\ntemplate <typename T>\\nT power(T a, T n, T mod) {\\n T res = 1;\\n T tmp = n;\\n T curr = a;\\n while(tmp){\\n if(tmp % 2 == 1){\\n res = (T)((ll)res * curr % mod);\\n }\\n curr = (T)((ll)curr * curr % mod);\\n tmp >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate<typename T>\\nT extgcd(T a, T b, T &x, T &y){\\n T d = a;\\n if(b != 0){\\n d = extgcd(b, a % b, y, x);\\n y -= (a / b) * x;\\n }else{\\n x = 1, y = 0;\\n }\\n return d;\\n}\\n\\ntemplate <typename T>\\nT modinv(T a, T m){\\n long long x = 0, y = 0;\\n extgcd<long long>(a, m, x, y);\\n x %= m;\\n if(x < 0)x += m;\\n return x;\\n}\\n\\ntemplate <typename T>\\nlong long garner(vector<T> b, vector<T> m, T MOD){\\n m.emplace_back(MOD);\\n vector<long long> coef(m.size(), 1);\\n vector<long long> consts(m.size(), 0);\\n for(int i = 0; i < b.size(); i++){\\n long long t = ((b[i] - consts[i]) % m[i]) * modinv<long long>(coef[i], m[i]) % m[i];\\n for(int j = i + 1; j < m.size(); j++){\\n consts[j] = (consts[j] + t * coef[j] % m[j]) % m[j];\\n coef[j] = coef[j] * m[i] % m[j];\\n }\\n }\\n return consts.back();\\n}\\n\\ntemplate <int MOD, int g>\\nstruct NTT{\\n int get_mod(){\\n return MOD;\\n }\\n void _ntt(vector<long long> &f, bool inv=false){\\n int n = f.size(), mask = n - 1;\\n int h = power<long long>(g, (MOD - 1) / n, MOD);\\n if(inv)h = modinv(h, MOD);\\n vector<long long> tmp(n);\\n for(int i = n >> 1; i >= 1; i >>= 1){\\n long long zeta = power<long long>(h, i, MOD);\\n long long w = 1;\\n for(int j = 0; j < n; j += i){\\n for(int k = 0; k < i; k++){\\n tmp[j+k] = (f[((j<<1)&mask)+k] + w * f[(((j<<1)+i)&mask)+k] % MOD) % MOD;\\n }\\n w = w * zeta % MOD;\\n }\\n swap(f, tmp);\\n }\\n }\\n void ntt(vector<long long> &f){\\n _ntt(f, false);\\n }\\n void intt(vector<long long> &f){\\n _ntt(f, true);\\n int n = f.size();\\n int ni = modinv(n, MOD);\\n for(int i = 0; i < n; i++)f[i] = f[i] * ni % MOD;\\n }\\n vector<long long> convolution(vector<long long> f, vector<long long> h){\\n int n = 1;\\n while(n < int(f.size() + h.size()))n *= 2;\\n f.resize(n, 0); h.resize(n, 0);\\n ntt(f);\\n ntt(h);\\n for(int i = 0; i < n; i++)f[i] = f[i] * h[i] % MOD;\\n intt(f);\\n return f;\\n }\\n};\\n\\nusing NTT1 = NTT<167772161, 3>;\\nusing NTT2 = NTT<469762049, 3>;\\nusing NTT3 = NTT<1224736769, 3>;\\n\\nvector<long long> arbitrary_mod_convolution(vector<long long> f, vector<long long> g, long long MOD){\\n for(size_t i = 0; i < f.size(); i++)f[i] %= MOD;\\n for(size_t i = 0; i < g.size(); i++)g[i] %= MOD;\\n NTT1 ntt1;\\n NTT2 ntt2;\\n NTT3 ntt3;\\n auto x1 = ntt1.convolution(f, g);\\n auto x2 = ntt2.convolution(f, g);\\n auto x3 = ntt3.convolution(f, g);\\n\\n vector<long long> res(x1.size());\\n vector<long long> b(3), m(3);\\n m[0] = ntt1.get_mod();\\n m[1] = ntt2.get_mod();\\n m[2] = ntt3.get_mod();\\n for(size_t i = 0; i < x1.size(); i++){\\n b[0] = x1[i];\\n b[1] = x2[i];\\n b[2] = x3[i];\\n res[i] = garner<long long>(b, m, MOD);\\n }\\n return res;\\n}\\n\\nconst ll B = 10000;\\nconst int BW = 4;\\nstruct BigInt{\\n vector<ll> digit;\\n BigInt(ll a = 0){\\n digit.emplace_back(a);\\n normalize();\\n }\\n BigInt(const string &s){\\n from_string(s);\\n }\\n void from_string(const string &s){\\n digit.clear();\\n int i;\\n for(i = (int)s.size() - BW; i >= 0; i-=BW){\\n digit.emplace_back(stol(s.substr(i, BW)));\\n }\\n i += BW;\\n if(i > 0)digit.emplace_back(stol(s.substr(0, i)));\\n }\\n void normalize(){\\n ll c = 0;\\n for(int i = 0; i < digit.size(); i++){\\n while(digit[i] < 0){\\n if(i + 1 == digit.size())digit.emplace_back(0);\\n digit[i+1]--;\\n digit[i] += B;\\n }\\n ll a = digit[i] + c;\\n digit[i] = a % B;\\n c = a / B;\\n }\\n while(c){\\n digit.emplace_back(c % B);\\n c /= B;\\n }\\n for(int i = (int)digit.size() - 1; i >= 1; i--){\\n if(digit[i] == 0){\\n digit.pop_back();\\n }else{\\n break;\\n }\\n }\\n }\\n size_t size(){\\n return digit.size();\\n }\\n BigInt& operator=(ll a){\\n digit.resize(1, a);\\n normalize();\\n return *this;\\n }\\n BigInt& operator=(const string &s){\\n from_string(s);\\n return *this;\\n }\\n} ZERO(0), ONE(1);\\n\\nostream &operator<<(ostream &os, const BigInt &b){\\n os << b.digit[b.digit.size() - 1];\\n for(int i = (int)b.digit.size() - 2; i >= 0; i--){\\n os << setw(BW) << setfill('0') << b.digit[i];\\n }\\n return os;\\n}\\n\\nistream & operator>>(istream &is, BigInt &b){\\n string s;\\n is >> s;\\n b.from_string(s);\\n return is;\\n}\\n\\nbool operator<(const BigInt &x, const BigInt &y){\\n if(x.digit.size() != y.digit.size())return x.digit.size() < y.digit.size();\\n for(int i = x.digit.size() - 1; i >= 0; i--){\\n if(x.digit[i] != y.digit[i])return x.digit[i] < y.digit[i];\\n }\\n return false;\\n}\\n\\nbool operator>(const BigInt &x, const BigInt y){\\n return y < x;\\n}\\n\\nbool operator<=(const BigInt &x, const BigInt &y){\\n return !(y < x);\\n}\\n\\nbool operator>=(const BigInt &x, const BigInt &y){\\n return !(x < y);\\n}\\n\\nbool operator!=(const BigInt &x, const BigInt &y){\\n return x < y || y < x;\\n}\\n\\nbool operator==(const BigInt &x, const BigInt &y){\\n return !(x < y) && !(y < x);\\n}\\n\\nBigInt operator+(const BigInt &x, ll a){\\n BigInt res = x;\\n res.digit[0] += a;\\n res.normalize();\\n return res;\\n}\\n\\nBigInt operator+(const BigInt &x, const BigInt &y){\\n BigInt res = x;\\n while(res.digit.size() < y.digit.size())res.digit.emplace_back(0);\\n for(int i = 0; i < y.digit.size(); i++)res.digit[i] += y.digit[i];\\n res.normalize();\\n return res;\\n}\\n\\nBigInt operator-(const BigInt &x, const BigInt &y){\\n BigInt res = x;\\n assert(res.digit.size() >= y.digit.size());\\n for(int i = 0; i < y.digit.size(); i++)res.digit[i] -= y.digit[i];\\n res.normalize();\\n return res;\\n}\\n\\nBigInt operator*(const BigInt &x, const BigInt &y){\\n BigInt z;\\n //NTT3 ntt;\\n vector<long long> xc = x.digit, yc = y.digit;\\n /*z.digit.assign(x.digit.size() + y.digit.size(), 0);\\n for(int i = 0; i < x.digit.size(); i++){\\n for(int j = 0; j < y.digit.size(); j++){\\n z.digit[i+j] += x.digit[i] * y.digit[j];\\n }\\n }*/\\n //z.digit = ntt.convolution(xc, yc);\\n z.digit = arbitrary_mod_convolution(xc, yc, (ll)mod * 10);\\n z.normalize();\\n return z;\\n}\\n\\nBigInt operator*(const BigInt &x, ll a){\\n BigInt res = x;\\n for(int i = 0; i < res.digit.size(); i++)res.digit[i] *= a;\\n res.normalize();\\n return res;\\n}\\n\\npair<BigInt, ll> divmod(const BigInt &x, ll a){\\n ll c = 0;\\n BigInt res = x;\\n for(int i = (int)res.digit.size() - 1; i >= 0; i--){\\n ll t = B * c + res.digit[i];\\n res.digit[i] = t / a;\\n c = t % a;\\n }\\n res.normalize();\\n return make_pair(res, c);\\n}\\n\\nBigInt operator/(const BigInt &x, ll a){\\n return divmod(x, a).first;\\n}\\n\\nBigInt operator%(const BigInt &x, ll a){\\n return divmod(x, a).second;\\n}\\n\\npair<BigInt, BigInt> divmod(const BigInt &x, const BigInt &y){\\n BigInt rx = x, ry = y;\\n if(x.digit.size() < y.digit.size())return make_pair(ZERO, x);\\n int F = B / (y.digit[y.digit.size() - 1] + 1);\\n rx = rx * F; ry = ry * F;\\n BigInt z;\\n z.digit.assign(rx.digit.size() - ry.digit.size() + 1, 0);\\n for(int k = (int)z.digit.size() - 1, i = (int)rx.digit.size() - 1; k >= 0; k--, i--){\\n z.digit[k] = (i + 1 < rx.digit.size() ? rx.digit[i+1]: 0) * B + rx.digit[i];\\n z.digit[k] /= ry.digit[ry.digit.size() - 1];\\n BigInt t;\\n t.digit.assign(k + ry.digit.size(), 0);\\n for(int m = 0; m < ry.digit.size(); m++){\\n t.digit[k+m] = z.digit[k] * ry.digit[m];\\n }\\n t.normalize();\\n while(rx < t){\\n z.digit[k] -= 1;\\n for(int m = 0; m < ry.digit.size(); m++){\\n t.digit[k+m] -= ry.digit[m];\\n }\\n t.normalize();\\n }\\n rx = rx - t;\\n }\\n z.normalize();\\n return make_pair(z, rx / F);\\n}\\n\\nBigInt operator/(const BigInt &x, const BigInt &y){\\n return divmod(x, y).first;\\n}\\n\\nBigInt operator%(const BigInt &x, const BigInt &y){\\n return divmod(x, y).second;\\n}\\n\\nBigInt& operator+=(BigInt &x, ll a){\\n x = x + a;\\n return x;\\n}\\n\\nBigInt &operator+=(BigInt &x, const BigInt &y){\\n x = x + y;\\n return x;\\n}\\n\\nBigInt &operator-=(BigInt &x, const BigInt &y){\\n x = x - y;\\n return x;\\n}\\n\\nBigInt& operator*=(BigInt &x, const BigInt &y){\\n x = x * y;\\n return x;\\n}\\n\\nBigInt& operator/=(BigInt &x, const BigInt &y){\\n x = x / y;\\n return x;\\n}\\n\\nBigInt& operator%=(BigInt &x, const BigInt &y){\\n x = x % y;\\n return x;\\n}\\n\\nBigInt& operator/=(BigInt &x, ll a){\\n x = x / a;\\n return x;\\n}\\n\\nBigInt& operator%=(BigInt &x, ll a){\\n x = x % a;\\n return x;\\n}\\n\\nBigInt sqrt(const BigInt &x){\\n BigInt l = 1;\\n BigInt r = x;\\n while(r - l > BigInt(1)){\\n BigInt m = (r + l) / 2;\\n if(m * m > x)r = m;\\n else l = m;\\n }\\n return l;\\n}\\n\\nstruct SBigInt{\\n bool neg = false;\\n BigInt b = 0;\\n SBigInt(){}\\n SBigInt(ll a): b(BigInt(abs(a))){\\n if(a < 0)neg = true;\\n }\\n SBigInt(const string &s){\\n string t = s;\\n if(t[0] == '-'){\\n neg = true;\\n t = t.substr(1, t.size() - 1);\\n }\\n b = BigInt(t);\\n }\\n void check_zero(){\\n if(b == ZERO)neg = false;\\n }\\n bool operator==(const SBigInt &r) const{\\n return (neg == r.neg) && (b == r.b);\\n }\\n bool operator!=(const SBigInt &r) const{\\n return (neg != r.neg) || (b != r.b);\\n }\\n SBigInt operator-() const{\\n SBigInt res = *this;\\n res.neg = !res.neg;\\n res.check_zero();\\n return res;\\n }\\n};\\n\\nSBigInt operator+(const SBigInt &x, const SBigInt &y){\\n SBigInt res;\\n if(x.neg == y.neg){\\n res.b = x.b + y.b;\\n res.neg = x.neg;\\n }else{\\n if(x.b > y.b){\\n res.b = x.b - y.b;\\n res.neg = x.neg;\\n }else{\\n res.b = y.b - x.b;\\n res.neg = y.neg;\\n }\\n }\\n res.check_zero();\\n return res;\\n}\\n\\nSBigInt operator-(const SBigInt &x, const SBigInt &y){\\n SBigInt res = x + (- y);\\n res.check_zero();\\n return res;\\n}\\n\\nSBigInt operator*(const SBigInt &x, const SBigInt &y){\\n SBigInt res;\\n res.neg = !(x.neg == y.neg);\\n res.b = x.b * y.b;\\n res.check_zero();\\n return res;\\n}\\n\\nSBigInt operator/(const SBigInt &x, const SBigInt &y){\\n SBigInt res;\\n res.neg = !(x.neg == y.neg);\\n res.b = x.b / y.b;\\n res.check_zero();\\n return res;\\n}\\n\\nostream &operator<<(ostream &os, const SBigInt &b){\\n if(b.neg)os << \\\"-\\\";\\n os << b.b;\\n return os;\\n}\\n\\nint main(int argc, char const* argv[])\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n string a, b;\\n cin >> a >> b;\\n SBigInt A(a), B(b);\\n cout << A * B << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.64,\n \"time_ms\": 20,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.038,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":91,"cells":{"group_id":{"kind":"string","value":"aoj_0044_cpp"},"problem_description":{"kind":"string","value":"素数 II\n素数というのは、1 よりも大きくそれ自身か 1 でしか割りきれない整数をいいます。例えば、2 は、2 と 1 でしか割り切れないので素数ですが、12 は、12 と 1 のほかに、2, 3, 4, 6 で割りきれる数なので素数ではありません。\n整数\nn\nを入力したとき、\nn\nより小さい素数のうち最も大きいものと、\nn\nより大きい素数のうち最も小さいものを出力するプログラムを作成してください。\nInput\n複数のデータセットが与えられます。各データセットに\nn\n(3 ≤\nn\n≤ 50,000) が１行に与えられます。\nデータセットの数は 50 を超えません。\nOutput\n各データセットに対して、\nn\nより小さい素数のうち最大のものと、\nn\nより大きい素数のうち最小のものを１つのスペースで区切って１行に出力して下さい。\nSample Input\n19\n3517\nOutput for the Sample Input\n17 23\n3511 3527"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0044_3570869","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n#include <stdlib.h>\nusing namespace std;\n\n\n\nint main(){\n\tint d,arr[100000],count,ch;\n\tarr[0]=2;\n\tcount =0;\n\tfor(int i=3;i<=50100;i++){\n\t\tch=0;\n\t\tfor(int j=0;j<=count;j++){\n\t\t\tif(i%arr[j] == 0)ch=1;\n\t\t}\n\t\tif(ch == 0){\n\t\t\tcount++;\n\t\t\tarr[count]=i;\n\t\t}\n\t}\n\twhile(scanf(\"%d\",&d) != EOF){\n\t\tfor(int i=0;;i++){\n\t\t\tif(arr[i]==d){\n\t\t\t\tprintf(\"%d %d\\n\",arr[i-1],arr[i+1]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(arr[i]>d){\n\t\t\t\tprintf(\"%d %d\\n\",arr[i-1],arr[i]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\t\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":300,"memory_kb":3220,"score_of_the_acc":-0.4895,"final_rank":2},{"submission_id":"aoj_0044_3202548","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvector<int> prime;\n\nint main(void) {\n\tfor(int i = 2;i < 60000;i++) {\n\t\tbool isPrime = true;\n\t\tfor(auto e:prime) {\n\t\t\tif(i % e == 0) {\n\t\t\t\tisPrime = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(isPrime) prime.push_back(i);\n\t}\n\tint n;\n\twhile(cin >> n) {\n\t\tauto eq = equal_range(prime.begin(),prime.end(),n);\n\t\tcout << *(eq.first-1) << \" \" << *(eq.second) << endl;\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3048,"score_of_the_acc":-0.0227,"final_rank":1},{"submission_id":"aoj_0044_2811117","code_snippet":"#include<iostream>\nusing namespace std;\n\nvoid prime(int a){\n int cnt1=a+1;\n int cnt2=a-1;\n bool is_prime[1000000];\n is_prime[0] = is_prime[1] = false;\n for(int i=2;i<1000000;i++){\n is_prime[i] = true;\n }\n for(int i=2;i*i<1000000;i++){\n if(is_prime[i]){\n for(int j=i*i;j<1000000;j+=i){\n is_prime[j] = false;\n }\n }\n }\n while(1){\n if(is_prime[cnt2]){\n cout << cnt2 << \" \";\n break;\n }\n cnt2--;\n }\n\n while(1){\n if(is_prime[cnt1]){\n cout << cnt1 << endl;\n break;\n }\n cnt1++;\n }\n\n}\n\nint main(){\n while(1){\n int num;\n cin >> num;\n if(cin.eof())\n break;\n\n prime(num);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4052,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_0044_2290108","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<set>\n#include<string>\n\n\nint main() {\n\tint n;\n\tbool a;\n\tstd::vector<int> prime;\n\tprime.emplace_back(2);\n\tfor (int i = 3; i < 1000000; i += 2) {\n\t\ta = false;\n\t\tfor (int j = 3; j <= std::sqrt(i); j += 2) {\n\t\t\tif (i%j == 0) {\n\t\t\t\ta = true;\n\t\t\t}\n\t\t}\n\t\tif (a == false) {\n\t\t\tprime.emplace_back(i);\n\t\t}\n\t}\n\twhile (std::cin >> n) {\n\t\tint ans = 0;\n\t\tint low = 0, high = 0;\n\t\tfor (int i = 0; i < prime.size(); i++) {\n\t\t\tif (prime[i] < n) {\n\t\t\t\tlow = prime[i];\n\t\t\t}\n\t\t\tif (prime[i] > n) {\n\t\t\t\thigh = prime[i];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tstd::cout << low << \" \" << high << std::endl;\n\t}\n}","accuracy":1,"time_ms":900,"memory_kb":3264,"score_of_the_acc":-1.2151,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_0044_3570869\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <string.h>\\n#include <math.h>\\n#include <time.h>\\n#include <stdlib.h>\\nusing namespace std;\\n\\n\\n\\nint main(){\\n\\tint d,arr[100000],count,ch;\\n\\tarr[0]=2;\\n\\tcount =0;\\n\\tfor(int i=3;i<=50100;i++){\\n\\t\\tch=0;\\n\\t\\tfor(int j=0;j<=count;j++){\\n\\t\\t\\tif(i%arr[j] == 0)ch=1;\\n\\t\\t}\\n\\t\\tif(ch == 0){\\n\\t\\t\\tcount++;\\n\\t\\t\\tarr[count]=i;\\n\\t\\t}\\n\\t}\\n\\twhile(scanf(\\\"%d\\\",&d) != EOF){\\n\\t\\tfor(int i=0;;i++){\\n\\t\\t\\tif(arr[i]==d){\\n\\t\\t\\t\\tprintf(\\\"%d %d\\\\n\\\",arr[i-1],arr[i+1]);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tif(arr[i]>d){\\n\\t\\t\\t\\tprintf(\\\"%d %d\\\\n\\\",arr[i-1],arr[i]);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\t\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.4895,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0044_3202548\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nvector<int> prime;\\n\\nint main(void) {\\n\\tfor(int i = 2;i < 60000;i++) {\\n\\t\\tbool isPrime = true;\\n\\t\\tfor(auto e:prime) {\\n\\t\\t\\tif(i % e == 0) {\\n\\t\\t\\t\\tisPrime = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(isPrime) prime.push_back(i);\\n\\t}\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tauto eq = equal_range(prime.begin(),prime.end(),n);\\n\\t\\tcout << *(eq.first-1) << \\\" \\\" << *(eq.second) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3048,\n \"score_of_the_acc\": -0.0227,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0044_2811117\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nvoid prime(int a){\\n int cnt1=a+1;\\n int cnt2=a-1;\\n bool is_prime[1000000];\\n is_prime[0] = is_prime[1] = false;\\n for(int i=2;i<1000000;i++){\\n is_prime[i] = true;\\n }\\n for(int i=2;i*i<1000000;i++){\\n if(is_prime[i]){\\n for(int j=i*i;j<1000000;j+=i){\\n is_prime[j] = false;\\n }\\n }\\n }\\n while(1){\\n if(is_prime[cnt2]){\\n cout << cnt2 << \\\" \\\";\\n break;\\n }\\n cnt2--;\\n }\\n\\n while(1){\\n if(is_prime[cnt1]){\\n cout << cnt1 << endl;\\n break;\\n }\\n cnt1++;\\n }\\n\\n}\\n\\nint main(){\\n while(1){\\n int num;\\n cin >> num;\\n if(cin.eof())\\n break;\\n\\n prime(num);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4052,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0044_2290108\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<set>\\n#include<string>\\n\\n\\nint main() {\\n\\tint n;\\n\\tbool a;\\n\\tstd::vector<int> prime;\\n\\tprime.emplace_back(2);\\n\\tfor (int i = 3; i < 1000000; i += 2) {\\n\\t\\ta = false;\\n\\t\\tfor (int j = 3; j <= std::sqrt(i); j += 2) {\\n\\t\\t\\tif (i%j == 0) {\\n\\t\\t\\t\\ta = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (a == false) {\\n\\t\\t\\tprime.emplace_back(i);\\n\\t\\t}\\n\\t}\\n\\twhile (std::cin >> n) {\\n\\t\\tint ans = 0;\\n\\t\\tint low = 0, high = 0;\\n\\t\\tfor (int i = 0; i < prime.size(); i++) {\\n\\t\\t\\tif (prime[i] < n) {\\n\\t\\t\\t\\tlow = prime[i];\\n\\t\\t\\t}\\n\\t\\t\\tif (prime[i] > n) {\\n\\t\\t\\t\\thigh = prime[i];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::cout << low << \\\" \\\" << high << std::endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -1.2151,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":92,"cells":{"group_id":{"kind":"string","value":"aoj_0040_cpp"},"problem_description":{"kind":"string","value":"アフィン暗号\n簡単な暗号法の一つに、アフィン暗号というものがあります。まず、アルファベット a〜z を a = 0, b = 1, c = 2,..., x = 23, y = 24, z = 25 と 0〜25 の数字に置き換えます。そして、以下の式で、原文のアルファベットを置換します。\n$F(\\gamma) = (\\alpha \\cdot \\gamma + \\beta)$ mod $26$\nただし、mod 26 は 26 で割った余りを表します。例えば、$\\alpha = 3, \\beta = 2$ のとき、アルファベットの 'a' (=0) は、$F(0) = (3 \\cdot 0 + 2)$ mod $26 = 2$ で 'c' に、アルファベットの 'n' (=13) は $F(13) = (3 \\cdot 13 + 2)$ mod $26 = 15$ で 'p' に置換されます。\nこのとき、$\\gamma$ に対する $F(\\gamma)$ が必ず 1 対 1 で対応付けられるように、$\\alpha$ と $\\beta$ は慎重に選ばれているものとします（$\\alpha$ と 26 が互いに素であることが条件）。$\\alpha = 4, \\beta = 7$ のときのように、$F('a') = 7, F('n') = 7$ と、'a' も 'n' も同じ 'h' に置換されるようなことはありません。また、アルファベット以外の文字は置換されません。\n暗号化された文字列を元の文章に復号したものを出力するプログラムを作成してください。元の文章には、キーワードとして\nthat\nthis\nのいずれかが必ず含まれているものとします。\nInput\n複数のデータセットが与えられます。１行目にデータセット数 $n$ ($n \\leq 30$) が与えられます。続いて $n$ 行のデータが与えられます。各データセットに英小文字と空白からなる 256 文字以内の暗号化された文章が１行に与えられます。\nOutput\n各データセットに対して、復号した元の文章を１行に出力して下さい。\nSample Input\n1\ny eazqyp pnop pngtg ye obmpngt xmybp mr lygw\nOutput for the Sample Input\ni submit that there is another point of view"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0040_2489714","code_snippet":"#include<iostream>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<functional>\n#include<algorithm>\n#include<cstdio>\n#include<unordered_map>\nusing namespace std;\n//---------------------------------------------------\n//????????????????????????????????????\n#define int long long\n#define str string\nconst int inf = 999999999999999999;\nstruct P {\n\tint pos, cost;\n};\nbool operator<(P a, P b) { return a.cost < b.cost; }\nbool operator>(P a, P b) { return a.cost > b.cost; }\nstruct B {\n\tint to, cost;\n};\nint gcm(int i, int j) {//?????§??¬?´???°\n\tif (i > j) swap(i, j);\n\tif (i == 0) return j;\n\treturn gcm(j%i, i);\n}\nbool sfind(string s, string l) {//?????????1??????????????????2????????????\n\tfor (int i = 0; i <= s.size() - l.size(); i++) {\n\t\tstr t = \"\";\n\t\tfor (int j = 0; j < l.size(); j++)\n\t\t\tt += s[i + j];\n\t\tif (t == l)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\ntypedef long long ll;\ntypedef long double ld;\n//---------------------------------------------------\n//+++++++++++++++++++++++++++++++++++++++++++++++++++\n//---------------------------------------------------\nsigned main() {\n\tint n;\n\tcin >> n;\n\tgetchar();\n\tfor (int r = 0; r < n; r++) {\n\t\tstring s;\n\t\tgetline(cin, s);\n\t\tfor (int i = 0; i < 26; i++) {\n\t\t\tfor (int j = 0; j < 26; j++) {\n\t\t\t\tstring a = \"\";\n\t\t\t\tfor (int z = 0; z < s.size(); z++) {\n\t\t\t\t\tif (s[z] == ' ')\n\t\t\t\t\t\ta += \" \";\n\t\t\t\t\telse\n\t\t\t\t\t\ta += (char)((((s[z] - 'a')*i + j) % 26) + 'a');\n\t\t\t\t}\n\t\t\t\tif (sfind(a, \"that\") || sfind(a, \"this\")) {\n\t\t\t\t\tcout << a << endl;\n\t\t\t\t\tgoto stop;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tstop:;\n\t}\n\tgetchar(); getchar();\n}","accuracy":1,"time_ms":50,"memory_kb":3156,"score_of_the_acc":-2,"final_rank":8},{"submission_id":"aoj_0040_1954615","code_snippet":"#include<iostream>\n#include<string.h>\n#include<vector>\n#include<list>\n#include<stdio.h>\n#include<math.h>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<algorithm>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\nint main(){\n int n;\n char ans[257], str[257];\n while(cin >> n){\n cin.ignore();\n rep(i,n){\n cin.getline(str, sizeof(str));\n bool c = false;\n rep(i,26){\n rep(j,26){\n rep(k,strlen(str)){\n if(str[k] != ' ')\n ans[k] = (i * str[k] - 'a' + j) % 26 + 'a';\n else ans[k] = str[k];\n }\n if(strstr(ans, \"this\") != NULL || strstr(ans, \"that\") != NULL){\n c = true;\n }\n if(c) break;\n }\n if(c) break;\n }\n ans[strlen(str)] = '\\0';\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1160,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_0040_1863770","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n\n\nbool IsCoprime(int a, int b)\n{\n\twhile (a > 0 && b > 0)\n\t{\n\t\tif (a < b) swap(a, b);\n\t\ta %= b;\n\t}\n\tif (a == 1 || b == 1) return true;\n\treturn false;\n}\n\n\nchar get(int a, int b, char c)\n{\n\tfor (int i = 0; i < 26; i++)\n\t{\n\t\tif ((a * i + b) % 26 == c - 'a') return char(i + 'a');\n\t}\n}\n\n\nint main()\n{\n\tint n;\n\tstring cip;\n\tstring dec;\n\n\tcin >> n;\n\tcin.get();\n\n\twhile (n--)\n\t{\n\t\tgetline(cin, cip);\n\t\tdec = cip;\n\n\t\tfor (int a = 0; a < 26; a++)\n\t\t{\n\t\t\tif (!IsCoprime(a, 26)) continue;\n\t\t\tfor (int b = 0; b < 26; b++)\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < cip.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tif (cip[i] == ' ') continue;\n\t\t\t\t\tdec[i] = get(a, b, cip[i]);\n\t\t\t\t}\n\t\t\t\tif (dec.find(\"that\") != -1 || dec.find(\"this\") != -1)\n\t\t\t\t{\n\t\t\t\t\tcout << dec << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1212,"score_of_the_acc":-0.0261,"final_rank":3},{"submission_id":"aoj_0040_1853174","code_snippet":"#define _USE_MATH_DEFINES\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n\ntypedef long long ll;\nusing namespace std;\n\nint F(int a, int b, int c){\n\treturn (a*c+b) % 26;\n}\n\nint main(){\n\tint n;\n\tstring str1;\n\tgetline(cin,str1);\n\n\tn = atoi(str1.c_str());\n\tfor(int i=0;i<n;i++){\n\t\tstring str2;\n\t\tgetline(cin,str2);\n\n\t\tfor(int a=0;a<100;a++){\n\t\t\tfor(int b=0;b<100;b++){\n\t\t\t\tstring tmp = str2;\n\t\t\t\tfor(int i=0;i<str2.size();i++){\n\t\t\t\t\tif(tmp[i]=='.') continue;\n\t\t\t\t\tif(tmp[i]==' ') continue;\n\t\t\t\t\tif(isdigit(tmp[i])) continue;\n\t\t\t\t\ttmp[i] = F(a,b,str2[i]-'a') + 'a';\n\t\t\t\t}\n\n\t\t\t\tif(tmp.find(\"that\") != string::npos\n\t\t\t\t\t|| tmp.find(\"this\") != string::npos){\n\t\t\t\t\t\tcout << tmp << endl;\n\t\t\t\t\t\tgoto found;\n\t\t\t\t}\n\t\t\t}\n\t\t}\nfound:;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1200,"score_of_the_acc":-0.02,"final_rank":2},{"submission_id":"aoj_0040_1841488","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std; \n \nmap<char, int> c2i;\nmap<int, char> i2c;\nstring str;\n \nvoid init()\n{\n for (char ch = 'a'; ch <= 'z'; ch++) {\n\tc2i[ch] = ch - 'a';\n\ti2c[ch - 'a'] = ch;\n }\n}\n \nbool serch(string s)\n{\n string str;\n stringstream ss(s);\n while (ss >> str) {\n if (str == \"this\" || str == \"that\") {\n return 1;\n }\n }\n return 0;\n}\n \nchar F(char ch, int a, int b)\n{\n int num = (a * c2i[ch] + b) % 26; \n return i2c[num];\n}\n \nint main()\n{\n int n;\n init(); \n cin >> n;\n cin.ignore();\n while (n--) {\n\tgetline(cin, str);\n \n\tfor (int i = 0; i < 26; i++) {\n\t for (int j = 0; j < 26; j++) {\n\t\tstring next;\n\t\tfor (int k = 0; k < (int)str.size(); k++) {\n\t\t if (islower(str[k])) {\n next += F(str[k], i, j);\n\t\t } else {\n next += str[k];\n }\n }\n\t\tif (serch(next)) {\n\t\t cout << next << endl;\n goto END;\n\t\t}\n\t }\n\t}\n END:;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3004,"score_of_the_acc":-0.9238,"final_rank":6},{"submission_id":"aoj_0040_1772504","code_snippet":"#include<cstdio>\n#include<cmath>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#include<map>\nusing namespace std;\nstring change(int a,int b,string str){\n for(int i=0;i<str.size();i++)str[i]=((str[i]-'a')*a+b)%26+'a';\n return str;\n}\nstring out(int a,int b,string str){\n for(int i=0;i<str.size();i++){\n if('a'<=str[i]&&str[i]<='z'){\n for(int j=0;j<26;j++){\n if((j*a+b)%26+'a'==str[i]){\n str[i]=j+'a';\n break;\n }\n }\n }\n }\n return str;\n}\nint main(){\n int N;\n cin>>N;\n for(int i=0;i<N;i++){\n string str;\n if(!i)getchar();\n getline(cin,str);\n for(int j=1;;j++){\n for(int k=0;k<26;k++){\n for(int l=0;l<str.size()-3;l++){\n if(change(j,k,\"that\")==str.substr(l,4)){\n cout<<out(j,k,str)<<endl;\n goto exit;\n }\n if(change(j,k,\"this\")==str.substr(l,4)){\n cout<<out(j,k,str)<<endl;\n goto exit;\n }\n }\n }\n }\n exit:;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1220,"score_of_the_acc":-1.0301,"final_rank":7},{"submission_id":"aoj_0040_1664994","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(i=0;i<n;++i)\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define sc second\n\nint gcd(int p, int q){\n if(p<q) swap(p,q);\n while(q!=0){\n int tmp=p%q;\n p=q;\n q=tmp;\n }\n return p;\n}\n\nint main(int argc, char const *argv[]) {\n int i,j,k;\n\n string a=\"abcdefghijklmnopqrstuvwxyz\";\n\n int n;\n scanf(\"%d\\n\",&n);\n for(int times=0; times<n; ++times){\n string s;\n getline(cin,s);\n //cout << s << endl;\n\n string ans;\n bool end=false;\n\n for(i=1; i<=25; ++i){//??¢???????????????\n if(gcd(26,i)!=1) continue;\n\n rep(j,26){\n //????????£?????§????¨?\n set<int> ch;\n rep(k,a.size()) ch.insert((i*k+j)%26);\n //??????\n if(ch.size()!=a.size()) continue;\n\n //printf(\"(%d,%d)\\n\",i,j);\n\n //?????????\n ans=\"\";\n int p=0;\n rep(k,s.size()){\n if('a'<=s[k] && s[k]<='z'){\n ans+='a'+(i*(s[k]-'a')+j)%26;\n }\n else{\n ans+=s[k];\n string tmp=ans.substr(p,k-p);\n //cout << tmp << endl;\n\n if(tmp==\"this\"||tmp ==\"that\")\n end=true;\n\n p=k+1;\n }\n }\n\n string tmp=ans.substr(p,k-p);\n //cout << tmp << endl;\n\n if(tmp==\"this\"||tmp ==\"that\")\n end=true;\n\n\n if(end) break;\n }\n if(end) break;\n }\n\n std::cout << ans << std::endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1240,"score_of_the_acc":-0.0401,"final_rank":5},{"submission_id":"aoj_0040_1662878","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n\nchar T[27] = \"abcdefghijklmnopqrstuvwxyz\";\n\nstring S, V;\nint n;\nint x[26];\n\nint main() {\n\tcin >> n;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tS = \"\";\n\t\twhile (S == \"\") {\n\t\t\tgetline(cin, S);\n\t\t}\n\t\tfor (int j = 0; j < 26; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < 26; k++)\n\t\t\t{\n\t\t\t\tfor (int l = 0; l < 26; l++)\n\t\t\t\t{\n\t\t\t\t\tx[l] = -1;\n\t\t\t\t}\n\t\t\t\tfor (int l = 0; l < 26; l++)\n\t\t\t\t{\n\t\t\t\t\tif (x[(j*l + k) % 26] == -1)\n\t\t\t\t\t{\n\t\t\t\t\t\tx[(j*l + k) % 26] = l;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tgoto E;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tV = \"\";\n\t\t\t\tfor (int l = 0; l < S.size(); l++)\n\t\t\t\t{\n\t\t\t\t\tfor (int m = 0; m < 26; m++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (T[m] == S[l])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tV += T[x[m]];\n\t\t\t\t\t\t\tgoto G;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tV += S[l];\n\t\t\t\tG:;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < S.size() - 3; i++)\n\t\t\t\t{\n\t\t\t\t\tif (V.substr(i, 4) == \"this\" || V.substr(i, 4) == \"that\")\n\t\t\t\t\t{\n\t\t\t\t\t\tcout << V << endl;\n\t\t\t\t\t\tgoto H;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tE:;\n\t\t\t}\n\t\t}\n\tH:;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.0301,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_0040_2489714\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cmath>\\n#include<queue>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<iomanip>\\n#include<vector>\\n#include<functional>\\n#include<algorithm>\\n#include<cstdio>\\n#include<unordered_map>\\nusing namespace std;\\n//---------------------------------------------------\\n//????????????????????????????????????\\n#define int long long\\n#define str string\\nconst int inf = 999999999999999999;\\nstruct P {\\n\\tint pos, cost;\\n};\\nbool operator<(P a, P b) { return a.cost < b.cost; }\\nbool operator>(P a, P b) { return a.cost > b.cost; }\\nstruct B {\\n\\tint to, cost;\\n};\\nint gcm(int i, int j) {//?????§??¬?´???°\\n\\tif (i > j) swap(i, j);\\n\\tif (i == 0) return j;\\n\\treturn gcm(j%i, i);\\n}\\nbool sfind(string s, string l) {//?????????1??????????????????2????????????\\n\\tfor (int i = 0; i <= s.size() - l.size(); i++) {\\n\\t\\tstr t = \\\"\\\";\\n\\t\\tfor (int j = 0; j < l.size(); j++)\\n\\t\\t\\tt += s[i + j];\\n\\t\\tif (t == l)\\n\\t\\t\\treturn 1;\\n\\t}\\n\\treturn 0;\\n}\\ntypedef long long ll;\\ntypedef long double ld;\\n//---------------------------------------------------\\n//+++++++++++++++++++++++++++++++++++++++++++++++++++\\n//---------------------------------------------------\\nsigned main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tgetchar();\\n\\tfor (int r = 0; r < n; r++) {\\n\\t\\tstring s;\\n\\t\\tgetline(cin, s);\\n\\t\\tfor (int i = 0; i < 26; i++) {\\n\\t\\t\\tfor (int j = 0; j < 26; j++) {\\n\\t\\t\\t\\tstring a = \\\"\\\";\\n\\t\\t\\t\\tfor (int z = 0; z < s.size(); z++) {\\n\\t\\t\\t\\t\\tif (s[z] == ' ')\\n\\t\\t\\t\\t\\t\\ta += \\\" \\\";\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\ta += (char)((((s[z] - 'a')*i + j) % 26) + 'a');\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (sfind(a, \\\"that\\\") || sfind(a, \\\"this\\\")) {\\n\\t\\t\\t\\t\\tcout << a << endl;\\n\\t\\t\\t\\t\\tgoto stop;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\tstop:;\\n\\t}\\n\\tgetchar(); getchar();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -2,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0040_1954615\",\n \"code_snippet\": \"#include<iostream>\\n#include<string.h>\\n#include<vector>\\n#include<list>\\n#include<stdio.h>\\n#include<math.h>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<queue>\\n#include<algorithm>\\n#define range(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,b) range(i,0,b)\\n#define debug(x) cout << \\\"debug \\\" << x << endl;\\nusing namespace std;\\n\\nint main(){\\n int n;\\n char ans[257], str[257];\\n while(cin >> n){\\n cin.ignore();\\n rep(i,n){\\n cin.getline(str, sizeof(str));\\n bool c = false;\\n rep(i,26){\\n rep(j,26){\\n rep(k,strlen(str)){\\n if(str[k] != ' ')\\n ans[k] = (i * str[k] - 'a' + j) % 26 + 'a';\\n else ans[k] = str[k];\\n }\\n if(strstr(ans, \\\"this\\\") != NULL || strstr(ans, \\\"that\\\") != NULL){\\n c = true;\\n }\\n if(c) break;\\n }\\n if(c) break;\\n }\\n ans[strlen(str)] = '\\\\0';\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0040_1863770\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\nusing namespace std;\\n\\n\\nbool IsCoprime(int a, int b)\\n{\\n\\twhile (a > 0 && b > 0)\\n\\t{\\n\\t\\tif (a < b) swap(a, b);\\n\\t\\ta %= b;\\n\\t}\\n\\tif (a == 1 || b == 1) return true;\\n\\treturn false;\\n}\\n\\n\\nchar get(int a, int b, char c)\\n{\\n\\tfor (int i = 0; i < 26; i++)\\n\\t{\\n\\t\\tif ((a * i + b) % 26 == c - 'a') return char(i + 'a');\\n\\t}\\n}\\n\\n\\nint main()\\n{\\n\\tint n;\\n\\tstring cip;\\n\\tstring dec;\\n\\n\\tcin >> n;\\n\\tcin.get();\\n\\n\\twhile (n--)\\n\\t{\\n\\t\\tgetline(cin, cip);\\n\\t\\tdec = cip;\\n\\n\\t\\tfor (int a = 0; a < 26; a++)\\n\\t\\t{\\n\\t\\t\\tif (!IsCoprime(a, 26)) continue;\\n\\t\\t\\tfor (int b = 0; b < 26; b++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int i = 0; i < cip.size(); i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (cip[i] == ' ') continue;\\n\\t\\t\\t\\t\\tdec[i] = get(a, b, cip[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (dec.find(\\\"that\\\") != -1 || dec.find(\\\"this\\\") != -1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcout << dec << endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.0261,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0040_1853174\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\nint F(int a, int b, int c){\\n\\treturn (a*c+b) % 26;\\n}\\n\\nint main(){\\n\\tint n;\\n\\tstring str1;\\n\\tgetline(cin,str1);\\n\\n\\tn = atoi(str1.c_str());\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tstring str2;\\n\\t\\tgetline(cin,str2);\\n\\n\\t\\tfor(int a=0;a<100;a++){\\n\\t\\t\\tfor(int b=0;b<100;b++){\\n\\t\\t\\t\\tstring tmp = str2;\\n\\t\\t\\t\\tfor(int i=0;i<str2.size();i++){\\n\\t\\t\\t\\t\\tif(tmp[i]=='.') continue;\\n\\t\\t\\t\\t\\tif(tmp[i]==' ') continue;\\n\\t\\t\\t\\t\\tif(isdigit(tmp[i])) continue;\\n\\t\\t\\t\\t\\ttmp[i] = F(a,b,str2[i]-'a') + 'a';\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(tmp.find(\\\"that\\\") != string::npos\\n\\t\\t\\t\\t\\t|| tmp.find(\\\"this\\\") != string::npos){\\n\\t\\t\\t\\t\\t\\tcout << tmp << endl;\\n\\t\\t\\t\\t\\t\\tgoto found;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\nfound:;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.02,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0040_1841488\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std; \\n \\nmap<char, int> c2i;\\nmap<int, char> i2c;\\nstring str;\\n \\nvoid init()\\n{\\n for (char ch = 'a'; ch <= 'z'; ch++) {\\n\\tc2i[ch] = ch - 'a';\\n\\ti2c[ch - 'a'] = ch;\\n }\\n}\\n \\nbool serch(string s)\\n{\\n string str;\\n stringstream ss(s);\\n while (ss >> str) {\\n if (str == \\\"this\\\" || str == \\\"that\\\") {\\n return 1;\\n }\\n }\\n return 0;\\n}\\n \\nchar F(char ch, int a, int b)\\n{\\n int num = (a * c2i[ch] + b) % 26; \\n return i2c[num];\\n}\\n \\nint main()\\n{\\n int n;\\n init(); \\n cin >> n;\\n cin.ignore();\\n while (n--) {\\n\\tgetline(cin, str);\\n \\n\\tfor (int i = 0; i < 26; i++) {\\n\\t for (int j = 0; j < 26; j++) {\\n\\t\\tstring next;\\n\\t\\tfor (int k = 0; k < (int)str.size(); k++) {\\n\\t\\t if (islower(str[k])) {\\n next += F(str[k], i, j);\\n\\t\\t } else {\\n next += str[k];\\n }\\n }\\n\\t\\tif (serch(next)) {\\n\\t\\t cout << next << endl;\\n goto END;\\n\\t\\t}\\n\\t }\\n\\t}\\n END:;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3004,\n \"score_of_the_acc\": -0.9238,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0040_1772504\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cmath>\\n#include<cstring>\\n#include<iostream>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\nstring change(int a,int b,string str){\\n for(int i=0;i<str.size();i++)str[i]=((str[i]-'a')*a+b)%26+'a';\\n return str;\\n}\\nstring out(int a,int b,string str){\\n for(int i=0;i<str.size();i++){\\n if('a'<=str[i]&&str[i]<='z'){\\n for(int j=0;j<26;j++){\\n if((j*a+b)%26+'a'==str[i]){\\n str[i]=j+'a';\\n break;\\n }\\n }\\n }\\n }\\n return str;\\n}\\nint main(){\\n int N;\\n cin>>N;\\n for(int i=0;i<N;i++){\\n string str;\\n if(!i)getchar();\\n getline(cin,str);\\n for(int j=1;;j++){\\n for(int k=0;k<26;k++){\\n for(int l=0;l<str.size()-3;l++){\\n if(change(j,k,\\\"that\\\")==str.substr(l,4)){\\n cout<<out(j,k,str)<<endl;\\n goto exit;\\n }\\n if(change(j,k,\\\"this\\\")==str.substr(l,4)){\\n cout<<out(j,k,str)<<endl;\\n goto exit;\\n }\\n }\\n }\\n }\\n exit:;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -1.0301,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0040_1664994\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n#define rep(i,n) for(i=0;i<n;++i)\\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)\\n#define mp make_pair\\n#define pb push_back\\n#define fi first\\n#define sc second\\n\\nint gcd(int p, int q){\\n if(p<q) swap(p,q);\\n while(q!=0){\\n int tmp=p%q;\\n p=q;\\n q=tmp;\\n }\\n return p;\\n}\\n\\nint main(int argc, char const *argv[]) {\\n int i,j,k;\\n\\n string a=\\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\n int n;\\n scanf(\\\"%d\\\\n\\\",&n);\\n for(int times=0; times<n; ++times){\\n string s;\\n getline(cin,s);\\n //cout << s << endl;\\n\\n string ans;\\n bool end=false;\\n\\n for(i=1; i<=25; ++i){//??¢???????????????\\n if(gcd(26,i)!=1) continue;\\n\\n rep(j,26){\\n //????????£?????§????¨?\\n set<int> ch;\\n rep(k,a.size()) ch.insert((i*k+j)%26);\\n //??????\\n if(ch.size()!=a.size()) continue;\\n\\n //printf(\\\"(%d,%d)\\\\n\\\",i,j);\\n\\n //?????????\\n ans=\\\"\\\";\\n int p=0;\\n rep(k,s.size()){\\n if('a'<=s[k] && s[k]<='z'){\\n ans+='a'+(i*(s[k]-'a')+j)%26;\\n }\\n else{\\n ans+=s[k];\\n string tmp=ans.substr(p,k-p);\\n //cout << tmp << endl;\\n\\n if(tmp==\\\"this\\\"||tmp ==\\\"that\\\")\\n end=true;\\n\\n p=k+1;\\n }\\n }\\n\\n string tmp=ans.substr(p,k-p);\\n //cout << tmp << endl;\\n\\n if(tmp==\\\"this\\\"||tmp ==\\\"that\\\")\\n end=true;\\n\\n\\n if(end) break;\\n }\\n if(end) break;\\n }\\n\\n std::cout << ans << std::endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.0401,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0040_1662878\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n\\nchar T[27] = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\nstring S, V;\\nint n;\\nint x[26];\\n\\nint main() {\\n\\tcin >> n;\\n\\tfor (int i = 0; i < n; i++)\\n\\t{\\n\\t\\tS = \\\"\\\";\\n\\t\\twhile (S == \\\"\\\") {\\n\\t\\t\\tgetline(cin, S);\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < 26; j++)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 0; k < 26; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int l = 0; l < 26; l++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tx[l] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int l = 0; l < 26; l++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (x[(j*l + k) % 26] == -1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tx[(j*l + k) % 26] = l;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tgoto E;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tV = \\\"\\\";\\n\\t\\t\\t\\tfor (int l = 0; l < S.size(); l++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor (int m = 0; m < 26; m++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (T[m] == S[l])\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tV += T[x[m]];\\n\\t\\t\\t\\t\\t\\t\\tgoto G;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tV += S[l];\\n\\t\\t\\t\\tG:;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int i = 0; i < S.size() - 3; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (V.substr(i, 4) == \\\"this\\\" || V.substr(i, 4) == \\\"that\\\")\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcout << V << endl;\\n\\t\\t\\t\\t\\t\\tgoto H;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\tE:;\\n\\t\\t\\t}\\n\\t\\t}\\n\\tH:;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0301,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":93,"cells":{"group_id":{"kind":"string","value":"aoj_0042_cpp"},"problem_description":{"kind":"string","value":"泥棒\n宝物がたくさん収蔵されている博物館に、泥棒が大きな風呂敷を一つだけ持って忍び込みました。盗み出したいものはたくさんありますが、風呂敷が耐えられる重さが限られており、これを超えると風呂敷が破れてしまいます。そこで泥棒は、用意した風呂敷を破らず且つ最も価値が高くなるようなお宝の組み合わせを考えなくてはなりません。\n風呂敷が耐えられる重さ\nW\n、および博物館にある個々のお宝の価値と重さを読み込んで、重さの総和が\nW\nを超えない範囲で価値の総和が最大になるときの、お宝の価値総和と重さの総和を出力するプログラムを作成してください。ただし、価値の総和が最大になる組み合わせが複数あるときは、重さの総和が小さいものを出力することとします。\nInput\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\nW\nN\nv\n1\n,\nw\n1\nv\n2\n,\nw\n2\n:\nv\nN\n,\nw\nN\n１行目に風呂敷の耐えられる重さを表す整数\nW\n(\nW\n≤ 1,000)、２行目にお宝の数\nN\n(1 ≤\nN\n≤ 1,000) が与えられます。続く\nN\n行に\ni\n番目のお宝の価値を表す整数\nv\ni\n(0 ≤\nv\ni\n≤ 10,000) とその重さを表す整数\nw\ni\n(0 ≤\nw\ni\n≤\nW\n) の組がそれぞれ１行に与えられます。\nW\nが 0 のとき入力の最後とします。データセットの数は 50 を超えません。\nOutput\n各データセットに対して以下のように出力して下さい。\nCase データセットの番号:\n風呂敷に入れたお宝の価値総和\nそのときのお宝の重さの総和\nSample Input\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n50\n5\n60,10\n100,20\n120,30\n210,45\n10,4\n0\nOutput for the Sample Input\nCase 1:\n220\n49\nCase 2:\n220\n49"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0042_7370385","code_snippet":"#include <bits/stdc++.h>\n#include <stdint.h>\n\nusing namespace std;\n\n#define PI M_PI\n#define MOD 1000000007\n#define debug(x) cout << #x << \" = \" << x << endl\n#define MAP_HAS_KEY(m, key) (m.find(key) != m.end())\n\ntemplate<class T> std::vector<std::string> split(const std::string& s, const T& separator, bool ignore_empty = 0, bool split_empty = 0) {\n struct {\n auto len(const std::string& s) { return s.length(); }\n auto len(const std::string::value_type* p) { return p ? std::char_traits<std::string::value_type>::length(p) : 0; }\n auto len(const std::string::value_type c) { return c == std::string::value_type() ? 0 : 1; /*return 1;*/ }\n } util;\n \n if (s.empty()) { /// empty string ///\n if (!split_empty || util.len(separator)) return {\"\"};\n return {};\n }\n \n auto v = std::vector<std::string>();\n auto n = static_cast<std::string::size_type>(util.len(separator));\n if (n == 0) { /// empty separator ///\n if (!split_empty) return {s};\n for (auto&& c : s) v.emplace_back(1, c);\n return v;\n }\n \n auto p = std::string::size_type(0);\n while (1) { /// split with separator ///\n auto pos = s.find(separator, p);\n if (pos == std::string::npos) {\n if (ignore_empty && p - n + 1 == s.size()) break;\n v.emplace_back(s.begin() + p, s.end());\n break;\n }\n if (!ignore_empty || p != pos)\n v.emplace_back(s.begin() + p, s.begin() + pos);\n p = pos + n;\n }\n return v;\n}\n\nint64_t primeFactor(int64_t n) {\n for(int64_t i=2; i<=n; i++) {\n if(n%i == 0) return i;\n }\n return n;\n}\n\nint primeCount(int n) {\n int current = n;\n int count = 0;\n \n for(;;) {\n //cout << current << \" \";\n int prime = primeFactor(current);\n current = current / prime;\n count++;\n\n if(current == 1) break;\n }\n return count;\n}\n\ntypedef struct {\n int64_t value;\n int64_t weight;\n} ITEM;\n\nbool test(int caseCount) {\n int w, n;\n\n cin >> w;\n if(w == 0) return false;\n\n cin >> n;\n\n vector<ITEM> treasures(n);\n for(int i=0; i<n; i++) {\n string s;\n cin >> s;\n auto strs = split(s, ',');\n int a = stoi(strs[0]);\n int b = stoi(strs[1]);\n treasures[i] = ITEM{a, b};\n }\n\n map<pair<int, int>, ITEM> memo;\n\n function<ITEM(int, int)> rec = [&](int idx, int leastWeight) {\n if(idx == n) return ITEM{0, leastWeight};\n auto key = make_pair(idx, leastWeight);\n if(MAP_HAS_KEY(memo, key)) return memo[key];\n\n auto treasure = treasures[idx];\n\n ITEM a = rec(idx+1, leastWeight);\n if(leastWeight < treasure.weight) {\n memo[key] = a;\n return a;\n }\n ITEM b = rec(idx+1, leastWeight - treasure.weight);\n b.value += treasure.value;\n //b.weight -= treasure.weight;\n\n if(a.value == b.value) memo[key] = (a.weight > b.weight) ? a : b;\n else memo[key] = (a.value > b.value) ? a : b;\n \n return memo[key];\n };\n\n cout << \"Case \" << caseCount << \":\" << endl;\n ITEM result = rec(0, w);\n cout << result.value << endl;\n cout << w - result.weight << endl;\n\n return true;\n}\n\nint main() {\n\n int caseCount = 0;\n for(;;) {\n if(!test(++caseCount)) break;\n }\n\n}","accuracy":1,"time_ms":450,"memory_kb":65188,"score_of_the_acc":-1.1483,"final_rank":4},{"submission_id":"aoj_0042_6259751","code_snippet":"#include<stdio.h>\n#include<string.h>\n\nstruct Node\n{\n\tint w;\n\tint v;\n};\n\nNode g_dp[1001][1001];\nNode g_data[1001];\n\nNode slove(Node data[], int idx, int n, int sum)\n{\n\tNode tmp;\n\ttmp.w = 0;\n\ttmp.v = 0;\n\tif (idx >= n)\n\t{\n\t\ttmp.w = sum;\n\t\ttmp.v = 0;\n\t\treturn tmp;\n\t}\n\n\tif (sum <= 0)\n\t\treturn tmp;\n\n\tif (g_dp[idx][sum].v != 0)\n\t\treturn g_dp[idx][sum];\n\n\n\tNode ret, ret1, ret2;\n\tint s = sum - data[idx].w;\n\tif (s >= 0)\n\t{\n\t\tret1 = slove(data, idx + 1, n, s);\n\t\tret1.v += data[idx].v;\n\t}\n\telse\n\t{\n\t\tret1 = tmp;\n\t}\n\n\tret2 = slove(data, idx + 1, n, sum);\n\tif (ret1.v > ret2.v)\n\t\tret = ret1;\n\telse\n\t\tret = ret2;\n\tg_dp[idx][sum] = ret;\n\treturn g_dp[idx][sum];\n}\n\n\nint main()\n{\n\tint w, n, v1, w1;\n\tint mk = 0;\n\twhile (scanf(\"%d\", &w) != EOF)\n\t{\n\t\tif (w == 0)\n\t\t\tbreak;\n\t\tscanf(\"%d\", &n);\n\t\tmemset(g_data, 0, sizeof(g_data));\n\t\tmemset(g_dp, 0, sizeof(g_dp));\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tscanf(\"%d,%d\", &v1, &w1);\n\t\t\tg_data[i].w = w1;\n\t\t\tg_data[i].v = v1;\n\t\t}\n\t\tmk++;\n\t\tNode maxN = slove(g_data, 0, n, w);\n\t\tprintf(\"Case %d:\\n\",mk);\n\t\tprintf(\"%d\\n%d\\n\", maxN.v, w - maxN.w);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":10580,"score_of_the_acc":-0.004,"final_rank":2},{"submission_id":"aoj_0042_3637488","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int\t\t\t\tlong long\n#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )\n#define REP( i, n ) FOR( i, 0, n )\n#define REPR( i, m )\tfor( int (i) = (m); (i) >= 0; (i)-- )\n#define REPONE( i, n )\tFOR( i, 1, n + 1 )\n#define ALL( a ) (a).begin(), (a).end()\n#define MP\t\t\t\tmake_pair\n#define EB\t\t\t\templace_back\n\ntypedef pair<int, int> P;\n\ntemplate<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }\n\nconst int INF = 1e9;\nconst int MOD = 1e9 + 7;\n\nint dp[1001][10001];\n\nsigned main() {\n\tint W, N, cnt = 1;\n\twhile( cin >> W, W ) {\n\t\tcin >> N;\n\t\tfill( dp[0], dp[1001], 0 );\n\n\t\tint w = 0, vmax = 0;\n\t\tvector<P> tre( N );\n\t\tREP( i, N ) {\n\t\t\tchar c;\n\t\t\tcin >> tre[i].first >> c >> tre[i].second;\n\t\t}\n\n\t\tREP( i, N ) {\n\t\t\tREP( j, W + 1 ) {\n\t\t\t\tif( j - tre[i].second >= 0 ) {\n\t\t\t\t\tdp[i + 1][j] = max( dp[i][j], dp[i][j - tre[i].second] + tre[i].first );\n\n\t\t\t\t\tif( vmax < dp[i + 1][j] ) {\n\t\t\t\t\t\tvmax = dp[i + 1][j];\n\t\t\t\t\t\tw = j;\n\t\t\t\t\t} else if( vmax == dp[i + 1][j] ) {\n\t\t\t\t\t\tchmin( w, j );\n\t\t\t\t\t}\n\n\n\t\t\t\t} else {\n\t\t\t\t\tdp[i + 1][j] = dp[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << \"Case \" << ( cnt++ ) << \":\" << endl;\n\t\tcout << dp[N][W] << endl << w << endl;\n\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":81296,"score_of_the_acc":-0.8011,"final_rank":3},{"submission_id":"aoj_0042_3224544","code_snippet":"#include <cstdio>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define gcu getchar_unlocked\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\nint in() {return in(gcu());}\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\n//bool scan(string &s){int c;s=\"\";\n//\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\n#define pcu putchar_unlocked\n#define vo inline void out\ntemplate <typename T>\nvo(T n){static char buf[20];char *p=buf;\n\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\n\twhile (p!=buf)pcu(*--p);}\nvo(const char *s){while(*s)pcu(*s++);}\nvo(char c){pcu(c);}\n//vo(string &s){for (char c: s) pcu(c);}\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);out('\\n');}\n#undef vo\n\nstruct T {int v, w;};\n\nT find(int n, int w, vector<T> &ts, vector<vector<T>> &m) {\n\tT r;\n\tif (n < 0)\n\t\treturn {0, w};\n\telse if (m[n][w].w != -1)\n\t\treturn m[n][w];\n\telse if (ts[n].w > w)\n\t\tr = find(n - 1, w, ts, m);\n\telse {\n\t\tT a = find(n - 1, w, ts, m),\n\t\t b = find(n - 1, w - ts[n].w, ts, m);\n\t\tb.v += ts[n].v;\n\t\tr = a.v > b.v ? a : b;\n\t}\n\tm[n][w] = r;\n\treturn r;\n}\n\nint main() {\n\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\n\t\tout(\"Case \", i, \":\\n\");\n\t\tvector<T> ts(n);\n\t\tvector<vector<T>> m(n, vector<T>(w + 1, {0, -1}));\n\t\tfor (auto &t: ts) {\n\t\t\tint v = in();\n\t\t\tt = {v, in()};\n\t\t}\n\t\tT r = find(n - 1, w, ts, m);\n\t\tout(r.v, '\\n', w - r.w, '\\n');\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":10172,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_0042_3224505","code_snippet":"#include <cstdio>\n#include <utility>\n#include <vector>\n#include <map>\nusing namespace std;\n\n#define gcu getchar_unlocked\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\nint in() {return in(gcu());}\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\n//bool scan(string &s){int c;s=\"\";\n//\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\n#define pcu putchar_unlocked\n#define vo inline void out\ntemplate <typename T>\nvo(T n){static char buf[20];char *p=buf;\n\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\n\twhile (p!=buf)pcu(*--p);}\nvo(const char *s){while(*s)pcu(*s++);}\nvo(char c){pcu(c);}\n//vo(string &s){for (char c: s) pcu(c);}\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);out('\\n');}\n#undef vo\n\nstruct T {int v, w;};\nmap<vector<int>, T> m;\n\nT find(int n, int w, vector<T> &ts) {\n\tT r;\n\tvector<int> k = {n, w};\n\tif (m.count(k))\n\t\treturn m[k];\n\tif (n < 0)\n\t\tr = {0, w};\n\telse if (ts[n].w > w)\n\t\tr = find(n - 1, w, ts);\n\telse {\n\t\tT a = find(n - 1, w, ts),\n\t\t b = find(n - 1, w - ts[n].w, ts);\n\t\tb.v += ts[n].v;\n\t\tr = a.v > b.v ? a : b;\n\t}\n\tm[k] = r;\n\treturn r;\n}\n\nint main() {\n\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\n\t\tout(\"Case \", i, \":\\n\");\n\t\tvector<T> ts(n);\n\t\tm = {};\n\t\tfor (auto &t: ts) {\n\t\t\tint v = in();\n\t\t\tt = {v, in()};\n\t\t}\n\t\tT r = find(n - 1, w, ts);\n\t\tout(r.v, '\\n', w - r.w, '\\n');\n\t}\n}","accuracy":1,"time_ms":740,"memory_kb":111024,"score_of_the_acc":-2,"final_rank":5},{"submission_id":"aoj_0042_3224496","code_snippet":"#include <cstdio>\n#include <utility>\n#include <vector>\n#include <map>\nusing namespace std;\n\n#define gcu getchar_unlocked\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\nint in() {return in(gcu());}\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\n//bool scan(string &s){int c;s=\"\";\n//\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\n#define pcu putchar_unlocked\n#define vo inline void out\ntemplate <typename T>\nvo(T n){static char buf[20];char *p=buf;\n\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\n\twhile (p!=buf)pcu(*--p);}\nvo(const char *s){while(*s)pcu(*s++);}\nvo(char c){pcu(c);}\n//vo(string &s){for (char c: s) pcu(c);}\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);out('\\n');}\n#undef vo\n\nstruct T {int v, w;};\nmap<vector<int>, T> m;\n\nT find(int n, int w, vector<T> &ts) {\n\tT r;\n\tvector<int> k = {n, w};\n\tif (m.count(k))\n\t\treturn m[k];\n\tif (n < 0 || ts[n].w > w)\n\t\tr = {0, w};\n\telse {\n\t\tT a = find(n - 1, w, ts),\n\t\t b = find(n - 1, w - ts[n].w, ts);\n\t\tb.v += ts[n].v;\n\t\tr = a.v > b.v ? a : b;\n\t}\n\tm[k] = r;\n\treturn r;\n}\n\nint main() {\n\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\n\t\tout(\"Case \", i, \":\\n\");\n\t\tvector<T> ts(n);\n\t\tm = {};\n\t\tfor (auto &t: ts) {\n\t\t\tint v = in();\n\t\t\tt = {v, in()};\n\t\t}\n\t\tT r = find(n - 1, w, ts);\n\t\tout(r.v, '\\n', w - r.w, '\\n');\n\t}\n}","accuracy":0.5,"time_ms":700,"memory_kb":110940,"score_of_the_acc":-1.9444,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_0042_7370385\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <stdint.h>\\n\\nusing namespace std;\\n\\n#define PI M_PI\\n#define MOD 1000000007\\n#define debug(x) cout << #x << \\\" = \\\" << x << endl\\n#define MAP_HAS_KEY(m, key) (m.find(key) != m.end())\\n\\ntemplate<class T> std::vector<std::string> split(const std::string& s, const T& separator, bool ignore_empty = 0, bool split_empty = 0) {\\n struct {\\n auto len(const std::string& s) { return s.length(); }\\n auto len(const std::string::value_type* p) { return p ? std::char_traits<std::string::value_type>::length(p) : 0; }\\n auto len(const std::string::value_type c) { return c == std::string::value_type() ? 0 : 1; /*return 1;*/ }\\n } util;\\n \\n if (s.empty()) { /// empty string ///\\n if (!split_empty || util.len(separator)) return {\\\"\\\"};\\n return {};\\n }\\n \\n auto v = std::vector<std::string>();\\n auto n = static_cast<std::string::size_type>(util.len(separator));\\n if (n == 0) { /// empty separator ///\\n if (!split_empty) return {s};\\n for (auto&& c : s) v.emplace_back(1, c);\\n return v;\\n }\\n \\n auto p = std::string::size_type(0);\\n while (1) { /// split with separator ///\\n auto pos = s.find(separator, p);\\n if (pos == std::string::npos) {\\n if (ignore_empty && p - n + 1 == s.size()) break;\\n v.emplace_back(s.begin() + p, s.end());\\n break;\\n }\\n if (!ignore_empty || p != pos)\\n v.emplace_back(s.begin() + p, s.begin() + pos);\\n p = pos + n;\\n }\\n return v;\\n}\\n\\nint64_t primeFactor(int64_t n) {\\n for(int64_t i=2; i<=n; i++) {\\n if(n%i == 0) return i;\\n }\\n return n;\\n}\\n\\nint primeCount(int n) {\\n int current = n;\\n int count = 0;\\n \\n for(;;) {\\n //cout << current << \\\" \\\";\\n int prime = primeFactor(current);\\n current = current / prime;\\n count++;\\n\\n if(current == 1) break;\\n }\\n return count;\\n}\\n\\ntypedef struct {\\n int64_t value;\\n int64_t weight;\\n} ITEM;\\n\\nbool test(int caseCount) {\\n int w, n;\\n\\n cin >> w;\\n if(w == 0) return false;\\n\\n cin >> n;\\n\\n vector<ITEM> treasures(n);\\n for(int i=0; i<n; i++) {\\n string s;\\n cin >> s;\\n auto strs = split(s, ',');\\n int a = stoi(strs[0]);\\n int b = stoi(strs[1]);\\n treasures[i] = ITEM{a, b};\\n }\\n\\n map<pair<int, int>, ITEM> memo;\\n\\n function<ITEM(int, int)> rec = [&](int idx, int leastWeight) {\\n if(idx == n) return ITEM{0, leastWeight};\\n auto key = make_pair(idx, leastWeight);\\n if(MAP_HAS_KEY(memo, key)) return memo[key];\\n\\n auto treasure = treasures[idx];\\n\\n ITEM a = rec(idx+1, leastWeight);\\n if(leastWeight < treasure.weight) {\\n memo[key] = a;\\n return a;\\n }\\n ITEM b = rec(idx+1, leastWeight - treasure.weight);\\n b.value += treasure.value;\\n //b.weight -= treasure.weight;\\n\\n if(a.value == b.value) memo[key] = (a.weight > b.weight) ? a : b;\\n else memo[key] = (a.value > b.value) ? a : b;\\n \\n return memo[key];\\n };\\n\\n cout << \\\"Case \\\" << caseCount << \\\":\\\" << endl;\\n ITEM result = rec(0, w);\\n cout << result.value << endl;\\n cout << w - result.weight << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n\\n int caseCount = 0;\\n for(;;) {\\n if(!test(++caseCount)) break;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 65188,\n \"score_of_the_acc\": -1.1483,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0042_6259751\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\n\\nstruct Node\\n{\\n\\tint w;\\n\\tint v;\\n};\\n\\nNode g_dp[1001][1001];\\nNode g_data[1001];\\n\\nNode slove(Node data[], int idx, int n, int sum)\\n{\\n\\tNode tmp;\\n\\ttmp.w = 0;\\n\\ttmp.v = 0;\\n\\tif (idx >= n)\\n\\t{\\n\\t\\ttmp.w = sum;\\n\\t\\ttmp.v = 0;\\n\\t\\treturn tmp;\\n\\t}\\n\\n\\tif (sum <= 0)\\n\\t\\treturn tmp;\\n\\n\\tif (g_dp[idx][sum].v != 0)\\n\\t\\treturn g_dp[idx][sum];\\n\\n\\n\\tNode ret, ret1, ret2;\\n\\tint s = sum - data[idx].w;\\n\\tif (s >= 0)\\n\\t{\\n\\t\\tret1 = slove(data, idx + 1, n, s);\\n\\t\\tret1.v += data[idx].v;\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tret1 = tmp;\\n\\t}\\n\\n\\tret2 = slove(data, idx + 1, n, sum);\\n\\tif (ret1.v > ret2.v)\\n\\t\\tret = ret1;\\n\\telse\\n\\t\\tret = ret2;\\n\\tg_dp[idx][sum] = ret;\\n\\treturn g_dp[idx][sum];\\n}\\n\\n\\nint main()\\n{\\n\\tint w, n, v1, w1;\\n\\tint mk = 0;\\n\\twhile (scanf(\\\"%d\\\", &w) != EOF)\\n\\t{\\n\\t\\tif (w == 0)\\n\\t\\t\\tbreak;\\n\\t\\tscanf(\\\"%d\\\", &n);\\n\\t\\tmemset(g_data, 0, sizeof(g_data));\\n\\t\\tmemset(g_dp, 0, sizeof(g_dp));\\n\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%d,%d\\\", &v1, &w1);\\n\\t\\t\\tg_data[i].w = w1;\\n\\t\\t\\tg_data[i].v = v1;\\n\\t\\t}\\n\\t\\tmk++;\\n\\t\\tNode maxN = slove(g_data, 0, n, w);\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\",mk);\\n\\t\\tprintf(\\\"%d\\\\n%d\\\\n\\\", maxN.v, w - maxN.w);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 10580,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0042_3637488\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int\\t\\t\\t\\tlong long\\n#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )\\n#define REP( i, n ) FOR( i, 0, n )\\n#define REPR( i, m )\\tfor( int (i) = (m); (i) >= 0; (i)-- )\\n#define REPONE( i, n )\\tFOR( i, 1, n + 1 )\\n#define ALL( a ) (a).begin(), (a).end()\\n#define MP\\t\\t\\t\\tmake_pair\\n#define EB\\t\\t\\t\\templace_back\\n\\ntypedef pair<int, int> P;\\n\\ntemplate<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }\\n\\nconst int INF = 1e9;\\nconst int MOD = 1e9 + 7;\\n\\nint dp[1001][10001];\\n\\nsigned main() {\\n\\tint W, N, cnt = 1;\\n\\twhile( cin >> W, W ) {\\n\\t\\tcin >> N;\\n\\t\\tfill( dp[0], dp[1001], 0 );\\n\\n\\t\\tint w = 0, vmax = 0;\\n\\t\\tvector<P> tre( N );\\n\\t\\tREP( i, N ) {\\n\\t\\t\\tchar c;\\n\\t\\t\\tcin >> tre[i].first >> c >> tre[i].second;\\n\\t\\t}\\n\\n\\t\\tREP( i, N ) {\\n\\t\\t\\tREP( j, W + 1 ) {\\n\\t\\t\\t\\tif( j - tre[i].second >= 0 ) {\\n\\t\\t\\t\\t\\tdp[i + 1][j] = max( dp[i][j], dp[i][j - tre[i].second] + tre[i].first );\\n\\n\\t\\t\\t\\t\\tif( vmax < dp[i + 1][j] ) {\\n\\t\\t\\t\\t\\t\\tvmax = dp[i + 1][j];\\n\\t\\t\\t\\t\\t\\tw = j;\\n\\t\\t\\t\\t\\t} else if( vmax == dp[i + 1][j] ) {\\n\\t\\t\\t\\t\\t\\tchmin( w, j );\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tdp[i + 1][j] = dp[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << \\\"Case \\\" << ( cnt++ ) << \\\":\\\" << endl;\\n\\t\\tcout << dp[N][W] << endl << w << endl;\\n\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 81296,\n \"score_of_the_acc\": -0.8011,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0042_3224544\",\n \"code_snippet\": \"#include <cstdio>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define gcu getchar_unlocked\\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\\n\\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\\nint in() {return in(gcu());}\\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\\n//bool scan(string &s){int c;s=\\\"\\\";\\n//\\tfor(;;){c=gcu();if(c=='\\\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\\n#define pcu putchar_unlocked\\n#define vo inline void out\\ntemplate <typename T>\\nvo(T n){static char buf[20];char *p=buf;\\n\\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\\n\\twhile (p!=buf)pcu(*--p);}\\nvo(const char *s){while(*s)pcu(*s++);}\\nvo(char c){pcu(c);}\\n//vo(string &s){for (char c: s) pcu(c);}\\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\\\"\\\":\\\" \\\"),out(x);out('\\\\n');}\\n#undef vo\\n\\nstruct T {int v, w;};\\n\\nT find(int n, int w, vector<T> &ts, vector<vector<T>> &m) {\\n\\tT r;\\n\\tif (n < 0)\\n\\t\\treturn {0, w};\\n\\telse if (m[n][w].w != -1)\\n\\t\\treturn m[n][w];\\n\\telse if (ts[n].w > w)\\n\\t\\tr = find(n - 1, w, ts, m);\\n\\telse {\\n\\t\\tT a = find(n - 1, w, ts, m),\\n\\t\\t b = find(n - 1, w - ts[n].w, ts, m);\\n\\t\\tb.v += ts[n].v;\\n\\t\\tr = a.v > b.v ? a : b;\\n\\t}\\n\\tm[n][w] = r;\\n\\treturn r;\\n}\\n\\nint main() {\\n\\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\\n\\t\\tout(\\\"Case \\\", i, \\\":\\\\n\\\");\\n\\t\\tvector<T> ts(n);\\n\\t\\tvector<vector<T>> m(n, vector<T>(w + 1, {0, -1}));\\n\\t\\tfor (auto &t: ts) {\\n\\t\\t\\tint v = in();\\n\\t\\t\\tt = {v, in()};\\n\\t\\t}\\n\\t\\tT r = find(n - 1, w, ts, m);\\n\\t\\tout(r.v, '\\\\n', w - r.w, '\\\\n');\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 10172,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0042_3224505\",\n \"code_snippet\": \"#include <cstdio>\\n#include <utility>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\n#define gcu getchar_unlocked\\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\\n\\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\\nint in() {return in(gcu());}\\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\\n//bool scan(string &s){int c;s=\\\"\\\";\\n//\\tfor(;;){c=gcu();if(c=='\\\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\\n#define pcu putchar_unlocked\\n#define vo inline void out\\ntemplate <typename T>\\nvo(T n){static char buf[20];char *p=buf;\\n\\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\\n\\twhile (p!=buf)pcu(*--p);}\\nvo(const char *s){while(*s)pcu(*s++);}\\nvo(char c){pcu(c);}\\n//vo(string &s){for (char c: s) pcu(c);}\\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\\\"\\\":\\\" \\\"),out(x);out('\\\\n');}\\n#undef vo\\n\\nstruct T {int v, w;};\\nmap<vector<int>, T> m;\\n\\nT find(int n, int w, vector<T> &ts) {\\n\\tT r;\\n\\tvector<int> k = {n, w};\\n\\tif (m.count(k))\\n\\t\\treturn m[k];\\n\\tif (n < 0)\\n\\t\\tr = {0, w};\\n\\telse if (ts[n].w > w)\\n\\t\\tr = find(n - 1, w, ts);\\n\\telse {\\n\\t\\tT a = find(n - 1, w, ts),\\n\\t\\t b = find(n - 1, w - ts[n].w, ts);\\n\\t\\tb.v += ts[n].v;\\n\\t\\tr = a.v > b.v ? a : b;\\n\\t}\\n\\tm[k] = r;\\n\\treturn r;\\n}\\n\\nint main() {\\n\\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\\n\\t\\tout(\\\"Case \\\", i, \\\":\\\\n\\\");\\n\\t\\tvector<T> ts(n);\\n\\t\\tm = {};\\n\\t\\tfor (auto &t: ts) {\\n\\t\\t\\tint v = in();\\n\\t\\t\\tt = {v, in()};\\n\\t\\t}\\n\\t\\tT r = find(n - 1, w, ts);\\n\\t\\tout(r.v, '\\\\n', w - r.w, '\\\\n');\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 111024,\n \"score_of_the_acc\": -2,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0042_3224496\",\n \"code_snippet\": \"#include <cstdio>\\n#include <utility>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\n#define gcu getchar_unlocked\\nint in(int c){int n=0;bool m=false;if(c=='-')m=true,c=gcu();\\n\\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;}\\nint in() {return in(gcu());}\\nbool scan(int &n){int c=gcu();return c==EOF?false:(n=in(c),true);}\\nbool scan(char &c){c=gcu();gcu();return c!=EOF;}\\n//bool scan(string &s){int c;s=\\\"\\\";\\n//\\tfor(;;){c=gcu();if(c=='\\\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\\n#define pcu putchar_unlocked\\n#define vo inline void out\\ntemplate <typename T>\\nvo(T n){static char buf[20];char *p=buf;\\n\\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\\n\\twhile (p!=buf)pcu(*--p);}\\nvo(const char *s){while(*s)pcu(*s++);}\\nvo(char c){pcu(c);}\\n//vo(string &s){for (char c: s) pcu(c);}\\ntemplate <typename head, typename... tail> vo(head&& h, tail&&... t){out(h);out(move(t)...);}\\n//template <typename T> vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\\\"\\\":\\\" \\\"),out(x);out('\\\\n');}\\n#undef vo\\n\\nstruct T {int v, w;};\\nmap<vector<int>, T> m;\\n\\nT find(int n, int w, vector<T> &ts) {\\n\\tT r;\\n\\tvector<int> k = {n, w};\\n\\tif (m.count(k))\\n\\t\\treturn m[k];\\n\\tif (n < 0 || ts[n].w > w)\\n\\t\\tr = {0, w};\\n\\telse {\\n\\t\\tT a = find(n - 1, w, ts),\\n\\t\\t b = find(n - 1, w - ts[n].w, ts);\\n\\t\\tb.v += ts[n].v;\\n\\t\\tr = a.v > b.v ? a : b;\\n\\t}\\n\\tm[k] = r;\\n\\treturn r;\\n}\\n\\nint main() {\\n\\tfor (int w, n, i = 1; (w = in()) && (n = in()); i++) {\\n\\t\\tout(\\\"Case \\\", i, \\\":\\\\n\\\");\\n\\t\\tvector<T> ts(n);\\n\\t\\tm = {};\\n\\t\\tfor (auto &t: ts) {\\n\\t\\t\\tint v = in();\\n\\t\\t\\tt = {v, in()};\\n\\t\\t}\\n\\t\\tT r = find(n - 1, w, ts);\\n\\t\\tout(r.v, '\\\\n', w - r.w, '\\\\n');\\n\\t}\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 700,\n \"memory_kb\": 110940,\n \"score_of_the_acc\": -1.9444,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":94,"cells":{"group_id":{"kind":"string","value":"aoj_0041_cpp"},"problem_description":{"kind":"string","value":"式\n与えられた 4 つの 1 から 9 の整数を使って、答えが 10 になる式をつくります。\n 4 つの整数\na, b, c, d\nを入力したとき、下記の条件に従い、答えが 10 になる式を出力するプログラムを作成してください。また、答えが複数ある時は、最初に見つかった答えだけを出力するものとします。答えがない時は、0 と出力してください。\n演算子として、加算 (+)、減算 (-)、乗算 (*) だけを使います。除算 (/) は使いません。使用できる演算子は３個です。\n数を4つとも使わなければいけません。\n4つの数の順番は自由に入れ換えてかまいません。\nカッコを使ってもかまいません。使用できるカッコは３組（６個）以下です。\nInput\n複数のデータセットが与えられます。各データセットの形式は以下のとおり：\na\nb\nc\nd\n入力は４つの 0 で終了します。データセットの数は 40 を超えません。\nOutput\n各データセットについて、与えられた 4 つの整数と上記の演算記号およびカッコを組み合わせて値が 10 となる式または 0 を１行に出力してください。式の文字列が 1024 文字を超えてはいけません。\nSample Input\n8 7 9 9\n4 4 4 4\n5 5 7 5\n0 0 0 0\nOutput for the Sample Input\n((9 * (9 - 7)) - 8)\n0\n((7 * 5) - (5 * 5))"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0041_8027424","code_snippet":"#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<128>>;\n\n#define TO_STRING(var) # var\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n#define sqrt __builtin_sqrtl\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acos(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to;\n int cost;\n Edge(int to, int cost) : from(-1), to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n Edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n};\n\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(12);\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nint POW(int x, int n) {\n __int128_t ret = 1;\n // if (ret >= INFL) return INFL;\n if (n < 0) { cout << \"error\" << endl; return 0; }\n else if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) ret = POW(x * x, n / 2);\n else ret = x * POW(x, n - 1);\n\n if (ret > 8e18) ret = 0;\n return ret;\n}\nint floor(int x, int y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\nll per(int x, int y) {\n if (y == 0) {\n cout << \"error\" << endl;\n return INFL;\n }\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n // if (x < 0 && y > 0) \n return x / y - (x % y < 0);\n}\nll mod(int x, int y) {\n if (y == 0) {\n cout << \"error\" << endl;\n return INFL;\n }\n if (x >= 0 && y > 0) return x % y;\n if (x >= 0 && y < 0) return x % y;\n if (x < 0 && y < 0) {\n __int128_t ret = x % y;\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n }\n // if (x < 0 && y > 0) {\n __int128_t ret = x % y;\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n // }\n}\nint modf(ld x) {\n if (equals(x, 0)) return 0;\n\telse if (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; }\n return false;\n}\n\nint countl_zero(int N) { return __builtin_clzll(N); }\nint countl_one(int N) {\n int ret = 0; while (N % 2) { N /= 2; ret++; }\n return ret;\n}\nint countr_zero(int N) { return __builtin_ctzll(N); }\nint countr_one(int N) {\n int ret = 0, k = 63 - __builtin_clzll(N);\n while (k != -1 && (N & (1LL << k))) { k--; ret++; }\n return ret;\n}\nint popcount(int N) { return __builtin_popcountll(N); }\nint unpopcount(int N) { return 64 - __builtin_clzll(N) - __builtin_popcountll(N); }\n\nint top_bit(int N) { return 63 - __builtin_clzll(N);} // 2^kの位\nint bot_bit(int N) { return __builtin_ctz(N);} // 2^kの位\nint MSB(int N) { return 1 << (63 - __builtin_clzll(N)); } // mask\n\nint bit_width(int N) { return 64 - __builtin_clzll(N); } // 桁数\nint ceil_log2(int N) { return 63 - __builtin_clzll(N); }\nint bit_floor(int N) { return 1 << (63 - __builtin_clzll(N)); }\nint floor_log2(int N) { return 64 - __builtin_clzll(N-1); }\nint bit_ceil(int N) { return 1 << (64 - __builtin_clzll(N-1)) - (N==1); }\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n\n return true;\n\t}\n\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase(\n remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }),\n G.end());\n return G;\n }\n\nprivate:\n\tvector<int> par;\n\tvector<int> sz;\n};\n\ntemplate<int mod> class Modint{\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t;\n x = t;\n return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n\nint modinv(__int128_t x, int mod) {\n if (x == 1) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = 10 * ret + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128];\n char *d = end(buffer);\n\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n\n if (x < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n\n if (os.rdbuf()->sputn(d, len) != len) {\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\nstring to_string(char c) {\n string s = {c};\n return s;\n}\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1);\n _finv.resize(N + 1);\n _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1;\n _finv[0] = _finv[1] = 1;\n _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint COM(int N, int K) {\n if (N < K) return 0;\n if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\n\n#pragma endregion\n\nusing T = int;\nT calc_revpo(vector<string> &S) {\n int N = S.size();\n vector<T> st;\n for (int i = 0; i < N; i++) {\n if (S[i] == \"+\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a + b);\n } else if (S[i] == \"-\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a - b);\n } else if (S[i] == \"*\") {\n T b = st.back();\n st.pop_back();\n T a = st.back();\n st.pop_back();\n st.pb(a * b);\n } else st.pb(stoll(S[i]));\n }\n return st.back();\n}\n\nstring decode_revpo(vector<string> &S) {\n vector<string> st;\n int N = S.size();\n for (int i = 0; i < N; i++) {\n if (S[i][0] >= '0' && S[i][0] <= '9') st.push_back(S[i]);\n else {\n string B = st.back();\n st.pop_back();\n string A = st.back();\n st.pop_back();\n\n // 演算子が「*」「/」で、演算子の前の式が\n // 「宙ぶらりんの+ -」を含むとき括弧をつける\n if (S[i] == \"*\") {\n int depth = 0;\n int sz = A.size();\n for (int j = 0; j < sz; j++) {\n if (A[j] == '(') depth++;\n if (A[j] == ')') depth--;\n\n if (depth == 0 && (A[j] == '+' or A[j] == '-')) {\n A = \"(\" + A + \")\";\n break;\n }\n }\n }\n\n // 演算子が「-」「*」で、演算子の後の式が\n // 「宙ぶらりんの+ -」を含むとき括弧をつける\n if (S[i] == \"-\" or S[i] == \"*\") {\n int depth = 0;\n int sz = B.size();\n for (int j = 0; j < sz; j++) {\n if (B[j] == '(') depth++;\n if (B[j] == ')') depth--;\n\n if (depth == 0 && (B[j] == '+' or B[j] == '-')) {\n B = \"(\" + B + \")\";\n break;\n }\n }\n }\n\n if (S[i] == \"+\") st.push_back(A + \" + \" + B);\n if (S[i] == \"-\") st.push_back(A + \" - \" + B);\n if (S[i] == \"*\") st.push_back(A + \" * \" + B);\n }\n }\n return st.back();\n}\n\n// 数字を1, 演算子を0とした01列Bが逆ポーランド記法としてありえるか\n// 括弧列のような判定方法\nbool isvalid(vector<int> &B) {\n int N = B.size();\n\n int depth = B[0];\n for (int i = 1; i < N; i++) {\n if (depth == 0) return false;\n if (B[i]) depth++;\n else depth--;\n }\n return true;\n}\n\nsigned main() {\n while (true) {\n int N = 4, M = 10;\n vector<int> A(N);\n for (int i = 0; i < N; i++) cin >> A[i];\n sort(A.begin(), A.end());\n if (A[0] + A[1] + A[2] + A[3] == 0) break;\n\n vector<int> B(N + N - 1, 1); // 01列。1が数字、0が演算子\n for (int i = 0; i < N - 1; i++) B[i] = 0;\n\n int ans = 0;\n string S;\n do {\n if (isvalid(B)) { // 逆ポの記法としてありえるなら\n sort(A.begin(), A.end());\n do {\n int p = POW(3LL, N - 1);\n for (int j = 0; j < p; j++) {\n vector<string> T;\n int curA = 0, curC = 0;\n\n vector<string> C;\n int J = j;\n while (J) {\n int r = J % 3;\n J /= 3;\n\n if (r == 0) C.pb(\"+\");\n if (r == 1) C.pb(\"-\");\n if (r == 2) C.pb(\"*\");\n }\n while (C.size() < N - 1) C.pb(\"+\");\n\n for (int k = 0; k < N + N - 1; k++) {\n if (B[k]) T.pb(to_string(A[curA])), curA++;\n else T.pb(C[curC]), curC++;\n }\n if (abs(calc_revpo(T) - M) < EPS) {\n S = decode_revpo(T);\n ans++;\n }\n }\n } while (next_permutation(A.begin(), A.end()));\n }\n } while (next_permutation(B.begin(), B.end()));\n if (ans == 0) cout << ans << endl;\n else cout << S << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3432,"score_of_the_acc":-1.0312,"final_rank":11},{"submission_id":"aoj_0041_4893128","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n\n// カンマ区切りのデータをvector<int>に変換\nvector<int> comma_sep(string inp) {\n inp += ',';\n vector<int> v;\n string s = \"\";\n for (char c : inp) {\n if (c == ',') {\n v.push_back(stoi(s));\n s = \"\";\n } else {\n s += c;\n }\n }\n return v;\n}\n\ntemplate <class T>\nvector<vector<T>> permutations_parts(vector<T> p, int x, int s, int n) {\n vector<vector<T>> ret;\n if (x == s) {\n for (int i = x; i < n; i++) ret.push_back({p[i]});\n return ret;\n }\n for (int i = x; i < n; i++) {\n vector<T> v = p;\n swap(v[x], v[i]);\n vector<vector<T>> v2 = permutations_parts(v, x + 1, s, n);\n T q = v[x];\n int size = (int)v2.size();\n for (int i = 0; i < size; i++) { v2[i].push_back(q); }\n copy(v2.begin(), v2.end(), back_inserter(ret));\n }\n return ret;\n}\ntemplate <class T> vector<vector<T>> permutations(vector<T> v, int size = -1) {\n int n = (int)v.size();\n if (size == -1) size = n;\n if (size == n) {\n vector<vector<T>> ret;\n int ret_size = 1;\n for (int i = size; i > 1; i--) ret_size *= i;\n ret.reserve(ret_size);\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\n return ret;\n }\n return permutations_parts(v, 0, size - 1, n);\n}\n\ntemplate <class T> vector<vector<T>> permutations2(vector<T> v, int size = -1) {\n int n = (int)v.size();\n if (size == -1) size = n;\n if (size == n) {\n vector<vector<T>> ret;\n int ret_size = 1;\n for (int i = size; i > 1; i--) ret_size *= i;\n ret.reserve(ret_size);\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\n }\n return permutations_parts(v, 0, size - 1, n);\n}\n\nint main() {\n PRE_COMMAND\n int a, b, c, d;\n string a_s, b_s, c_s, d_s, s;\n while (cin >> a_s >> b_s >> c_s >> d_s) {\n if (a_s == \"0\") break;\n s = \"0\";\n int ans, ans2;\n vector<string> v2 = {a_s, b_s, c_s, d_s};\n vector<vector<string>> v3 = permutations(v2);\n vector<vector<string>> v4 = permutations2(v2);\n SORT(v4);\n for (string c1 : {\" + \", \" - \", \" * \"}) {\n for (string c2 : {\" + \", \" - \", \" * \"}) {\n for (string c3 : {\" + \", \" - \", \" * \"}) {\n for (auto v : v4) {\n a_s = v[0], b_s = v[1], c_s = v[2], d_s = v[3];\n a = stoi(a_s), b = stoi(b_s), c = stoi(c_s),\n d = stoi(d_s);\n // ((a+b)+c)+d\n ans = 0;\n if (c1 == \" + \") ans = a + b;\n if (c1 == \" - \") ans = a - b;\n if (c1 == \" * \") ans = a * b;\n if (c2 == \" + \") ans = ans + c;\n if (c2 == \" - \") ans = ans - c;\n if (c2 == \" * \") ans = ans * c;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (ans == 10)\n s = \"(((\" + a_s + c1 + b_s + \")\" + c2 + c_s + \")\" +\n c3 + d_s + \")\";\n // (a+b)+(c+d)\n ans = 0, ans2 = 0;\n if (c1 == \" + \") ans = a + b;\n if (c1 == \" - \") ans = a - b;\n if (c1 == \" * \") ans = a * b;\n if (c3 == \" + \") ans2 = c + d;\n if (c3 == \" - \") ans2 = c - d;\n if (c3 == \" * \") ans2 = c * d;\n if (c2 == \" + \") ans = ans + ans2;\n if (c2 == \" - \") ans = ans - ans2;\n if (c2 == \" * \") ans = ans * ans2;\n if (ans == 10)\n s = \"((\" + a_s + c1 + b_s + \")\" + c2 + \"(\" + c_s +\n c3 + d_s + \"))\";\n // (a+(b+c))+d\n ans = 0;\n if (c2 == \" + \") ans = b + c;\n if (c2 == \" - \") ans = b - c;\n if (c2 == \" * \") ans = b * c;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (ans == 10)\n s = \"((\" + a_s + c1 + \"(\" + b_s + c2 + c_s + \"))\" +\n c3 + d_s + \")\";\n // a+((b+c)+d)\n ans = 0;\n if (c2 == \" + \") ans = b + c;\n if (c2 == \" - \") ans = b - c;\n if (c2 == \" * \") ans = b * c;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (ans == 10)\n s = \"(\" + a_s + c1 + \"((\" + b_s + c2 + c_s + \")\" +\n c3 + d_s + \"))\";\n // a+(b+(c+d))\n ans = 0;\n if (c3 == \" + \") ans = c + d;\n if (c3 == \" - \") ans = c - d;\n if (c3 == \" * \") ans = c * d;\n if (c2 == \" + \") ans = b + ans;\n if (c2 == \" - \") ans = b - ans;\n if (c2 == \" * \") ans = b * ans;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (ans == 10)\n s = \"(\" + a_s + c1 + \"(\" + b_s + c2 + \"(\" + c_s +\n c3 + d_s + \")))\";\n }\n }\n }\n }\n cout << s << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3200,"score_of_the_acc":-0.8942,"final_rank":7},{"submission_id":"aoj_0041_4893122","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n\n// カンマ区切りのデータをvector<int>に変換\nvector<int> comma_sep(string inp) {\n inp += ',';\n vector<int> v;\n string s = \"\";\n for (char c : inp) {\n if (c == ',') {\n v.push_back(stoi(s));\n s = \"\";\n } else {\n s += c;\n }\n }\n return v;\n}\n\ntemplate <class T>\nvector<vector<T>> permutations_parts(vector<T> p, int x, int s, int n) {\n vector<vector<T>> ret;\n if (x == s) {\n for (int i = x; i < n; i++) ret.push_back({p[i]});\n return ret;\n }\n for (int i = x; i < n; i++) {\n vector<T> v = p;\n swap(v[x], v[i]);\n vector<vector<T>> v2 = permutations_parts(v, x + 1, s, n);\n T q = v[x];\n int size = (int)v2.size();\n for (int i = 0; i < size; i++) { v2[i].push_back(q); }\n copy(v2.begin(), v2.end(), back_inserter(ret));\n }\n return ret;\n}\ntemplate <class T> vector<vector<T>> permutations(vector<T> v, int size = -1) {\n int n = (int)v.size();\n if (size == -1) size = n;\n if (size == n) {\n vector<vector<T>> ret;\n int ret_size = 1;\n for (int i = size; i > 1; i--) ret_size *= i;\n ret.reserve(ret_size);\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\n //return ret;\n }\n return permutations_parts(v, 0, size - 1, n);\n}\n\nint main() {\n PRE_COMMAND\n int a, b, c, d;\n string a_s, b_s, c_s, d_s, s;\n while (cin >> a_s >> b_s >> c_s >> d_s) {\n if (a_s == \"0\") break;\n s = \"0\";\n int ans, ans2;\n vector<string> v2 = {a_s, b_s, c_s, d_s};\n vector<vector<string>> v3 = permutations(v2);\n for (string c1 : {\" + \", \" - \", \" * \"}) {\n for (string c2 : {\" + \", \" - \", \" * \"}) {\n for (string c3 : {\" + \", \" - \", \" * \"}) {\n for (auto v : v3) {\n a_s = v[0], b_s = v[1], c_s = v[2], d_s = v[3];\n a = stoi(a_s), b = stoi(b_s), c = stoi(c_s),\n d = stoi(d_s);\n // ((a+b)+c)+d\n ans = 0;\n if (c1 == \" + \") ans = a + b;\n if (c1 == \" - \") ans = a - b;\n if (c1 == \" * \") ans = a * b;\n if (c2 == \" + \") ans = ans + c;\n if (c2 == \" - \") ans = ans - c;\n if (c2 == \" * \") ans = ans * c;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (ans == 10)\n s = \"(((\" + a_s + c1 + b_s + \")\" + c2 + c_s + \")\" +\n c3 + d_s + \")\";\n // (a+b)+(c+d)\n ans = 0, ans2 = 0;\n if (c1 == \" + \") ans = a + b;\n if (c1 == \" - \") ans = a - b;\n if (c1 == \" * \") ans = a * b;\n if (c3 == \" + \") ans2 = c + d;\n if (c3 == \" - \") ans2 = c - d;\n if (c3 == \" * \") ans2 = c * d;\n if (c2 == \" + \") ans = ans + ans2;\n if (c2 == \" - \") ans = ans - ans2;\n if (c2 == \" * \") ans = ans * ans2;\n if (ans == 10)\n s = \"((\" + a_s + c1 + b_s + \")\" + c2 + \"(\" + c_s +\n c3 + d_s + \"))\";\n // (a+(b+c))+d\n ans = 0;\n if (c2 == \" + \") ans = b + c;\n if (c2 == \" - \") ans = b - c;\n if (c2 == \" * \") ans = b * c;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (ans == 10)\n s = \"((\" + a_s + c1 + \"(\" + b_s + c2 + c_s + \"))\" +\n c3 + d_s + \")\";\n // a+((b+c)+d)\n ans = 0;\n if (c2 == \" + \") ans = b + c;\n if (c2 == \" - \") ans = b - c;\n if (c2 == \" * \") ans = b * c;\n if (c3 == \" + \") ans = ans + d;\n if (c3 == \" - \") ans = ans - d;\n if (c3 == \" * \") ans = ans * d;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (ans == 10)\n s = \"(\" + a_s + c1 + \"((\" + b_s + c2 + c_s + \")\" +\n c3 + d_s + \"))\";\n // a+(b+(c+d))\n ans = 0;\n if (c3 == \" + \") ans = c + d;\n if (c3 == \" - \") ans = c - d;\n if (c3 == \" * \") ans = c * d;\n if (c2 == \" + \") ans = b + ans;\n if (c2 == \" - \") ans = b - ans;\n if (c2 == \" * \") ans = b * ans;\n if (c1 == \" + \") ans = a + ans;\n if (c1 == \" - \") ans = a - ans;\n if (c1 == \" * \") ans = a * ans;\n if (ans == 10)\n s = \"(\" + a_s + c1 + \"(\" + b_s + c2 + \"(\" + c_s +\n c3 + d_s + \")))\";\n }\n }\n }\n }\n cout << s << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3176,"score_of_the_acc":-0.8832,"final_rank":6},{"submission_id":"aoj_0041_4357268","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nint main() {\n vector<char> v(4);\n string A = \"+-*\";\n while(true){\n for (auto &&i : v) scanf(\" %c\", &i);\n if(v[0] == '0') break;\n auto solve = [&](string &s) -> string {\n stack<pair<string, int>> S;\n for (auto &&i : s) {\n if(isdigit(i)) S.emplace(string(1, i), i-'0');\n else if(i == '+'){\n if(S.size() < 2) return {};\n auto a = S.top(); S.pop();\n auto b = S.top(); S.pop();\n S.emplace(\"(\" + a.first + \"+\" + b.first + \")\", a.second+b.second);\n }else if(i == '*'){\n if(S.size() < 2) return {};\n auto a = S.top(); S.pop();\n auto b = S.top(); S.pop();\n S.emplace(\"(\" + a.first + \"*\" + b.first + \")\", a.second*b.second);\n }else if(i == '-'){\n if(S.size() < 2) return {};\n auto a = S.top(); S.pop();\n auto b = S.top(); S.pop();\n S.emplace(\"(\" + a.first + \"-\" + b.first + \")\", a.second-b.second);\n }\n }\n if(S.top().second != 10) return {};\n else return S.top().first;\n };\n int ok = 0;\n for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) for (int k = 0; k < 3; ++k) {\n string s = string(1, v[0])+v[1]+v[2]+v[3]+A[i]+A[j]+A[k];\n sort(s.begin(),s.end());\n do {\n auto ret = solve(s);\n if(!ret.empty()){\n cout << ret << \"\\n\";\n i = j = k = 3;\n ok = 1;\n break;\n }\n }while(next_permutation(s.begin(),s.end()));\n }\n if(!ok) puts(\"0\");\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3100,"score_of_the_acc":-1.0048,"final_rank":10},{"submission_id":"aoj_0041_4310788","code_snippet":"#include <bits/stdc++.h>\n//typedef\n//-------------------------#include <bits/stdc++.h>\n\nconst double pi = 3.141592653589793238462643383279;\n\nusing namespace std;\n\n//conversion\n//------------------------------------------\ninline int toInt(string s)\n{\n int v;\n istringstream sin(s);\n sin >> v;\n return v;\n}\ntemplate <class T>\ninline string toString(T x)\n{\n ostringstream sout;\n sout << x;\n return sout.str();\n}\ninline int readInt()\n{\n int x;\n scanf(\"%d\", &x);\n return x;\n}\n\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\nconst double EPS = 1E-8;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n\nclass UnionFind\n{\npublic:\n vector<int> par;\n vector<int> siz;\n\n UnionFind(int sz_) : par(sz_), siz(sz_, 1)\n {\n for (ll i = 0; i < sz_; ++i)\n par[i] = i;\n }\n void init(int sz_)\n {\n par.resize(sz_);\n siz.assign(sz_, 1LL);\n for (ll i = 0; i < sz_; ++i)\n par[i] = i;\n }\n\n int root(int x)\n {\n while (par[x] != x)\n {\n x = par[x] = par[par[x]];\n }\n return x;\n }\n\n bool merge(int x, int y)\n {\n x = root(x);\n y = root(y);\n if (x == y)\n return false;\n if (siz[x] < siz[y])\n swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y)\n {\n return root(x) == root(y);\n }\n\n int size(int x)\n {\n return siz[root(x)];\n }\n};\n\nll modPow(ll x, ll n, ll mod = MOD)\n{\n ll res = 1;\n while (n)\n {\n if (n & 1)\n res = (res * x) % mod;\n\n res %= mod;\n x = x * x % mod;\n n >>= 1;\n }\n return res;\n}\n\n#define SIEVE_SIZE 5000000 + 10\nbool sieve[SIEVE_SIZE];\nvoid makeSieve()\n{\n for (int i = 0; i < SIEVE_SIZE; ++i)\n sieve[i] = true;\n sieve[0] = sieve[1] = false;\n for (int i = 2; i * i < SIEVE_SIZE; ++i)\n if (sieve[i])\n for (int j = 2; i * j < SIEVE_SIZE; ++j)\n sieve[i * j] = false;\n}\n\nbool isprime(ll n)\n{\n if (n == 0 || n == 1)\n return false;\n for (ll i = 2; i * i <= n; ++i)\n if (n % i == 0)\n return false;\n return true;\n}\n\nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n\n// テーブルを作る前処理\nvoid COMinit()\n{\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++)\n {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算\nlong long COM(int n, int k)\n{\n if (n < k)\n return 0;\n if (n < 0 || k < 0)\n return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nlong long extGCD(long long a, long long b, long long &x, long long &y)\n{\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\n// 負の数にも対応した mod (a = -11 とかでも OK)\ninline long long mod(long long a, long long m)\n{\n return (a % m + m) % m;\n}\n\n// 逆元計算 (ここでは a と m が互いに素であることが必要)\nlong long modinv(long long a, long long m)\n{\n long long x, y;\n extGCD(a, m, x, y);\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\n}\nll GCD(ll a, ll b)\n{\n\n if (b == 0)\n return a;\n return GCD(b, a % b);\n}\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat &A, mat &B)\n{\n mat C(A.size(), vec((int)B[0].size()));\n for (int i = 0; i < A.size(); ++i)\n {\n for (int k = 0; k < B.size(); ++k)\n {\n for (int j = 0; j < B[0].size(); ++j)\n {\n C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;\n }\n }\n }\n return C;\n}\nmat matPow(mat A, ll n)\n{\n mat B(A.size(), vec((int)A.size()));\n\n for (int i = 0; i < A.size(); ++i)\n {\n B[i][i] = 1;\n }\n\n while (n > 0)\n {\n if (n & 1)\n B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\nconst int INF = 1e9 + 7;\n#define repi(i, m, n) for (int i = m; i < n; i++)\n#define fi first\n#define se second\nclass Arithmetic\n{\npublic:\n string str;\n int n, flag = 1;\n void init(string s)\n {\n str = s;\n n = str.size();\n }\n int add(int a, int b) { return a + b; }\n int mul(int a, int b) { return a * b; }\n int div(int a, int b) { return a / b; }\n int sur(int a, int b) { return a % b; }\n\n P get_num(int p)\n {\n int ans = 0, q = -1, f = 0;\n if (str[p] == '(')\n return calc(p + 1, 0);\n if (str[p] == '-')\n {\n f = 1;\n p++;\n }\n if (str[p] == '(')\n {\n P pi = calc(p + 1, 0);\n return P(-pi.fi, pi.se);\n }\n repi(i, p, n)\n {\n if (!isdigit(str[i]))\n break;\n ans = ans * 10 + (str[i] - '0');\n q = i;\n }\n if (f)\n return P(-ans, q);\n return P(ans, q);\n }\n\n P calc(int pp = 0, int f = 0)\n {\n P pi = get_num(pp);\n int ans = pi.fi, p = pi.se + 1;\n repi(i, p, n)\n {\n if (f and str[i] == ')')\n return P(ans, i - 1);\n if (str[i] == ')')\n return P(ans, i);\n if (str[i] == '*' or str[i] == '/' or str[i] == '%')\n {\n pi = get_num(i + 1);\n if (str[i] == '*')\n ans = mul(ans, pi.fi);\n if (str[i] == '/')\n ans = div(ans, pi.fi);\n if (str[i] == '%')\n ans = sur(ans, pi.fi);\n }\n if (str[i] == '+' or str[i] == '-')\n {\n if (f)\n return P(ans, i - 1);\n if (str[i] == '+')\n pi = calc(i + 1, 1);\n if (str[i] == '-')\n pi = calc(i, 1);\n ans = add(ans, pi.fi);\n }\n i = pi.se;\n }\n return P(ans, n - 1);\n }\n int solve(int ret = -INF)\n { //0除算のとき返す値\n flag = 1;\n P ans = calc();\n if (!flag)\n return ret;\n return ans.fi;\n }\n};\n\nstring ans = \"\";\n\nvoid rec(int idx, string s, vector<string> &v, bool p)\n{\n if (idx == 3)\n {\n s += v[idx];\n if (p)\n {\n s += ')';\n }\n Arithmetic solver;\n solver.init(s);\n if (solver.solve() == 10)\n {\n ans = s;\n }\n return;\n }\n if (!p)\n {\n s += v[idx];\n rec(idx + 1, s + '+', v, false);\n rec(idx + 1, s + '*', v, false);\n rec(idx + 1, s + '-', v, false);\n s.pop_back();\n s += '(';\n s += v[idx];\n rec(idx + 1, s + '+', v, true);\n rec(idx + 1, s + '*', v, true);\n rec(idx + 1, s + '-', v, true);\n }\n else\n {\n s += v[idx];\n rec(idx + 1, s + '+', v, true);\n rec(idx + 1, s + '*', v, true);\n rec(idx + 1, s + '-', v, true);\n\n s.pop_back();\n s += v[idx];\n s += ')';\n rec(idx + 1, s + '+', v, false);\n rec(idx + 1, s + '*', v, false);\n rec(idx + 1, s + '-', v, false);\n }\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n\n vector<string> v(4);\n while (cin >> v[0] >> v[1] >> v[2] >> v[3])\n {\n if (v[0] == \"0\" && v[1] == \"0\" && v[2] == \"0\" && v[3] == \"0\")\n break;\n\n ans = \"\";\n sort(all(v));\n do\n {\n string t = \"\";\n rec(0, \"\", v, false);\n\n } while (next_permutation(all(v)));\n if (ans == \"\")\n cout << 0 << endl;\n else\n {\n string tmp = \"\";\n for (int i = 0; i < ans.size(); i++)\n {\n if (ans[i] == '*' || ans[i] == '+' || ans[i] == '-')\n {\n tmp += \" \";\n tmp += ans[i];\n tmp += \" \";\n }\n else\n {\n tmp += ans[i];\n }\n }\n cout << tmp << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3128,"score_of_the_acc":-0.8613,"final_rank":5},{"submission_id":"aoj_0041_2292293","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing db = double;\nusing ll = long long;\nusing vi = vector <int>;\n#define op operator\n#define pb push_back\n\nstring ans;\nvoid dfs(vector <pair <int, string>> v) {\n\tif(v.size() == 1) {\n\t\tif(v[0].first == 10)\n\t\t\tans = v[0].second;\n\t\telse\n\t\t\treturn;\n\t}\n\tint n = v.size();\n\tfor(int i = 0; i < n; i ++)\n\t\tfor(int j = 0; j < n; j ++) if(i != j) {\n\t\t\tvector <pair <int, string>> nxt;\n\t\t\tfor(int k = 0; k < n; k ++) if(i != k && j != k)\n\t\t\t\tnxt.pb({v[k]});\n\t\t\tnxt.pb({v[i].first + v[j].first, \"(\" + v[i].second + \"+\" + v[j].second + \")\"});\n\t\t\tdfs(nxt); nxt.pop_back();\n\t\t\tnxt.pb({v[i].first - v[j].first, \"(\" + v[i].second + \"-\" + v[j].second + \")\"});\n\t\t\tdfs(nxt); nxt.pop_back();\n\t\t\tnxt.pb({v[i].first * v[j].first, \"(\" + v[i].second + \"*\" + v[j].second + \")\"});\n\t\t\tdfs(nxt); nxt.pop_back();\n\t\t}\n}\n\nint a[4];\n\nint main() {\n\tios :: sync_with_stdio(0);\n\n\tfor(;;) {\n\t\tfor(int i = 0; i < 4; i ++)\n\t\t\tcin >> a[i];\n\t\tif(*max_element(a, a + 4) == 0)\n\t\t\tbreak;\n\t\tvector <pair <int, string>> v;\n\t\tfor(int i = 0; i < 4; i ++)\n\t\t\tv.pb({a[i], to_string(a[i])});\n\t\tans = \"\";\n\t\tdfs(v);\n\t\tif(ans.size())\n\t\t\tcout << ans << '\\n';\n\t\telse\n\t\t\tcout << \"0\\n\";\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3276,"score_of_the_acc":-0.9601,"final_rank":9},{"submission_id":"aoj_0041_2149302","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n#define INF (1e9+1)\n//#define INF (1LL<<59)\n\n\nint RPN(vector<char> v){\n\tstack<int> num;\n\trep(i,v.size()){\n\t\tif(isdigit(v[i])){\n\t\t\tnum.push(v[i]-'0');\n\t\t}else{\n\t\t\tif(num.size()<2) throw -1;\n\t\t\tint a,b;\n\t\t\ta = num.top(),num.pop();\n\t\t\tb = num.top();num.pop();\n\t\t\tif(v[i]=='+')num.push(a+b);\n\t\t\tif(v[i]=='-')num.push(a-b);\n\t\t\tif(v[i]=='*')num.push(a*b);\n\t\t}\n\t}\n\tif(num.size()!=1)throw -1;\n\t\n\treturn num.top();\n}\n\nvoid printRPN(vector<char> v){\n\tstack<string> num;\n\trep(i,v.size()){\n\t\tif(isdigit(v[i])){\n\t\t\tnum.push(string(1,v[i]));\n\t\t}else{\n\t\t\tstring a,b;\n\t\t\ta = num.top(),num.pop();\n\t\t\tb = num.top();num.pop();\n\t\t\tif(v[i]=='+')num.push(\"(\"+a+\"+\"+b+\")\");\n\t\t\tif(v[i]=='-')num.push(\"(\"+a+\"-\"+b+\")\");\n\t\t\tif(v[i]=='*')num.push(\"(\"+a+\"*\"+b+\")\");\n\t\t}\n\t}\n\tcout<<num.top()<<endl;\n}\n\nint main(){\n\tvector<char> v(4);\n\twhile(cin>>v[0]>>v[1]>>v[2]>>v[3]){\n\t\tif(v[0]=='0'&&v[1]=='0'&&v[2]=='0'&&v[3]=='0')break;\n\t\trep(plus,4){\n\t\t\trep(minus,4){\n\t\t\t\trep(mul,4){\n\t\t\t\t\tvector<char> tmp=v;\n\t\t\t\t\tif(plus+minus+mul!=3)continue;\n\t\t\t\t\trep(i,plus)tmp.pb('+');\n\t\t\t\t\trep(i,minus)tmp.pb('-');\n\t\t\t\t\trep(i,mul)tmp.pb('*');\n\t\t\t\t\t\n\t\t\t\t\tsort(all(tmp));\n\t\t\t\t\tdo{\n\t\t\t\t\t\tint res;\n\t\t\t\t\t\ttry{\n\t\t\t\t\t\t\tres = RPN(tmp);\n\t\t\t\t\t\t}catch(int e){continue;}\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(res==10){\n\t\t\t\t\t\t\tprintRPN(tmp);\n\t\t\t\t\t\t\tgoto next;\n\t\t\t\t\t\t}\n\t\t\t\t\t}while(next_permutation(all(tmp)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<0<<endl;\n\tnext:;\n\t}\n}","accuracy":1,"time_ms":330,"memory_kb":3144,"score_of_the_acc":-1.8686,"final_rank":14},{"submission_id":"aoj_0041_2109508","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n\nusing namespace std;\n\nbool Found;\nchar ans[30];\n\nint calc(char arg[30]){\n\n\tint tmp,op1,work,count,work2;\n\tchar line[30],calc;\n\tstack<int> NUM,work_num;\n\tstack<char> OP,work_op;\n\n\tint loop;\n\tfor(loop = 0; arg[loop] != '\\0';loop++)line[loop] = arg[loop];\n\n\tline[loop++] = '=';\n\tline[loop] = '\\0';\n\n\n\tbool numFLG,negFLG;\n\n\ttmp = 0;\n\tnumFLG = false;\n\tnegFLG = false;\n\n\tfor(int k = 0; line[k] != '\\0'; k++){\n\t\tif(line[k] >= '0' && line[k] <= '9'){\n\t\t\tnumFLG = true;\n\t\t\ttmp = 10*tmp + (line[k] - '0');\n\n\t\t}else{\n\n\t\t\tif(numFLG == true){\n\n\t\t\t\tif(negFLG){\n\t\t\t\t\ttmp = -1*tmp;\n\t\t\t\t\tnegFLG = false;\n\t\t\t\t}\n\n\t\t\t\tif(OP.empty() == false && (OP.top() == '*' || OP.top() == '/')){\n\t\t\t\t\tcalc = OP.top();\n\t\t\t\t\tOP.pop();\n\t\t\t\t\top1 = NUM.top();\n\t\t\t\t\tNUM.pop();\n\n\t\t\t\t\tif(calc == '*'){\n\t\t\t\t\t\tNUM.push(tmp*op1);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tNUM.push(op1/tmp);\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tNUM.push(tmp);\n\t\t\t\t}\n\n\t\t\t\tnumFLG = false;\n\t\t\t\ttmp = 0;\n\t\t\t}\n\n\t\t\tif(line[k] == '+' ||line[k] == '*' || line[k] == '/' || line[k] == '(' || line[k] == '-'){\n\t\t\t\tOP.push(line[k]);\n\t\t\t}else if(line[k] == ')'){\n\t\t\t\twork = NUM.top();\n\t\t\t\tNUM.pop();\n\t\t\t\twork_num.push(work);\n\n\t\t\t\tcount = 0;\n\n\t\t\t\twhile(true){\n\t\t\t\t\tcalc = OP.top();\n\t\t\t\t\tOP.pop();\n\t\t\t\t\tif(calc == '(')break;\n\n\t\t\t\t\tcount++;\n\n\t\t\t\t\twork_op.push(calc);\n\n\t\t\t\t\twork = NUM.top();\n\t\t\t\t\tNUM.pop();\n\t\t\t\t\twork_num.push(work);\n\t\t\t\t}\n\n\t\t\t\tif(count == 0){\n\t\t\t\t\twork = work_num.top();\n\t\t\t\t\twork_num.pop();\n\t\t\t\t}else{\n\n\t\t\t\t\twork = work_num.top();\n\t\t\t\t\twork_num.pop();\n\n\t\t\t\t\twhile(!work_num.empty()){\n\t\t\t\t\t\tcalc = work_op.top();\n\t\t\t\t\t\twork_op.pop();\n\n\t\t\t\t\t\tif(calc == '+'){\n\t\t\t\t\t\t\twork += work_num.top();\n\t\t\t\t\t\t}else if(calc == '-'){\n\t\t\t\t\t\t\twork -= work_num.top();\n\t\t\t\t\t\t}else if(calc == '*'){\n\t\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\twork /= work_num.top();\n\t\t\t\t\t\t}\n\t\t\t\t\t\twork_num.pop();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(OP.empty() == false && OP.top() == '*'){\n\t\t\t\t\tOP.pop();\n\t\t\t\t\twork2 = NUM.top();\n\t\t\t\t\tNUM.pop();\n\t\t\t\t\twork *= work2;\n\t\t\t\t}else if(OP.empty() == false &&OP.top() == '/'){\n\t\t\t\t\tOP.pop();\n\t\t\t\t\twork2 = NUM.top();\n\t\t\t\t\tNUM.pop();\n\t\t\t\t\twork = work2/work;\n\t\t\t\t}\n\n\t\t\t\tNUM.push(work);\n\n\t\t\t}else{\n\t\t\t\twork = NUM.top();\n\t\t\t\tNUM.pop();\n\t\t\t\twork_num.push(work);\n\n\t\t\t\twhile(!NUM.empty()){\n\t\t\t\t\tcalc = OP.top();\n\t\t\t\t\tOP.pop();\n\n\t\t\t\t\twork_op.push(calc);\n\n\t\t\t\t\twork = NUM.top();\n\t\t\t\t\tNUM.pop();\n\t\t\t\t\twork_num.push(work);\n\t\t\t\t}\n\n\t\t\t\twork = work_num.top();\n\t\t\t\twork_num.pop();\n\n\t\t\t\twhile(!work_num.empty()){\n\t\t\t\t\tcalc = work_op.top();\n\t\t\t\t\twork_op.pop();\n\n\t\t\t\t\tif(calc == '+'){\n\t\t\t\t\t\twork += work_num.top();\n\t\t\t\t\t}else if(calc == '-'){\n\t\t\t\t\t\twork -= work_num.top();\n\t\t\t\t\t}else if(calc == '*'){\n\t\t\t\t\t\twork *= work_num.top();\n\t\t\t\t\t}else{\n\t\t\t\t\t\twork /= work_num.top();\n\t\t\t\t\t}\n\t\t\t\t\twork_num.pop();\n\t\t\t\t}\n\n\t\t\t\treturn work;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\t//must not reach here\n}\n\n\nvoid func(int a,int b, int c,int d){\n\n\tchar eq1[30],eq2[30],eq3[30],eq4[30],eq5[30],eq6[30],eq7[30],eq8[30];\n\teq1[0] = '(',eq1[1] = '0' + a,eq1[2] = '?',eq1[3] = '0' + b,eq1[4] = ')',eq1[5] = '?',eq1[6] = '(',eq1[7] = '0' + c,eq1[8] = '?',eq1[9] = '0' + d,eq1[10] = ')',eq1[11] = '\\0';\n\n\teq2[0] = '0' + a,eq2[1] = '?',eq2[2] = '(',eq2[3] = '0' + b,eq2[4] = '?',eq2[5] = '0' + c,eq2[6] = ')',eq2[7] = '?',eq2[8] = '0' + d,eq2[9] = '\\0';\n\n\teq3[0] = '0' + a,eq3[1] = '?',eq3[2] = '0' + b,eq3[3] = '?',eq3[4] = '(',eq3[5] = '0' + c,eq3[6] = '?',eq3[7] = '0' + d,eq3[8] = ')',eq3[9] = '\\0';\n\n\teq4[0] = '0' + a,eq4[1] = '?',eq4[2] = '(',eq4[3] = '0' + b,eq4[4] = '?',eq4[5] = '(',eq4[6] = '0' + c,eq4[7] = '?',eq4[8] = '0' + d,eq4[9] = ')',eq4[10] = ')',eq4[11] = '\\0';\n\n\teq5[0] = '(',eq5[1] = '0' + a,eq5[2] = '?',eq5[3] = '(',eq5[4] = '0' + b,eq5[5] = '?',eq5[6] = '0' + c,eq5[7] = ')',eq5[8] = ')',eq5[9] = '?',eq5[10] = '0' + d,eq5[11] = '\\0';\n\n\teq6[0] = '(',eq6[1] = '0' + a,eq6[2] = '?',eq6[3] = '0' + b,eq6[4] = ')',eq6[5] = '?',eq6[6] = '0' + c,eq6[7] = '?',eq6[8] = '0' + d,eq6[9] = '\\0';\n\n\teq7[0] = '(',eq7[1] = '(',eq7[2] = '0' + a,eq7[3] = '?',eq7[4] = '0' + b,eq7[5] = ')',eq7[6] = '?',eq7[7] = '0' + c,eq7[8] = ')',eq7[9] = '?',eq7[10] = '0' + d,eq7[11] = '\\0';\n\n\teq8[0] = '0' + a,eq8[1] = '?',eq8[2] = '(',eq8[3] = '(',eq8[4] = '0' + b,eq8[5] = '?',eq8[6] = '0' + c,eq8[7] = ')',eq8[8] = '?',eq8[9] = '0' + d,eq8[10] = ')',eq8[11] = '\\0';\n\n\n\tfor(int x = 0; x < 3; x++){\n\t\tfor(int y = 0; y < 3; y++){\n\t\t\tfor(int z = 0; z < 3; z++){\n\t\t\t\tswitch(x){\n\t\t\t\tcase 0:\n\t\t\t\t\teq1[2] = '+',eq2[1] = '+',eq3[1] = '+',eq4[1] = '+',eq5[2] = '+',eq6[2] = '+',eq7[3] = '+',eq8[1] = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\teq1[2] = '-',eq2[1] = '-',eq3[1] = '-',eq4[1] = '-',eq5[2] = '-',eq6[2] = '-',eq7[3] = '-',eq8[1] = '-';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\teq1[2] = '*',eq2[1] = '*',eq3[1] = '*',eq4[1] = '*',eq5[2] = '*',eq6[2] = '*',eq7[3] = '*',eq8[1] = '*';\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tswitch(y){\n\t\t\t\tcase 0:\n\t\t\t\t\teq1[5] = '+',eq2[4] = '+',eq3[3] = '+',eq4[4] = '+',eq5[5] = '+',eq6[5] = '+',eq7[6] = '+',eq8[5] = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\teq1[5] = '-',eq2[4] = '-',eq3[3] = '-',eq4[4] = '-',eq5[5] = '-',eq6[5] = '-',eq7[6] = '-',eq8[5] = '-';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\teq1[5] = '*',eq2[4] = '*',eq3[3] = '*',eq4[4] = '*',eq5[5] = '*',eq6[5] = '*',eq7[6] = '*',eq8[5] = '*';\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tswitch(z){\n\t\t\t\tcase 0:\n\t\t\t\t\teq1[8] = '+',eq2[7] = '+',eq3[6] = '+',eq4[7] = '+',eq5[9] = '+',eq6[7] = '+',eq7[9] = '+',eq8[8] = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\teq1[8] = '-',eq2[7] = '-',eq3[6] = '-',eq4[7] = '-',eq5[9] = '-',eq6[7] = '-',eq7[9] = '-',eq8[8] = '-';\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\teq1[8] = '*',eq2[7] = '*',eq3[6] = '*',eq4[7] = '*',eq5[9] = '*',eq6[7] = '*',eq7[9] = '*',eq8[8] = '*';\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(calc(eq1) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq1[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq2) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq2[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq3) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq3[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq4) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq4[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq5) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq5[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq6) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq6[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq7) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq7[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t\tif(calc(eq8) == 10){\n\t\t\t\t\tfor(int i = 0; i < 30; i++)ans[i] = eq8[i];\n\t\t\t\t\tFound = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tint a,b,c,d,num[4];\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&a,&b,&c,&d);\n\t\tif(a == 0 && b == 0 && c == 0 && d == 0)break;\n\n\t\tFound = false;\n\n\t\tnum[0] = a,num[1] = b,num[2] = c,num[3] =d;\n\n\t\tfor(int e = 0; e < 4; e++){\n\t\t\tfor(int f = 0; f < 4; f++){\n\t\t\t\tfor(int g = 0; g < 4; g++){\n\t\t\t\t\tfor(int h = 0; h < 4; h++){\n\t\t\t\t\t\tif(e != f && e != g && e != h && f != g && f != h && g != h)func(num[e],num[f],num[g],num[h]);\n\t\t\t\t\t\tif(Found)break;\n\t\t\t\t\t}\n\t\t\t\t\tif(Found)break;\n\t\t\t\t}\n\t\t\t\tif(Found)break;\n\t\t\t}\n\t\t\tif(Found)break;\n\t\t}\n\n\t\tif(Found)printf(\"%s\\n\",ans);\n\t\telse{\n\t\t\tprintf(\"0\\n\");\n\t\t}\n\t}\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":2556,"score_of_the_acc":-0.6629,"final_rank":3},{"submission_id":"aoj_0041_1963921","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <cmath>\n#include <random>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\n#define ALL(v) v.begin(), v.end()\n\n// every calculation can be written\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\n\nint calc(int a, int b, char ope) {\n if (ope == '+') return a + b;\n if (ope == '-') return a - b;\n if (ope == '*') return a * b;\n return -1;\n}\n\nbool isten(string s) {\n int ans;\n if (s[1] == '(') {\n int a, b, c, d;\n a = s[2] - '0';\n b = s[6] - '0';\n c = s[11] - '0';\n d = s[16] - '0';\n ans = calc(calc(calc(a,b,s[4]), c, s[9]), d, s[14]);\n }else {\n int a, b, c, d;\n a = s[1] - '0';\n b = s[5] - '0';\n c = s[11] - '0';\n d = s[15] - '0';\n ans = calc(calc(a, b, s[3]), calc(c, d, s[13]), s[8]);\n }\n return ans == 10;\n}\n\n// every calculation can be written\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\n\n\nvector<char> operands = {'+', '-', '*'};\nrandom_device rd;\n\nchar getRandomOperand() {\n return operands[rd() % 3];\n}\n\nvoid solve41(int a, int b, int c, int d) {\n vector<int> nums;\n nums.push_back(a), nums.push_back(b), nums.push_back(c), nums.push_back(d);\n sort(ALL(nums));\n do {\n REP(i,100) {\n string eq1, eq2;\n eq1 = \"((\" + to_string(nums[0]) + \" \" + getRandomOperand() + \" \" +\n to_string(nums[1]) + \") \" + getRandomOperand() + \" \" + to_string(nums[2]) +\n \") \" + getRandomOperand() + \" \" + to_string(nums[3]);\n eq2 = \"(\" + to_string(nums[0]) + \" \" + getRandomOperand() + \" \" +\n to_string(nums[1]) + \") \" + getRandomOperand() + \" (\" + to_string(nums[2]) +\n \" \" + getRandomOperand() + \" \" + to_string(nums[3]) + \")\";\n if (isten(eq1)) {\n cout << eq1 << endl;\n return;\n }else if (isten(eq2)) {\n cout << eq2 << endl;\n return;\n }\n }\n }while (next_permutation(nums.begin(), nums.end()));\n cout << 0 << endl;\n}\n\nint main() {\n int a, b, c, d;\n while(cin >> a >> b >> c >> d, a + b + c + d) {\n solve41(a,b,c,d);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3124,"score_of_the_acc":-0.8595,"final_rank":4},{"submission_id":"aoj_0041_1963920","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\n#include <cmath>\n#include <random>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\n#define ALL(v) v.begin(), v.end()\n\n// every calculation can be written\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\n\nint calc(int a, int b, char ope) {\n if (ope == '+') return a + b;\n if (ope == '-') return a - b;\n if (ope == '*') return a * b;\n return -1;\n}\n\nbool isten(string s) {\n int ans;\n if (s[1] == '(') {\n int a, b, c, d;\n a = s[2] - '0';\n b = s[6] - '0';\n c = s[11] - '0';\n d = s[16] - '0';\n ans = calc(calc(calc(a,b,s[4]), c, s[9]), d, s[14]);\n }else {\n int a, b, c, d;\n a = s[1] - '0';\n b = s[5] - '0';\n c = s[11] - '0';\n d = s[15] - '0';\n ans = calc(calc(a, b, s[3]), calc(c, d, s[13]), s[8]);\n }\n return ans == 10;\n}\n\n// every calculation can be written\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\n\n\nvector<char> operands = {'+', '-', '*'};\nrandom_device rd;\n\nchar getRandomOperand() {\n return operands[rd() % 3];\n}\n\nvoid solve41(int a, int b, int c, int d) {\n vector<int> nums;\n nums.push_back(a), nums.push_back(b), nums.push_back(c), nums.push_back(d);\n sort(ALL(nums));\n do {\n REP(i,500) {\n string eq1, eq2;\n eq1 = \"((\" + to_string(nums[0]) + \" \" + getRandomOperand() + \" \" +\n to_string(nums[1]) + \") \" + getRandomOperand() + \" \" + to_string(nums[2]) +\n \") \" + getRandomOperand() + \" \" + to_string(nums[3]);\n eq2 = \"(\" + to_string(nums[0]) + \" \" + getRandomOperand() + \" \" +\n to_string(nums[1]) + \") \" + getRandomOperand() + \" (\" + to_string(nums[2]) +\n \" \" + getRandomOperand() + \" \" + to_string(nums[3]) + \")\";\n if (isten(eq1)) {\n cout << eq1 << endl;\n return;\n }else if (isten(eq2)) {\n cout << eq2 << endl;\n return;\n }\n }\n }while (next_permutation(nums.begin(), nums.end()));\n cout << 0 << endl;\n}\n\nint main() {\n int a, b, c, d;\n while(cin >> a >> b >> c >> d, a + b + c + d) {\n solve41(a,b,c,d);\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3144,"score_of_the_acc":-1.1499,"final_rank":12},{"submission_id":"aoj_0041_1829312","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <sstream>\n#include <cmath>\nusing namespace std;\n\ntypedef pair<int,string> pis;\n#define fi first\n#define se second\n\nvector<pis> solve(vector<int> nums) {\n\tvector<pis> res;\n\tif(nums.size() == 1) {\n\t\tstring s;\n\t\tstringstream sstr;\n\t\tsstr << nums[0];\n\t\tsstr >> s;\n\t\tres.push_back(pis(nums[0],s));\n\t\treturn res;\n\t}\n\tfor(int i = 1; i < nums.size(); i++) {\n\t\tvector<int> a(nums.begin(), nums.begin()+i);\n\t\tvector<int> b(nums.begin()+i, nums.end());\n\t\tvector<pis> aa, bb;\n\t\taa = solve(a);\n\t\tbb = solve(b);\n\t\tfor(int i = 0; i < aa.size(); i++) {\n\t\t\tfor(int j = 0; j < bb.size(); j++) {\n\t\t\t\tres.push_back(pis(aa[i].fi + bb[j].fi, \"(\" + aa[i].se + \"+\" + bb[j].se + \")\"));\n\t\t\t\tres.push_back(pis(aa[i].fi - bb[j].fi, \"(\" + aa[i].se + \"-\" + bb[j].se + \")\"));\n\t\t\t\tres.push_back(pis(aa[i].fi * bb[j].fi, \"(\" + aa[i].se + \"*\" + bb[j].se + \")\"));\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\twhile(1) {\n\t\tvector<int> a;\n\t\ta.resize(4);\n\t\tbool brk = true;\n\t\tfor(int i = 0; i < 4; i++) {\n\t\t\tcin >> a[i];\n\t\t\tif(a[i] != 0) brk = false;\n\t\t}\n\t\tif(brk) break;\n\n\t\tsort(a.begin(), a.end());\n\t\tstring res = \"0\";\n\t\tdo {\n\t\t\tvector<pis> tmp;\n\t\t\ttmp = solve(a);\n\t\t\tfor(int i = 0; i < tmp.size(); i++) {\n\t\t\t\tif(tmp[i].fi == 10)\n\t\t\t\t\tres = tmp[i].se;\n\t\t\t}\n\t\t} while(next_permutation(a.begin(), a.end()));\n\t\tcout << res << endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":1284,"score_of_the_acc":-0.0826,"final_rank":2},{"submission_id":"aoj_0041_1829298","code_snippet":"#include <bits/stdc++.h>\nusing namespace std ;\n\n#define pb(n) push_back(n)\n#define fi first\n#define se second\n#define all(r) (r).begin(),(r).end()\n#define gsort(st,en) sort((st),(en),greater<int>())\n#define vmax(ary) *max_element(all(ary))\n#define vmin(ary) *min_element(all(ary))\n#define debug(x) cout<<#x<<\": \"<<x<<endl\n#define fcout(n) cout<<fixed<<setprecision((n))\n#define scout(n) cout<<setw(n)\n#define vary(type,name,size,init) vector< type> name(size,init)\n#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init));\n\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\n#define repa(n,array) for(auto &n :(array))\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<ll>;\nusing dict = map<string,int>;\nusing pii = pair<int,int> ;\nusing pll = pair<ll,ll> ;\n\ntemplate<typename T>\nT ston(string& str, T n){\n istringstream sin(str) ;\n T num ;\n sin >> num ;\n return num ;\n}\n\nconst string op[4] = {\"+\",\"-\",\"*\",\"/\"};\nconst string pare[] = {\"(.!.)!.!.\",\".!.!(.!.)\",\".!(.!.)!.\",\"(.!.)!(.!.)\",\"(.!.!.)!.\",\".!(.!.!.)\",\"(.!(.!.))!.\",\"((.!.)!.)!.\",\".!((.!.)!.)\",\".!(.!(.!.))\",\".!.!.!.\"};\n\ndouble RPN(string str){\n string s,s2;\n double ans;\n stack<double> n;\n s = str;\n ans = 0;\n s += \" \" ;\n rep(i,s.size()){\n if(s[i] != ' '){\n s2 += s[i];\n }\n else{\n double a,b;\n if(s2 == \"+\"){\n b = n.top(),n.pop();\n a = n.top(),n.pop();\n ans = a + b;\n n.push(ans);\n }\n else if(s2 == \"-\"){\n b = n.top(),n.pop();\n a = n.top(),n.pop();\n ans = a - b;\n n.push(ans);\n }\n else if(s2 == \"*\"){\n b = n.top(),n.pop();\n a = n.top(),n.pop();\n ans = a * b;\n n.push(ans);\n }\n else if(s2 == \"/\"){\n b = n.top(),n.pop();\n a = n.top(),n.pop();\n ans = a / b;\n n.push(ans);\n }\n else{\n n.push(ston(s2,1.0));\n }\n s2.clear();\n }\n }\n return n.top();\n}\n\nvector<string> Split(char c,string s){\n vector<string> res(0);\n string str = \"\";\n rep(i,s.size()){\n if(s[i] == c){\n if(str.size()){\n res.push_back(str);\n }\n str.clear();\n }\n else{\n str += s[i];\n }\n }\n res.push_back(str);\n return res;\n}\nbool check(string s1,string s2){\n if(((s1 == \"+\" || s1 == \"-\" ) && s2 != \"(\")|| s1 == s2) return true;\n if((s1 == \"*\" || s1 == \"/\")&& (s2 == \"+\" || s2 == \"-\")) return false;\n if(s2 == \"(\") return false;\n}\nstring ConvertRPN(string s){\n const string notnumber = \"+-*/() \";\n stack<string> fom;\n auto str = Split(' ',s);\n string res = \"\";\n rep(i,str.size()){\n if(notnumber.find(str[i]) == string::npos){\n res += str[i];\n res += \" \";\n }\n else if(str[i] == \")\"){\n while(fom.top() != \"(\"){\n if(fom.top() != \" \"){\n res += fom.top();\n res += \" \";\n }\n fom.pop();\n }\n fom.pop();\n }\n else if(str[i] == \"(\" || fom.empty()){\n fom.push(str[i]);\n }\n else if(check(str[i],fom.top())){\n while(!fom.empty() && check(str[i],fom.top())){\n if(fom.top() != \" \"){\n res += fom.top();\n res += \" \";\n }\n fom.pop();\n }\n fom.push(str[i]);\n }\n else{\n fom.push(str[i]);\n }\n }\n bool f = true;\n while(fom.size()){\n if(fom.top() != \" \"){\n res += fom.top();\n res += \" \";\n }\n fom.pop();\n }\n res.resize(res.size()-1);\n return res;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n vary(ll,v,4,0);\n while(cin >> v[0] >> v[1] >> v[2] >> v[3] && v[0] && v[1] && v[2] && v[3]){\n sort(all(v));\n bool f = false;\n do{\n rep(i,3){\n rep(j,3){\n rep(k,3){\n string formula = op[i]+op[j] + op[k];\n rep(m,10){\n ll c = 0,d = 0;\n string res =\"\";\n rep(l,pare[m].size()){\n if(pare[m][l] == '.'){\n res += to_string(v[c])+ \" \";\n ++c;\n }\n else if(pare[m][l] == '!'){\n res += formula[d];\n res += \" \";\n ++d;\n }\n else{\n res += pare[m][l];\n res += \" \";\n }\n }\n res.resize(res.size()-1);\n string tmp = res;\n res = ConvertRPN(res);\n if(RPN(res) == 10){\n cout << tmp<<endl;\n f = true;\n i = j = k = 4;\n v.clear();\n break;\n }\n }\n }\n }\n }\n }while(next_permutation(all(v)));\n if(!f){\n cout << 0 << endl;\n }\n v.resize(4);\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3220,"score_of_the_acc":-1.1533,"final_rank":13},{"submission_id":"aoj_0041_1658385","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef complex<double> P;\ntypedef pair<int,int> pii;\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define REPR(i,n) for(ll i=1;i<n;++i)\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define MOD (ll)(1e9+7)\n#define ADD(a,b) a=((a)+(b))%MOD\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\nint calc(string s){\n assert(s.size()==7);\n stack<int> st;\n REP(i,s.size()){\n char c = s[i];\n if(c=='+'){\n if(st.size()<2) return -1;\n int a = st.top(); st.pop();\n a += st.top(); st.pop();\n st.push(a);\n }else if(c=='-'){\n if(st.size()<2) return -1;\n int a = st.top(); st.pop();\n a -= st.top(); st.pop();\n st.push(a);\n }else if(c=='*'){\n if(st.size()<2) return -1;\n int a = st.top(); st.pop();\n a *= st.top(); st.pop();\n st.push(a);\n }else{\n st.push((int)(c-'0'));\n }\n }\n assert(st.size()==1);\n return st.top();\n}\n\nvoid output(string s){\n stack<string> st;\n REP(i,s.size()){\n char c = s[i];\n if(c=='+' || c=='-' || c=='*'){\n if(st.size()<2) assert(false&&\"NO STACK\");\n string a = \"(\";\n a += st.top(); st.pop();\n a += c;\n a += st.top(); st.pop();\n a += \")\";\n st.push(a);\n }else{\n st.push(string(1,c));\n }\n }\n assert(st.size()==1);\n cout<<st.top()<<endl;\n}\n\nint main(){\n int a[4];\n while(~scanf(\"%d%d%d%d\",a,a+1,a+2,a+3)){\n if(a[0]==0 && a[1]==0 && a[2]==0 && a[3]==0)break;\n // ???????????????????¨????\n vi expr(7,0);\n FOR(i,4,7)expr[i]=1;\n vi numlst(4);\n REP(i,4)numlst[i]=i;\n bool flag = false;\n do{\n if(flag)break;\n if(expr[0]==1 || expr[1]==1) continue;\n if(expr[6]==0) continue;\n REP(exmsk,3*3*3){\n if(flag)break;\n do{\n if(flag)break;\n string s = \"\";\n int i1=0;\n int tmp = exmsk;\n REP(i,7){\n if(expr[i]==0){\n s += (char)(a[numlst[i1]]+'0');\n ++i1;\n }else{\n s += \"+-*\"[tmp%3];\n tmp /= 3;\n }\n }\n int res = calc(s);\n if(res==10){\n flag = true;\n output(s);\n break;\n }\n }while(next_permutation(ALL(numlst)));\n }\n }while(next_permutation(ALL(expr)));\n if(!flag)cout<<0<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1240,"score_of_the_acc":-0.0625,"final_rank":1},{"submission_id":"aoj_0041_1589855","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define dump(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define dump(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\n//template<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<58;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n\tos << \"[\";\n\tfor (const auto &v : vec) {\n\t\tos << v << \",\";\n\t}\n\tos << \"]\";\n\treturn os;\n}\n\nstring int_to_string(int x){\n stringstream ss;\n ss << x;\n return ss.str();\n}\n\nvector<pair<int,string>> nv(const vector<pair<int,string>>& v,const vector<pair<int,string>>& tmp,const vector<int>& idxs,char op){\n auto x=v[idxs[0]],y=v[idxs[1]];\n pair<int,string> p;\n if(op=='+') p=make_pair(x.first+y.first,\"(\"+x.second+\" + \"+y.second+\")\");\n else if(op=='-') p=make_pair(x.first-y.first,\"(\"+x.second+\" - \"+y.second+\")\");\n else if(op=='*') p=make_pair(x.first*y.first,\"(\"+x.second+\" * \"+y.second+\")\");\n auto res=tmp; res.emplace_back(p);\n return move(res);\n}\n\nstring dfs(vector<pair<int,string>> v){\n if(v.size()==1){\n if(v[0].first==10) return v[0].second;\n else return \"\";\n }\n\n string res=\"\";\n rep(b,0,1<<v.size()){\n if(__builtin_popcount(b)!=2) continue;\n vector<pair<int,string>> tmp;\n vector<int> idxs;\n rep(i,0,v.size()){\n if((1&(b>>i))==0) tmp.emplace_back(v[i]);\n else idxs.emplace_back(i);\n }\n\n res=max(res,dfs(nv(v,tmp,idxs,'+')));\n res=max(res,dfs(nv(v,tmp,idxs,'*')));\n res=max(res,dfs(nv(v,tmp,idxs,'-')));\n swap(idxs[0],idxs[1]);\n res=max(res,dfs(nv(v,tmp,idxs,'-')));\n }\n return res;\n}\n\nvoid solve(){\n int a,b,c,d;\n while(cin >> a >> b >> c >> d){\n if(a==0 and b==0 and c==0 and d==0) break;\n vector<pair<int,string>> v;\n v.emplace_back(make_pair(a,int_to_string(a)));\n v.emplace_back(make_pair(b,int_to_string(b)));\n v.emplace_back(make_pair(c,int_to_string(c)));\n v.emplace_back(make_pair(d,int_to_string(d)));\n string ans=dfs(v);\n\n if(ans.empty()) cout << 0 << endl;\n else cout << ans << endl;\n }\n}\n\nint main(){\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3224,"score_of_the_acc":-0.9051,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_0041_8027424\",\n \"code_snippet\": \"#pragma region Macros\\n\\n// #pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\\\")\\n\\n#include <bits/extc++.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<128>>;\\n\\n#define TO_STRING(var) # var\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n#define sqrt __builtin_sqrtl\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acos(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\nconst int MOD = 998244353;\\n// const int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n\\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n\\nstruct Edge {\\n int from, to;\\n int cost;\\n Edge(int to, int cost) : from(-1), to(to), cost(cost) {}\\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\\n Edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n};\\n\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(12);\\n}\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n\\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\nint POW(int x, int n) {\\n __int128_t ret = 1;\\n // if (ret >= INFL) return INFL;\\n if (n < 0) { cout << \\\"error\\\" << endl; return 0; }\\n else if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) ret = POW(x * x, n / 2);\\n else ret = x * POW(x, n - 1);\\n\\n if (ret > 8e18) ret = 0;\\n return ret;\\n}\\nint floor(int x, int y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\nll per(int x, int y) {\\n if (y == 0) {\\n cout << \\\"error\\\" << endl;\\n return INFL;\\n }\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n // if (x < 0 && y > 0) \\n return x / y - (x % y < 0);\\n}\\nll mod(int x, int y) {\\n if (y == 0) {\\n cout << \\\"error\\\" << endl;\\n return INFL;\\n }\\n if (x >= 0 && y > 0) return x % y;\\n if (x >= 0 && y < 0) return x % y;\\n if (x < 0 && y < 0) {\\n __int128_t ret = x % y;\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n }\\n // if (x < 0 && y > 0) {\\n __int128_t ret = x % y;\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n // }\\n}\\nint modf(ld x) {\\n if (equals(x, 0)) return 0;\\n\\telse if (x < 0) return ceill(x);\\n\\telse return floorl(x);\\n}\\n\\ntemplate <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; }\\n return false;\\n}\\n\\nint countl_zero(int N) { return __builtin_clzll(N); }\\nint countl_one(int N) {\\n int ret = 0; while (N % 2) { N /= 2; ret++; }\\n return ret;\\n}\\nint countr_zero(int N) { return __builtin_ctzll(N); }\\nint countr_one(int N) {\\n int ret = 0, k = 63 - __builtin_clzll(N);\\n while (k != -1 && (N & (1LL << k))) { k--; ret++; }\\n return ret;\\n}\\nint popcount(int N) { return __builtin_popcountll(N); }\\nint unpopcount(int N) { return 64 - __builtin_clzll(N) - __builtin_popcountll(N); }\\n\\nint top_bit(int N) { return 63 - __builtin_clzll(N);} // 2^kの位\\nint bot_bit(int N) { return __builtin_ctz(N);} // 2^kの位\\nint MSB(int N) { return 1 << (63 - __builtin_clzll(N)); } // mask\\n\\nint bit_width(int N) { return 64 - __builtin_clzll(N); } // 桁数\\nint ceil_log2(int N) { return 63 - __builtin_clzll(N); }\\nint bit_floor(int N) { return 1 << (63 - __builtin_clzll(N)); }\\nint floor_log2(int N) { return 64 - __builtin_clzll(N-1); }\\nint bit_ceil(int N) { return 1 << (64 - __builtin_clzll(N-1)) - (N==1); }\\n\\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n\\n return true;\\n\\t}\\n\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase(\\n remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }),\\n G.end());\\n return G;\\n }\\n\\nprivate:\\n\\tvector<int> par;\\n\\tvector<int> sz;\\n};\\n\\ntemplate<int mod> class Modint{\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n\\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = Modint<MOD>;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t;\\n x = t;\\n return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\nmint modpow(const mint &x, int n) {\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\n\\nint modpow(__int128_t x, int n, int mod) {\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n\\nint modinv(__int128_t x, int mod) {\\n if (x == 1) return 1;\\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n}\\n\\nistream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = 10 * ret + S[i] - '0';\\n x = ret * f;\\n return (is);\\n}\\nostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128];\\n char *d = end(buffer);\\n\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n\\n if (x < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = end(buffer) - d;\\n\\n if (os.rdbuf()->sputn(d, len) != len) {\\n os.setstate(ios_base::badbit);\\n }\\n }\\n return os;\\n}\\n\\nstring to_string(char c) {\\n string s = {c};\\n return s;\\n}\\n\\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1);\\n _finv.resize(N + 1);\\n _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1;\\n _finv[0] = _finv[1] = 1;\\n _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n\\nmint COM(int N, int K) {\\n if (N < K) return 0;\\n if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\n\\n#pragma endregion\\n\\nusing T = int;\\nT calc_revpo(vector<string> &S) {\\n int N = S.size();\\n vector<T> st;\\n for (int i = 0; i < N; i++) {\\n if (S[i] == \\\"+\\\") {\\n T b = st.back();\\n st.pop_back();\\n T a = st.back();\\n st.pop_back();\\n st.pb(a + b);\\n } else if (S[i] == \\\"-\\\") {\\n T b = st.back();\\n st.pop_back();\\n T a = st.back();\\n st.pop_back();\\n st.pb(a - b);\\n } else if (S[i] == \\\"*\\\") {\\n T b = st.back();\\n st.pop_back();\\n T a = st.back();\\n st.pop_back();\\n st.pb(a * b);\\n } else st.pb(stoll(S[i]));\\n }\\n return st.back();\\n}\\n\\nstring decode_revpo(vector<string> &S) {\\n vector<string> st;\\n int N = S.size();\\n for (int i = 0; i < N; i++) {\\n if (S[i][0] >= '0' && S[i][0] <= '9') st.push_back(S[i]);\\n else {\\n string B = st.back();\\n st.pop_back();\\n string A = st.back();\\n st.pop_back();\\n\\n // 演算子が「*」「/」で、演算子の前の式が\\n // 「宙ぶらりんの+ -」を含むとき括弧をつける\\n if (S[i] == \\\"*\\\") {\\n int depth = 0;\\n int sz = A.size();\\n for (int j = 0; j < sz; j++) {\\n if (A[j] == '(') depth++;\\n if (A[j] == ')') depth--;\\n\\n if (depth == 0 && (A[j] == '+' or A[j] == '-')) {\\n A = \\\"(\\\" + A + \\\")\\\";\\n break;\\n }\\n }\\n }\\n\\n // 演算子が「-」「*」で、演算子の後の式が\\n // 「宙ぶらりんの+ -」を含むとき括弧をつける\\n if (S[i] == \\\"-\\\" or S[i] == \\\"*\\\") {\\n int depth = 0;\\n int sz = B.size();\\n for (int j = 0; j < sz; j++) {\\n if (B[j] == '(') depth++;\\n if (B[j] == ')') depth--;\\n\\n if (depth == 0 && (B[j] == '+' or B[j] == '-')) {\\n B = \\\"(\\\" + B + \\\")\\\";\\n break;\\n }\\n }\\n }\\n\\n if (S[i] == \\\"+\\\") st.push_back(A + \\\" + \\\" + B);\\n if (S[i] == \\\"-\\\") st.push_back(A + \\\" - \\\" + B);\\n if (S[i] == \\\"*\\\") st.push_back(A + \\\" * \\\" + B);\\n }\\n }\\n return st.back();\\n}\\n\\n// 数字を1, 演算子を0とした01列Bが逆ポーランド記法としてありえるか\\n// 括弧列のような判定方法\\nbool isvalid(vector<int> &B) {\\n int N = B.size();\\n\\n int depth = B[0];\\n for (int i = 1; i < N; i++) {\\n if (depth == 0) return false;\\n if (B[i]) depth++;\\n else depth--;\\n }\\n return true;\\n}\\n\\nsigned main() {\\n while (true) {\\n int N = 4, M = 10;\\n vector<int> A(N);\\n for (int i = 0; i < N; i++) cin >> A[i];\\n sort(A.begin(), A.end());\\n if (A[0] + A[1] + A[2] + A[3] == 0) break;\\n\\n vector<int> B(N + N - 1, 1); // 01列。1が数字、0が演算子\\n for (int i = 0; i < N - 1; i++) B[i] = 0;\\n\\n int ans = 0;\\n string S;\\n do {\\n if (isvalid(B)) { // 逆ポの記法としてありえるなら\\n sort(A.begin(), A.end());\\n do {\\n int p = POW(3LL, N - 1);\\n for (int j = 0; j < p; j++) {\\n vector<string> T;\\n int curA = 0, curC = 0;\\n\\n vector<string> C;\\n int J = j;\\n while (J) {\\n int r = J % 3;\\n J /= 3;\\n\\n if (r == 0) C.pb(\\\"+\\\");\\n if (r == 1) C.pb(\\\"-\\\");\\n if (r == 2) C.pb(\\\"*\\\");\\n }\\n while (C.size() < N - 1) C.pb(\\\"+\\\");\\n\\n for (int k = 0; k < N + N - 1; k++) {\\n if (B[k]) T.pb(to_string(A[curA])), curA++;\\n else T.pb(C[curC]), curC++;\\n }\\n if (abs(calc_revpo(T) - M) < EPS) {\\n S = decode_revpo(T);\\n ans++;\\n }\\n }\\n } while (next_permutation(A.begin(), A.end()));\\n }\\n } while (next_permutation(B.begin(), B.end()));\\n if (ans == 0) cout << ans << endl;\\n else cout << S << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -1.0312,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0041_4893128\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\\n#ifdef _DEBUG\\n#define PRE_COMMAND \\\\\\n std::cin.rdbuf(in.rdbuf()); \\\\\\n std::cout << fixed << setprecision(15);\\n#else\\n#define PRE_COMMAND cout << fixed << setprecision(15);\\n#endif\\nconst double EPS = 1e-10, PI = acos(-1.0);\\ntemplate <class T> auto MAX(T& seq) {\\n return *max_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto MIN(T& seq) {\\n return *min_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto SUM(T& seq) {\\n T temp{0};\\n auto& temp2 = temp[0];\\n return accumulate(seq.begin(), seq.end(), temp2);\\n}\\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\\n sort(seq.begin(), seq.end(), sort_order);\\n}\\ntemplate <class T> void SORTR(vector<T>& seq) {\\n sort(seq.begin(), seq.end(), greater<T>());\\n}\\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\\n while (k) {\\n if (k & 1) now = (now * n) % mod;\\n n = (n * n) % mod;\\n k >>= 1;\\n }\\n return now;\\n}\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\\n for (T& x : vec) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n if (!v.size()) return os;\\n typename vector<T>::const_iterator ii = v.begin();\\n os << *ii++;\\n for (; ii != v.end(); ++ii) os << \\\" \\\" << *ii;\\n return os;\\n}\\n\\n// カンマ区切りのデータをvector<int>に変換\\nvector<int> comma_sep(string inp) {\\n inp += ',';\\n vector<int> v;\\n string s = \\\"\\\";\\n for (char c : inp) {\\n if (c == ',') {\\n v.push_back(stoi(s));\\n s = \\\"\\\";\\n } else {\\n s += c;\\n }\\n }\\n return v;\\n}\\n\\ntemplate <class T>\\nvector<vector<T>> permutations_parts(vector<T> p, int x, int s, int n) {\\n vector<vector<T>> ret;\\n if (x == s) {\\n for (int i = x; i < n; i++) ret.push_back({p[i]});\\n return ret;\\n }\\n for (int i = x; i < n; i++) {\\n vector<T> v = p;\\n swap(v[x], v[i]);\\n vector<vector<T>> v2 = permutations_parts(v, x + 1, s, n);\\n T q = v[x];\\n int size = (int)v2.size();\\n for (int i = 0; i < size; i++) { v2[i].push_back(q); }\\n copy(v2.begin(), v2.end(), back_inserter(ret));\\n }\\n return ret;\\n}\\ntemplate <class T> vector<vector<T>> permutations(vector<T> v, int size = -1) {\\n int n = (int)v.size();\\n if (size == -1) size = n;\\n if (size == n) {\\n vector<vector<T>> ret;\\n int ret_size = 1;\\n for (int i = size; i > 1; i--) ret_size *= i;\\n ret.reserve(ret_size);\\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\\n return ret;\\n }\\n return permutations_parts(v, 0, size - 1, n);\\n}\\n\\ntemplate <class T> vector<vector<T>> permutations2(vector<T> v, int size = -1) {\\n int n = (int)v.size();\\n if (size == -1) size = n;\\n if (size == n) {\\n vector<vector<T>> ret;\\n int ret_size = 1;\\n for (int i = size; i > 1; i--) ret_size *= i;\\n ret.reserve(ret_size);\\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\\n }\\n return permutations_parts(v, 0, size - 1, n);\\n}\\n\\nint main() {\\n PRE_COMMAND\\n int a, b, c, d;\\n string a_s, b_s, c_s, d_s, s;\\n while (cin >> a_s >> b_s >> c_s >> d_s) {\\n if (a_s == \\\"0\\\") break;\\n s = \\\"0\\\";\\n int ans, ans2;\\n vector<string> v2 = {a_s, b_s, c_s, d_s};\\n vector<vector<string>> v3 = permutations(v2);\\n vector<vector<string>> v4 = permutations2(v2);\\n SORT(v4);\\n for (string c1 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (string c2 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (string c3 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (auto v : v4) {\\n a_s = v[0], b_s = v[1], c_s = v[2], d_s = v[3];\\n a = stoi(a_s), b = stoi(b_s), c = stoi(c_s),\\n d = stoi(d_s);\\n // ((a+b)+c)+d\\n ans = 0;\\n if (c1 == \\\" + \\\") ans = a + b;\\n if (c1 == \\\" - \\\") ans = a - b;\\n if (c1 == \\\" * \\\") ans = a * b;\\n if (c2 == \\\" + \\\") ans = ans + c;\\n if (c2 == \\\" - \\\") ans = ans - c;\\n if (c2 == \\\" * \\\") ans = ans * c;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (ans == 10)\\n s = \\\"(((\\\" + a_s + c1 + b_s + \\\")\\\" + c2 + c_s + \\\")\\\" +\\n c3 + d_s + \\\")\\\";\\n // (a+b)+(c+d)\\n ans = 0, ans2 = 0;\\n if (c1 == \\\" + \\\") ans = a + b;\\n if (c1 == \\\" - \\\") ans = a - b;\\n if (c1 == \\\" * \\\") ans = a * b;\\n if (c3 == \\\" + \\\") ans2 = c + d;\\n if (c3 == \\\" - \\\") ans2 = c - d;\\n if (c3 == \\\" * \\\") ans2 = c * d;\\n if (c2 == \\\" + \\\") ans = ans + ans2;\\n if (c2 == \\\" - \\\") ans = ans - ans2;\\n if (c2 == \\\" * \\\") ans = ans * ans2;\\n if (ans == 10)\\n s = \\\"((\\\" + a_s + c1 + b_s + \\\")\\\" + c2 + \\\"(\\\" + c_s +\\n c3 + d_s + \\\"))\\\";\\n // (a+(b+c))+d\\n ans = 0;\\n if (c2 == \\\" + \\\") ans = b + c;\\n if (c2 == \\\" - \\\") ans = b - c;\\n if (c2 == \\\" * \\\") ans = b * c;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (ans == 10)\\n s = \\\"((\\\" + a_s + c1 + \\\"(\\\" + b_s + c2 + c_s + \\\"))\\\" +\\n c3 + d_s + \\\")\\\";\\n // a+((b+c)+d)\\n ans = 0;\\n if (c2 == \\\" + \\\") ans = b + c;\\n if (c2 == \\\" - \\\") ans = b - c;\\n if (c2 == \\\" * \\\") ans = b * c;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (ans == 10)\\n s = \\\"(\\\" + a_s + c1 + \\\"((\\\" + b_s + c2 + c_s + \\\")\\\" +\\n c3 + d_s + \\\"))\\\";\\n // a+(b+(c+d))\\n ans = 0;\\n if (c3 == \\\" + \\\") ans = c + d;\\n if (c3 == \\\" - \\\") ans = c - d;\\n if (c3 == \\\" * \\\") ans = c * d;\\n if (c2 == \\\" + \\\") ans = b + ans;\\n if (c2 == \\\" - \\\") ans = b - ans;\\n if (c2 == \\\" * \\\") ans = b * ans;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (ans == 10)\\n s = \\\"(\\\" + a_s + c1 + \\\"(\\\" + b_s + c2 + \\\"(\\\" + c_s +\\n c3 + d_s + \\\")))\\\";\\n }\\n }\\n }\\n }\\n cout << s << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.8942,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0041_4893122\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\\n#ifdef _DEBUG\\n#define PRE_COMMAND \\\\\\n std::cin.rdbuf(in.rdbuf()); \\\\\\n std::cout << fixed << setprecision(15);\\n#else\\n#define PRE_COMMAND cout << fixed << setprecision(15);\\n#endif\\nconst double EPS = 1e-10, PI = acos(-1.0);\\ntemplate <class T> auto MAX(T& seq) {\\n return *max_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto MIN(T& seq) {\\n return *min_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto SUM(T& seq) {\\n T temp{0};\\n auto& temp2 = temp[0];\\n return accumulate(seq.begin(), seq.end(), temp2);\\n}\\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\\n sort(seq.begin(), seq.end(), sort_order);\\n}\\ntemplate <class T> void SORTR(vector<T>& seq) {\\n sort(seq.begin(), seq.end(), greater<T>());\\n}\\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\\n while (k) {\\n if (k & 1) now = (now * n) % mod;\\n n = (n * n) % mod;\\n k >>= 1;\\n }\\n return now;\\n}\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\\n for (T& x : vec) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n if (!v.size()) return os;\\n typename vector<T>::const_iterator ii = v.begin();\\n os << *ii++;\\n for (; ii != v.end(); ++ii) os << \\\" \\\" << *ii;\\n return os;\\n}\\n\\n// カンマ区切りのデータをvector<int>に変換\\nvector<int> comma_sep(string inp) {\\n inp += ',';\\n vector<int> v;\\n string s = \\\"\\\";\\n for (char c : inp) {\\n if (c == ',') {\\n v.push_back(stoi(s));\\n s = \\\"\\\";\\n } else {\\n s += c;\\n }\\n }\\n return v;\\n}\\n\\ntemplate <class T>\\nvector<vector<T>> permutations_parts(vector<T> p, int x, int s, int n) {\\n vector<vector<T>> ret;\\n if (x == s) {\\n for (int i = x; i < n; i++) ret.push_back({p[i]});\\n return ret;\\n }\\n for (int i = x; i < n; i++) {\\n vector<T> v = p;\\n swap(v[x], v[i]);\\n vector<vector<T>> v2 = permutations_parts(v, x + 1, s, n);\\n T q = v[x];\\n int size = (int)v2.size();\\n for (int i = 0; i < size; i++) { v2[i].push_back(q); }\\n copy(v2.begin(), v2.end(), back_inserter(ret));\\n }\\n return ret;\\n}\\ntemplate <class T> vector<vector<T>> permutations(vector<T> v, int size = -1) {\\n int n = (int)v.size();\\n if (size == -1) size = n;\\n if (size == n) {\\n vector<vector<T>> ret;\\n int ret_size = 1;\\n for (int i = size; i > 1; i--) ret_size *= i;\\n ret.reserve(ret_size);\\n do { ret.push_back(v); } while (next_permutation(v.begin(), v.end()));\\n //return ret;\\n }\\n return permutations_parts(v, 0, size - 1, n);\\n}\\n\\nint main() {\\n PRE_COMMAND\\n int a, b, c, d;\\n string a_s, b_s, c_s, d_s, s;\\n while (cin >> a_s >> b_s >> c_s >> d_s) {\\n if (a_s == \\\"0\\\") break;\\n s = \\\"0\\\";\\n int ans, ans2;\\n vector<string> v2 = {a_s, b_s, c_s, d_s};\\n vector<vector<string>> v3 = permutations(v2);\\n for (string c1 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (string c2 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (string c3 : {\\\" + \\\", \\\" - \\\", \\\" * \\\"}) {\\n for (auto v : v3) {\\n a_s = v[0], b_s = v[1], c_s = v[2], d_s = v[3];\\n a = stoi(a_s), b = stoi(b_s), c = stoi(c_s),\\n d = stoi(d_s);\\n // ((a+b)+c)+d\\n ans = 0;\\n if (c1 == \\\" + \\\") ans = a + b;\\n if (c1 == \\\" - \\\") ans = a - b;\\n if (c1 == \\\" * \\\") ans = a * b;\\n if (c2 == \\\" + \\\") ans = ans + c;\\n if (c2 == \\\" - \\\") ans = ans - c;\\n if (c2 == \\\" * \\\") ans = ans * c;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (ans == 10)\\n s = \\\"(((\\\" + a_s + c1 + b_s + \\\")\\\" + c2 + c_s + \\\")\\\" +\\n c3 + d_s + \\\")\\\";\\n // (a+b)+(c+d)\\n ans = 0, ans2 = 0;\\n if (c1 == \\\" + \\\") ans = a + b;\\n if (c1 == \\\" - \\\") ans = a - b;\\n if (c1 == \\\" * \\\") ans = a * b;\\n if (c3 == \\\" + \\\") ans2 = c + d;\\n if (c3 == \\\" - \\\") ans2 = c - d;\\n if (c3 == \\\" * \\\") ans2 = c * d;\\n if (c2 == \\\" + \\\") ans = ans + ans2;\\n if (c2 == \\\" - \\\") ans = ans - ans2;\\n if (c2 == \\\" * \\\") ans = ans * ans2;\\n if (ans == 10)\\n s = \\\"((\\\" + a_s + c1 + b_s + \\\")\\\" + c2 + \\\"(\\\" + c_s +\\n c3 + d_s + \\\"))\\\";\\n // (a+(b+c))+d\\n ans = 0;\\n if (c2 == \\\" + \\\") ans = b + c;\\n if (c2 == \\\" - \\\") ans = b - c;\\n if (c2 == \\\" * \\\") ans = b * c;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (ans == 10)\\n s = \\\"((\\\" + a_s + c1 + \\\"(\\\" + b_s + c2 + c_s + \\\"))\\\" +\\n c3 + d_s + \\\")\\\";\\n // a+((b+c)+d)\\n ans = 0;\\n if (c2 == \\\" + \\\") ans = b + c;\\n if (c2 == \\\" - \\\") ans = b - c;\\n if (c2 == \\\" * \\\") ans = b * c;\\n if (c3 == \\\" + \\\") ans = ans + d;\\n if (c3 == \\\" - \\\") ans = ans - d;\\n if (c3 == \\\" * \\\") ans = ans * d;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (ans == 10)\\n s = \\\"(\\\" + a_s + c1 + \\\"((\\\" + b_s + c2 + c_s + \\\")\\\" +\\n c3 + d_s + \\\"))\\\";\\n // a+(b+(c+d))\\n ans = 0;\\n if (c3 == \\\" + \\\") ans = c + d;\\n if (c3 == \\\" - \\\") ans = c - d;\\n if (c3 == \\\" * \\\") ans = c * d;\\n if (c2 == \\\" + \\\") ans = b + ans;\\n if (c2 == \\\" - \\\") ans = b - ans;\\n if (c2 == \\\" * \\\") ans = b * ans;\\n if (c1 == \\\" + \\\") ans = a + ans;\\n if (c1 == \\\" - \\\") ans = a - ans;\\n if (c1 == \\\" * \\\") ans = a * ans;\\n if (ans == 10)\\n s = \\\"(\\\" + a_s + c1 + \\\"(\\\" + b_s + c2 + \\\"(\\\" + c_s +\\n c3 + d_s + \\\")))\\\";\\n }\\n }\\n }\\n }\\n cout << s << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.8832,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0041_4357268\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <iomanip>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n\\nstatic const int MOD = 1000000007;\\nusing ll = long long;\\nusing u32 = unsigned;\\nusing u64 = unsigned long long;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\n\\nint main() {\\n vector<char> v(4);\\n string A = \\\"+-*\\\";\\n while(true){\\n for (auto &&i : v) scanf(\\\" %c\\\", &i);\\n if(v[0] == '0') break;\\n auto solve = [&](string &s) -> string {\\n stack<pair<string, int>> S;\\n for (auto &&i : s) {\\n if(isdigit(i)) S.emplace(string(1, i), i-'0');\\n else if(i == '+'){\\n if(S.size() < 2) return {};\\n auto a = S.top(); S.pop();\\n auto b = S.top(); S.pop();\\n S.emplace(\\\"(\\\" + a.first + \\\"+\\\" + b.first + \\\")\\\", a.second+b.second);\\n }else if(i == '*'){\\n if(S.size() < 2) return {};\\n auto a = S.top(); S.pop();\\n auto b = S.top(); S.pop();\\n S.emplace(\\\"(\\\" + a.first + \\\"*\\\" + b.first + \\\")\\\", a.second*b.second);\\n }else if(i == '-'){\\n if(S.size() < 2) return {};\\n auto a = S.top(); S.pop();\\n auto b = S.top(); S.pop();\\n S.emplace(\\\"(\\\" + a.first + \\\"-\\\" + b.first + \\\")\\\", a.second-b.second);\\n }\\n }\\n if(S.top().second != 10) return {};\\n else return S.top().first;\\n };\\n int ok = 0;\\n for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) for (int k = 0; k < 3; ++k) {\\n string s = string(1, v[0])+v[1]+v[2]+v[3]+A[i]+A[j]+A[k];\\n sort(s.begin(),s.end());\\n do {\\n auto ret = solve(s);\\n if(!ret.empty()){\\n cout << ret << \\\"\\\\n\\\";\\n i = j = k = 3;\\n ok = 1;\\n break;\\n }\\n }while(next_permutation(s.begin(),s.end()));\\n }\\n if(!ok) puts(\\\"0\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -1.0048,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0041_4310788\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//typedef\\n//-------------------------#include <bits/stdc++.h>\\n\\nconst double pi = 3.141592653589793238462643383279;\\n\\nusing namespace std;\\n\\n//conversion\\n//------------------------------------------\\ninline int toInt(string s)\\n{\\n int v;\\n istringstream sin(s);\\n sin >> v;\\n return v;\\n}\\ntemplate <class T>\\ninline string toString(T x)\\n{\\n ostringstream sout;\\n sout << x;\\n return sout.str();\\n}\\ninline int readInt()\\n{\\n int x;\\n scanf(\\\"%d\\\", &x);\\n return x;\\n}\\n\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\nconst double EPS = 1E-8;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\n\\nclass UnionFind\\n{\\npublic:\\n vector<int> par;\\n vector<int> siz;\\n\\n UnionFind(int sz_) : par(sz_), siz(sz_, 1)\\n {\\n for (ll i = 0; i < sz_; ++i)\\n par[i] = i;\\n }\\n void init(int sz_)\\n {\\n par.resize(sz_);\\n siz.assign(sz_, 1LL);\\n for (ll i = 0; i < sz_; ++i)\\n par[i] = i;\\n }\\n\\n int root(int x)\\n {\\n while (par[x] != x)\\n {\\n x = par[x] = par[par[x]];\\n }\\n return x;\\n }\\n\\n bool merge(int x, int y)\\n {\\n x = root(x);\\n y = root(y);\\n if (x == y)\\n return false;\\n if (siz[x] < siz[y])\\n swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool issame(int x, int y)\\n {\\n return root(x) == root(y);\\n }\\n\\n int size(int x)\\n {\\n return siz[root(x)];\\n }\\n};\\n\\nll modPow(ll x, ll n, ll mod = MOD)\\n{\\n ll res = 1;\\n while (n)\\n {\\n if (n & 1)\\n res = (res * x) % mod;\\n\\n res %= mod;\\n x = x * x % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\n#define SIEVE_SIZE 5000000 + 10\\nbool sieve[SIEVE_SIZE];\\nvoid makeSieve()\\n{\\n for (int i = 0; i < SIEVE_SIZE; ++i)\\n sieve[i] = true;\\n sieve[0] = sieve[1] = false;\\n for (int i = 2; i * i < SIEVE_SIZE; ++i)\\n if (sieve[i])\\n for (int j = 2; i * j < SIEVE_SIZE; ++j)\\n sieve[i * j] = false;\\n}\\n\\nbool isprime(ll n)\\n{\\n if (n == 0 || n == 1)\\n return false;\\n for (ll i = 2; i * i <= n; ++i)\\n if (n % i == 0)\\n return false;\\n return true;\\n}\\n\\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\n// テーブルを作る前処理\\nvoid COMinit()\\n{\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++)\\n {\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\n// 二項係数計算\\nlong long COM(int n, int k)\\n{\\n if (n < k)\\n return 0;\\n if (n < 0 || k < 0)\\n return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n\\nlong long extGCD(long long a, long long b, long long &x, long long &y)\\n{\\n if (b == 0)\\n {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n long long d = extGCD(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\n// 負の数にも対応した mod (a = -11 とかでも OK)\\ninline long long mod(long long a, long long m)\\n{\\n return (a % m + m) % m;\\n}\\n\\n// 逆元計算 (ここでは a と m が互いに素であることが必要)\\nlong long modinv(long long a, long long m)\\n{\\n long long x, y;\\n extGCD(a, m, x, y);\\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\\n}\\nll GCD(ll a, ll b)\\n{\\n\\n if (b == 0)\\n return a;\\n return GCD(b, a % b);\\n}\\n\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nmat mul(mat &A, mat &B)\\n{\\n mat C(A.size(), vec((int)B[0].size()));\\n for (int i = 0; i < A.size(); ++i)\\n {\\n for (int k = 0; k < B.size(); ++k)\\n {\\n for (int j = 0; j < B[0].size(); ++j)\\n {\\n C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;\\n }\\n }\\n }\\n return C;\\n}\\nmat matPow(mat A, ll n)\\n{\\n mat B(A.size(), vec((int)A.size()));\\n\\n for (int i = 0; i < A.size(); ++i)\\n {\\n B[i][i] = 1;\\n }\\n\\n while (n > 0)\\n {\\n if (n & 1)\\n B = mul(B, A);\\n A = mul(A, A);\\n n >>= 1;\\n }\\n return B;\\n}\\n\\nconst int INF = 1e9 + 7;\\n#define repi(i, m, n) for (int i = m; i < n; i++)\\n#define fi first\\n#define se second\\nclass Arithmetic\\n{\\npublic:\\n string str;\\n int n, flag = 1;\\n void init(string s)\\n {\\n str = s;\\n n = str.size();\\n }\\n int add(int a, int b) { return a + b; }\\n int mul(int a, int b) { return a * b; }\\n int div(int a, int b) { return a / b; }\\n int sur(int a, int b) { return a % b; }\\n\\n P get_num(int p)\\n {\\n int ans = 0, q = -1, f = 0;\\n if (str[p] == '(')\\n return calc(p + 1, 0);\\n if (str[p] == '-')\\n {\\n f = 1;\\n p++;\\n }\\n if (str[p] == '(')\\n {\\n P pi = calc(p + 1, 0);\\n return P(-pi.fi, pi.se);\\n }\\n repi(i, p, n)\\n {\\n if (!isdigit(str[i]))\\n break;\\n ans = ans * 10 + (str[i] - '0');\\n q = i;\\n }\\n if (f)\\n return P(-ans, q);\\n return P(ans, q);\\n }\\n\\n P calc(int pp = 0, int f = 0)\\n {\\n P pi = get_num(pp);\\n int ans = pi.fi, p = pi.se + 1;\\n repi(i, p, n)\\n {\\n if (f and str[i] == ')')\\n return P(ans, i - 1);\\n if (str[i] == ')')\\n return P(ans, i);\\n if (str[i] == '*' or str[i] == '/' or str[i] == '%')\\n {\\n pi = get_num(i + 1);\\n if (str[i] == '*')\\n ans = mul(ans, pi.fi);\\n if (str[i] == '/')\\n ans = div(ans, pi.fi);\\n if (str[i] == '%')\\n ans = sur(ans, pi.fi);\\n }\\n if (str[i] == '+' or str[i] == '-')\\n {\\n if (f)\\n return P(ans, i - 1);\\n if (str[i] == '+')\\n pi = calc(i + 1, 1);\\n if (str[i] == '-')\\n pi = calc(i, 1);\\n ans = add(ans, pi.fi);\\n }\\n i = pi.se;\\n }\\n return P(ans, n - 1);\\n }\\n int solve(int ret = -INF)\\n { //0除算のとき返す値\\n flag = 1;\\n P ans = calc();\\n if (!flag)\\n return ret;\\n return ans.fi;\\n }\\n};\\n\\nstring ans = \\\"\\\";\\n\\nvoid rec(int idx, string s, vector<string> &v, bool p)\\n{\\n if (idx == 3)\\n {\\n s += v[idx];\\n if (p)\\n {\\n s += ')';\\n }\\n Arithmetic solver;\\n solver.init(s);\\n if (solver.solve() == 10)\\n {\\n ans = s;\\n }\\n return;\\n }\\n if (!p)\\n {\\n s += v[idx];\\n rec(idx + 1, s + '+', v, false);\\n rec(idx + 1, s + '*', v, false);\\n rec(idx + 1, s + '-', v, false);\\n s.pop_back();\\n s += '(';\\n s += v[idx];\\n rec(idx + 1, s + '+', v, true);\\n rec(idx + 1, s + '*', v, true);\\n rec(idx + 1, s + '-', v, true);\\n }\\n else\\n {\\n s += v[idx];\\n rec(idx + 1, s + '+', v, true);\\n rec(idx + 1, s + '*', v, true);\\n rec(idx + 1, s + '-', v, true);\\n\\n s.pop_back();\\n s += v[idx];\\n s += ')';\\n rec(idx + 1, s + '+', v, false);\\n rec(idx + 1, s + '*', v, false);\\n rec(idx + 1, s + '-', v, false);\\n }\\n}\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n\\n vector<string> v(4);\\n while (cin >> v[0] >> v[1] >> v[2] >> v[3])\\n {\\n if (v[0] == \\\"0\\\" && v[1] == \\\"0\\\" && v[2] == \\\"0\\\" && v[3] == \\\"0\\\")\\n break;\\n\\n ans = \\\"\\\";\\n sort(all(v));\\n do\\n {\\n string t = \\\"\\\";\\n rec(0, \\\"\\\", v, false);\\n\\n } while (next_permutation(all(v)));\\n if (ans == \\\"\\\")\\n cout << 0 << endl;\\n else\\n {\\n string tmp = \\\"\\\";\\n for (int i = 0; i < ans.size(); i++)\\n {\\n if (ans[i] == '*' || ans[i] == '+' || ans[i] == '-')\\n {\\n tmp += \\\" \\\";\\n tmp += ans[i];\\n tmp += \\\" \\\";\\n }\\n else\\n {\\n tmp += ans[i];\\n }\\n }\\n cout << tmp << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3128,\n \"score_of_the_acc\": -0.8613,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0041_2292293\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing db = double;\\nusing ll = long long;\\nusing vi = vector <int>;\\n#define op operator\\n#define pb push_back\\n\\nstring ans;\\nvoid dfs(vector <pair <int, string>> v) {\\n\\tif(v.size() == 1) {\\n\\t\\tif(v[0].first == 10)\\n\\t\\t\\tans = v[0].second;\\n\\t\\telse\\n\\t\\t\\treturn;\\n\\t}\\n\\tint n = v.size();\\n\\tfor(int i = 0; i < n; i ++)\\n\\t\\tfor(int j = 0; j < n; j ++) if(i != j) {\\n\\t\\t\\tvector <pair <int, string>> nxt;\\n\\t\\t\\tfor(int k = 0; k < n; k ++) if(i != k && j != k)\\n\\t\\t\\t\\tnxt.pb({v[k]});\\n\\t\\t\\tnxt.pb({v[i].first + v[j].first, \\\"(\\\" + v[i].second + \\\"+\\\" + v[j].second + \\\")\\\"});\\n\\t\\t\\tdfs(nxt); nxt.pop_back();\\n\\t\\t\\tnxt.pb({v[i].first - v[j].first, \\\"(\\\" + v[i].second + \\\"-\\\" + v[j].second + \\\")\\\"});\\n\\t\\t\\tdfs(nxt); nxt.pop_back();\\n\\t\\t\\tnxt.pb({v[i].first * v[j].first, \\\"(\\\" + v[i].second + \\\"*\\\" + v[j].second + \\\")\\\"});\\n\\t\\t\\tdfs(nxt); nxt.pop_back();\\n\\t\\t}\\n}\\n\\nint a[4];\\n\\nint main() {\\n\\tios :: sync_with_stdio(0);\\n\\n\\tfor(;;) {\\n\\t\\tfor(int i = 0; i < 4; i ++)\\n\\t\\t\\tcin >> a[i];\\n\\t\\tif(*max_element(a, a + 4) == 0)\\n\\t\\t\\tbreak;\\n\\t\\tvector <pair <int, string>> v;\\n\\t\\tfor(int i = 0; i < 4; i ++)\\n\\t\\t\\tv.pb({a[i], to_string(a[i])});\\n\\t\\tans = \\\"\\\";\\n\\t\\tdfs(v);\\n\\t\\tif(ans.size())\\n\\t\\t\\tcout << ans << '\\\\n';\\n\\t\\telse\\n\\t\\t\\tcout << \\\"0\\\\n\\\";\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -0.9601,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0041_2149302\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n#define INF (1e9+1)\\n//#define INF (1LL<<59)\\n\\n\\nint RPN(vector<char> v){\\n\\tstack<int> num;\\n\\trep(i,v.size()){\\n\\t\\tif(isdigit(v[i])){\\n\\t\\t\\tnum.push(v[i]-'0');\\n\\t\\t}else{\\n\\t\\t\\tif(num.size()<2) throw -1;\\n\\t\\t\\tint a,b;\\n\\t\\t\\ta = num.top(),num.pop();\\n\\t\\t\\tb = num.top();num.pop();\\n\\t\\t\\tif(v[i]=='+')num.push(a+b);\\n\\t\\t\\tif(v[i]=='-')num.push(a-b);\\n\\t\\t\\tif(v[i]=='*')num.push(a*b);\\n\\t\\t}\\n\\t}\\n\\tif(num.size()!=1)throw -1;\\n\\t\\n\\treturn num.top();\\n}\\n\\nvoid printRPN(vector<char> v){\\n\\tstack<string> num;\\n\\trep(i,v.size()){\\n\\t\\tif(isdigit(v[i])){\\n\\t\\t\\tnum.push(string(1,v[i]));\\n\\t\\t}else{\\n\\t\\t\\tstring a,b;\\n\\t\\t\\ta = num.top(),num.pop();\\n\\t\\t\\tb = num.top();num.pop();\\n\\t\\t\\tif(v[i]=='+')num.push(\\\"(\\\"+a+\\\"+\\\"+b+\\\")\\\");\\n\\t\\t\\tif(v[i]=='-')num.push(\\\"(\\\"+a+\\\"-\\\"+b+\\\")\\\");\\n\\t\\t\\tif(v[i]=='*')num.push(\\\"(\\\"+a+\\\"*\\\"+b+\\\")\\\");\\n\\t\\t}\\n\\t}\\n\\tcout<<num.top()<<endl;\\n}\\n\\nint main(){\\n\\tvector<char> v(4);\\n\\twhile(cin>>v[0]>>v[1]>>v[2]>>v[3]){\\n\\t\\tif(v[0]=='0'&&v[1]=='0'&&v[2]=='0'&&v[3]=='0')break;\\n\\t\\trep(plus,4){\\n\\t\\t\\trep(minus,4){\\n\\t\\t\\t\\trep(mul,4){\\n\\t\\t\\t\\t\\tvector<char> tmp=v;\\n\\t\\t\\t\\t\\tif(plus+minus+mul!=3)continue;\\n\\t\\t\\t\\t\\trep(i,plus)tmp.pb('+');\\n\\t\\t\\t\\t\\trep(i,minus)tmp.pb('-');\\n\\t\\t\\t\\t\\trep(i,mul)tmp.pb('*');\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tsort(all(tmp));\\n\\t\\t\\t\\t\\tdo{\\n\\t\\t\\t\\t\\t\\tint res;\\n\\t\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\t\\t\\tres = RPN(tmp);\\n\\t\\t\\t\\t\\t\\t}catch(int e){continue;}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif(res==10){\\n\\t\\t\\t\\t\\t\\t\\tprintRPN(tmp);\\n\\t\\t\\t\\t\\t\\t\\tgoto next;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}while(next_permutation(all(tmp)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<0<<endl;\\n\\tnext:;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -1.8686,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0041_2109508\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n\\nusing namespace std;\\n\\nbool Found;\\nchar ans[30];\\n\\nint calc(char arg[30]){\\n\\n\\tint tmp,op1,work,count,work2;\\n\\tchar line[30],calc;\\n\\tstack<int> NUM,work_num;\\n\\tstack<char> OP,work_op;\\n\\n\\tint loop;\\n\\tfor(loop = 0; arg[loop] != '\\\\0';loop++)line[loop] = arg[loop];\\n\\n\\tline[loop++] = '=';\\n\\tline[loop] = '\\\\0';\\n\\n\\n\\tbool numFLG,negFLG;\\n\\n\\ttmp = 0;\\n\\tnumFLG = false;\\n\\tnegFLG = false;\\n\\n\\tfor(int k = 0; line[k] != '\\\\0'; k++){\\n\\t\\tif(line[k] >= '0' && line[k] <= '9'){\\n\\t\\t\\tnumFLG = true;\\n\\t\\t\\ttmp = 10*tmp + (line[k] - '0');\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(numFLG == true){\\n\\n\\t\\t\\t\\tif(negFLG){\\n\\t\\t\\t\\t\\ttmp = -1*tmp;\\n\\t\\t\\t\\t\\tnegFLG = false;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(OP.empty() == false && (OP.top() == '*' || OP.top() == '/')){\\n\\t\\t\\t\\t\\tcalc = OP.top();\\n\\t\\t\\t\\t\\tOP.pop();\\n\\t\\t\\t\\t\\top1 = NUM.top();\\n\\t\\t\\t\\t\\tNUM.pop();\\n\\n\\t\\t\\t\\t\\tif(calc == '*'){\\n\\t\\t\\t\\t\\t\\tNUM.push(tmp*op1);\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tNUM.push(op1/tmp);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tNUM.push(tmp);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tnumFLG = false;\\n\\t\\t\\t\\ttmp = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(line[k] == '+' ||line[k] == '*' || line[k] == '/' || line[k] == '(' || line[k] == '-'){\\n\\t\\t\\t\\tOP.push(line[k]);\\n\\t\\t\\t}else if(line[k] == ')'){\\n\\t\\t\\t\\twork = NUM.top();\\n\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\twork_num.push(work);\\n\\n\\t\\t\\t\\tcount = 0;\\n\\n\\t\\t\\t\\twhile(true){\\n\\t\\t\\t\\t\\tcalc = OP.top();\\n\\t\\t\\t\\t\\tOP.pop();\\n\\t\\t\\t\\t\\tif(calc == '(')break;\\n\\n\\t\\t\\t\\t\\tcount++;\\n\\n\\t\\t\\t\\t\\twork_op.push(calc);\\n\\n\\t\\t\\t\\t\\twork = NUM.top();\\n\\t\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(count == 0){\\n\\t\\t\\t\\t\\twork = work_num.top();\\n\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\twork = work_num.top();\\n\\t\\t\\t\\t\\twork_num.pop();\\n\\n\\t\\t\\t\\t\\twhile(!work_num.empty()){\\n\\t\\t\\t\\t\\t\\tcalc = work_op.top();\\n\\t\\t\\t\\t\\t\\twork_op.pop();\\n\\n\\t\\t\\t\\t\\t\\tif(calc == '+'){\\n\\t\\t\\t\\t\\t\\t\\twork += work_num.top();\\n\\t\\t\\t\\t\\t\\t}else if(calc == '-'){\\n\\t\\t\\t\\t\\t\\t\\twork -= work_num.top();\\n\\t\\t\\t\\t\\t\\t}else if(calc == '*'){\\n\\t\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\twork /= work_num.top();\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(OP.empty() == false && OP.top() == '*'){\\n\\t\\t\\t\\t\\tOP.pop();\\n\\t\\t\\t\\t\\twork2 = NUM.top();\\n\\t\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\t\\twork *= work2;\\n\\t\\t\\t\\t}else if(OP.empty() == false &&OP.top() == '/'){\\n\\t\\t\\t\\t\\tOP.pop();\\n\\t\\t\\t\\t\\twork2 = NUM.top();\\n\\t\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\t\\twork = work2/work;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tNUM.push(work);\\n\\n\\t\\t\\t}else{\\n\\t\\t\\t\\twork = NUM.top();\\n\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\twork_num.push(work);\\n\\n\\t\\t\\t\\twhile(!NUM.empty()){\\n\\t\\t\\t\\t\\tcalc = OP.top();\\n\\t\\t\\t\\t\\tOP.pop();\\n\\n\\t\\t\\t\\t\\twork_op.push(calc);\\n\\n\\t\\t\\t\\t\\twork = NUM.top();\\n\\t\\t\\t\\t\\tNUM.pop();\\n\\t\\t\\t\\t\\twork_num.push(work);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\twork = work_num.top();\\n\\t\\t\\t\\twork_num.pop();\\n\\n\\t\\t\\t\\twhile(!work_num.empty()){\\n\\t\\t\\t\\t\\tcalc = work_op.top();\\n\\t\\t\\t\\t\\twork_op.pop();\\n\\n\\t\\t\\t\\t\\tif(calc == '+'){\\n\\t\\t\\t\\t\\t\\twork += work_num.top();\\n\\t\\t\\t\\t\\t}else if(calc == '-'){\\n\\t\\t\\t\\t\\t\\twork -= work_num.top();\\n\\t\\t\\t\\t\\t}else if(calc == '*'){\\n\\t\\t\\t\\t\\t\\twork *= work_num.top();\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\twork /= work_num.top();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\twork_num.pop();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\treturn work;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn -1;\\t//must not reach here\\n}\\n\\n\\nvoid func(int a,int b, int c,int d){\\n\\n\\tchar eq1[30],eq2[30],eq3[30],eq4[30],eq5[30],eq6[30],eq7[30],eq8[30];\\n\\teq1[0] = '(',eq1[1] = '0' + a,eq1[2] = '?',eq1[3] = '0' + b,eq1[4] = ')',eq1[5] = '?',eq1[6] = '(',eq1[7] = '0' + c,eq1[8] = '?',eq1[9] = '0' + d,eq1[10] = ')',eq1[11] = '\\\\0';\\n\\n\\teq2[0] = '0' + a,eq2[1] = '?',eq2[2] = '(',eq2[3] = '0' + b,eq2[4] = '?',eq2[5] = '0' + c,eq2[6] = ')',eq2[7] = '?',eq2[8] = '0' + d,eq2[9] = '\\\\0';\\n\\n\\teq3[0] = '0' + a,eq3[1] = '?',eq3[2] = '0' + b,eq3[3] = '?',eq3[4] = '(',eq3[5] = '0' + c,eq3[6] = '?',eq3[7] = '0' + d,eq3[8] = ')',eq3[9] = '\\\\0';\\n\\n\\teq4[0] = '0' + a,eq4[1] = '?',eq4[2] = '(',eq4[3] = '0' + b,eq4[4] = '?',eq4[5] = '(',eq4[6] = '0' + c,eq4[7] = '?',eq4[8] = '0' + d,eq4[9] = ')',eq4[10] = ')',eq4[11] = '\\\\0';\\n\\n\\teq5[0] = '(',eq5[1] = '0' + a,eq5[2] = '?',eq5[3] = '(',eq5[4] = '0' + b,eq5[5] = '?',eq5[6] = '0' + c,eq5[7] = ')',eq5[8] = ')',eq5[9] = '?',eq5[10] = '0' + d,eq5[11] = '\\\\0';\\n\\n\\teq6[0] = '(',eq6[1] = '0' + a,eq6[2] = '?',eq6[3] = '0' + b,eq6[4] = ')',eq6[5] = '?',eq6[6] = '0' + c,eq6[7] = '?',eq6[8] = '0' + d,eq6[9] = '\\\\0';\\n\\n\\teq7[0] = '(',eq7[1] = '(',eq7[2] = '0' + a,eq7[3] = '?',eq7[4] = '0' + b,eq7[5] = ')',eq7[6] = '?',eq7[7] = '0' + c,eq7[8] = ')',eq7[9] = '?',eq7[10] = '0' + d,eq7[11] = '\\\\0';\\n\\n\\teq8[0] = '0' + a,eq8[1] = '?',eq8[2] = '(',eq8[3] = '(',eq8[4] = '0' + b,eq8[5] = '?',eq8[6] = '0' + c,eq8[7] = ')',eq8[8] = '?',eq8[9] = '0' + d,eq8[10] = ')',eq8[11] = '\\\\0';\\n\\n\\n\\tfor(int x = 0; x < 3; x++){\\n\\t\\tfor(int y = 0; y < 3; y++){\\n\\t\\t\\tfor(int z = 0; z < 3; z++){\\n\\t\\t\\t\\tswitch(x){\\n\\t\\t\\t\\tcase 0:\\n\\t\\t\\t\\t\\teq1[2] = '+',eq2[1] = '+',eq3[1] = '+',eq4[1] = '+',eq5[2] = '+',eq6[2] = '+',eq7[3] = '+',eq8[1] = '+';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\teq1[2] = '-',eq2[1] = '-',eq3[1] = '-',eq4[1] = '-',eq5[2] = '-',eq6[2] = '-',eq7[3] = '-',eq8[1] = '-';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\teq1[2] = '*',eq2[1] = '*',eq3[1] = '*',eq4[1] = '*',eq5[2] = '*',eq6[2] = '*',eq7[3] = '*',eq8[1] = '*';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswitch(y){\\n\\t\\t\\t\\tcase 0:\\n\\t\\t\\t\\t\\teq1[5] = '+',eq2[4] = '+',eq3[3] = '+',eq4[4] = '+',eq5[5] = '+',eq6[5] = '+',eq7[6] = '+',eq8[5] = '+';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\teq1[5] = '-',eq2[4] = '-',eq3[3] = '-',eq4[4] = '-',eq5[5] = '-',eq6[5] = '-',eq7[6] = '-',eq8[5] = '-';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\teq1[5] = '*',eq2[4] = '*',eq3[3] = '*',eq4[4] = '*',eq5[5] = '*',eq6[5] = '*',eq7[6] = '*',eq8[5] = '*';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswitch(z){\\n\\t\\t\\t\\tcase 0:\\n\\t\\t\\t\\t\\teq1[8] = '+',eq2[7] = '+',eq3[6] = '+',eq4[7] = '+',eq5[9] = '+',eq6[7] = '+',eq7[9] = '+',eq8[8] = '+';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\teq1[8] = '-',eq2[7] = '-',eq3[6] = '-',eq4[7] = '-',eq5[9] = '-',eq6[7] = '-',eq7[9] = '-',eq8[8] = '-';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\teq1[8] = '*',eq2[7] = '*',eq3[6] = '*',eq4[7] = '*',eq5[9] = '*',eq6[7] = '*',eq7[9] = '*',eq8[8] = '*';\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq1) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq1[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq2) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq2[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq3) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq3[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq4) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq4[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq5) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq5[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq6) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq6[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq7) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq7[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(calc(eq8) == 10){\\n\\t\\t\\t\\t\\tfor(int i = 0; i < 30; i++)ans[i] = eq8[i];\\n\\t\\t\\t\\t\\tFound = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tint a,b,c,d,num[4];\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&a,&b,&c,&d);\\n\\t\\tif(a == 0 && b == 0 && c == 0 && d == 0)break;\\n\\n\\t\\tFound = false;\\n\\n\\t\\tnum[0] = a,num[1] = b,num[2] = c,num[3] =d;\\n\\n\\t\\tfor(int e = 0; e < 4; e++){\\n\\t\\t\\tfor(int f = 0; f < 4; f++){\\n\\t\\t\\t\\tfor(int g = 0; g < 4; g++){\\n\\t\\t\\t\\t\\tfor(int h = 0; h < 4; h++){\\n\\t\\t\\t\\t\\t\\tif(e != f && e != g && e != h && f != g && f != h && g != h)func(num[e],num[f],num[g],num[h]);\\n\\t\\t\\t\\t\\t\\tif(Found)break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(Found)break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(Found)break;\\n\\t\\t\\t}\\n\\t\\t\\tif(Found)break;\\n\\t\\t}\\n\\n\\t\\tif(Found)printf(\\\"%s\\\\n\\\",ans);\\n\\t\\telse{\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2556,\n \"score_of_the_acc\": -0.6629,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0041_1963921\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <algorithm>\\n#include <cmath>\\n#include <random>\\nusing namespace std;\\n\\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\\n#define ALL(v) v.begin(), v.end()\\n\\n// every calculation can be written\\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\\n\\nint calc(int a, int b, char ope) {\\n if (ope == '+') return a + b;\\n if (ope == '-') return a - b;\\n if (ope == '*') return a * b;\\n return -1;\\n}\\n\\nbool isten(string s) {\\n int ans;\\n if (s[1] == '(') {\\n int a, b, c, d;\\n a = s[2] - '0';\\n b = s[6] - '0';\\n c = s[11] - '0';\\n d = s[16] - '0';\\n ans = calc(calc(calc(a,b,s[4]), c, s[9]), d, s[14]);\\n }else {\\n int a, b, c, d;\\n a = s[1] - '0';\\n b = s[5] - '0';\\n c = s[11] - '0';\\n d = s[15] - '0';\\n ans = calc(calc(a, b, s[3]), calc(c, d, s[13]), s[8]);\\n }\\n return ans == 10;\\n}\\n\\n// every calculation can be written\\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\\n\\n\\nvector<char> operands = {'+', '-', '*'};\\nrandom_device rd;\\n\\nchar getRandomOperand() {\\n return operands[rd() % 3];\\n}\\n\\nvoid solve41(int a, int b, int c, int d) {\\n vector<int> nums;\\n nums.push_back(a), nums.push_back(b), nums.push_back(c), nums.push_back(d);\\n sort(ALL(nums));\\n do {\\n REP(i,100) {\\n string eq1, eq2;\\n eq1 = \\\"((\\\" + to_string(nums[0]) + \\\" \\\" + getRandomOperand() + \\\" \\\" +\\n to_string(nums[1]) + \\\") \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[2]) +\\n \\\") \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[3]);\\n eq2 = \\\"(\\\" + to_string(nums[0]) + \\\" \\\" + getRandomOperand() + \\\" \\\" +\\n to_string(nums[1]) + \\\") \\\" + getRandomOperand() + \\\" (\\\" + to_string(nums[2]) +\\n \\\" \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[3]) + \\\")\\\";\\n if (isten(eq1)) {\\n cout << eq1 << endl;\\n return;\\n }else if (isten(eq2)) {\\n cout << eq2 << endl;\\n return;\\n }\\n }\\n }while (next_permutation(nums.begin(), nums.end()));\\n cout << 0 << endl;\\n}\\n\\nint main() {\\n int a, b, c, d;\\n while(cin >> a >> b >> c >> d, a + b + c + d) {\\n solve41(a,b,c,d);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.8595,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0041_1963920\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <algorithm>\\n#include <cmath>\\n#include <random>\\nusing namespace std;\\n\\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\\n#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\\n#define ALL(v) v.begin(), v.end()\\n\\n// every calculation can be written\\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\\n\\nint calc(int a, int b, char ope) {\\n if (ope == '+') return a + b;\\n if (ope == '-') return a - b;\\n if (ope == '*') return a * b;\\n return -1;\\n}\\n\\nbool isten(string s) {\\n int ans;\\n if (s[1] == '(') {\\n int a, b, c, d;\\n a = s[2] - '0';\\n b = s[6] - '0';\\n c = s[11] - '0';\\n d = s[16] - '0';\\n ans = calc(calc(calc(a,b,s[4]), c, s[9]), d, s[14]);\\n }else {\\n int a, b, c, d;\\n a = s[1] - '0';\\n b = s[5] - '0';\\n c = s[11] - '0';\\n d = s[15] - '0';\\n ans = calc(calc(a, b, s[3]), calc(c, d, s[13]), s[8]);\\n }\\n return ans == 10;\\n}\\n\\n// every calculation can be written\\n// ((a ? b) ? c) ? d or (a ? b) ? (c ? d)\\n\\n\\nvector<char> operands = {'+', '-', '*'};\\nrandom_device rd;\\n\\nchar getRandomOperand() {\\n return operands[rd() % 3];\\n}\\n\\nvoid solve41(int a, int b, int c, int d) {\\n vector<int> nums;\\n nums.push_back(a), nums.push_back(b), nums.push_back(c), nums.push_back(d);\\n sort(ALL(nums));\\n do {\\n REP(i,500) {\\n string eq1, eq2;\\n eq1 = \\\"((\\\" + to_string(nums[0]) + \\\" \\\" + getRandomOperand() + \\\" \\\" +\\n to_string(nums[1]) + \\\") \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[2]) +\\n \\\") \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[3]);\\n eq2 = \\\"(\\\" + to_string(nums[0]) + \\\" \\\" + getRandomOperand() + \\\" \\\" +\\n to_string(nums[1]) + \\\") \\\" + getRandomOperand() + \\\" (\\\" + to_string(nums[2]) +\\n \\\" \\\" + getRandomOperand() + \\\" \\\" + to_string(nums[3]) + \\\")\\\";\\n if (isten(eq1)) {\\n cout << eq1 << endl;\\n return;\\n }else if (isten(eq2)) {\\n cout << eq2 << endl;\\n return;\\n }\\n }\\n }while (next_permutation(nums.begin(), nums.end()));\\n cout << 0 << endl;\\n}\\n\\nint main() {\\n int a, b, c, d;\\n while(cin >> a >> b >> c >> d, a + b + c + d) {\\n solve41(a,b,c,d);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -1.1499,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0041_1829312\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <string>\\n#include <sstream>\\n#include <cmath>\\nusing namespace std;\\n\\ntypedef pair<int,string> pis;\\n#define fi first\\n#define se second\\n\\nvector<pis> solve(vector<int> nums) {\\n\\tvector<pis> res;\\n\\tif(nums.size() == 1) {\\n\\t\\tstring s;\\n\\t\\tstringstream sstr;\\n\\t\\tsstr << nums[0];\\n\\t\\tsstr >> s;\\n\\t\\tres.push_back(pis(nums[0],s));\\n\\t\\treturn res;\\n\\t}\\n\\tfor(int i = 1; i < nums.size(); i++) {\\n\\t\\tvector<int> a(nums.begin(), nums.begin()+i);\\n\\t\\tvector<int> b(nums.begin()+i, nums.end());\\n\\t\\tvector<pis> aa, bb;\\n\\t\\taa = solve(a);\\n\\t\\tbb = solve(b);\\n\\t\\tfor(int i = 0; i < aa.size(); i++) {\\n\\t\\t\\tfor(int j = 0; j < bb.size(); j++) {\\n\\t\\t\\t\\tres.push_back(pis(aa[i].fi + bb[j].fi, \\\"(\\\" + aa[i].se + \\\"+\\\" + bb[j].se + \\\")\\\"));\\n\\t\\t\\t\\tres.push_back(pis(aa[i].fi - bb[j].fi, \\\"(\\\" + aa[i].se + \\\"-\\\" + bb[j].se + \\\")\\\"));\\n\\t\\t\\t\\tres.push_back(pis(aa[i].fi * bb[j].fi, \\\"(\\\" + aa[i].se + \\\"*\\\" + bb[j].se + \\\")\\\"));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nint main() {\\n\\twhile(1) {\\n\\t\\tvector<int> a;\\n\\t\\ta.resize(4);\\n\\t\\tbool brk = true;\\n\\t\\tfor(int i = 0; i < 4; i++) {\\n\\t\\t\\tcin >> a[i];\\n\\t\\t\\tif(a[i] != 0) brk = false;\\n\\t\\t}\\n\\t\\tif(brk) break;\\n\\n\\t\\tsort(a.begin(), a.end());\\n\\t\\tstring res = \\\"0\\\";\\n\\t\\tdo {\\n\\t\\t\\tvector<pis> tmp;\\n\\t\\t\\ttmp = solve(a);\\n\\t\\t\\tfor(int i = 0; i < tmp.size(); i++) {\\n\\t\\t\\t\\tif(tmp[i].fi == 10)\\n\\t\\t\\t\\t\\tres = tmp[i].se;\\n\\t\\t\\t}\\n\\t\\t} while(next_permutation(a.begin(), a.end()));\\n\\t\\tcout << res << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.0826,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0041_1829298\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n\\n#define pb(n) push_back(n)\\n#define fi first\\n#define se second\\n#define all(r) (r).begin(),(r).end()\\n#define gsort(st,en) sort((st),(en),greater<int>())\\n#define vmax(ary) *max_element(all(ary))\\n#define vmin(ary) *min_element(all(ary))\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define fcout(n) cout<<fixed<<setprecision((n))\\n#define scout(n) cout<<setw(n)\\n#define vary(type,name,size,init) vector< type> name(size,init)\\n#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init));\\n\\n#define rep(i,n) for(int i = 0; i < (int)(n);++i)\\n#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)\\n#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)\\n#define repa(n,array) for(auto &n :(array))\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\nusing dict = map<string,int>;\\nusing pii = pair<int,int> ;\\nusing pll = pair<ll,ll> ;\\n\\ntemplate<typename T>\\nT ston(string& str, T n){\\n istringstream sin(str) ;\\n T num ;\\n sin >> num ;\\n return num ;\\n}\\n\\nconst string op[4] = {\\\"+\\\",\\\"-\\\",\\\"*\\\",\\\"/\\\"};\\nconst string pare[] = {\\\"(.!.)!.!.\\\",\\\".!.!(.!.)\\\",\\\".!(.!.)!.\\\",\\\"(.!.)!(.!.)\\\",\\\"(.!.!.)!.\\\",\\\".!(.!.!.)\\\",\\\"(.!(.!.))!.\\\",\\\"((.!.)!.)!.\\\",\\\".!((.!.)!.)\\\",\\\".!(.!(.!.))\\\",\\\".!.!.!.\\\"};\\n\\ndouble RPN(string str){\\n string s,s2;\\n double ans;\\n stack<double> n;\\n s = str;\\n ans = 0;\\n s += \\\" \\\" ;\\n rep(i,s.size()){\\n if(s[i] != ' '){\\n s2 += s[i];\\n }\\n else{\\n double a,b;\\n if(s2 == \\\"+\\\"){\\n b = n.top(),n.pop();\\n a = n.top(),n.pop();\\n ans = a + b;\\n n.push(ans);\\n }\\n else if(s2 == \\\"-\\\"){\\n b = n.top(),n.pop();\\n a = n.top(),n.pop();\\n ans = a - b;\\n n.push(ans);\\n }\\n else if(s2 == \\\"*\\\"){\\n b = n.top(),n.pop();\\n a = n.top(),n.pop();\\n ans = a * b;\\n n.push(ans);\\n }\\n else if(s2 == \\\"/\\\"){\\n b = n.top(),n.pop();\\n a = n.top(),n.pop();\\n ans = a / b;\\n n.push(ans);\\n }\\n else{\\n n.push(ston(s2,1.0));\\n }\\n s2.clear();\\n }\\n }\\n return n.top();\\n}\\n\\nvector<string> Split(char c,string s){\\n vector<string> res(0);\\n string str = \\\"\\\";\\n rep(i,s.size()){\\n if(s[i] == c){\\n if(str.size()){\\n res.push_back(str);\\n }\\n str.clear();\\n }\\n else{\\n str += s[i];\\n }\\n }\\n res.push_back(str);\\n return res;\\n}\\nbool check(string s1,string s2){\\n if(((s1 == \\\"+\\\" || s1 == \\\"-\\\" ) && s2 != \\\"(\\\")|| s1 == s2) return true;\\n if((s1 == \\\"*\\\" || s1 == \\\"/\\\")&& (s2 == \\\"+\\\" || s2 == \\\"-\\\")) return false;\\n if(s2 == \\\"(\\\") return false;\\n}\\nstring ConvertRPN(string s){\\n const string notnumber = \\\"+-*/() \\\";\\n stack<string> fom;\\n auto str = Split(' ',s);\\n string res = \\\"\\\";\\n rep(i,str.size()){\\n if(notnumber.find(str[i]) == string::npos){\\n res += str[i];\\n res += \\\" \\\";\\n }\\n else if(str[i] == \\\")\\\"){\\n while(fom.top() != \\\"(\\\"){\\n if(fom.top() != \\\" \\\"){\\n res += fom.top();\\n res += \\\" \\\";\\n }\\n fom.pop();\\n }\\n fom.pop();\\n }\\n else if(str[i] == \\\"(\\\" || fom.empty()){\\n fom.push(str[i]);\\n }\\n else if(check(str[i],fom.top())){\\n while(!fom.empty() && check(str[i],fom.top())){\\n if(fom.top() != \\\" \\\"){\\n res += fom.top();\\n res += \\\" \\\";\\n }\\n fom.pop();\\n }\\n fom.push(str[i]);\\n }\\n else{\\n fom.push(str[i]);\\n }\\n }\\n bool f = true;\\n while(fom.size()){\\n if(fom.top() != \\\" \\\"){\\n res += fom.top();\\n res += \\\" \\\";\\n }\\n fom.pop();\\n }\\n res.resize(res.size()-1);\\n return res;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n vary(ll,v,4,0);\\n while(cin >> v[0] >> v[1] >> v[2] >> v[3] && v[0] && v[1] && v[2] && v[3]){\\n sort(all(v));\\n bool f = false;\\n do{\\n rep(i,3){\\n rep(j,3){\\n rep(k,3){\\n string formula = op[i]+op[j] + op[k];\\n rep(m,10){\\n ll c = 0,d = 0;\\n string res =\\\"\\\";\\n rep(l,pare[m].size()){\\n if(pare[m][l] == '.'){\\n res += to_string(v[c])+ \\\" \\\";\\n ++c;\\n }\\n else if(pare[m][l] == '!'){\\n res += formula[d];\\n res += \\\" \\\";\\n ++d;\\n }\\n else{\\n res += pare[m][l];\\n res += \\\" \\\";\\n }\\n }\\n res.resize(res.size()-1);\\n string tmp = res;\\n res = ConvertRPN(res);\\n if(RPN(res) == 10){\\n cout << tmp<<endl;\\n f = true;\\n i = j = k = 4;\\n v.clear();\\n break;\\n }\\n }\\n }\\n }\\n }\\n }while(next_permutation(all(v)));\\n if(!f){\\n cout << 0 << endl;\\n }\\n v.resize(4);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -1.1533,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0041_1658385\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef complex<double> P;\\ntypedef pair<int,int> pii;\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define REPR(i,n) for(ll i=1;i<n;++i)\\n#define FOR(i,a,b) for(ll i=a;i<b;++i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define MOD (ll)(1e9+7)\\n#define ADD(a,b) a=((a)+(b))%MOD\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\nint calc(string s){\\n assert(s.size()==7);\\n stack<int> st;\\n REP(i,s.size()){\\n char c = s[i];\\n if(c=='+'){\\n if(st.size()<2) return -1;\\n int a = st.top(); st.pop();\\n a += st.top(); st.pop();\\n st.push(a);\\n }else if(c=='-'){\\n if(st.size()<2) return -1;\\n int a = st.top(); st.pop();\\n a -= st.top(); st.pop();\\n st.push(a);\\n }else if(c=='*'){\\n if(st.size()<2) return -1;\\n int a = st.top(); st.pop();\\n a *= st.top(); st.pop();\\n st.push(a);\\n }else{\\n st.push((int)(c-'0'));\\n }\\n }\\n assert(st.size()==1);\\n return st.top();\\n}\\n\\nvoid output(string s){\\n stack<string> st;\\n REP(i,s.size()){\\n char c = s[i];\\n if(c=='+' || c=='-' || c=='*'){\\n if(st.size()<2) assert(false&&\\\"NO STACK\\\");\\n string a = \\\"(\\\";\\n a += st.top(); st.pop();\\n a += c;\\n a += st.top(); st.pop();\\n a += \\\")\\\";\\n st.push(a);\\n }else{\\n st.push(string(1,c));\\n }\\n }\\n assert(st.size()==1);\\n cout<<st.top()<<endl;\\n}\\n\\nint main(){\\n int a[4];\\n while(~scanf(\\\"%d%d%d%d\\\",a,a+1,a+2,a+3)){\\n if(a[0]==0 && a[1]==0 && a[2]==0 && a[3]==0)break;\\n // ???????????????????¨????\\n vi expr(7,0);\\n FOR(i,4,7)expr[i]=1;\\n vi numlst(4);\\n REP(i,4)numlst[i]=i;\\n bool flag = false;\\n do{\\n if(flag)break;\\n if(expr[0]==1 || expr[1]==1) continue;\\n if(expr[6]==0) continue;\\n REP(exmsk,3*3*3){\\n if(flag)break;\\n do{\\n if(flag)break;\\n string s = \\\"\\\";\\n int i1=0;\\n int tmp = exmsk;\\n REP(i,7){\\n if(expr[i]==0){\\n s += (char)(a[numlst[i1]]+'0');\\n ++i1;\\n }else{\\n s += \\\"+-*\\\"[tmp%3];\\n tmp /= 3;\\n }\\n }\\n int res = calc(s);\\n if(res==10){\\n flag = true;\\n output(s);\\n break;\\n }\\n }while(next_permutation(ALL(numlst)));\\n }\\n }while(next_permutation(ALL(expr)));\\n if(!flag)cout<<0<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.0625,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0041_1589855\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define dump(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define dump(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\n//template<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<58;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n\\tos << \\\"[\\\";\\n\\tfor (const auto &v : vec) {\\n\\t\\tos << v << \\\",\\\";\\n\\t}\\n\\tos << \\\"]\\\";\\n\\treturn os;\\n}\\n\\nstring int_to_string(int x){\\n stringstream ss;\\n ss << x;\\n return ss.str();\\n}\\n\\nvector<pair<int,string>> nv(const vector<pair<int,string>>& v,const vector<pair<int,string>>& tmp,const vector<int>& idxs,char op){\\n auto x=v[idxs[0]],y=v[idxs[1]];\\n pair<int,string> p;\\n if(op=='+') p=make_pair(x.first+y.first,\\\"(\\\"+x.second+\\\" + \\\"+y.second+\\\")\\\");\\n else if(op=='-') p=make_pair(x.first-y.first,\\\"(\\\"+x.second+\\\" - \\\"+y.second+\\\")\\\");\\n else if(op=='*') p=make_pair(x.first*y.first,\\\"(\\\"+x.second+\\\" * \\\"+y.second+\\\")\\\");\\n auto res=tmp; res.emplace_back(p);\\n return move(res);\\n}\\n\\nstring dfs(vector<pair<int,string>> v){\\n if(v.size()==1){\\n if(v[0].first==10) return v[0].second;\\n else return \\\"\\\";\\n }\\n\\n string res=\\\"\\\";\\n rep(b,0,1<<v.size()){\\n if(__builtin_popcount(b)!=2) continue;\\n vector<pair<int,string>> tmp;\\n vector<int> idxs;\\n rep(i,0,v.size()){\\n if((1&(b>>i))==0) tmp.emplace_back(v[i]);\\n else idxs.emplace_back(i);\\n }\\n\\n res=max(res,dfs(nv(v,tmp,idxs,'+')));\\n res=max(res,dfs(nv(v,tmp,idxs,'*')));\\n res=max(res,dfs(nv(v,tmp,idxs,'-')));\\n swap(idxs[0],idxs[1]);\\n res=max(res,dfs(nv(v,tmp,idxs,'-')));\\n }\\n return res;\\n}\\n\\nvoid solve(){\\n int a,b,c,d;\\n while(cin >> a >> b >> c >> d){\\n if(a==0 and b==0 and c==0 and d==0) break;\\n vector<pair<int,string>> v;\\n v.emplace_back(make_pair(a,int_to_string(a)));\\n v.emplace_back(make_pair(b,int_to_string(b)));\\n v.emplace_back(make_pair(c,int_to_string(c)));\\n v.emplace_back(make_pair(d,int_to_string(d)));\\n string ans=dfs(v);\\n\\n if(ans.empty()) cout << 0 << endl;\\n else cout << ans << endl;\\n }\\n}\\n\\nint main(){\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.9051,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":95,"cells":{"group_id":{"kind":"string","value":"aoj_0067_cpp"},"problem_description":{"kind":"string","value":"島の数\n地勢を示す縦 12, 横 12 のマスからなる平面図があります。おのおののマスは白か黒に塗られています。白は海を、黒は陸地を表します。二つの黒いマスが上下、あるいは左右に接しているとき、これらは地続きであるといいます。この平面図では、黒いマス一つのみ、あるいは地続きの黒いマスが作る領域を「島」といいます。例えば下図には、5 つの島があります。\n■■■■□□□□■■■■\n■■■□□□□□■■■■\n■■□□□□□□■■■■\n■□□□□□□□■■■■\n□□□■□□□■□□□□\n□□□□□□■■■□□□\n□□□□□■■■■■□□\n■□□□■■■■■■■□\n■■□□□■■■■■□□\n■■■□□□■■■□□□\n■■■■□□□■□□□□\n□□□□□□□□□□□□\nマスのデータを読み込んで、島の数を出力するプログラムを作成してください。\nInput\n入力は複数のデータセットからなります。各データセットに１つの平面図が与えられます。黒いマスを 1、白いマスを 0 で表現した 12 個の数字の列 12 行でひとつの平面図を表します。データセットの間は１つの空行で区切られています。\nデータセットの数は 20 を超えません。\nOutput\nデータセットごとに、島の数を１行に出力します。\nSample Input\n111100001111\n111000001111\n110000001111\n100000001111\n000100010000\n000000111000\n000001111100\n100011111110\n110001111100\n111000111000\n111100010000\n000000000000\n\n010001111100\n110010000010\n010010000001\n010000000001\n010000000110\n010000111000\n010000000100\n010000000010\n010000000001\n010010000001\n010010000010\n111001111100\n\n000000000000\n111111111111\n100010100001\n100010100001\n100010100001\n100010100001\n100100100101\n101000011101\n100000000001\n100000000001\n111111111111\n100000000001\nOutput for the Sample Input\n5\n13\n4\nHint\n以下はサンプルインプットを■と□で表したものです。\n■■■■□□□□■■■■ □■□□□■■■■■□□ □□□□□□□□□□□□\n■■■□□□□□■■■■ ■■□□■□□□□□■□ ■■■■■■■■■■■■\n■■□□□□□□■■■■ □■□□■□□□□□□■ ■□□□■□■□□□□■\n■□□□□□□□■■■■ □■□□□□□□□□□■ ■□□□■□■□□□□■\n□□□■□□□■□□□□ □■□□□□□□□■■□ ■□□□■□■□□□□■\n□□□□□□■■■□□□ □■□□□□■■■□□□ ■□□□■□■□□□□■\n□□□□□■■■■■□□ □■□□□□□□□■□□ ■□□■□□■□□■□■\n■□□□■■■■■■■□ □■□□□□□□□□■□ ■□■□□□□■■■□■\n■■□□□■■■■■□□ □■□□□□□□□□□■ ■□□□□□□□□□□■\n■■■□□□■■■□□□ □■□□■□□□□□□■ ■□□□□□□□□□□■\n■■■■□□□■□□□□ □■□□■□□□□□■□ ■■■■■■■■■■■■\n□□□□□□□□□□□□ ■■■□□■■■■■□□ ■□□□□□□□□□□■"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0067_5246731","code_snippet":"#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nvector<string> island(12);\nvector<vector<bool>> seen(12, vector<bool>(12));\n\nvoid bfs(int h, int w) {\n\tqueue<pair<int, int>> q;\n\tq.push(make_pair(h, w));\n\n\tvector<int> X, Y;\n\tX = { 0,-1,1,0 };\n\tY = { -1,0,0,1 };\n\n\tint x, y;\n\twhile (!q.empty()) {\n\t\ty = q.front().first;\n\t\tx = q.front().second;\n\t\tseen[y][x] = 1;\n\t\tq.pop();\n\t\tfor (int i = 0; i < 4; i++) {\n\t\t\tint H, W;\n\t\t\tH = y + Y[i];\n\t\t\tW = x + X[i];\n\t\t\tif (H < 0 || H>11) continue;\n\t\t\tif (W < 0 || W>11) continue;\n\t\t\tif ((!seen[H][W])&& (island[H][W]=='1')) q.push(make_pair(H, W));\n\t\t}\n\t}\n\treturn;\n}\n\nint main() {\n\tfor (int i = 0; i < 12; i++) island[i].assign(\"\");\n\n\twhile (cin >> island[0]) {\n\t\t//cout << island[0] << endl;\n\t\tfor (int i = 1; i < 12; i++) cin >> island[i];\n\t\t//for (int i = 0; i < 12; i++) cout << island[i] << endl;\n\t\tfor (int i = 0; i < 12; i++) {\n\t\t\tfor (int j = 0; j < 12; j++) {\n\t\t\t\tseen[i][j] = 0;\n\t\t\t}\n\t\t}\n\n\t\tint cnt = 0;\n\t\tfor (int i = 0; i < 12; i++) {\n\t\t\tfor (int j = 0; j < 12; j++) {\n\t\t\t\tif ((island[i][j] == '1') && (!seen[i][j])) {\n\t\t\t\t\tcnt++;\n\t\t\t\t\tbfs(i, j);\n\t\t\t\t\t/*for (int i = 0; i < 12; i++) {\n\t\t\t\t\t\tfor (int j = 0; j < 12; j++) {\n\t\t\t\t\t\t\tcout << seen[i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcout << endl;\n\t\t\t\t\t}\n\t\t\t\t\tcout << endl;*/\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":8800,"score_of_the_acc":-2,"final_rank":4},{"submission_id":"aoj_0067_3324152","code_snippet":"#include <iostream>\n#include <queue>\n#include <string>\n#include <vector>\n\n#define N 12\n\nusing namespace std;\n\nint main() {\n // 隣接行列\n // int adjacent[N][N];\n string s;\n while(cin >> s) {\n vector<string> numStr(N);\n // 到達したかどうかを判断\n bool reached[N][N];\n\n numStr[0] = s;\n for(int i = 1; i < N; i++) {\n cin >> numStr[i];\n }\n\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n // cout << numStr[i].at(j);\n reached[i][j] = false;\n }\n // cout << endl;\n }\n // cout << numStr[N+1];\n\n // 始点の選択\n queue<pair<int, int> > que;\n // 島の数\n int cnt = 0;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < N; j++) {\n if(reached[i][j] == false && numStr[i].at(j) == '1') {\n que.push(pair<int, int>(i, j));\n // その島のカウントをつける。\n cnt++;\n while(!que.empty()) {\n // popする値を保存する。\n int f = que.front().first;\n int s = que.front().second;\n // cout << \"front = (\" << f << \",\" << s << \")\" << endl;\n // popする値をtrueに変更する。\n reached[f][s] = true;\n que.pop();\n\n // 右\n if(!(s == N-1)) {\n // cout << \"log右\" << endl;\n if(reached[f][s+1] == false && numStr[f].at(s+1) == '1') que.push(pair<int, int>(f, s+1));\n }\n // 左\n if(!(s == 0)) {\n // cout << \"log左\" << endl;\n if(reached[f][s-1] == false && numStr[f].at(s-1) == '1') que.push(pair<int, int>(f, s-1));\n }\n // 上\n if(!(f == 0)) {\n // cout << \"log上\" << endl;\n if(reached[f-1][s] == false && numStr[f-1].at(s) == '1') que.push(pair<int, int>(f+1, s));\n }\n // 下\n if(!(f == N-1)) {\n // cout << \"log下\" << endl;\n if(reached[f+1][s] == false && numStr[f+1].at(s) == '1') que.push(pair<int, int>(f+1, s));\n }\n\n }\n }\n }\n }\n cout << cnt << endl;\n // 終了判定\n // if(cin.eof()) break;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":8740,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_0067_2313551","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> PA;\nint dx[4] = {1,-1,0,0};\nint dy[4] = {0,0,1,-1};\nqueue<PA> que;\nint main(){\n int n,ans;\n char m[13][13];\n \n while(cin >> m[0]){\n \n for(int j = 0;j < 12;j++){\n if(j==0) continue;\n cin >> m[j];\n }\n ans = 0;\n for(int j = 0;j < 12;j++){\n for(int k = 0;k < 12;k++){\n\tif(m[j][k] == '1'){\n\t que.push(PA(j,k));\n\t while(!que.empty()){\n\t PA p=que.front();que.pop();\n\t m[p.first][p.second] = '0';\n\t for(int l = 0;l < 4;l++){\n\t int y = p.first+dy[l];\n\t int x = p.second+dx[l];\n\t if(x<0||y<0||x>=12||y>=12||m[y][x]=='0') continue;\n\t que.push( PA(y,x) );\n\t }\n\t }\n\t ans++;\n\t}\n }\n }\n cout << ans << endl;\n }\n return (0);\n}","accuracy":1,"time_ms":30,"memory_kb":8768,"score_of_the_acc":-1.4667,"final_rank":3},{"submission_id":"aoj_0067_2204416","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint vecx[4]={0,1,0,-1},vecy[4]={1,0,-1,0};\n\nvoid explore(string atlas[12],int vstd[12][12],int i,int j){\n queue<pair<int,int> > bfs;\n bfs.push(make_pair(i,j));\n while(!bfs.empty()){\n int x=bfs.front().first,y=bfs.front().second;\n vstd[x][y]=1;\n for(int k=0; k<4; k++){\n int nextx=x+vecx[k],nexty=y+vecy[k];\n if(nextx<0||nextx>11||nexty<0||nexty>11)continue;\n if(atlas[x+vecx[k]][y+vecy[k]]=='1'&&vstd[x+vecx[k]][y+vecy[k]]==0){\n bfs.push(make_pair(x+vecx[k],y+vecy[k]));\n }\n }\n bfs.pop();\n //cout<<x<<' '<<y<<endl;\n }\n}\n\nint main(){\n string atlas[12];\n int vstd[12][12],cnt;\n while(cin>>atlas[0],!cin.eof()){\n cnt=0;\n for(int i=1; i<12; i++){\n cin>>atlas[i];\n }\n fill(vstd[0],vstd[12],0);\n for(int i=0; i<12; i++){\n for(int j=0; j<12; j++){\n if(vstd[i][j]==0&&atlas[i][j]=='1'){\n explore(atlas,vstd,i,j);\n cnt++;\n }\n }\n }\n cout<<cnt<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":8764,"score_of_the_acc":-1.4,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_0067_5246731\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define NIL (-1)\\n#define LL long long\\nusing namespace std;\\nconst int64_t MOD = 1e9 + 7;\\nconst int INF = INT_MAX;\\nconst double PI = acos(-1.0);\\n\\nvector<string> island(12);\\nvector<vector<bool>> seen(12, vector<bool>(12));\\n\\nvoid bfs(int h, int w) {\\n\\tqueue<pair<int, int>> q;\\n\\tq.push(make_pair(h, w));\\n\\n\\tvector<int> X, Y;\\n\\tX = { 0,-1,1,0 };\\n\\tY = { -1,0,0,1 };\\n\\n\\tint x, y;\\n\\twhile (!q.empty()) {\\n\\t\\ty = q.front().first;\\n\\t\\tx = q.front().second;\\n\\t\\tseen[y][x] = 1;\\n\\t\\tq.pop();\\n\\t\\tfor (int i = 0; i < 4; i++) {\\n\\t\\t\\tint H, W;\\n\\t\\t\\tH = y + Y[i];\\n\\t\\t\\tW = x + X[i];\\n\\t\\t\\tif (H < 0 || H>11) continue;\\n\\t\\t\\tif (W < 0 || W>11) continue;\\n\\t\\t\\tif ((!seen[H][W])&& (island[H][W]=='1')) q.push(make_pair(H, W));\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\n\\nint main() {\\n\\tfor (int i = 0; i < 12; i++) island[i].assign(\\\"\\\");\\n\\n\\twhile (cin >> island[0]) {\\n\\t\\t//cout << island[0] << endl;\\n\\t\\tfor (int i = 1; i < 12; i++) cin >> island[i];\\n\\t\\t//for (int i = 0; i < 12; i++) cout << island[i] << endl;\\n\\t\\tfor (int i = 0; i < 12; i++) {\\n\\t\\t\\tfor (int j = 0; j < 12; j++) {\\n\\t\\t\\t\\tseen[i][j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint cnt = 0;\\n\\t\\tfor (int i = 0; i < 12; i++) {\\n\\t\\t\\tfor (int j = 0; j < 12; j++) {\\n\\t\\t\\t\\tif ((island[i][j] == '1') && (!seen[i][j])) {\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t\\tbfs(i, j);\\n\\t\\t\\t\\t\\t/*for (int i = 0; i < 12; i++) {\\n\\t\\t\\t\\t\\t\\tfor (int j = 0; j < 12; j++) {\\n\\t\\t\\t\\t\\t\\t\\tcout << seen[i][j];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcout << endl;*/\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << cnt << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8800,\n \"score_of_the_acc\": -2,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0067_3324152\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <string>\\n#include <vector>\\n\\n#define N 12\\n\\nusing namespace std;\\n\\nint main() {\\n // 隣接行列\\n // int adjacent[N][N];\\n string s;\\n while(cin >> s) {\\n vector<string> numStr(N);\\n // 到達したかどうかを判断\\n bool reached[N][N];\\n\\n numStr[0] = s;\\n for(int i = 1; i < N; i++) {\\n cin >> numStr[i];\\n }\\n\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < N; j++) {\\n // cout << numStr[i].at(j);\\n reached[i][j] = false;\\n }\\n // cout << endl;\\n }\\n // cout << numStr[N+1];\\n\\n // 始点の選択\\n queue<pair<int, int> > que;\\n // 島の数\\n int cnt = 0;\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < N; j++) {\\n if(reached[i][j] == false && numStr[i].at(j) == '1') {\\n que.push(pair<int, int>(i, j));\\n // その島のカウントをつける。\\n cnt++;\\n while(!que.empty()) {\\n // popする値を保存する。\\n int f = que.front().first;\\n int s = que.front().second;\\n // cout << \\\"front = (\\\" << f << \\\",\\\" << s << \\\")\\\" << endl;\\n // popする値をtrueに変更する。\\n reached[f][s] = true;\\n que.pop();\\n\\n // 右\\n if(!(s == N-1)) {\\n // cout << \\\"log右\\\" << endl;\\n if(reached[f][s+1] == false && numStr[f].at(s+1) == '1') que.push(pair<int, int>(f, s+1));\\n }\\n // 左\\n if(!(s == 0)) {\\n // cout << \\\"log左\\\" << endl;\\n if(reached[f][s-1] == false && numStr[f].at(s-1) == '1') que.push(pair<int, int>(f, s-1));\\n }\\n // 上\\n if(!(f == 0)) {\\n // cout << \\\"log上\\\" << endl;\\n if(reached[f-1][s] == false && numStr[f-1].at(s) == '1') que.push(pair<int, int>(f+1, s));\\n }\\n // 下\\n if(!(f == N-1)) {\\n // cout << \\\"log下\\\" << endl;\\n if(reached[f+1][s] == false && numStr[f+1].at(s) == '1') que.push(pair<int, int>(f+1, s));\\n }\\n\\n }\\n }\\n }\\n }\\n cout << cnt << endl;\\n // 終了判定\\n // if(cin.eof()) break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8740,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0067_2313551\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> PA;\\nint dx[4] = {1,-1,0,0};\\nint dy[4] = {0,0,1,-1};\\nqueue<PA> que;\\nint main(){\\n int n,ans;\\n char m[13][13];\\n \\n while(cin >> m[0]){\\n \\n for(int j = 0;j < 12;j++){\\n if(j==0) continue;\\n cin >> m[j];\\n }\\n ans = 0;\\n for(int j = 0;j < 12;j++){\\n for(int k = 0;k < 12;k++){\\n\\tif(m[j][k] == '1'){\\n\\t que.push(PA(j,k));\\n\\t while(!que.empty()){\\n\\t PA p=que.front();que.pop();\\n\\t m[p.first][p.second] = '0';\\n\\t for(int l = 0;l < 4;l++){\\n\\t int y = p.first+dy[l];\\n\\t int x = p.second+dx[l];\\n\\t if(x<0||y<0||x>=12||y>=12||m[y][x]=='0') continue;\\n\\t que.push( PA(y,x) );\\n\\t }\\n\\t }\\n\\t ans++;\\n\\t}\\n }\\n }\\n cout << ans << endl;\\n }\\n return (0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8768,\n \"score_of_the_acc\": -1.4667,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0067_2204416\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint vecx[4]={0,1,0,-1},vecy[4]={1,0,-1,0};\\n\\nvoid explore(string atlas[12],int vstd[12][12],int i,int j){\\n queue<pair<int,int> > bfs;\\n bfs.push(make_pair(i,j));\\n while(!bfs.empty()){\\n int x=bfs.front().first,y=bfs.front().second;\\n vstd[x][y]=1;\\n for(int k=0; k<4; k++){\\n int nextx=x+vecx[k],nexty=y+vecy[k];\\n if(nextx<0||nextx>11||nexty<0||nexty>11)continue;\\n if(atlas[x+vecx[k]][y+vecy[k]]=='1'&&vstd[x+vecx[k]][y+vecy[k]]==0){\\n bfs.push(make_pair(x+vecx[k],y+vecy[k]));\\n }\\n }\\n bfs.pop();\\n //cout<<x<<' '<<y<<endl;\\n }\\n}\\n\\nint main(){\\n string atlas[12];\\n int vstd[12][12],cnt;\\n while(cin>>atlas[0],!cin.eof()){\\n cnt=0;\\n for(int i=1; i<12; i++){\\n cin>>atlas[i];\\n }\\n fill(vstd[0],vstd[12],0);\\n for(int i=0; i<12; i++){\\n for(int j=0; j<12; j++){\\n if(vstd[i][j]==0&&atlas[i][j]=='1'){\\n explore(atlas,vstd,i,j);\\n cnt++;\\n }\\n }\\n }\\n cout<<cnt<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8764,\n \"score_of_the_acc\": -1.4,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":96,"cells":{"group_id":{"kind":"string","value":"aoj_0043_cpp"},"problem_description":{"kind":"string","value":"パズル\n1 〜 9 の数字を 14 個組み合わせて完成させるパズルがあります。与えられた 13 個の数字にもうひとつ数字を付け加えて完成させます。\nパズルの完成条件は\n同じ数字を２つ組み合わせたものが必ずひとつ必要です。\n残りの12 個の数字は、３個の数字の組み合わせ４つです。\n３個の数字の組み合わせ方は、同じ数字を３つ組み合わせたものか、または３つの連続する数字を組み合わせたものです。ただし、9 1 2 のような並びは連続する数字とは認められません。\n同じ数字は4 回まで使えます。\n13 個の数字からなる文字列を読み込んで、パズルを完成することができる数字を昇順に全て出力するプログラムを作成してください。なお、1〜9 のどの数字を付け加えてもパズルを完成させることができないときは 0 を出力してください。\n例えば与えられた文字列が 3456666777999 の場合\n「2」があれば、\n234 567 666 77 999\n「3」があれば、\n33 456 666 777 999\n「5」があれば、\n345 567 666 77 999\n「8」があれば、\n345 666 678 77 999\nというふうに、2 3 5 8 のいずれかの数字が付け加えられるとパズルは完成します。「6」でも整いますが、5 回目の使用になるので、この例では使えないことに注意してください。\nInput\n入力は複数のデータセットからなります。各データセットとして、13 個の数字が１行に与えられます。データセットの数は 50 を超えません。\nOutput\nデータセットごとに、パズルを完成させることができる数字を昇順に空白区切りで１行に出力します。\nSample Input\n3649596966777\n6358665788577\n9118992346175\n9643871425498\n7755542764533\n1133557799246\nOutput for the Sample Input\n2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0043_4893249","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\n#ifdef _DEBUG\n#define PRE_COMMAND \\\n std::cin.rdbuf(in.rdbuf()); \\\n std::cout << fixed << setprecision(15);\n#else\n#define PRE_COMMAND cout << fixed << setprecision(15);\n#endif\nconst double EPS = 1e-10, PI = acos(-1.0);\ntemplate <class T> auto MAX(T& seq) {\n return *max_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto MIN(T& seq) {\n return *min_element(seq.begin(), seq.end());\n}\ntemplate <class T> auto SUM(T& seq) {\n T temp{0};\n auto& temp2 = temp[0];\n return accumulate(seq.begin(), seq.end(), temp2);\n}\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\n sort(seq.begin(), seq.end(), sort_order);\n}\ntemplate <class T> void SORTR(vector<T>& seq) {\n sort(seq.begin(), seq.end(), greater<T>());\n}\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\n while (k) {\n if (k & 1) now = (now * n) % mod;\n n = (n * n) % mod;\n k >>= 1;\n }\n return now;\n}\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\n for (T& x : vec) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n if (!v.size()) return os;\n typename vector<T>::const_iterator ii = v.begin();\n os << *ii++;\n for (; ii != v.end(); ++ii) os << \" \" << *ii;\n return os;\n}\n\n// カンマ区切りのデータをvector<int>に変換\nvector<int> comma_sep(string inp) {\n inp += ',';\n vector<int> v;\n string s = \"\";\n for (char c : inp) {\n if (c == ',') {\n v.push_back(stoi(s));\n s = \"\";\n } else {\n s += c;\n }\n }\n return v;\n}\n\ntemplate <class S> map<S, int> Counter(vector<S>& v) {\n map<S, int> ret;\n for (auto i : v) { ret[i]++; }\n return ret;\n}\n\nint main() {\n PRE_COMMAND\n set<vector<int>> ok_list;\n vector<vector<int>> three_pair = {\n {1, 2, 3}, {2, 3, 4}, {3, 4, 5}, {4, 5, 6}, {5, 6, 7}, {6, 7, 8},\n {7, 8, 9}, {1, 1, 1}, {2, 2, 2}, {3, 3, 3}, {4, 4, 4}, {5, 5, 5},\n {6, 6, 6}, {7, 7, 7}, {8, 8, 8}, {9, 9, 9}};\n vector<vector<int>> two_pair = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5},\n {6, 6}, {7, 7}, {8, 8}, {9, 9}};\n vector<int> deck;\n for (auto t1 : three_pair) {\n for (auto t2 : three_pair) {\n for (auto t3 : three_pair) {\n for (auto t4 : three_pair) {\n for (auto t5 : two_pair) {\n deck = {};\n for (int i : t1) deck.push_back(i);\n for (int i : t2) deck.push_back(i);\n for (int i : t3) deck.push_back(i);\n for (int i : t4) deck.push_back(i);\n for (int i : t5) deck.push_back(i);\n map<int, int> c = Counter(deck);\n bool flag = false;\n for (auto temp : c) {\n if (get<1>(temp) > 4) flag = true;\n }\n if (flag) continue;\n SORT(deck);\n ok_list.insert(deck);\n }\n }\n }\n }\n }\n string s;\n while (cin >> s) {\n vector<int> now, ans;\n for (int i = 0; i < 13; i++) now.push_back((int)(s[i] - '0'));\n for (int i = 1; i < 10; i++) {\n vector<int> now2 = now;\n now2.push_back(i);\n SORT(now2);\n if (ok_list.count(now2)) ans.push_back(i);\n }\n if (ans.size()) {\n cout << ans << endl;\n } else {\n cout << 0 << endl;\n }\n }\n}","accuracy":1,"time_ms":230,"memory_kb":4816,"score_of_the_acc":-0.8331,"final_rank":14},{"submission_id":"aoj_0043_4357252","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = uint32_t;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nbool solve(string s){\n map<int, int> m;\n for (auto &&i : s) {\n m[i]++;\n }\n sort(s.begin(),s.end());\n vector<string> v, u;\n for (int i = 1; i <= 9; ++i) {\n v.emplace_back(3, (char)(i+'0'));\n u.emplace_back(2, (char)(i+'0'));\n }\n for (int i = 1; i < 8; ++i) {\n string t;\n for (int j = 0; j < 3; ++j) {\n t += (char)(i+j+'0');\n }\n v.emplace_back(t);\n }\n int n = v.size();\n\n for (int i = 0; i < n; ++i) {\n for (int j = i; j < n; ++j) {\n for (int k = j; k < n; ++k) {\n for (int l = k; l < n; ++l) {\n for (int o = 0; o < 9; ++o) {\n string t = v[i]+v[j]+v[k]+v[l]+u[o];\n sort(t.begin(),t.end());\n if(s == t) return true;\n }\n }\n }\n }\n }\n return false;\n}\n\nint main() {\n string s;\n while(getline(cin, s)){\n sort(s.begin(),s.end());\n map<int, int> cnt;\n for (auto &&i : s) {\n cnt[i-'0']++;\n }\n int b = 0;\n for (int i = 1; i <= 9; ++i) {\n if(cnt[i] < 4){\n string t = s;\n t += char(i + '0');\n if(solve(t)) {\n if(b++) cout << \" \";\n cout << i;\n }\n }\n }\n if(!b) printf(\"0\");\n puts(\"\");\n }\n return 0;\n}","accuracy":1,"time_ms":630,"memory_kb":3164,"score_of_the_acc":-1.1895,"final_rank":18},{"submission_id":"aoj_0043_2896038","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\nbool serch(std::vector<int>&nums)\n{\n\tconst int length = nums.size();\n\tstatic int found_hand = 0;\n\tswitch (found_hand)\n\t{\n\tcase 0:\n\t\tint pair[2];\n\t\tfor (int i = 0; i < length - 1; i++)\n\t\t{\n\t\t\tfor (int j = i + 1; j < length; j++)\n\t\t\t{\n\t\t\t\tif (nums[i] == nums[j])\n\t\t\t\t{\n\t\t\t\t\tpair[0] = nums[i];\n\t\t\t\t\tpair[1] = nums[j];\n\t\t\t\t\tnums.erase(nums.begin() + j);\n\t\t\t\t\tnums.erase(nums.begin() + i);\n\t\t\t\t\tfound_hand++;\n\t\t\t\t\tif (serch(nums))\n\t\t\t\t\t{\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tnums.push_back(pair[0]);\n\t\t\t\t\t\tnums.push_back(pair[1]);\n\t\t\t\t\t\tstd::sort(nums.begin(), nums.end());\n\t\t\t\t\t\tfound_hand--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tint trio[3];\n\t\tfor (int i = 0; i < length - 2; i++)\n\t\t{\n\t\t\tfor (int j = i + 1; j < length - 1; j++)\n\t\t\t{\n\t\t\t\tfor (int k = j + 1; k < length; k++)\n\t\t\t\t{\n\t\t\t\t\tif (nums[i] == nums[j] && nums[j] == nums[k] || nums[j] == nums[i] + 1 && nums[k] == nums[j] + 1)\n\t\t\t\t\t{\n\t\t\t\t\t\ttrio[0] = nums[i];\n\t\t\t\t\t\ttrio[1] = nums[j];\n\t\t\t\t\t\ttrio[2] = nums[k];\n\t\t\t\t\t\tnums.erase(nums.begin() + k);\n\t\t\t\t\t\tnums.erase(nums.begin() + j);\n\t\t\t\t\t\tnums.erase(nums.begin() + i);\n\t\t\t\t\t\tfound_hand++;\n\t\t\t\t\t\tif (found_hand == 5 || serch(nums))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfound_hand = 0;\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tnums.push_back(trio[0]);\n\t\t\t\t\t\t\tnums.push_back(trio[1]);\n\t\t\t\t\t\t\tnums.push_back(trio[2]);\n\t\t\t\t\t\t\tstd::sort(nums.begin(), nums.end());\n\t\t\t\t\t\t\tfound_hand--;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t}\n\treturn false;\n}\nint main()\n{\n\tfor (std::string str; std::cin >> str;)\n\t{\n\t\tstd::vector<int>ans;\n\t\tans.reserve(9);\n\t\tstd::vector<int>nums;\n\t\tnums.reserve(14);\n\t\tstd::vector<int>appearance_count(9, 0);\n\t\tfor (auto i : str)\n\t\t{\n\t\t\tconst int foo = static_cast<int>(i - '0');\n\t\t\tnums.push_back(foo);\n\t\t\tappearance_count[foo]++;\n\t\t}\n\t\tfor (int i = 1; i <= 9; i++)\n\t\t{\n\t\t\tif (appearance_count[i] == 4)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tauto nums_copy = nums;\n\t\t\tnums_copy.push_back(i);\n\t\t\tstd::sort(nums_copy.begin(), nums_copy.end());\n\t\t\tif (serch(nums_copy))\n\t\t\t{\n\t\t\t\tans.push_back(i);\n\t\t\t}\n\t\t}\n\t\tif (ans.size() == 0)\n\t\t{\n\t\t\tstd::cout << '0';\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (int i = 0; i < ans.size(); i++)\n\t\t\t{\n\t\t\t\tif (i != 0)\n\t\t\t\t{\n\t\t\t\t\tstd::cout << ' ';\n\t\t\t\t}\n\t\t\t\tstd::cout << ans[i];\n\t\t\t}\n\t\t}\n\t\tstd::cout << std::endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3180,"score_of_the_acc":-0.2947,"final_rank":12},{"submission_id":"aoj_0043_2140762","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint d[14];\nint memo[10][4][2][1 << 14];\nbool solve(int p, int cnt, bool r,int u) {\n\tif (memo[p][cnt][r][u] != -1)return memo[p][cnt][r][u];\n\tbool ok = false;\n\tif (cnt == 3) {\n\t\tint f = -1, s = -1;\n\t\trep(i, 14) {\n\t\t\tif (!(u>>i&1)) {\n\t\t\t\tif (f == -1)f = d[i];\n\t\t\t\telse if (s == -1)s = d[i];\n\t\t\t\telse ok = true;\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tif (f == s)return memo[p][cnt][r][u]=true;\n\t\t\treturn memo[p][cnt][r][u]=false;\n\t\t}\n\t\tok = true; cnt = 0;\n\t}\n\trep(i, 14) {\n\t\tif (!(u>>i&1) && (ok || (r&&d[i] == p + 1) || (!r&&d[i] == p))) {\n\t\t\tu |= 1 << i;\n\t\t\tif (solve(d[i], cnt + 1, r,u))return memo[p][cnt][r][u]=true;\n\t\t\tif (ok) {\n\t\t\t\tif (solve(d[i], cnt + 1, !r,u))return memo[p][cnt][r][u]=true;\n\t\t\t}\n\t\t\tu ^= 1 << i;\n\t\t}\n\t}\n\treturn memo[p][cnt][r][u]=false;\n}\nint main() {\n\twhile (1) {\n\t\tint cnt[10]{};\n\t\trep(i, 13) {\n\t\t\tif (!~scanf(\"%1d\", &d[i]))return 0;\n\t\t\tcnt[d[i]]++;\n\t\t}\n\t\tbool flag = false;\n\t\tfor (int i = 1; i <= 9; i++) {\n\t\t\tif (cnt[i] >= 4)continue;\n\t\t\td[13] = i;\n\t\t\tmemset(memo, -1, sizeof(memo));\n\t\t\tif (solve(0, 3, 0, 0)) {\n\t\t\t\tif (flag)printf(\" \");\n\t\t\t\tprintf(\"%d\", i);\n\t\t\t\tflag = true;\n\t\t\t}\n\t\t}\n\t\tif (!flag)printf(\"0\");\n\t\tprintf(\"\\n\");\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":8312,"score_of_the_acc":-1.0441,"final_rank":17},{"submission_id":"aoj_0043_2140759","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nint d[14];\nbool used[14];\nbool solve(int p, int cnt, bool r) {\n\tbool ok = false;\n\tif (cnt == 3) {\n\t\tint f = -1, s = -1;\n\t\trep(i, 14) {\n\t\t\tif (!used[i]) {\n\t\t\t\tif (f == -1)f = d[i];\n\t\t\t\telse if (s == -1)s = d[i];\n\t\t\t\telse ok = true;\n\t\t\t}\n\t\t}\n\t\tif (!ok) {\n\t\t\tif (f == s)return true;\n\t\t\treturn false;\n\t\t}\n\t\tok = true; cnt = 0;\n\t}\n\trep(i, 14) {\n\t\tif (!used[i] && (ok || (r&&d[i] == p + 1) || (!r&&d[i] == p))) {\n\t\t\tused[i] = true;\n\t\t\tif (solve(d[i], cnt + 1, r))return true;\n\t\t\tif (ok) {\n\t\t\t\tif (solve(d[i], cnt + 1, !r))return true;\n\t\t\t}\n\t\t\tused[i] = false;\n\t\t}\n\t}\n\treturn false;\n}\nint main(){\n\twhile (1) {\n\t\tint cnt[10]{};\n\t\trep(i, 13) {\n\t\t\tif (!~scanf(\"%1d\", &d[i]))return 0;\n\t\t\tcnt[d[i]]++;\n\t\t}\n\t\tbool flag = false;\n\t\tfor (int i = 1; i <= 9; i++) {\n\t\t\tif (cnt[i] >= 4)continue;\n\t\t\td[13] = i;\n\t\t\tmemset(used, 0, sizeof(used));\n\t\t\tif (solve(0, 3, 0)) {\n\t\t\t\tif (flag)printf(\" \");\n\t\t\t\tprintf(\"%d\", i);\n\t\t\t\tflag = true;\n\t\t\t}\n\t\t}\n\t\tif (!flag)printf(\"0\");\n\t\tprintf(\"\\n\");\n\t}\n}","accuracy":1,"time_ms":520,"memory_kb":3072,"score_of_the_acc":-1.0149,"final_rank":16},{"submission_id":"aoj_0043_1979953","code_snippet":"#define\t_USE_MATH_DEFINES\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <cfloat>\n#include <map>\n#include <queue>\n#include <stack>\n#include <list>\n#include <string>\n#include <set>\n#include <complex>\n#include <utility>\n#include <numeric>\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define REP(i,a,n) for(int i=a;i<(n);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define VI\tvector<int>\n#define\t VS vector<string>\n#define all(a) (a).begin(),(a).end()\n#define debug(x) cout<<#x<<\": \"<<x<<endl\nusing namespace std;\ntypedef long long ll;\n\nconst int INF=1e9;\nchar fi[101][101];\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\ndouble EPS = 1e-10;\nint N,M;\nint sx,sy;\nint gx,gy;\nint w,h;\nint ans;\nint dx[4]={0,0,-1,1};\nint dy[4]={-1,1,0,0};\nconst int MAX_V=100;\nconst int MAX_N=100;\nchar o[3]={'+','-','*'};\n#define md 1000003\n\n\nint dp[353][353]={0};\nint bow[353][353]={0};\ndouble add(double a,double b){\n\tif(abs(a+b)<EPS*(abs(a)+abs(b)))\n\treturn 0;\n\treturn a+b;\n}\n\nstruct P{\n\tdouble x,y;\n\tP(){}\n\t\tP(double x,double y):x(x),y(y){\n\t\t}\n\t\tP operator + (P p){\n\t\t\treturn P(add(x,p.x),add(y,p.y));\n\t\t}\n\t\tP operator - (P p){\n\t\t\treturn P(add(x,-p.x),add(y,-p.y));\n\t\t}\n\t\tP operator *(double d){\n\t\t\treturn P(x*d,y*d);\n\t\t}\n\t\tdouble dot(P p){\n\t\t\treturn add(x*p.x,y*p.y);\n\t\t}\n\t\tdouble det(P p){\n\t\t\treturn add(x*p.y,-y*p.x);\n\t\t}\n};\n\nbool cmp_x(const P& p,const P& q){\n\tif(p.x!=q.x) return p.x<q.x;\n\treturn p.y<q.y;\n}\n\nvector<P> convex_hull(P* ps, int n){\n\tsort(ps,ps+n,cmp_x);\n\tint k=0;\n\tvector<P> \tqs(n*2);\n\t\n\trep(i,n){\n\t\twhile(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)\n\t\t\tk--;\n\t\tqs[k++]=ps[i];\n\t}\n\tfor(int i=n-2,t=k;i>=0;i--){\n\t\twhile(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)\n\t\tk--;\n\t\tqs[k++]=ps[i];\n\t}\n\tqs.resize(k-1);\n\treturn qs;\n}\n\nint n,m;\nvector<double> p;\nP ps[101];\nchar c[520][520];\nlong long mod=1000000007;\nlong long pow(ll i,ll j){\n\tll tmp=1;\n\twhile(j){\n\t\tif(j%2) tmp=tmp*i%mod;\n\t\ti=i*i%mod;\n\t\tj/=2;\n\t}\n\treturn tmp;\n}\nint cards[10];\nbool ok;\nvoid saiki(int deep){\n\tif(deep==4){\n\t\tok=true;\n\t\treturn;\n\t}\n\tfor(int i=1;i<=7;i++){\n\t\tif(cards[i]>0&&cards[i+1]>0&&cards[i+2]>0){\n\t\t\tcards[i]--;\n\t\t\tcards[i+1]--;\n\t\t\tcards[i+2]--;\n\t\t\tsaiki(deep+1);\n\t\t\tcards[i]++;\n\t\t\tcards[i+1]++;\n\t\t\tcards[i+2]++;\n\t\t}\n\t\tfor(int i=1;i<=9;i++){\n\t\t\tif(cards[i]>2){\n\t\t\t\tcards[i]-=3;\n\t\t\t\tsaiki(deep+1);\n\t\t\t\tcards[i]+=3;\n\t\t\t}\n\t\t}\n\t}\n\t\n}\n\nint main(){\n\t\n\tstring s;\n\twhile(cin>>s){\n\t\tfor(int i=0;i<=9;i++){\n\t\t\tcards[i]=0;\n\t\t}\n\t\tqueue<int> a;\n\t\tbool f=false;\n\t\t\n\trep(i,s.size()){\n\t\tcards[s[i]-'0']++;\n\t\tif(cards[s[i]-'0']>4){\n\t\t\tf=true;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\tif(!f){\n\tfor(int i=1;i<=9;i++){\n\t\tif(cards[i]<4){\n\t\t\tok=false;\n\t\t\tcards[i]++;\n\t\t\tfor(int j=1;j<=9;j++){\n\t\t\t\tif(cards[j]>1){\n\t\t\t\t\tcards[j]-=2;\n\t\t\t\t\tsaiki(0);\n\t\t\t\t\tif(ok){\n\t\t\t\t\t\ta.push(i);\n\t\t\t\t\t\tcards[j]+=2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcards[j]+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcards[i]--;\n\t\t}\n\t\t\t\n\t}\n\t}\n\t\tif(f||a.empty())\n\t\t\tcout<<0<<endl;\n\telse{\n\t\tcout<<a.front();\n\t\ta.pop();\n\t\twhile(!a.empty()){\n\t\t\tcout<<\" \"<<a.front();\n\t\t\ta.pop();\n\t\t}\n\t\tcout<<endl;\n\t\t\n\t}\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1196,"score_of_the_acc":-0.0164,"final_rank":4},{"submission_id":"aoj_0043_1841027","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<string>\nusing namespace std;\nqueue<vector<int> >Q;\nstring S; int p[14];\nint main() {\n\twhile (cin >> S) {\n\t\tvector<int>s; int g[10] = { 0,0,0,0,0,0,0,0,0,0 };\n\t\tfor (int i = 0; i < 13; i++) {\n\t\t\tp[i] = S[i] - '0'; g[p[i]]++;\n\t\t}\n\t\tfor (int i = 0; i < 10; i++)s.push_back(g[i]);\n\t\ts.push_back(1); int f[10] = { 0,0,0,0,0,0,0,0,0,0 };\n\t\tfor (int h = 1; h < 10; h++) {\n\t\t\ts[h]++; Q.push(s); int OK = 0;\n\t\t\twhile (!Q.empty()) {\n\t\t\t\tvector<int>t = Q.front(), u; Q.pop(); int sum = 0;\n\t\t\t\tfor (int i = 0; i < 10; i++) sum += t[i];\n\t\t\t\tif (sum == 0)OK = 1;\n\t\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\t\tif (t[i] >= 2 && t[10] >= 1) { u = t; u[i] -= 2; u[10] = 0; Q.push(u); }\n\t\t\t\t\tif (t[i] >= 3) { u = t; u[i] -= 3; Q.push(u); }\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < 8; i++) {\n\t\t\t\t\tif (t[i] >= 1 && t[i + 1] >= 1 && t[i + 2] >= 1) {\n\t\t\t\t\t\tu = t; u[i] -= 1; u[i + 1] -= 1; u[i + 2] -= 1; Q.push(u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (s[h] >= 5)OK = 0;\n\t\t\t}\n\t\t\tf[h] = OK; s[h]--;\n\t\t}\n\t\tint V = 0;\n\t\tfor (int i = 1; i < 10; i++) {\n\t\t\tif (f[i] == 1) {\n\t\t\t\tif (V >= 1) { cout << ' '; }\n\t\t\t\tcout << i; V++;\n\t\t\t}\n\t\t}\n\t\tif (V == 0)cout << '0';\n\t\tcout << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1268,"score_of_the_acc":-0.0118,"final_rank":2},{"submission_id":"aoj_0043_1590651","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nint mentu[16][3] = {\n\t{1,1,1},{2,2,2},{3,3,3},{4,4,4},{5,5,5},{6,6,6},{7,7,7},{8,8,8},{9,9,9},\n\t{1,2,3},{2,3,4},{3,4,5},{4,5,6},{5,6,7},{6,7,8},{7,8,9}\n};\n\nint main(){\n\t\n\tstring str;\n\t\n\twhile(true){\n\t\t\n\t\tint num[10], num_1[10], dummy[10];\n\t\t\n\t\tbool ans[10];\n\t\t\n\t\tcin >> str;\n\t\tif(cin.eof()){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < 10; i++){\n\t\t\tnum[i] = 0;\n\t\t\tans[i] = false;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < str.size(); i++){\n\t\t\tnum[str[i] - '0']++;\n\t\t}\n\t\t\n\t\tfor(int rest = 1; rest <= 9; rest++){\n\t\t\tfor(int i = 0; i < 10; i++){\n\t\t\t\tnum_1[i] = num[i];\n\t\t\t}\n\t\t\t\n\t\t\tif(num_1[rest] >= 4){\n\t\t\t\tcontinue;\n\t\t\t}else{\n\t\t\t\tnum_1[rest]++;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i = 0; i < 16; i++){\n\t\t\t\tfor(int j = i; j < 16; j++){\n\t\t\t\t\tfor(int k = j; k < 16; k++){\n\t\t\t\t\t\tfor(int l = k; l < 16; l++){\n\t\t\t\t\t\t\tfor(int m = 1; m <= 9; m++){\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tfor(int b = 1; b <= 9; b++){\n\t\t\t\t\t\t\t\t\tdummy[b] = 0;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tfor(int a = 0; a < 3; a++){\n\t\t\t\t\t\t\t\t\tdummy[mentu[i][a]]++;\n\t\t\t\t\t\t\t\t\tdummy[mentu[j][a]]++;\n\t\t\t\t\t\t\t\t\tdummy[mentu[k][a]]++;\n\t\t\t\t\t\t\t\t\tdummy[mentu[l][a]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdummy[m] += 2;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tfor(int b = 1; b <= 9; b++){\n\t\t\t\t\t\t\t\t\tif(num_1[b] != dummy[b]){\n\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif(b == 9){\n\t\t\t\t\t\t\t\t\t\tans[rest] = true;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*\n\t\t\tcout << \" \";\n\t\t\t\n\t\t\tfor(int i = 1; i <= 9; i++){\n\t\t\t\tcout << dummy[i];\n\t\t\t}\n\t\t\t*/\n\t\t\t\n\t\t}\n\t\t\n\t\tint loop;\n\t\t\n\t\tbool found;\n\t\t\n\t\tfound = false;\n\t\t\n\t\tfor(loop = 1; loop <= 9; loop++){\n\t\t\tif(ans[loop]){\n\t\t\t\tcout << loop;\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(loop = loop + 1; loop <= 9; loop++){\n\t\t\tif(ans[loop]){\n\t\t\t\tcout << \" \" << loop;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(!found){\n\t\t\tcout << \"0\";\n\t\t}\n\t\tcout << endl;\n\t\t\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1184,"score_of_the_acc":-0.0441,"final_rank":7},{"submission_id":"aoj_0043_1360445","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\ntypedef unsigned long long ull;\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\n#define rep(i,n) loop(i,0,n)\n#define all(a) (a).begin(), (a).end()\n\nbool ok(int i, int j){\n\treturn i == j && i < 9;\n}\n\nint main(){\n\tstring s;\n\tvector<vector<int> > a, b;\n\tfor(int i=1; i < 10; i++){\n\t\tvector<int> v;\n\t\tfor(int j=0; j< 2; j++) v.push_back(i);\n\t\tb.push_back(v);\n\t\tv.push_back(i);\n\t\ta.push_back(v);\n\t}\n\tfor(int i=1; i <= 7; i++){\n\t\tvector<int> v;\n\t\tfor(int j=0; j < 3; j++) v.push_back(i+j);\n\t\ta.push_back(v);\n\t}\n\n\twhile(cin >> s){\n\t\tint c[10] = {0};\n\t\tfor(int i=0; i < s.size(); i++) c[s[i]-'0']++;\n\t\tstring t = \"123456789\";\n\n\t\tvector<int> ret;\n\t\trep(q, t.size()){\n\t\t\tc[t[q]-'0']++;\n\t\t\tbool p = true;\n\t\t\trep(i, 10) if(4 < c[i]){c[t[q]-'0']--; p = false; break;}\n\t\t\tif(!p) continue;\n\t\t\tloop(i, 0, a.size())loop(j, 0, a.size()){\n\t\t\t\tif(ok(i, j)) continue;\n\t\t\t\tloop(k, 0, a.size()){\n\t\t\t\t\tif(ok(j, k) || ok(i, k)) continue;\n\t\t\t\t\tloop(l, 0, a.size()){\n\t\t\t\t\t\tif(ok(i, l) || ok(j, l) || ok(k, l)) continue;\n\t\t\t\t\t\trep(m, b.size()){\n\t\t\t\t\t\t\tif(i == m || j == m || k == m || l == m) continue;\n\t\t\t\t\t\t\tint d[10] = {0};\n\t\t\t\t\t\t\trep(n, 3){d[a[i][n]]++; d[a[j][n]]++; d[a[k][n]]++; d[a[l][n]]++;}\n\t\t\t\t\t\t\trep(n, 2) d[b[m][n]]++;\n\t\t\t\t\t\t\tbool possible = true;\n\t\t\t\t\t\t\trep(n, 10) if(c[n] != d[n]){possible = false; break;}\n\t\t\t\t\t\t\tif(possible) ret.push_back(q+1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tc[t[q]-'0']--;\n\t\t}\n\t\tint n = -1;\n\t\trep(i, ret.size()){\n\t\t\tif(n != ret[i]){cout << (i == 0 ? \"\" : \" \") << ret[i]; n = ret[i];}\n\t\t}\n\t\tif(n == -1) cout << 0;\n\t\tcout << endl;\n\t}\n}","accuracy":1,"time_ms":690,"memory_kb":1228,"score_of_the_acc":-1.0062,"final_rank":15},{"submission_id":"aoj_0043_1242837","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <map>\n#include <bitset>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\n\nusing namespace std;\n\ntypedef map<int, int> Num;\n\nint check2(Num a) {\n\tint sum = 0;\n\tfor (int i = 1; i <= 9; i++)\n\t\tsum += a[i];\n\treturn sum;\n}\n\nvoid check1(Num a, int n, int *ans) {\n\tif (check2(a) == 0) {\n\t\t*ans |= (0x01 << n);\n\t\treturn;\n\t}\n\n\tfor (int i = 1; i <= 9; i++) {\n\t\tif (a[i] >= 3) {\n\t\t\ta[i] -= 3;\n\t\t\tcheck1(a, n, ans);\n\t\t\ta[i] += 3;\n\t\t}\n\t}\n\n\tfor (int i = 3; i <= 9; i++) {\n\t\tif (a[i-2] && a[i-1] && a[i]) {\n\t\t\ta[i-2] -= 1;\n\t\t\ta[i-1] -= 1;\n\t\t\ta[i] -= 1;\n\t\t\tcheck1(a, n, ans);\n\t\t\ta[i-2] += 1;\n\t\t\ta[i-1] += 1;\n\t\t\ta[i] += 1;\n\t\t}\n\t}\n}\n\nint solve(Num a) {\n\tint ans = 0;\n\tfor (int i = 1; i <= 9; i++) {\n\t\tif (a[i] == 4) continue;\n\n\t\ta[i]++;\n\t\tfor (int j = 1; j <= 9; j++)\n\t\t\tif (a[j] > 1) {\n\t\t\t\ta[j] -= 2;\n\t\t\t\tcheck1(a, i, &ans);\n\t\t\t\ta[j] += 2;\n\t\t\t}\n\t\ta[i]--;\n\t}\n\treturn ans;\n}\n\nint main() {\n\tstring str;\n\twhile (cin >> str) {\n\t\tNum a;\n\t\tfor (int i = 1; i <= 9; i++)\n\t\t\ta[i] = 0;\n\t\tfor (int i = 0; i < str.size(); i++) {\n\t\t\tint s = str[i] - '0';\n\t\t\ta[s]++;\n\t\t}\n\t\tint ans = solve(a);\n\t\tif (ans == 0)\n\t\t\tcout << 0 << endl;\n\t\telse {\n\t\t\tint ifs = 0;\n\t\t\tfor (int i = 1; i <= 9; i++) {\n\t\t\t\tif (ans & (0x01 << i))\n\t\t\t\t\tcout << ((ifs++) ? \" \" : \"\") << i;\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1188,"score_of_the_acc":-0.0153,"final_rank":3},{"submission_id":"aoj_0043_1091760","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <map>\n#include <vector>\nusing namespace std;\n\nstring str;\n\nbool c (map<char,int> m) {\n for (auto i = m.begin(); i != m.end(); i++) {\n if (i->second != 0) return false;\n }\n return true;\n}\n\nbool dfs(map<char,int> m) {\n if (c(m)) return true;\n for (char i = '1'; i <= '9'; i++) {\n if (m[i] >= 3) {\n m[i] -= 3;\n if (dfs (m)) return true;;\n m[i] += 3;\n }\n if (i + 2 <= '9' && m[i] > 0 && m[i+1] > 0 && m[i+2] > 0) {\n m[i]--; m[i + 1]--; m[i + 2]--;\n if (dfs(m)) return true;\n m[i]++; m[i + 1]++; m[i + 2]++;\n }\n }\n return false;\n}\n\nint main ()\n{\n while (cin >> str) {\n map<char,int> m;\n for (char i = '1' ; i <= '9'; i++) m[i] = 0;\n for (int i = 0; i < str.size(); i++) {\n m[str[i]]++;\n }\n\n vector<char> res;\n for (char i = '1'; i <= '9'; i++) {\n if (m[i] >= 4) continue;\n m[i]++;\n for (char j = '1'; j <= '9'; j++) {\n if (m[j] >= 2) {\n m[j] -= 2;\n if (dfs(m)) {\n res.push_back(i);\n m[j] += 2;\n break;\n }\n m[j] += 2;\n }\n }\n m[i]--;\n }\n if (res.size()) {\n cout << res[0];\n for (int i = 1; i < res.size(); i++) cout << \" \" << res[i];\n } else cout << 0;\n cout << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1204,"score_of_the_acc":-0.0028,"final_rank":1},{"submission_id":"aoj_0043_1053767","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\n\nstring str;\nset<vint> se;\n\nint main() {\n se.clear();\n \n int j[4];\n for (int i = 1; i <= 9; ++i) {\n for (j[0] = 1; j[0] <= 16; ++j[0]) {\n for (j[1] = 1; j[1] <= 16; ++j[1]) {\n for (j[2] = 1; j[2] <= 16; ++j[2]) {\n for (j[3] = 1; j[3] <= 16; ++j[3]) {\n vint tmp(9, 0);\n tmp[i-1] = 2;\n for (int k = 0; k < 4; ++k) {\n if (j[k] <= 9) tmp[j[k]-1] += 3;\n else {\n tmp[j[k]-10]++;\n tmp[j[k]-9]++;\n tmp[j[k]-8]++;\n }\n }\n bool check = true;\n for (int l = 0; l < 9; ++l) if (tmp[l] > 4) check = false;\n if (check) se.insert(tmp);\n }\n }\n }\n }\n }\n \n while (cin >> str) {\n vint vec(9, 0);\n for (int i = 0; i < str.size(); ++i) vec[ str[i]-'1' ]++;\n vint res;\n for (int add = 1; add <= 9; ++add) {\n vint tmp = vec;\n tmp[add-1]++;\n if (se.count(tmp)) res.PB(add);\n }\n \n if (res.size() == 0) cout << \"0\";\n else {\n for (int i = 0; i < res.size(); ++i) {\n cout << res[i];\n if (i != res.size()-1) cout << \" \";\n }\n }\n cout << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":2660,"score_of_the_acc":-0.2953,"final_rank":13},{"submission_id":"aoj_0043_948775","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef map<char, int> State;\n\nbool finished(State &m){\n for(char c = '1' ; c <= '9' ; c++){\n if(m[c]) return false;\n }\n return true;\n}\n\nbool bfs(string s){\n State start;\n for(int i = 0 ; i < (int)s.size() ; i++){\n start[s[i]]++;\n if(start[s[i]] > 4) return false;\n }\n queue<State> que;\n for(char c = '1' ; c <= '9' ; c++){\n if(start[c] >= 2){\n State nex = start;\n nex[c] -= 2;\n que.push(nex); \n }\n }\n \n while(!que.empty()){\n State q = que.front(); que.pop();\n \n if(finished(q)) return true;\n \n for(char c = '1' ; c <= '9' ; c++){\n if(q[c] >= 3){\n\tState nex = q;\n\tnex[c] -= 3;\n\tque.push(nex);\n }\n }\n for(char c = '1' ; c <= '7' ; c++){\n if(q[c] >= 1 && q[c+1] >= 1 && q[c+2] >= 1){\n\tState nex = q;\n\tnex[c] -= 1, nex[c+1] -= 1, nex[c+2] -= 1;\n\tque.push(nex);\n }\n }\n }\n return false;\n}\n\nint main(){\n string s;\n while(cin >> s){\n vector<char> ans;\n for(char c = '1' ; c <= '9' ; c++){\n if(bfs(s + c)) ans.push_back(c);\n }\n if(ans.size() == 0) cout << 0 << endl;\n else{\n for(int i = 0 ; i < (int)ans.size() ; i++){\n\tcout << ans[i];\n\tif(i == (int)ans.size()-1) cout << endl;\n\telse cout << ' ';\n }\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1288,"score_of_the_acc":-0.0293,"final_rank":6},{"submission_id":"aoj_0043_899145","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nvector<int> a(14);\nbool solve(int x, int y);\nint main(){\n string s;\n while(cin >>s){\n vector<int> ans;\n for(int i=1; i<10; i++){\n int n[10]={};\n bool f = true;\n for(int j=0; j<s.size(); j++) a[j] = s[j]-'0';\n a[13] = i;\n sort(a.begin(),a.end());\n for(int j=0; j<a.size(); j++) n[a[j]]++;\n for(int j=1; j<10; j++) if(n[j]>4) f = false;\n if(f) if(solve(1,4)) ans.push_back(i);\n }\n if(ans.size() == 0) cout <<\"0\"<<endl;\n else{\n for(int i=0; i<ans.size(); i++){\n\tif(i != 0) cout <<\" \";\n\tcout <<ans[i];\n }\n cout <<endl;\n }\n }\n}\nbool solve(int x, int y){\n int ans = false;\n if(x == 0 && y == 0) return true;\n if(x == 1){\n for(int i=0; i<13; i++){\n if(a[i] == -1) continue;\n if(a[i] == a[i+1]){\n\tint sc = a[i];\n\ta[i] = a[i+1] = -1;\n\tans = ans|solve(0,y);\n\ta[i] = a[i+1] = sc;\n }\n }\n }\n if(y != 0){\n for(int i=0; i<12; i++){\n if(a[i] == -1) continue;\n if(a[i] == a[i+1] && a[i+1] == a[i+2]){\n\tint sc = a[i];\n\ta[i] = a[i+1] = a[i+2] = -1;\n\tans = ans|solve(x,y-1);\n\ta[i] = a[i+1] = a[i+2] = sc;\n }\n for(int j=i+1; j<13; j++){\n\tif(a[j]!=a[i]+1) continue;\n\tfor(int k=j+1; k<14; k++){\n\t if(a[k]!=a[j]+1) continue;\n\t int sc = a[i];\n\t a[i] = a[j] = a[k] = -1;\n\t ans = ans|solve(x,y-1);\n\t a[i] = sc; a[j] = sc+1; a[k] = sc+2;\n\t}\n }\n }\n }\n return ans;\n}","accuracy":1,"time_ms":170,"memory_kb":1204,"score_of_the_acc":-0.2381,"final_rank":11},{"submission_id":"aoj_0043_860578","code_snippet":"#include<stdio.h>\n#include<string.h>\n#include<set>\n#include<vector>\n\nstd::set<std::vector<int> > all;\n\nvoid search(std::vector<int> count,int p,int cPerm[2]){\n\tif(p==10&&(cPerm[0]+cPerm[1]==0)){\n\t\tall.insert(count);\t\t\n\t}else{\n\t\tif(count[p]<=2&&cPerm[0]>0){\n\t\t\tcPerm[0]=0;\n\t\t\tcount[p]+=2;\n\t\t\tsearch(count,p,cPerm);\n\t\t\tcount[p]-=2;\n\t\t\tcPerm[0]=1;\n\t\t}\n\t\tif(count[p]<=1&&cPerm[1]>0){\n\t\t\tcPerm[1]--;\n\t\t\tcount[p]+=3;\n\t\t\tsearch(count,p,cPerm);\n\t\t\tcount[p]-=3;\n\t\t\tcPerm[1]++;\n\t\t}\n\t\tif(p<=7&&count[p]<4&&cPerm[1]>0){\n\t\t\tcPerm[1]--;\n\t\t\tcount[p]++;\n\t\t\tcount[p+1]++;\n\t\t\tcount[p+2]++;\n\t\t\tsearch(count,p,cPerm);\n\t\t\tcount[p]--;\n\t\t\tcount[p+1]--;\n\t\t\tcount[p+2]--;\n\t\t\tcPerm[1]++;\n\t\t}\n\t\tif(count[p]<=4)search(count,p+1,cPerm);\n\t}\n}\n\nint main(){\n\tchar text[15];\n\tstd::vector<int> count;\n\tint cPerm[2]={1,4};\n\tfor(int i=0;i<=9;i++)count.push_back(0);\n\tsearch(count,1,cPerm);\n\twhile(scanf(\"%s\",text)!=EOF){\n\t\tfor(int i=0;i<=9;i++)count[i]=0;\n\t\tfor(int i=0;text[i]!='\\0';i++)count[text[i]-'0']++;\n\t\tbool isFirst=true;\n\t\t\n\t\tfor(int i=1;i<=9;i++){\n\t\t\tcount[i]++;\n\t\t\tif(all.find(count)!=all.end()){\n\t\t\t\tif(isFirst==true){\n\t\t\t\t\tisFirst=false;\n\t\t\t\t}else{\n\t\t\t\t\tprintf(\" \");\n\t\t\t\t}\n\t\t\t\tprintf(\"%d\",i);\n\t\t\t}\n\t\t\tcount[i]--;\n\t\t}\n\t\tprintf(\"%s\",isFirst?\"0\\n\":\"\\n\");\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":2480,"score_of_the_acc":-0.1818,"final_rank":10},{"submission_id":"aoj_0043_764761","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nvector<int> a(14),b(14);\nbool five();\nbool tempy(int x, int y);\nint main(){\n for(;;){\n vector<int> ans;\n if(scanf(\"%1d\",&a[0]) == EOF) break;\n for(int i=1; i<13; i++) scanf(\"%1d\",&a[i]);\n for(int i=1; i<=9; i++){\n a[13] = i;\n for(int j=0; j<14; j++) b[j] = a[j];\n sort(b.begin(),b.end());\n if(five()) continue;\n if(tempy(1,4)) ans.push_back(i); \n }\n if(ans.empty()) ans.push_back(0);\n for(int i=0; i<ans.size(); i++){\n if(i != 0) cout <<\" \";\n cout <<ans[i];\n }\n cout <<endl;\n }\n return 0;\n}\nbool five(){\n for(int i=0,j=0,k=0; i<14; i++){\n if(b[i] != j){j=b[i];k = 1;}\n else k++;\n if(k == 5) return true;\n }\n return false;\n}\nbool tempy(int x, int y){\n if(x == 0 && y == 0) return true;\n for(int i=0; i<14; i++){\n if(b[i] == 0) continue;\n if(x != 0){\n for(int j=i+1; j<14; j++){\n\tif(b[i] != b[j]) continue;\n\tint q = b[i];\n\tb[i] = b[j] = 0;\n\tif(tempy(0,y)) return true;\n\tb[i] = b[j] = q;\n\tbreak;\n }\n }\n if(y != 0){\n for(int j=i+1; j<14; j++){\n\tif(b[i] != b[j]) continue;\n\tfor(int k=j+1; k<14; k++){\n\t if(b[i] != b[k]) continue;\n\t int q = b[i];\n\t b[i] = b[j] = b[k] = 0;\n\t if(tempy(x,y-1)) return true;\n\t b[i] = b[j] = b[k] = q;\n\t goto flag_pon;\n\t}\n }\n flag_pon:;\n for(int j=i+1; j<14; j++){\n\tif(b[i]+1 != b[j]) continue;\n\tfor(int k=j+1; k<14; k++){\n\t if(b[i]+2 != b[k]) continue;\n\t int q = b[i];\n\t b[i] = b[j] = b[k] = 0;\n\t if(tempy(x,y-1)) return true;\n\t b[i] = q;b[j] = q+1;b[k] = q+2;\n\t goto flag_chi;\n\t}\n }\n flag_chi:;\n }\n }\n return false;\n}","accuracy":1,"time_ms":20,"memory_kb":1232,"score_of_the_acc":-0.0214,"final_rank":5},{"submission_id":"aoj_0043_582316","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nvector<int> h(14),a(13);\nvector<bool> hf(14);\nbool ten(int x, int y);\nint main(){\n string s;\n while(cin >>s){\n bool f = false;\n for(int i=0; i<13; i++) a[i] = s[i]-'0';\n for(int i=1; i<=9; i++){\n int lot[10]={0};\n bool ax = true;\n for(int j=0; j<13; j++) h[j] = a[j];\n h[13] = i;\n for(int j=0; j<14; j++){hf[j] = true;lot[h[j]]++;}\n for(int j=1; j<10; j++) if(lot[j]>4) ax = false;\n if(ax){\n\tsort(h.begin(),h.end());\n\tif(ten(4,1)){\n\t if(f) cout <<\" \";\n\t cout <<i;\n\t f = true;\n\t}\n }\n }\n if(!f) cout <<\"0\";\n cout <<endl;\n }\n return 0;\n}\nbool ten(int x, int y){\n bool f=false;\n if(x == 0 && y == 0) return true;\n for(int i=0; i<14; i++){\n if(hf[i]){\n if(y!=0){\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i] == h[j]){\n\t hf[i] = hf[j] = false;\n\t f|=ten(x,0);\n\t if(f) return f;\n\t hf[i] = hf[j] = true;\n\t break;\n\t }\n\t else if(h[i]!=h[j]) break;\n\t}\n }\n if(x!=0){\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i] == h[j]){\n\t for(int k=j+1; k<14; k++){\n\t if(hf[k] && h[i] == h[k]){\n\t\thf[i] =\thf[j] = hf[k] = false;\n\t\tf|=ten(x-1,y);\n\t\tif(f) return f;\n\t\thf[i] = hf[j] = hf[k] = true;\n\t\tbreak;\n\t }\n\t else if(h[i]!=h[k]) break;\n\t }\n\t }\n\t else if(h[i]!=h[j]) break;\n\t}\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i]+1 == h[j]){\n\t for(int k=j+1; k<14; k++){\n\t if(hf[k] && h[i]+2 == h[k]){\n\t\thf[i] =\thf[j] = hf[k] = false;\n\t\tf|=ten(x-1,y);\n\t\tif(f) return f;\n\t\thf[i] = hf[j] = hf[k] = true;\n\t\tbreak;\n\t }\n\t else if(h[i]+2<h[k]) break;\n\t }\n\t }\n\t else if(h[i]+1<h[j]) break;\n\t}\n }\n }\n }\n return f;\n}","accuracy":1,"time_ms":40,"memory_kb":1200,"score_of_the_acc":-0.0464,"final_rank":8},{"submission_id":"aoj_0043_582313","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nvector<int> h(14);\nvector<bool> hf(14);\nbool ten(int x, int y);\nint main(){\n string s;\n while(cin >>s){\n bool f = false;\n vector<int> a(13);\n for(int i=0; i<13; i++) a[i] = s[i]-'0';\n for(int i=1; i<=9; i++){\n int lot[10]={0};\n bool ax = true;\n for(int j=0; j<13; j++) h[j] = a[j];\n h[13] = i;\n for(int j=0; j<14; j++){\n\thf[j] = true;\n\tlot[h[j]]++;\n }\n for(int j=1; j<10; j++) if(lot[j]>4) ax = false;\n if(ax){\n\tsort(h.begin(),h.end());\n\tif(ten(4,1)){\n\t if(f) cout <<\" \";\n\t cout <<i;\n\t f = true;\n\t}\n }\n }\n if(!f) cout <<\"0\";\n cout <<endl;\n }\n return 0;\n}\nbool ten(int x, int y){\n bool f=false;\n if(x == 0 && y == 0) return true;\n for(int i=0; i<14; i++){\n if(hf[i]){\n if(y!=0){\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i] == h[j]){\n\t hf[i] = false;\n\t hf[j] = false;\n\t f|=ten(x,0);\n\t if(f) return f;\n\t hf[i] = true;\n\t hf[j] = true;\n\t break;\n\t }\n\t else if(h[i]!=h[j]) break;\n\t}\n }\n if(x!=0){\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i] == h[j]){\n\t for(int k=j+1; k<14; k++){\n\t if(hf[k] && h[i] == h[k]){\n\t\thf[i] = false;\n\t\thf[j] = false;\n\t\thf[k] = false;\n\t\tf|=ten(x-1,y);\n\t\tif(f) return f;\n\t\thf[i] = true;\n\t\thf[j] = true;\n\t\thf[k] = true;\n\t\tbreak;\n\t }\n\t else if(h[i]!=h[k]) break;\n\t }\n\t }\n\t else if(h[i]!=h[j]) break;\n\t}\n\tfor(int j=i+1; j<14; j++){\n\t if(hf[j] && h[i]+1 == h[j]){\n\t for(int k=j+1; k<14; k++){\n\t if(hf[k] && h[i]+2 == h[k]){\n\t\thf[i] = false;\n\t\thf[j] = false;\n\t\thf[k] = false;\n\t\tf|=ten(x-1,y);\n\t\tif(f) return f;\n\t\thf[i] = true;\n\t\thf[j] = true;\n\t\thf[k] = true;\n\t\tbreak;\n\t }\n\t else if(h[i]+2<h[k]) break;\n\t }\n\t }\n\t else if(h[i]+1<h[j]) break;\n\t}\n }\n }\n }\n return f;\n}","accuracy":1,"time_ms":50,"memory_kb":1200,"score_of_the_acc":-0.0611,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_0043_4893249\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)\\n#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい\\n#ifdef _DEBUG\\n#define PRE_COMMAND \\\\\\n std::cin.rdbuf(in.rdbuf()); \\\\\\n std::cout << fixed << setprecision(15);\\n#else\\n#define PRE_COMMAND cout << fixed << setprecision(15);\\n#endif\\nconst double EPS = 1e-10, PI = acos(-1.0);\\ntemplate <class T> auto MAX(T& seq) {\\n return *max_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto MIN(T& seq) {\\n return *min_element(seq.begin(), seq.end());\\n}\\ntemplate <class T> auto SUM(T& seq) {\\n T temp{0};\\n auto& temp2 = temp[0];\\n return accumulate(seq.begin(), seq.end(), temp2);\\n}\\ntemplate <class T> void SORT(T& seq) { sort(seq.begin(), seq.end()); }\\ntemplate <class T, class S> void SORT(T& seq, S& sort_order) {\\n sort(seq.begin(), seq.end(), sort_order);\\n}\\ntemplate <class T> void SORTR(vector<T>& seq) {\\n sort(seq.begin(), seq.end(), greater<T>());\\n}\\ntemplate <class T, class S, class R> long long pow(T n_0, S k_0, R mod_0) {\\n long long n = n_0 % mod_0, k = k_0, mod = mod_0, now = 1;\\n while (k) {\\n if (k & 1) now = (now * n) % mod;\\n n = (n * n) % mod;\\n k >>= 1;\\n }\\n return now;\\n}\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& vec) {\\n for (T& x : vec) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n if (!v.size()) return os;\\n typename vector<T>::const_iterator ii = v.begin();\\n os << *ii++;\\n for (; ii != v.end(); ++ii) os << \\\" \\\" << *ii;\\n return os;\\n}\\n\\n// カンマ区切りのデータをvector<int>に変換\\nvector<int> comma_sep(string inp) {\\n inp += ',';\\n vector<int> v;\\n string s = \\\"\\\";\\n for (char c : inp) {\\n if (c == ',') {\\n v.push_back(stoi(s));\\n s = \\\"\\\";\\n } else {\\n s += c;\\n }\\n }\\n return v;\\n}\\n\\ntemplate <class S> map<S, int> Counter(vector<S>& v) {\\n map<S, int> ret;\\n for (auto i : v) { ret[i]++; }\\n return ret;\\n}\\n\\nint main() {\\n PRE_COMMAND\\n set<vector<int>> ok_list;\\n vector<vector<int>> three_pair = {\\n {1, 2, 3}, {2, 3, 4}, {3, 4, 5}, {4, 5, 6}, {5, 6, 7}, {6, 7, 8},\\n {7, 8, 9}, {1, 1, 1}, {2, 2, 2}, {3, 3, 3}, {4, 4, 4}, {5, 5, 5},\\n {6, 6, 6}, {7, 7, 7}, {8, 8, 8}, {9, 9, 9}};\\n vector<vector<int>> two_pair = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5},\\n {6, 6}, {7, 7}, {8, 8}, {9, 9}};\\n vector<int> deck;\\n for (auto t1 : three_pair) {\\n for (auto t2 : three_pair) {\\n for (auto t3 : three_pair) {\\n for (auto t4 : three_pair) {\\n for (auto t5 : two_pair) {\\n deck = {};\\n for (int i : t1) deck.push_back(i);\\n for (int i : t2) deck.push_back(i);\\n for (int i : t3) deck.push_back(i);\\n for (int i : t4) deck.push_back(i);\\n for (int i : t5) deck.push_back(i);\\n map<int, int> c = Counter(deck);\\n bool flag = false;\\n for (auto temp : c) {\\n if (get<1>(temp) > 4) flag = true;\\n }\\n if (flag) continue;\\n SORT(deck);\\n ok_list.insert(deck);\\n }\\n }\\n }\\n }\\n }\\n string s;\\n while (cin >> s) {\\n vector<int> now, ans;\\n for (int i = 0; i < 13; i++) now.push_back((int)(s[i] - '0'));\\n for (int i = 1; i < 10; i++) {\\n vector<int> now2 = now;\\n now2.push_back(i);\\n SORT(now2);\\n if (ok_list.count(now2)) ans.push_back(i);\\n }\\n if (ans.size()) {\\n cout << ans << endl;\\n } else {\\n cout << 0 << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 4816,\n \"score_of_the_acc\": -0.8331,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0043_4357252\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <iomanip>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n\\nstatic const int MOD = 1000000007;\\nusing ll = long long;\\nusing u32 = uint32_t;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\n\\nbool solve(string s){\\n map<int, int> m;\\n for (auto &&i : s) {\\n m[i]++;\\n }\\n sort(s.begin(),s.end());\\n vector<string> v, u;\\n for (int i = 1; i <= 9; ++i) {\\n v.emplace_back(3, (char)(i+'0'));\\n u.emplace_back(2, (char)(i+'0'));\\n }\\n for (int i = 1; i < 8; ++i) {\\n string t;\\n for (int j = 0; j < 3; ++j) {\\n t += (char)(i+j+'0');\\n }\\n v.emplace_back(t);\\n }\\n int n = v.size();\\n\\n for (int i = 0; i < n; ++i) {\\n for (int j = i; j < n; ++j) {\\n for (int k = j; k < n; ++k) {\\n for (int l = k; l < n; ++l) {\\n for (int o = 0; o < 9; ++o) {\\n string t = v[i]+v[j]+v[k]+v[l]+u[o];\\n sort(t.begin(),t.end());\\n if(s == t) return true;\\n }\\n }\\n }\\n }\\n }\\n return false;\\n}\\n\\nint main() {\\n string s;\\n while(getline(cin, s)){\\n sort(s.begin(),s.end());\\n map<int, int> cnt;\\n for (auto &&i : s) {\\n cnt[i-'0']++;\\n }\\n int b = 0;\\n for (int i = 1; i <= 9; ++i) {\\n if(cnt[i] < 4){\\n string t = s;\\n t += char(i + '0');\\n if(solve(t)) {\\n if(b++) cout << \\\" \\\";\\n cout << i;\\n }\\n }\\n }\\n if(!b) printf(\\\"0\\\");\\n puts(\\\"\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -1.1895,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0043_2896038\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\nbool serch(std::vector<int>&nums)\\n{\\n\\tconst int length = nums.size();\\n\\tstatic int found_hand = 0;\\n\\tswitch (found_hand)\\n\\t{\\n\\tcase 0:\\n\\t\\tint pair[2];\\n\\t\\tfor (int i = 0; i < length - 1; i++)\\n\\t\\t{\\n\\t\\t\\tfor (int j = i + 1; j < length; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (nums[i] == nums[j])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpair[0] = nums[i];\\n\\t\\t\\t\\t\\tpair[1] = nums[j];\\n\\t\\t\\t\\t\\tnums.erase(nums.begin() + j);\\n\\t\\t\\t\\t\\tnums.erase(nums.begin() + i);\\n\\t\\t\\t\\t\\tfound_hand++;\\n\\t\\t\\t\\t\\tif (serch(nums))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tnums.push_back(pair[0]);\\n\\t\\t\\t\\t\\t\\tnums.push_back(pair[1]);\\n\\t\\t\\t\\t\\t\\tstd::sort(nums.begin(), nums.end());\\n\\t\\t\\t\\t\\t\\tfound_hand--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbreak;\\n\\tdefault:\\n\\t\\tint trio[3];\\n\\t\\tfor (int i = 0; i < length - 2; i++)\\n\\t\\t{\\n\\t\\t\\tfor (int j = i + 1; j < length - 1; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int k = j + 1; k < length; k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (nums[i] == nums[j] && nums[j] == nums[k] || nums[j] == nums[i] + 1 && nums[k] == nums[j] + 1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\ttrio[0] = nums[i];\\n\\t\\t\\t\\t\\t\\ttrio[1] = nums[j];\\n\\t\\t\\t\\t\\t\\ttrio[2] = nums[k];\\n\\t\\t\\t\\t\\t\\tnums.erase(nums.begin() + k);\\n\\t\\t\\t\\t\\t\\tnums.erase(nums.begin() + j);\\n\\t\\t\\t\\t\\t\\tnums.erase(nums.begin() + i);\\n\\t\\t\\t\\t\\t\\tfound_hand++;\\n\\t\\t\\t\\t\\t\\tif (found_hand == 5 || serch(nums))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tfound_hand = 0;\\n\\t\\t\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tnums.push_back(trio[0]);\\n\\t\\t\\t\\t\\t\\t\\tnums.push_back(trio[1]);\\n\\t\\t\\t\\t\\t\\t\\tnums.push_back(trio[2]);\\n\\t\\t\\t\\t\\t\\t\\tstd::sort(nums.begin(), nums.end());\\n\\t\\t\\t\\t\\t\\t\\tfound_hand--;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbreak;\\n\\t}\\n\\treturn false;\\n}\\nint main()\\n{\\n\\tfor (std::string str; std::cin >> str;)\\n\\t{\\n\\t\\tstd::vector<int>ans;\\n\\t\\tans.reserve(9);\\n\\t\\tstd::vector<int>nums;\\n\\t\\tnums.reserve(14);\\n\\t\\tstd::vector<int>appearance_count(9, 0);\\n\\t\\tfor (auto i : str)\\n\\t\\t{\\n\\t\\t\\tconst int foo = static_cast<int>(i - '0');\\n\\t\\t\\tnums.push_back(foo);\\n\\t\\t\\tappearance_count[foo]++;\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= 9; i++)\\n\\t\\t{\\n\\t\\t\\tif (appearance_count[i] == 4)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tauto nums_copy = nums;\\n\\t\\t\\tnums_copy.push_back(i);\\n\\t\\t\\tstd::sort(nums_copy.begin(), nums_copy.end());\\n\\t\\t\\tif (serch(nums_copy))\\n\\t\\t\\t{\\n\\t\\t\\t\\tans.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans.size() == 0)\\n\\t\\t{\\n\\t\\t\\tstd::cout << '0';\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tfor (int i = 0; i < ans.size(); i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (i != 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstd::cout << ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstd::cout << ans[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::cout << std::endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2947,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0043_2140762\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nint d[14];\\nint memo[10][4][2][1 << 14];\\nbool solve(int p, int cnt, bool r,int u) {\\n\\tif (memo[p][cnt][r][u] != -1)return memo[p][cnt][r][u];\\n\\tbool ok = false;\\n\\tif (cnt == 3) {\\n\\t\\tint f = -1, s = -1;\\n\\t\\trep(i, 14) {\\n\\t\\t\\tif (!(u>>i&1)) {\\n\\t\\t\\t\\tif (f == -1)f = d[i];\\n\\t\\t\\t\\telse if (s == -1)s = d[i];\\n\\t\\t\\t\\telse ok = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok) {\\n\\t\\t\\tif (f == s)return memo[p][cnt][r][u]=true;\\n\\t\\t\\treturn memo[p][cnt][r][u]=false;\\n\\t\\t}\\n\\t\\tok = true; cnt = 0;\\n\\t}\\n\\trep(i, 14) {\\n\\t\\tif (!(u>>i&1) && (ok || (r&&d[i] == p + 1) || (!r&&d[i] == p))) {\\n\\t\\t\\tu |= 1 << i;\\n\\t\\t\\tif (solve(d[i], cnt + 1, r,u))return memo[p][cnt][r][u]=true;\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tif (solve(d[i], cnt + 1, !r,u))return memo[p][cnt][r][u]=true;\\n\\t\\t\\t}\\n\\t\\t\\tu ^= 1 << i;\\n\\t\\t}\\n\\t}\\n\\treturn memo[p][cnt][r][u]=false;\\n}\\nint main() {\\n\\twhile (1) {\\n\\t\\tint cnt[10]{};\\n\\t\\trep(i, 13) {\\n\\t\\t\\tif (!~scanf(\\\"%1d\\\", &d[i]))return 0;\\n\\t\\t\\tcnt[d[i]]++;\\n\\t\\t}\\n\\t\\tbool flag = false;\\n\\t\\tfor (int i = 1; i <= 9; i++) {\\n\\t\\t\\tif (cnt[i] >= 4)continue;\\n\\t\\t\\td[13] = i;\\n\\t\\t\\tmemset(memo, -1, sizeof(memo));\\n\\t\\t\\tif (solve(0, 3, 0, 0)) {\\n\\t\\t\\t\\tif (flag)printf(\\\" \\\");\\n\\t\\t\\t\\tprintf(\\\"%d\\\", i);\\n\\t\\t\\t\\tflag = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!flag)printf(\\\"0\\\");\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 8312,\n \"score_of_the_acc\": -1.0441,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0043_2140759\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nint d[14];\\nbool used[14];\\nbool solve(int p, int cnt, bool r) {\\n\\tbool ok = false;\\n\\tif (cnt == 3) {\\n\\t\\tint f = -1, s = -1;\\n\\t\\trep(i, 14) {\\n\\t\\t\\tif (!used[i]) {\\n\\t\\t\\t\\tif (f == -1)f = d[i];\\n\\t\\t\\t\\telse if (s == -1)s = d[i];\\n\\t\\t\\t\\telse ok = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok) {\\n\\t\\t\\tif (f == s)return true;\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tok = true; cnt = 0;\\n\\t}\\n\\trep(i, 14) {\\n\\t\\tif (!used[i] && (ok || (r&&d[i] == p + 1) || (!r&&d[i] == p))) {\\n\\t\\t\\tused[i] = true;\\n\\t\\t\\tif (solve(d[i], cnt + 1, r))return true;\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tif (solve(d[i], cnt + 1, !r))return true;\\n\\t\\t\\t}\\n\\t\\t\\tused[i] = false;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nint main(){\\n\\twhile (1) {\\n\\t\\tint cnt[10]{};\\n\\t\\trep(i, 13) {\\n\\t\\t\\tif (!~scanf(\\\"%1d\\\", &d[i]))return 0;\\n\\t\\t\\tcnt[d[i]]++;\\n\\t\\t}\\n\\t\\tbool flag = false;\\n\\t\\tfor (int i = 1; i <= 9; i++) {\\n\\t\\t\\tif (cnt[i] >= 4)continue;\\n\\t\\t\\td[13] = i;\\n\\t\\t\\tmemset(used, 0, sizeof(used));\\n\\t\\t\\tif (solve(0, 3, 0)) {\\n\\t\\t\\t\\tif (flag)printf(\\\" \\\");\\n\\t\\t\\t\\tprintf(\\\"%d\\\", i);\\n\\t\\t\\t\\tflag = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!flag)printf(\\\"0\\\");\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -1.0149,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0043_1979953\",\n \"code_snippet\": \"#define\\t_USE_MATH_DEFINES\\n#include <iostream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\n#include <vector>\\n#include <cstdio>\\n#include <cstring>\\n#include <cmath>\\n#include <cfloat>\\n#include <map>\\n#include <queue>\\n#include <stack>\\n#include <list>\\n#include <string>\\n#include <set>\\n#include <complex>\\n#include <utility>\\n#include <numeric>\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define REP(i,a,n) for(int i=a;i<(n);i++)\\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\\n#define VI\\tvector<int>\\n#define\\t VS vector<string>\\n#define all(a) (a).begin(),(a).end()\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst int INF=1e9;\\nchar fi[101][101];\\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\\ndouble EPS = 1e-10;\\nint N,M;\\nint sx,sy;\\nint gx,gy;\\nint w,h;\\nint ans;\\nint dx[4]={0,0,-1,1};\\nint dy[4]={-1,1,0,0};\\nconst int MAX_V=100;\\nconst int MAX_N=100;\\nchar o[3]={'+','-','*'};\\n#define md 1000003\\n\\n\\nint dp[353][353]={0};\\nint bow[353][353]={0};\\ndouble add(double a,double b){\\n\\tif(abs(a+b)<EPS*(abs(a)+abs(b)))\\n\\treturn 0;\\n\\treturn a+b;\\n}\\n\\nstruct P{\\n\\tdouble x,y;\\n\\tP(){}\\n\\t\\tP(double x,double y):x(x),y(y){\\n\\t\\t}\\n\\t\\tP operator + (P p){\\n\\t\\t\\treturn P(add(x,p.x),add(y,p.y));\\n\\t\\t}\\n\\t\\tP operator - (P p){\\n\\t\\t\\treturn P(add(x,-p.x),add(y,-p.y));\\n\\t\\t}\\n\\t\\tP operator *(double d){\\n\\t\\t\\treturn P(x*d,y*d);\\n\\t\\t}\\n\\t\\tdouble dot(P p){\\n\\t\\t\\treturn add(x*p.x,y*p.y);\\n\\t\\t}\\n\\t\\tdouble det(P p){\\n\\t\\t\\treturn add(x*p.y,-y*p.x);\\n\\t\\t}\\n};\\n\\nbool cmp_x(const P& p,const P& q){\\n\\tif(p.x!=q.x) return p.x<q.x;\\n\\treturn p.y<q.y;\\n}\\n\\nvector<P> convex_hull(P* ps, int n){\\n\\tsort(ps,ps+n,cmp_x);\\n\\tint k=0;\\n\\tvector<P> \\tqs(n*2);\\n\\t\\n\\trep(i,n){\\n\\t\\twhile(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)\\n\\t\\t\\tk--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\tfor(int i=n-2,t=k;i>=0;i--){\\n\\t\\twhile(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)\\n\\t\\tk--;\\n\\t\\tqs[k++]=ps[i];\\n\\t}\\n\\tqs.resize(k-1);\\n\\treturn qs;\\n}\\n\\nint n,m;\\nvector<double> p;\\nP ps[101];\\nchar c[520][520];\\nlong long mod=1000000007;\\nlong long pow(ll i,ll j){\\n\\tll tmp=1;\\n\\twhile(j){\\n\\t\\tif(j%2) tmp=tmp*i%mod;\\n\\t\\ti=i*i%mod;\\n\\t\\tj/=2;\\n\\t}\\n\\treturn tmp;\\n}\\nint cards[10];\\nbool ok;\\nvoid saiki(int deep){\\n\\tif(deep==4){\\n\\t\\tok=true;\\n\\t\\treturn;\\n\\t}\\n\\tfor(int i=1;i<=7;i++){\\n\\t\\tif(cards[i]>0&&cards[i+1]>0&&cards[i+2]>0){\\n\\t\\t\\tcards[i]--;\\n\\t\\t\\tcards[i+1]--;\\n\\t\\t\\tcards[i+2]--;\\n\\t\\t\\tsaiki(deep+1);\\n\\t\\t\\tcards[i]++;\\n\\t\\t\\tcards[i+1]++;\\n\\t\\t\\tcards[i+2]++;\\n\\t\\t}\\n\\t\\tfor(int i=1;i<=9;i++){\\n\\t\\t\\tif(cards[i]>2){\\n\\t\\t\\t\\tcards[i]-=3;\\n\\t\\t\\t\\tsaiki(deep+1);\\n\\t\\t\\t\\tcards[i]+=3;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n}\\n\\nint main(){\\n\\t\\n\\tstring s;\\n\\twhile(cin>>s){\\n\\t\\tfor(int i=0;i<=9;i++){\\n\\t\\t\\tcards[i]=0;\\n\\t\\t}\\n\\t\\tqueue<int> a;\\n\\t\\tbool f=false;\\n\\t\\t\\n\\trep(i,s.size()){\\n\\t\\tcards[s[i]-'0']++;\\n\\t\\tif(cards[s[i]-'0']>4){\\n\\t\\t\\tf=true;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\t\\tif(!f){\\n\\tfor(int i=1;i<=9;i++){\\n\\t\\tif(cards[i]<4){\\n\\t\\t\\tok=false;\\n\\t\\t\\tcards[i]++;\\n\\t\\t\\tfor(int j=1;j<=9;j++){\\n\\t\\t\\t\\tif(cards[j]>1){\\n\\t\\t\\t\\t\\tcards[j]-=2;\\n\\t\\t\\t\\t\\tsaiki(0);\\n\\t\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\t\\ta.push(i);\\n\\t\\t\\t\\t\\t\\tcards[j]+=2;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcards[j]+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcards[i]--;\\n\\t\\t}\\n\\t\\t\\t\\n\\t}\\n\\t}\\n\\t\\tif(f||a.empty())\\n\\t\\t\\tcout<<0<<endl;\\n\\telse{\\n\\t\\tcout<<a.front();\\n\\t\\ta.pop();\\n\\t\\twhile(!a.empty()){\\n\\t\\t\\tcout<<\\\" \\\"<<a.front();\\n\\t\\t\\ta.pop();\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t\\t\\n\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.0164,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0043_1841027\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<string>\\nusing namespace std;\\nqueue<vector<int> >Q;\\nstring S; int p[14];\\nint main() {\\n\\twhile (cin >> S) {\\n\\t\\tvector<int>s; int g[10] = { 0,0,0,0,0,0,0,0,0,0 };\\n\\t\\tfor (int i = 0; i < 13; i++) {\\n\\t\\t\\tp[i] = S[i] - '0'; g[p[i]]++;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 10; i++)s.push_back(g[i]);\\n\\t\\ts.push_back(1); int f[10] = { 0,0,0,0,0,0,0,0,0,0 };\\n\\t\\tfor (int h = 1; h < 10; h++) {\\n\\t\\t\\ts[h]++; Q.push(s); int OK = 0;\\n\\t\\t\\twhile (!Q.empty()) {\\n\\t\\t\\t\\tvector<int>t = Q.front(), u; Q.pop(); int sum = 0;\\n\\t\\t\\t\\tfor (int i = 0; i < 10; i++) sum += t[i];\\n\\t\\t\\t\\tif (sum == 0)OK = 1;\\n\\t\\t\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\t\\t\\tif (t[i] >= 2 && t[10] >= 1) { u = t; u[i] -= 2; u[10] = 0; Q.push(u); }\\n\\t\\t\\t\\t\\tif (t[i] >= 3) { u = t; u[i] -= 3; Q.push(u); }\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int i = 0; i < 8; i++) {\\n\\t\\t\\t\\t\\tif (t[i] >= 1 && t[i + 1] >= 1 && t[i + 2] >= 1) {\\n\\t\\t\\t\\t\\t\\tu = t; u[i] -= 1; u[i + 1] -= 1; u[i + 2] -= 1; Q.push(u);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\t\\tif (s[h] >= 5)OK = 0;\\n\\t\\t\\t}\\n\\t\\t\\tf[h] = OK; s[h]--;\\n\\t\\t}\\n\\t\\tint V = 0;\\n\\t\\tfor (int i = 1; i < 10; i++) {\\n\\t\\t\\tif (f[i] == 1) {\\n\\t\\t\\t\\tif (V >= 1) { cout << ' '; }\\n\\t\\t\\t\\tcout << i; V++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (V == 0)cout << '0';\\n\\t\\tcout << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": -0.0118,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0043_1590651\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nint mentu[16][3] = {\\n\\t{1,1,1},{2,2,2},{3,3,3},{4,4,4},{5,5,5},{6,6,6},{7,7,7},{8,8,8},{9,9,9},\\n\\t{1,2,3},{2,3,4},{3,4,5},{4,5,6},{5,6,7},{6,7,8},{7,8,9}\\n};\\n\\nint main(){\\n\\t\\n\\tstring str;\\n\\t\\n\\twhile(true){\\n\\t\\t\\n\\t\\tint num[10], num_1[10], dummy[10];\\n\\t\\t\\n\\t\\tbool ans[10];\\n\\t\\t\\n\\t\\tcin >> str;\\n\\t\\tif(cin.eof()){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < 10; i++){\\n\\t\\t\\tnum[i] = 0;\\n\\t\\t\\tans[i] = false;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < str.size(); i++){\\n\\t\\t\\tnum[str[i] - '0']++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int rest = 1; rest <= 9; rest++){\\n\\t\\t\\tfor(int i = 0; i < 10; i++){\\n\\t\\t\\t\\tnum_1[i] = num[i];\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(num_1[rest] >= 4){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tnum_1[rest]++;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < 16; i++){\\n\\t\\t\\t\\tfor(int j = i; j < 16; j++){\\n\\t\\t\\t\\t\\tfor(int k = j; k < 16; k++){\\n\\t\\t\\t\\t\\t\\tfor(int l = k; l < 16; l++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int m = 1; m <= 9; m++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int b = 1; b <= 9; b++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdummy[b] = 0;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int a = 0; a < 3; a++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdummy[mentu[i][a]]++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdummy[mentu[j][a]]++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdummy[mentu[k][a]]++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdummy[mentu[l][a]]++;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tdummy[m] += 2;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int b = 1; b <= 9; b++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(num_1[b] != dummy[b]){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(b == 9){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tans[rest] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t/*\\n\\t\\t\\tcout << \\\" \\\";\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 1; i <= 9; i++){\\n\\t\\t\\t\\tcout << dummy[i];\\n\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tint loop;\\n\\t\\t\\n\\t\\tbool found;\\n\\t\\t\\n\\t\\tfound = false;\\n\\t\\t\\n\\t\\tfor(loop = 1; loop <= 9; loop++){\\n\\t\\t\\tif(ans[loop]){\\n\\t\\t\\t\\tcout << loop;\\n\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(loop = loop + 1; loop <= 9; loop++){\\n\\t\\t\\tif(ans[loop]){\\n\\t\\t\\t\\tcout << \\\" \\\" << loop;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(!found){\\n\\t\\t\\tcout << \\\"0\\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t\\t\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1184,\n \"score_of_the_acc\": -0.0441,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0043_1360445\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\ntypedef unsigned long long ull;\\n#define loop(i,a,b) for(int i=(a);i<ull(b);++i)\\n#define rep(i,n) loop(i,0,n)\\n#define all(a) (a).begin(), (a).end()\\n\\nbool ok(int i, int j){\\n\\treturn i == j && i < 9;\\n}\\n\\nint main(){\\n\\tstring s;\\n\\tvector<vector<int> > a, b;\\n\\tfor(int i=1; i < 10; i++){\\n\\t\\tvector<int> v;\\n\\t\\tfor(int j=0; j< 2; j++) v.push_back(i);\\n\\t\\tb.push_back(v);\\n\\t\\tv.push_back(i);\\n\\t\\ta.push_back(v);\\n\\t}\\n\\tfor(int i=1; i <= 7; i++){\\n\\t\\tvector<int> v;\\n\\t\\tfor(int j=0; j < 3; j++) v.push_back(i+j);\\n\\t\\ta.push_back(v);\\n\\t}\\n\\n\\twhile(cin >> s){\\n\\t\\tint c[10] = {0};\\n\\t\\tfor(int i=0; i < s.size(); i++) c[s[i]-'0']++;\\n\\t\\tstring t = \\\"123456789\\\";\\n\\n\\t\\tvector<int> ret;\\n\\t\\trep(q, t.size()){\\n\\t\\t\\tc[t[q]-'0']++;\\n\\t\\t\\tbool p = true;\\n\\t\\t\\trep(i, 10) if(4 < c[i]){c[t[q]-'0']--; p = false; break;}\\n\\t\\t\\tif(!p) continue;\\n\\t\\t\\tloop(i, 0, a.size())loop(j, 0, a.size()){\\n\\t\\t\\t\\tif(ok(i, j)) continue;\\n\\t\\t\\t\\tloop(k, 0, a.size()){\\n\\t\\t\\t\\t\\tif(ok(j, k) || ok(i, k)) continue;\\n\\t\\t\\t\\t\\tloop(l, 0, a.size()){\\n\\t\\t\\t\\t\\t\\tif(ok(i, l) || ok(j, l) || ok(k, l)) continue;\\n\\t\\t\\t\\t\\t\\trep(m, b.size()){\\n\\t\\t\\t\\t\\t\\t\\tif(i == m || j == m || k == m || l == m) continue;\\n\\t\\t\\t\\t\\t\\t\\tint d[10] = {0};\\n\\t\\t\\t\\t\\t\\t\\trep(n, 3){d[a[i][n]]++; d[a[j][n]]++; d[a[k][n]]++; d[a[l][n]]++;}\\n\\t\\t\\t\\t\\t\\t\\trep(n, 2) d[b[m][n]]++;\\n\\t\\t\\t\\t\\t\\t\\tbool possible = true;\\n\\t\\t\\t\\t\\t\\t\\trep(n, 10) if(c[n] != d[n]){possible = false; break;}\\n\\t\\t\\t\\t\\t\\t\\tif(possible) ret.push_back(q+1);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tc[t[q]-'0']--;\\n\\t\\t}\\n\\t\\tint n = -1;\\n\\t\\trep(i, ret.size()){\\n\\t\\t\\tif(n != ret[i]){cout << (i == 0 ? \\\"\\\" : \\\" \\\") << ret[i]; n = ret[i];}\\n\\t\\t}\\n\\t\\tif(n == -1) cout << 0;\\n\\t\\tcout << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -1.0062,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0043_1242837\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <map>\\n#include <bitset>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <climits>\\n\\nusing namespace std;\\n\\ntypedef map<int, int> Num;\\n\\nint check2(Num a) {\\n\\tint sum = 0;\\n\\tfor (int i = 1; i <= 9; i++)\\n\\t\\tsum += a[i];\\n\\treturn sum;\\n}\\n\\nvoid check1(Num a, int n, int *ans) {\\n\\tif (check2(a) == 0) {\\n\\t\\t*ans |= (0x01 << n);\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor (int i = 1; i <= 9; i++) {\\n\\t\\tif (a[i] >= 3) {\\n\\t\\t\\ta[i] -= 3;\\n\\t\\t\\tcheck1(a, n, ans);\\n\\t\\t\\ta[i] += 3;\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 3; i <= 9; i++) {\\n\\t\\tif (a[i-2] && a[i-1] && a[i]) {\\n\\t\\t\\ta[i-2] -= 1;\\n\\t\\t\\ta[i-1] -= 1;\\n\\t\\t\\ta[i] -= 1;\\n\\t\\t\\tcheck1(a, n, ans);\\n\\t\\t\\ta[i-2] += 1;\\n\\t\\t\\ta[i-1] += 1;\\n\\t\\t\\ta[i] += 1;\\n\\t\\t}\\n\\t}\\n}\\n\\nint solve(Num a) {\\n\\tint ans = 0;\\n\\tfor (int i = 1; i <= 9; i++) {\\n\\t\\tif (a[i] == 4) continue;\\n\\n\\t\\ta[i]++;\\n\\t\\tfor (int j = 1; j <= 9; j++)\\n\\t\\t\\tif (a[j] > 1) {\\n\\t\\t\\t\\ta[j] -= 2;\\n\\t\\t\\t\\tcheck1(a, i, &ans);\\n\\t\\t\\t\\ta[j] += 2;\\n\\t\\t\\t}\\n\\t\\ta[i]--;\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tstring str;\\n\\twhile (cin >> str) {\\n\\t\\tNum a;\\n\\t\\tfor (int i = 1; i <= 9; i++)\\n\\t\\t\\ta[i] = 0;\\n\\t\\tfor (int i = 0; i < str.size(); i++) {\\n\\t\\t\\tint s = str[i] - '0';\\n\\t\\t\\ta[s]++;\\n\\t\\t}\\n\\t\\tint ans = solve(a);\\n\\t\\tif (ans == 0)\\n\\t\\t\\tcout << 0 << endl;\\n\\t\\telse {\\n\\t\\t\\tint ifs = 0;\\n\\t\\t\\tfor (int i = 1; i <= 9; i++) {\\n\\t\\t\\t\\tif (ans & (0x01 << i))\\n\\t\\t\\t\\t\\tcout << ((ifs++) ? \\\" \\\" : \\\"\\\") << i;\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.0153,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0043_1091760\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <map>\\n#include <vector>\\nusing namespace std;\\n\\nstring str;\\n\\nbool c (map<char,int> m) {\\n for (auto i = m.begin(); i != m.end(); i++) {\\n if (i->second != 0) return false;\\n }\\n return true;\\n}\\n\\nbool dfs(map<char,int> m) {\\n if (c(m)) return true;\\n for (char i = '1'; i <= '9'; i++) {\\n if (m[i] >= 3) {\\n m[i] -= 3;\\n if (dfs (m)) return true;;\\n m[i] += 3;\\n }\\n if (i + 2 <= '9' && m[i] > 0 && m[i+1] > 0 && m[i+2] > 0) {\\n m[i]--; m[i + 1]--; m[i + 2]--;\\n if (dfs(m)) return true;\\n m[i]++; m[i + 1]++; m[i + 2]++;\\n }\\n }\\n return false;\\n}\\n\\nint main ()\\n{\\n while (cin >> str) {\\n map<char,int> m;\\n for (char i = '1' ; i <= '9'; i++) m[i] = 0;\\n for (int i = 0; i < str.size(); i++) {\\n m[str[i]]++;\\n }\\n\\n vector<char> res;\\n for (char i = '1'; i <= '9'; i++) {\\n if (m[i] >= 4) continue;\\n m[i]++;\\n for (char j = '1'; j <= '9'; j++) {\\n if (m[j] >= 2) {\\n m[j] -= 2;\\n if (dfs(m)) {\\n res.push_back(i);\\n m[j] += 2;\\n break;\\n }\\n m[j] += 2;\\n }\\n }\\n m[i]--;\\n }\\n if (res.size()) {\\n cout << res[0];\\n for (int i = 1; i < res.size(); i++) cout << \\\" \\\" << res[i];\\n } else cout << 0;\\n cout << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.0028,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0043_1053767\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <numeric>\\n#include <utility>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vint;\\ntypedef vector<long long> vll;\\ntypedef pair<int,int> pint;\\ntypedef pair<long long, long long> pll;\\n\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(s) (s).begin(),(s).end()\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s << endl; }\\n\\n\\nstring str;\\nset<vint> se;\\n\\nint main() {\\n se.clear();\\n \\n int j[4];\\n for (int i = 1; i <= 9; ++i) {\\n for (j[0] = 1; j[0] <= 16; ++j[0]) {\\n for (j[1] = 1; j[1] <= 16; ++j[1]) {\\n for (j[2] = 1; j[2] <= 16; ++j[2]) {\\n for (j[3] = 1; j[3] <= 16; ++j[3]) {\\n vint tmp(9, 0);\\n tmp[i-1] = 2;\\n for (int k = 0; k < 4; ++k) {\\n if (j[k] <= 9) tmp[j[k]-1] += 3;\\n else {\\n tmp[j[k]-10]++;\\n tmp[j[k]-9]++;\\n tmp[j[k]-8]++;\\n }\\n }\\n bool check = true;\\n for (int l = 0; l < 9; ++l) if (tmp[l] > 4) check = false;\\n if (check) se.insert(tmp);\\n }\\n }\\n }\\n }\\n }\\n \\n while (cin >> str) {\\n vint vec(9, 0);\\n for (int i = 0; i < str.size(); ++i) vec[ str[i]-'1' ]++;\\n vint res;\\n for (int add = 1; add <= 9; ++add) {\\n vint tmp = vec;\\n tmp[add-1]++;\\n if (se.count(tmp)) res.PB(add);\\n }\\n \\n if (res.size() == 0) cout << \\\"0\\\";\\n else {\\n for (int i = 0; i < res.size(); ++i) {\\n cout << res[i];\\n if (i != res.size()-1) cout << \\\" \\\";\\n }\\n }\\n cout << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 2660,\n \"score_of_the_acc\": -0.2953,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0043_948775\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef map<char, int> State;\\n\\nbool finished(State &m){\\n for(char c = '1' ; c <= '9' ; c++){\\n if(m[c]) return false;\\n }\\n return true;\\n}\\n\\nbool bfs(string s){\\n State start;\\n for(int i = 0 ; i < (int)s.size() ; i++){\\n start[s[i]]++;\\n if(start[s[i]] > 4) return false;\\n }\\n queue<State> que;\\n for(char c = '1' ; c <= '9' ; c++){\\n if(start[c] >= 2){\\n State nex = start;\\n nex[c] -= 2;\\n que.push(nex); \\n }\\n }\\n \\n while(!que.empty()){\\n State q = que.front(); que.pop();\\n \\n if(finished(q)) return true;\\n \\n for(char c = '1' ; c <= '9' ; c++){\\n if(q[c] >= 3){\\n\\tState nex = q;\\n\\tnex[c] -= 3;\\n\\tque.push(nex);\\n }\\n }\\n for(char c = '1' ; c <= '7' ; c++){\\n if(q[c] >= 1 && q[c+1] >= 1 && q[c+2] >= 1){\\n\\tState nex = q;\\n\\tnex[c] -= 1, nex[c+1] -= 1, nex[c+2] -= 1;\\n\\tque.push(nex);\\n }\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n string s;\\n while(cin >> s){\\n vector<char> ans;\\n for(char c = '1' ; c <= '9' ; c++){\\n if(bfs(s + c)) ans.push_back(c);\\n }\\n if(ans.size() == 0) cout << 0 << endl;\\n else{\\n for(int i = 0 ; i < (int)ans.size() ; i++){\\n\\tcout << ans[i];\\n\\tif(i == (int)ans.size()-1) cout << endl;\\n\\telse cout << ' ';\\n }\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -0.0293,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0043_899145\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nvector<int> a(14);\\nbool solve(int x, int y);\\nint main(){\\n string s;\\n while(cin >>s){\\n vector<int> ans;\\n for(int i=1; i<10; i++){\\n int n[10]={};\\n bool f = true;\\n for(int j=0; j<s.size(); j++) a[j] = s[j]-'0';\\n a[13] = i;\\n sort(a.begin(),a.end());\\n for(int j=0; j<a.size(); j++) n[a[j]]++;\\n for(int j=1; j<10; j++) if(n[j]>4) f = false;\\n if(f) if(solve(1,4)) ans.push_back(i);\\n }\\n if(ans.size() == 0) cout <<\\\"0\\\"<<endl;\\n else{\\n for(int i=0; i<ans.size(); i++){\\n\\tif(i != 0) cout <<\\\" \\\";\\n\\tcout <<ans[i];\\n }\\n cout <<endl;\\n }\\n }\\n}\\nbool solve(int x, int y){\\n int ans = false;\\n if(x == 0 && y == 0) return true;\\n if(x == 1){\\n for(int i=0; i<13; i++){\\n if(a[i] == -1) continue;\\n if(a[i] == a[i+1]){\\n\\tint sc = a[i];\\n\\ta[i] = a[i+1] = -1;\\n\\tans = ans|solve(0,y);\\n\\ta[i] = a[i+1] = sc;\\n }\\n }\\n }\\n if(y != 0){\\n for(int i=0; i<12; i++){\\n if(a[i] == -1) continue;\\n if(a[i] == a[i+1] && a[i+1] == a[i+2]){\\n\\tint sc = a[i];\\n\\ta[i] = a[i+1] = a[i+2] = -1;\\n\\tans = ans|solve(x,y-1);\\n\\ta[i] = a[i+1] = a[i+2] = sc;\\n }\\n for(int j=i+1; j<13; j++){\\n\\tif(a[j]!=a[i]+1) continue;\\n\\tfor(int k=j+1; k<14; k++){\\n\\t if(a[k]!=a[j]+1) continue;\\n\\t int sc = a[i];\\n\\t a[i] = a[j] = a[k] = -1;\\n\\t ans = ans|solve(x,y-1);\\n\\t a[i] = sc; a[j] = sc+1; a[k] = sc+2;\\n\\t}\\n }\\n }\\n }\\n return ans;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 1204,\n \"score_of_the_acc\": -0.2381,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0043_860578\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\n#include<set>\\n#include<vector>\\n\\nstd::set<std::vector<int> > all;\\n\\nvoid search(std::vector<int> count,int p,int cPerm[2]){\\n\\tif(p==10&&(cPerm[0]+cPerm[1]==0)){\\n\\t\\tall.insert(count);\\t\\t\\n\\t}else{\\n\\t\\tif(count[p]<=2&&cPerm[0]>0){\\n\\t\\t\\tcPerm[0]=0;\\n\\t\\t\\tcount[p]+=2;\\n\\t\\t\\tsearch(count,p,cPerm);\\n\\t\\t\\tcount[p]-=2;\\n\\t\\t\\tcPerm[0]=1;\\n\\t\\t}\\n\\t\\tif(count[p]<=1&&cPerm[1]>0){\\n\\t\\t\\tcPerm[1]--;\\n\\t\\t\\tcount[p]+=3;\\n\\t\\t\\tsearch(count,p,cPerm);\\n\\t\\t\\tcount[p]-=3;\\n\\t\\t\\tcPerm[1]++;\\n\\t\\t}\\n\\t\\tif(p<=7&&count[p]<4&&cPerm[1]>0){\\n\\t\\t\\tcPerm[1]--;\\n\\t\\t\\tcount[p]++;\\n\\t\\t\\tcount[p+1]++;\\n\\t\\t\\tcount[p+2]++;\\n\\t\\t\\tsearch(count,p,cPerm);\\n\\t\\t\\tcount[p]--;\\n\\t\\t\\tcount[p+1]--;\\n\\t\\t\\tcount[p+2]--;\\n\\t\\t\\tcPerm[1]++;\\n\\t\\t}\\n\\t\\tif(count[p]<=4)search(count,p+1,cPerm);\\n\\t}\\n}\\n\\nint main(){\\n\\tchar text[15];\\n\\tstd::vector<int> count;\\n\\tint cPerm[2]={1,4};\\n\\tfor(int i=0;i<=9;i++)count.push_back(0);\\n\\tsearch(count,1,cPerm);\\n\\twhile(scanf(\\\"%s\\\",text)!=EOF){\\n\\t\\tfor(int i=0;i<=9;i++)count[i]=0;\\n\\t\\tfor(int i=0;text[i]!='\\\\0';i++)count[text[i]-'0']++;\\n\\t\\tbool isFirst=true;\\n\\t\\t\\n\\t\\tfor(int i=1;i<=9;i++){\\n\\t\\t\\tcount[i]++;\\n\\t\\t\\tif(all.find(count)!=all.end()){\\n\\t\\t\\t\\tif(isFirst==true){\\n\\t\\t\\t\\t\\tisFirst=false;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tprintf(\\\" \\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%d\\\",i);\\n\\t\\t\\t}\\n\\t\\t\\tcount[i]--;\\n\\t\\t}\\n\\t\\tprintf(\\\"%s\\\",isFirst?\\\"0\\\\n\\\":\\\"\\\\n\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2480,\n \"score_of_the_acc\": -0.1818,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0043_764761\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nvector<int> a(14),b(14);\\nbool five();\\nbool tempy(int x, int y);\\nint main(){\\n for(;;){\\n vector<int> ans;\\n if(scanf(\\\"%1d\\\",&a[0]) == EOF) break;\\n for(int i=1; i<13; i++) scanf(\\\"%1d\\\",&a[i]);\\n for(int i=1; i<=9; i++){\\n a[13] = i;\\n for(int j=0; j<14; j++) b[j] = a[j];\\n sort(b.begin(),b.end());\\n if(five()) continue;\\n if(tempy(1,4)) ans.push_back(i); \\n }\\n if(ans.empty()) ans.push_back(0);\\n for(int i=0; i<ans.size(); i++){\\n if(i != 0) cout <<\\\" \\\";\\n cout <<ans[i];\\n }\\n cout <<endl;\\n }\\n return 0;\\n}\\nbool five(){\\n for(int i=0,j=0,k=0; i<14; i++){\\n if(b[i] != j){j=b[i];k = 1;}\\n else k++;\\n if(k == 5) return true;\\n }\\n return false;\\n}\\nbool tempy(int x, int y){\\n if(x == 0 && y == 0) return true;\\n for(int i=0; i<14; i++){\\n if(b[i] == 0) continue;\\n if(x != 0){\\n for(int j=i+1; j<14; j++){\\n\\tif(b[i] != b[j]) continue;\\n\\tint q = b[i];\\n\\tb[i] = b[j] = 0;\\n\\tif(tempy(0,y)) return true;\\n\\tb[i] = b[j] = q;\\n\\tbreak;\\n }\\n }\\n if(y != 0){\\n for(int j=i+1; j<14; j++){\\n\\tif(b[i] != b[j]) continue;\\n\\tfor(int k=j+1; k<14; k++){\\n\\t if(b[i] != b[k]) continue;\\n\\t int q = b[i];\\n\\t b[i] = b[j] = b[k] = 0;\\n\\t if(tempy(x,y-1)) return true;\\n\\t b[i] = b[j] = b[k] = q;\\n\\t goto flag_pon;\\n\\t}\\n }\\n flag_pon:;\\n for(int j=i+1; j<14; j++){\\n\\tif(b[i]+1 != b[j]) continue;\\n\\tfor(int k=j+1; k<14; k++){\\n\\t if(b[i]+2 != b[k]) continue;\\n\\t int q = b[i];\\n\\t b[i] = b[j] = b[k] = 0;\\n\\t if(tempy(x,y-1)) return true;\\n\\t b[i] = q;b[j] = q+1;b[k] = q+2;\\n\\t goto flag_chi;\\n\\t}\\n }\\n flag_chi:;\\n }\\n }\\n return false;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.0214,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0043_582316\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nvector<int> h(14),a(13);\\nvector<bool> hf(14);\\nbool ten(int x, int y);\\nint main(){\\n string s;\\n while(cin >>s){\\n bool f = false;\\n for(int i=0; i<13; i++) a[i] = s[i]-'0';\\n for(int i=1; i<=9; i++){\\n int lot[10]={0};\\n bool ax = true;\\n for(int j=0; j<13; j++) h[j] = a[j];\\n h[13] = i;\\n for(int j=0; j<14; j++){hf[j] = true;lot[h[j]]++;}\\n for(int j=1; j<10; j++) if(lot[j]>4) ax = false;\\n if(ax){\\n\\tsort(h.begin(),h.end());\\n\\tif(ten(4,1)){\\n\\t if(f) cout <<\\\" \\\";\\n\\t cout <<i;\\n\\t f = true;\\n\\t}\\n }\\n }\\n if(!f) cout <<\\\"0\\\";\\n cout <<endl;\\n }\\n return 0;\\n}\\nbool ten(int x, int y){\\n bool f=false;\\n if(x == 0 && y == 0) return true;\\n for(int i=0; i<14; i++){\\n if(hf[i]){\\n if(y!=0){\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i] == h[j]){\\n\\t hf[i] = hf[j] = false;\\n\\t f|=ten(x,0);\\n\\t if(f) return f;\\n\\t hf[i] = hf[j] = true;\\n\\t break;\\n\\t }\\n\\t else if(h[i]!=h[j]) break;\\n\\t}\\n }\\n if(x!=0){\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i] == h[j]){\\n\\t for(int k=j+1; k<14; k++){\\n\\t if(hf[k] && h[i] == h[k]){\\n\\t\\thf[i] =\\thf[j] = hf[k] = false;\\n\\t\\tf|=ten(x-1,y);\\n\\t\\tif(f) return f;\\n\\t\\thf[i] = hf[j] = hf[k] = true;\\n\\t\\tbreak;\\n\\t }\\n\\t else if(h[i]!=h[k]) break;\\n\\t }\\n\\t }\\n\\t else if(h[i]!=h[j]) break;\\n\\t}\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i]+1 == h[j]){\\n\\t for(int k=j+1; k<14; k++){\\n\\t if(hf[k] && h[i]+2 == h[k]){\\n\\t\\thf[i] =\\thf[j] = hf[k] = false;\\n\\t\\tf|=ten(x-1,y);\\n\\t\\tif(f) return f;\\n\\t\\thf[i] = hf[j] = hf[k] = true;\\n\\t\\tbreak;\\n\\t }\\n\\t else if(h[i]+2<h[k]) break;\\n\\t }\\n\\t }\\n\\t else if(h[i]+1<h[j]) break;\\n\\t}\\n }\\n }\\n }\\n return f;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.0464,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0043_582313\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nvector<int> h(14);\\nvector<bool> hf(14);\\nbool ten(int x, int y);\\nint main(){\\n string s;\\n while(cin >>s){\\n bool f = false;\\n vector<int> a(13);\\n for(int i=0; i<13; i++) a[i] = s[i]-'0';\\n for(int i=1; i<=9; i++){\\n int lot[10]={0};\\n bool ax = true;\\n for(int j=0; j<13; j++) h[j] = a[j];\\n h[13] = i;\\n for(int j=0; j<14; j++){\\n\\thf[j] = true;\\n\\tlot[h[j]]++;\\n }\\n for(int j=1; j<10; j++) if(lot[j]>4) ax = false;\\n if(ax){\\n\\tsort(h.begin(),h.end());\\n\\tif(ten(4,1)){\\n\\t if(f) cout <<\\\" \\\";\\n\\t cout <<i;\\n\\t f = true;\\n\\t}\\n }\\n }\\n if(!f) cout <<\\\"0\\\";\\n cout <<endl;\\n }\\n return 0;\\n}\\nbool ten(int x, int y){\\n bool f=false;\\n if(x == 0 && y == 0) return true;\\n for(int i=0; i<14; i++){\\n if(hf[i]){\\n if(y!=0){\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i] == h[j]){\\n\\t hf[i] = false;\\n\\t hf[j] = false;\\n\\t f|=ten(x,0);\\n\\t if(f) return f;\\n\\t hf[i] = true;\\n\\t hf[j] = true;\\n\\t break;\\n\\t }\\n\\t else if(h[i]!=h[j]) break;\\n\\t}\\n }\\n if(x!=0){\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i] == h[j]){\\n\\t for(int k=j+1; k<14; k++){\\n\\t if(hf[k] && h[i] == h[k]){\\n\\t\\thf[i] = false;\\n\\t\\thf[j] = false;\\n\\t\\thf[k] = false;\\n\\t\\tf|=ten(x-1,y);\\n\\t\\tif(f) return f;\\n\\t\\thf[i] = true;\\n\\t\\thf[j] = true;\\n\\t\\thf[k] = true;\\n\\t\\tbreak;\\n\\t }\\n\\t else if(h[i]!=h[k]) break;\\n\\t }\\n\\t }\\n\\t else if(h[i]!=h[j]) break;\\n\\t}\\n\\tfor(int j=i+1; j<14; j++){\\n\\t if(hf[j] && h[i]+1 == h[j]){\\n\\t for(int k=j+1; k<14; k++){\\n\\t if(hf[k] && h[i]+2 == h[k]){\\n\\t\\thf[i] = false;\\n\\t\\thf[j] = false;\\n\\t\\thf[k] = false;\\n\\t\\tf|=ten(x-1,y);\\n\\t\\tif(f) return f;\\n\\t\\thf[i] = true;\\n\\t\\thf[j] = true;\\n\\t\\thf[k] = true;\\n\\t\\tbreak;\\n\\t }\\n\\t else if(h[i]+2<h[k]) break;\\n\\t }\\n\\t }\\n\\t else if(h[i]+1<h[j]) break;\\n\\t}\\n }\\n }\\n }\\n return f;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.0611,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":97,"cells":{"group_id":{"kind":"string","value":"aoj_0072_cpp"},"problem_description":{"kind":"string","value":"灯篭\n会津若松市は「歴史の町」として知られています。今から約 400 年前、蒲生氏郷により城下町の骨格が作られましたが、その後、徳川三代将軍家光公の異母弟「保科正之」公を藩祖とする会津藩 23 万石の中心都市として発展しました。今でも市内のいたるところに史跡や昔日の面影が残っているため、毎年、全国から多くの観光客が訪れています。\n今年は、ＮＨＫ大河ドラマで「新選組！」が放送されているため、新選組ゆかりの地(*1)として、大幅に観光客が増加しています。そこで市では、市内に点在する史跡を結ぶ通り沿いに 100 m 間隔で灯篭を設置して飾りたてることにしました。灯篭を飾ってある通りを辿れば市内の全ての史跡に到達できるように設置することが条件ですが、一筆書きでたどれる必要はありません。しかし、予算が限られているので設置する灯篭の数を最小限にする必要があります。\n史跡と史跡を結ぶ通りのデータを読み込んで、必要最小限の灯篭の数を出力するプログラムを作成して下さい。ただし、史跡と史跡の間の距離は 200 m 以上で、100 の倍数で与えられます。おのおのの史跡から一番近い灯篭までの距離は 100 m で、市内の史跡は 100 箇所以内です。史跡自身には灯篭を設置する必要はありません。\n(*1) 新選組は会津藩御預という形で発足、白虎隊の悲劇で知られる会津戊辰戦争に参戦、市内天寧寺に土方歳三が近藤勇の墓を建立\nInput\n複数のデータセットが与えられます。各データセットは以下の形式で与えられます。\nn\nm\na\n1\n,\nb\n1\n,\nd\n1\na\n2\n,\nb\n2\n,\nd\n2\n:\na\nm\n,\nb\nm\n,\nd\nm\n各データセットの最初の 1 行には史跡の箇所数\nn\nが与えられます。続いて史跡と史跡を結ぶ通りの数\nm\nが与えられます。続く\nm\n行に カンマで区切られてた3 つの数数\na\ni\n,\nb\ni\n,\nd\ni\nが与えられます。\na\ni\n,\nb\ni\nは史跡の番号です。史跡の番号は 0 番から\nn\n- 1 番まで振られています。\na\ni\nb\ni\nはそれらを結ぶ通りがあることを示し、\nd\ni\nは\na\ni\nb\ni\n間の道路の距離を表します。\nn\nが 0 のとき入力の最後とします。データセットの数は 20 を超えません。\nOutput\n各データセットに対して、必要最小限の灯篭の数を１行に出力して下さい。\nSample Input\n4\n4\n0,1,1500\n0,2,2000\n1,2,600\n1,3,500\n0\nOutput for the Sample Input\n23"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0072_1759212","code_snippet":"// 0072\n#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\n\nstruct road{\n\tint dis;\n\tint v1;\n\tint v2;\n};\n\n\nint findSet(int x, vector<int> &p){\n\tif(x != p[x])\n\t\tp[x] = findSet(p[x], p);\n\treturn p[x];\n}\n\nbool isSameSet(int x, int y, vector<int> &p){\n\treturn findSet(x, p) == findSet(y, p);\n}\n\nvoid link(int x, int y, vector<int> &p, vector<int> &rank){\n\tif(rank[x] > rank[y]){\n\t\tp[y] = x;\n\t}else{\n\t\tp[x] = y;\n\t\tif(rank[x] == rank[y])\n\t\t\trank[y]++;\n\t}\n}\n\nvoid unite(int x, int y, vector<int> &p, vector<int> &rank){\n\tlink(findSet(x, p), findSet(y, p), p, rank);\n}\n\nvoid Sort(vector<road> &ver){\n\troad r;\n\tfor(int i=0;i<ver.size();i++){\n\t\tfor(int j=1;j<ver.size()-i;j++){\n\t\t\tif(ver[j-1].dis > ver[j].dis){\n\t\t\t\tr = ver[j-1];\n\t\t\t\tver[j-1] = ver[j];\n\t\t\t\tver[j] = r;\n\t\t\t}\n\t\t}\n\t}\n}\n\nint lantern(vector<road> ver){\n\tvector<int> rank, p;\n\tfor(int i=0;i<ver.size();i++){\n\t\tp.push_back(i);\n\t\trank.push_back(0);\n\t}\n\n\tint lan = 0;\n\tfor(int i=0;i<ver.size();i++){\n\t\tif(!isSameSet(ver[i].v1, ver[i].v2, p)){\n\t\t\tlan += ver[i].dis/100-1;\n\t\t\tunite(ver[i].v1, ver[i].v2, p, rank);\n\t\t}\n\t}\n\n\treturn lan;\n}\n\nint main(){\n\twhile(1){\n\t\tint n, m, a, b, d;\n\t\tvector<road> ver;\n\t\troad v;\n\n\t\tcin>>n;\n\t\tif(n == 0)\n\t\t\tbreak;\n\n\t\tcin>>m;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tscanf(\"%d,%d,%d\", &a, &b, &d);\n\t\t\tv.v1 = a;\n\t\t\tv.v2 = b;\n\t\t\tv.dis = d;\n\t\t\tver.push_back(v);\n\t\t}\n\n\t\tSort(ver);\n\t\t\n\t\tcout<<lantern(ver)<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1396,"score_of_the_acc":-2,"final_rank":4},{"submission_id":"aoj_0072_1731423","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint n, m;\n\nconst int INF = 1e+9;\nconst int MAX_V = 100;\nint cost[MAX_V][MAX_V];\nint mincost[MAX_V];\nbool used[MAX_V];\n\nint prim(){\n\tfor(int i=0 ; i < n ; i++ ){\n\t\tmincost[i] = INF;\n\t\tused[i] = false;\n\t}\n\tmincost[0] = 0;\n\tint res = 0;\n\t\n\twhile( true ){\n\t\tint v = -1;\n\t\tfor(int u=0 ; u < n ; u++ ){\n\t\t\tif( !used[u] && (v == -1 || mincost[u] < mincost[v]) ){\n\t\t\t\tv = u;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(v == -1) break;\n\t\tused[v] = true;\n\t\tres += mincost[v];\n\t\t\n\t\tfor(int u=0 ; u < n ; u++ ){\n\t\t\tmincost[u] = min( mincost[u] , cost[v][u] );\n\t\t}\n\t}\n\treturn res;\n}\n\n// ?????????s?????????c???????????§??????????????????\nvector<string> split_string(string s, char c){\n\tstring str;\n\tvector<string> vs;\n\ts.push_back( c );\n\t\n\tfor(int i=0 ; i < s.size() ; i++ ){\n\t\tif( s[i] == c ){\n\t\t\tif( !str.empty() ){\n\t\t\t\tvs.push_back( str );\n\t\t\t\tstr.clear();\n\t\t\t}\n\t\t}else{\n\t\t\tstr.push_back( s[i] );\n\t\t}\n\t}\n\treturn vs;\n}\n\n// string???int?????????\nint s_to_i(string s){\n\tint n=0;\n\tfor(int i=0 ; i < s.size() ; i++ ){\n\t\tn *= 10;\n\t\tn += s[i] - '0';\n\t}\n\treturn n;\n}\n\nint main(){\n\twhile( cin >> n , n ){\n\t\tfor(int u=0 ; u < n ; u++ ){\n\t\t\tfor(int v=0 ; v < n ; v++ ){\n\t\t\t\tcost[u][v] = cost[v][u] = INF;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcin >> m;\n\t\tcin.ignore();\n\t\tfor(int i=0 ; i < m ; i++ ){\n\t\t\tstring s;\n\t\t\tgetline(cin,s);\n\t\t\tvector<string> vs = split_string( s , ',' );\n\t\t\tint u = s_to_i( vs[0] );\n\t\t\tint v = s_to_i( vs[1] );\n\t\t\tint c = (s_to_i( vs[2] ) - 100) / 100;\n\t\t\tcost[u][v] = cost[v][u] = c;\n\t\t}\n\t\tint ans = prim();\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1252,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_0072_1294687","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nstruct LINE {\n\tint a;\n\tint b;\n\tint d;\n\tbool use;\n};\n\nvector<int> getconnect(vector<LINE> &lines,int n)\n{\n\tvector<int>\tr;\n\tfor(int i=0;i<lines.size();i++){\n\t\tif( lines[i].a != lines[i].b && (lines[i].a==n || lines[i].b==n) ){\n\t\t\tr.push_back(i);\n\t\t}\n\t}\n\treturn r;\n}\n\nint main() {\n\n\twhile(true){\n\n\tint n,m;\n\tcin >> n >> m;\n\tif( n==0) break;\n\t\n\tvector<LINE> lines;\n\t\n\tfor(int i=0;i<m;i++){\n\t\tLINE l;\n\t\tchar c;\n\t\tcin >> l.a >> c >> l.b >> c >> l.d;\n\t\tl.use=false;\n\t\tlines.push_back(l);\n\t}\n\n\twhile( true ){\n\n\t\tint count=0;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tauto idxs=getconnect(lines,i);\n\t\t\tif( idxs.empty() ) continue;\n\n\t\t\tcount++;\n\t\t\t\n\t\t\tint mini = idxs[0];\n\t\t\tint mind = lines[mini].d;\n\t\t\tfor(int idx : idxs){\n\t\t\t\tif( lines[idx].d < mind ){\n\t\t\t\t\tmini = idx;\n\t\t\t\t\tmind = lines[idx].d;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint t = lines[mini].a!=i?lines[mini].a:lines[mini].b;\n\t\t\t\n\t\t\tauto idxs2=getconnect(lines,t);\n\t\t\tfor(int idx : idxs2){\n\t\t\t\tif( lines[idx].a==t){\n\t\t\t\t\tlines[idx].a = i;\n\t\t\t\t}\n\t\t\t\tif( lines[idx].b==t){\n\t\t\t\t\tlines[idx].b = i;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlines[mini].use=true;\n\t\t}\n\t\tif( count==0) break;\n\t\tcount=0;\n\t}\n\n\tint ans=0;\n\tfor( auto l : lines){\n\t\tif( l.use){\n\t\t\tans += l.d/100-1;\n\t\t}\n\t}\n\tcout << ans << endl;\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1348,"score_of_the_acc":-0.6667,"final_rank":2},{"submission_id":"aoj_0072_1078062","code_snippet":"// 2014/09/22 Tazoe\n\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <algorithm>\nusing namespace std;\n\nconst int INF = 1000000000;\n\nint main()\n{\n\twhile(true){\n\t\tint n;\n\t\tcin >> n;\n\n\t\tif(n==0)\n\t\t\tbreak;\n\n\t\tint W[100][100];\n\t\tfor(int i=0; i<n; i++){\n\t\t\tfor(int j=0; j<n; j++){\n\t\t\t\tW[i][j] = INF;\n\t\t\t}\n\t\t}\n\n\t\tint m;\n\t\tcin >> m;\n\n\t\tfor(int i=0; i<m; i++){\n\t\t\tstring s;\n\t\t\tcin >> s;\n\n\t\t\tfor(int j=0; j<s.size(); j++){\n\t\t\t\tif(s[j]==','){\n\t\t\t\t\ts[j] = ' ';\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tistringstream is(s);\n\t\t\tint a, b, d;\n\t\t\tis >> a >> b >> d;\n\n\t\t\tW[a][b] = W[b][a] = d;\n\t\t}\n/*\n\t\tfor(int i=0; i<n; i++){\n\t\t\tfor(int j=0; j<n; j++){\n\t\t\t\tif(W[i][j]==INF){\n\t\t\t\t\tcout << \"INF\" << ' ';\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tcout << W[i][j] << ' ';\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n*/\n\n\t\tint mincost[100];\n\t\tbool used[100];\n\n\t\tfor(int i=0; i<n; i++){\n\t\t\tmincost[i] = INF;\n\t\t\tused[i] = false;\n\t\t}\n\n\t\tmincost[0] = 0;\n\t\tint res = 0;\n\n\t\twhile(true){\n\t\t\tint v = -1;\n\t\t\tfor(int u=0; u<n; u++){\n\t\t\t\tif(!used[u] && (v==-1 || mincost[u]<mincost[v])){\n\t\t\t\t\tv = u;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(v==-1)\n\t\t\t\tbreak;\n\n\t\t\tused[v] = true;\n\t\t\tif(v!=0){\n\t\t\t\tres += (mincost[v]/100-1);\n\t\t\t}\n\n\t\t\tfor(int u=0; u<n; u++){\n\t\t\t\tmincost[u] = min(mincost[u], W[v][u]);\n\t\t\t}\n\t\t}\n\n\t\tcout << res << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1256,"score_of_the_acc":-1.0278,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_0072_1759212\",\n \"code_snippet\": \"// 0072\\n#include <iostream>\\n#include <vector>\\n#include <stdio.h>\\n#include <stdlib.h>\\nusing namespace std;\\n\\nstruct road{\\n\\tint dis;\\n\\tint v1;\\n\\tint v2;\\n};\\n\\n\\nint findSet(int x, vector<int> &p){\\n\\tif(x != p[x])\\n\\t\\tp[x] = findSet(p[x], p);\\n\\treturn p[x];\\n}\\n\\nbool isSameSet(int x, int y, vector<int> &p){\\n\\treturn findSet(x, p) == findSet(y, p);\\n}\\n\\nvoid link(int x, int y, vector<int> &p, vector<int> &rank){\\n\\tif(rank[x] > rank[y]){\\n\\t\\tp[y] = x;\\n\\t}else{\\n\\t\\tp[x] = y;\\n\\t\\tif(rank[x] == rank[y])\\n\\t\\t\\trank[y]++;\\n\\t}\\n}\\n\\nvoid unite(int x, int y, vector<int> &p, vector<int> &rank){\\n\\tlink(findSet(x, p), findSet(y, p), p, rank);\\n}\\n\\nvoid Sort(vector<road> &ver){\\n\\troad r;\\n\\tfor(int i=0;i<ver.size();i++){\\n\\t\\tfor(int j=1;j<ver.size()-i;j++){\\n\\t\\t\\tif(ver[j-1].dis > ver[j].dis){\\n\\t\\t\\t\\tr = ver[j-1];\\n\\t\\t\\t\\tver[j-1] = ver[j];\\n\\t\\t\\t\\tver[j] = r;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint lantern(vector<road> ver){\\n\\tvector<int> rank, p;\\n\\tfor(int i=0;i<ver.size();i++){\\n\\t\\tp.push_back(i);\\n\\t\\trank.push_back(0);\\n\\t}\\n\\n\\tint lan = 0;\\n\\tfor(int i=0;i<ver.size();i++){\\n\\t\\tif(!isSameSet(ver[i].v1, ver[i].v2, p)){\\n\\t\\t\\tlan += ver[i].dis/100-1;\\n\\t\\t\\tunite(ver[i].v1, ver[i].v2, p, rank);\\n\\t\\t}\\n\\t}\\n\\n\\treturn lan;\\n}\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tint n, m, a, b, d;\\n\\t\\tvector<road> ver;\\n\\t\\troad v;\\n\\n\\t\\tcin>>n;\\n\\t\\tif(n == 0)\\n\\t\\t\\tbreak;\\n\\n\\t\\tcin>>m;\\n\\t\\tfor(int i=0;i<m;i++){\\n\\t\\t\\tscanf(\\\"%d,%d,%d\\\", &a, &b, &d);\\n\\t\\t\\tv.v1 = a;\\n\\t\\t\\tv.v2 = b;\\n\\t\\t\\tv.dis = d;\\n\\t\\t\\tver.push_back(v);\\n\\t\\t}\\n\\n\\t\\tSort(ver);\\n\\t\\t\\n\\t\\tcout<<lantern(ver)<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1396,\n \"score_of_the_acc\": -2,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0072_1731423\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\n\\nint n, m;\\n\\nconst int INF = 1e+9;\\nconst int MAX_V = 100;\\nint cost[MAX_V][MAX_V];\\nint mincost[MAX_V];\\nbool used[MAX_V];\\n\\nint prim(){\\n\\tfor(int i=0 ; i < n ; i++ ){\\n\\t\\tmincost[i] = INF;\\n\\t\\tused[i] = false;\\n\\t}\\n\\tmincost[0] = 0;\\n\\tint res = 0;\\n\\t\\n\\twhile( true ){\\n\\t\\tint v = -1;\\n\\t\\tfor(int u=0 ; u < n ; u++ ){\\n\\t\\t\\tif( !used[u] && (v == -1 || mincost[u] < mincost[v]) ){\\n\\t\\t\\t\\tv = u;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(v == -1) break;\\n\\t\\tused[v] = true;\\n\\t\\tres += mincost[v];\\n\\t\\t\\n\\t\\tfor(int u=0 ; u < n ; u++ ){\\n\\t\\t\\tmincost[u] = min( mincost[u] , cost[v][u] );\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????????s?????????c???????????§??????????????????\\nvector<string> split_string(string s, char c){\\n\\tstring str;\\n\\tvector<string> vs;\\n\\ts.push_back( c );\\n\\t\\n\\tfor(int i=0 ; i < s.size() ; i++ ){\\n\\t\\tif( s[i] == c ){\\n\\t\\t\\tif( !str.empty() ){\\n\\t\\t\\t\\tvs.push_back( str );\\n\\t\\t\\t\\tstr.clear();\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tstr.push_back( s[i] );\\n\\t\\t}\\n\\t}\\n\\treturn vs;\\n}\\n\\n// string???int?????????\\nint s_to_i(string s){\\n\\tint n=0;\\n\\tfor(int i=0 ; i < s.size() ; i++ ){\\n\\t\\tn *= 10;\\n\\t\\tn += s[i] - '0';\\n\\t}\\n\\treturn n;\\n}\\n\\nint main(){\\n\\twhile( cin >> n , n ){\\n\\t\\tfor(int u=0 ; u < n ; u++ ){\\n\\t\\t\\tfor(int v=0 ; v < n ; v++ ){\\n\\t\\t\\t\\tcost[u][v] = cost[v][u] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tcin >> m;\\n\\t\\tcin.ignore();\\n\\t\\tfor(int i=0 ; i < m ; i++ ){\\n\\t\\t\\tstring s;\\n\\t\\t\\tgetline(cin,s);\\n\\t\\t\\tvector<string> vs = split_string( s , ',' );\\n\\t\\t\\tint u = s_to_i( vs[0] );\\n\\t\\t\\tint v = s_to_i( vs[1] );\\n\\t\\t\\tint c = (s_to_i( vs[2] ) - 100) / 100;\\n\\t\\t\\tcost[u][v] = cost[v][u] = c;\\n\\t\\t}\\n\\t\\tint ans = prim();\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0072_1294687\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nstruct LINE {\\n\\tint a;\\n\\tint b;\\n\\tint d;\\n\\tbool use;\\n};\\n\\nvector<int> getconnect(vector<LINE> &lines,int n)\\n{\\n\\tvector<int>\\tr;\\n\\tfor(int i=0;i<lines.size();i++){\\n\\t\\tif( lines[i].a != lines[i].b && (lines[i].a==n || lines[i].b==n) ){\\n\\t\\t\\tr.push_back(i);\\n\\t\\t}\\n\\t}\\n\\treturn r;\\n}\\n\\nint main() {\\n\\n\\twhile(true){\\n\\n\\tint n,m;\\n\\tcin >> n >> m;\\n\\tif( n==0) break;\\n\\t\\n\\tvector<LINE> lines;\\n\\t\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tLINE l;\\n\\t\\tchar c;\\n\\t\\tcin >> l.a >> c >> l.b >> c >> l.d;\\n\\t\\tl.use=false;\\n\\t\\tlines.push_back(l);\\n\\t}\\n\\n\\twhile( true ){\\n\\n\\t\\tint count=0;\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tauto idxs=getconnect(lines,i);\\n\\t\\t\\tif( idxs.empty() ) continue;\\n\\n\\t\\t\\tcount++;\\n\\t\\t\\t\\n\\t\\t\\tint mini = idxs[0];\\n\\t\\t\\tint mind = lines[mini].d;\\n\\t\\t\\tfor(int idx : idxs){\\n\\t\\t\\t\\tif( lines[idx].d < mind ){\\n\\t\\t\\t\\t\\tmini = idx;\\n\\t\\t\\t\\t\\tmind = lines[idx].d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint t = lines[mini].a!=i?lines[mini].a:lines[mini].b;\\n\\t\\t\\t\\n\\t\\t\\tauto idxs2=getconnect(lines,t);\\n\\t\\t\\tfor(int idx : idxs2){\\n\\t\\t\\t\\tif( lines[idx].a==t){\\n\\t\\t\\t\\t\\tlines[idx].a = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif( lines[idx].b==t){\\n\\t\\t\\t\\t\\tlines[idx].b = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tlines[mini].use=true;\\n\\t\\t}\\n\\t\\tif( count==0) break;\\n\\t\\tcount=0;\\n\\t}\\n\\n\\tint ans=0;\\n\\tfor( auto l : lines){\\n\\t\\tif( l.use){\\n\\t\\t\\tans += l.d/100-1;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1348,\n \"score_of_the_acc\": -0.6667,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0072_1078062\",\n \"code_snippet\": \"// 2014/09/22 Tazoe\\n\\n#include <iostream>\\n#include <string>\\n#include <sstream>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst int INF = 1000000000;\\n\\nint main()\\n{\\n\\twhile(true){\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\n\\t\\tif(n==0)\\n\\t\\t\\tbreak;\\n\\n\\t\\tint W[100][100];\\n\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\tfor(int j=0; j<n; j++){\\n\\t\\t\\t\\tW[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint m;\\n\\t\\tcin >> m;\\n\\n\\t\\tfor(int i=0; i<m; i++){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> s;\\n\\n\\t\\t\\tfor(int j=0; j<s.size(); j++){\\n\\t\\t\\t\\tif(s[j]==','){\\n\\t\\t\\t\\t\\ts[j] = ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tistringstream is(s);\\n\\t\\t\\tint a, b, d;\\n\\t\\t\\tis >> a >> b >> d;\\n\\n\\t\\t\\tW[a][b] = W[b][a] = d;\\n\\t\\t}\\n/*\\n\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\tfor(int j=0; j<n; j++){\\n\\t\\t\\t\\tif(W[i][j]==INF){\\n\\t\\t\\t\\t\\tcout << \\\"INF\\\" << ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tcout << W[i][j] << ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n*/\\n\\n\\t\\tint mincost[100];\\n\\t\\tbool used[100];\\n\\n\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\tmincost[i] = INF;\\n\\t\\t\\tused[i] = false;\\n\\t\\t}\\n\\n\\t\\tmincost[0] = 0;\\n\\t\\tint res = 0;\\n\\n\\t\\twhile(true){\\n\\t\\t\\tint v = -1;\\n\\t\\t\\tfor(int u=0; u<n; u++){\\n\\t\\t\\t\\tif(!used[u] && (v==-1 || mincost[u]<mincost[v])){\\n\\t\\t\\t\\t\\tv = u;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(v==-1)\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tused[v] = true;\\n\\t\\t\\tif(v!=0){\\n\\t\\t\\t\\tres += (mincost[v]/100-1);\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int u=0; u<n; u++){\\n\\t\\t\\t\\tmincost[u] = min(mincost[u], W[v][u]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcout << res << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -1.0278,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":98,"cells":{"group_id":{"kind":"string","value":"aoj_0056_cpp"},"problem_description":{"kind":"string","value":"ゴールドバッハの予想\n4 以上の偶数は 2 つの素数の和で表すことができるということが知られています。これはゴールドバッハ予想といい、コンピュータの計算によりかなり大きな数まで正しいことが確かめられています。例えば、10 は、7 + 3、5 + 5 の 2 通りの素数の和で表すことができます。\n整数\nn\nを入力し、\nn\nを 2 つの素数の和で表す組み合わせ数が何通りあるかを出力するプログラムを作成してください。ただし、\nn\nは 4 以上、50,000 以下とします。また、入力される\nn\nは偶数であるとはかぎりません。\nInput\n複数のデータセットが与えられます。各データセットに\nn\nが１行に与えられます。\nn\nが 0 のとき入力の最後とします。データセットの数は 10,000 を超えません。\nOutput\n各データセットに対して、\nn\nを 2 つの素数の和で表す組み合わせ数を１行に出力して下さい。\nSample Input\n10\n11\n0\nOutput for the Sample Input\n2\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0056_9629737","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n vector<int> yakusu(50001, -1);\n for(int i=2; i<=50000; i++){\n if(yakusu[i]!=-1) continue;\n int copy=i;\n while(copy<=50000){\n if(yakusu[copy]==-1) yakusu[copy]=i;\n copy+=i;\n }\n }\n vector<int> prime;\n for(int i=2; i<=50000; i++){\n if(yakusu[i]==i) prime.push_back(i);\n }\n int m=prime.size();\n map<int, int> ans;\n for(int i=0; i<m-1; i++){\n for(int j=i; j<m; j++){\n ans[prime[i]+prime[j]]++;\n }\n }\n\n int n;\n while(cin >> n){\n if(n==0) break;\n cout << ans[n] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":710,"memory_kb":6100,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_0056_9147754","code_snippet":"#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to, cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, int cost) : to(to), cost(cost) {}\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t; x = t; return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\nint modinv(__int128_t x, int mod) {\n assert(mod > 0);\n // assert(x > 0);\n if (x == 1 or x == 0) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) { string s = \"\"; s += c; return s; }\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nvector<string> split_str(string S, char c) {\n vector<string> ret;\n stringstream ss;\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == c) {\n ret.pb(ss.str());\n ss.str(\"\");\n ss.clear();\n } else {\n ss << S[i];\n }\n }\n ret.pb(ss.str());\n return ret;\n}\n\nvector<int> erat(int N) {\n vector<bool> prime(N + 1, true);\n prime[0] = false;\n if (N >= 1) prime[1] = false;\n\n for (int i = 2; i * i <= N; i++) {\n if (prime[i]) {\n for (int j = i + i; j <= N; j += i) {\n prime[j] = false;\n }\n }\n }\n\n vector<int> ret;\n for (int i = 2; i <= N; i++) {\n if (prime[i]) ret.pb(i);\n }\n return ret;\n}\nsigned main() {\n // string S;\n // unordered_map<string, int> mp;\n // while (cin >> S) {\n // vector<string> V = split_str(S, ',');\n // mp[V[1]]++;\n // }\n vector<int> P = erat(5e4);\n int sz = P.size();\n vector<int> dp(1e5 + 1);\n for (int i = 0; i < sz; i++) {\n for (int j = i; j < sz; j++) {\n dp[P[i] + P[j]]++;\n }\n }\n\n int x;\n while (cin >> x, x) {\n cout << dp[x] << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4116,"score_of_the_acc":-0.3616,"final_rank":19},{"submission_id":"aoj_0056_8861368","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n vector<int> isPrime(51000 + 1, false);\n isPrime[2] = true;\n for (int i = 3; i < 51000; i += 2) {\n isPrime[i] = true;\n }\n for (int i = 3; i*i < 51000; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j < 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n vector<int> primes;\n primes.reserve(51000/2); // Assuming half of the numbers are prime for upper limit\n primes.push_back(2);\n for (int i = 3; i < 51000; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n int i = 0, j = primes.size() - 1;\n while (i <= j) {\n if (primes[i] + primes[j] > n) {\n j--;\n } else if (primes[i] + primes[j] < n) {\n i++;\n } else {\n kotae++;\n i++;\n j--;\n }\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3096,"score_of_the_acc":-0.1763,"final_rank":11},{"submission_id":"aoj_0056_8861367","code_snippet":"#include <iostream>\n#include <bitset>\n#include <vector>\nusing namespace std;\n\n#define MAX 51000\n\nbitset<MAX + 1> isPrime;\nvector<int> primes;\n\nvoid generatePrimes() {\n isPrime.set(); // set all bits to 1\n isPrime[0] = isPrime[1] = false;\n primes.push_back(2);\n for (int i = 4; i <= MAX; i += 2)\n isPrime[i] = false;\n \n for (int i = 3; i * i <= MAX; i += 2) {\n if (isPrime[i]) {\n primes.push_back(i);\n for (int j = i * i; j <= MAX; j += i) {\n isPrime[j] = false;\n }\n }\n }\n for(int i = primes.back() + 2; i <= MAX; i += 2) {\n if(isPrime[i]) primes.push_back(i);\n }\n}\n\nint main(void) {\n generatePrimes();\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3196,"score_of_the_acc":-0.0799,"final_rank":7},{"submission_id":"aoj_0056_8861366","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n vector<int> isPrime(51000 + 1, 0);\n isPrime[2] = 1;\n for (int i = 3; i < 51000; i += 2) {\n isPrime[i] = 1;\n }\n\n // Start checking multiples from the square of each prime number\n for (int i = 3; i * i < 51000; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j < 51000; j += i) {\n isPrime[j] = 0;\n }\n }\n }\n\n vector<int> primes;\n primes.push_back(2);\n for (int i = 3; i < 51000; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n // Limit prime number iteration\n for (int i = 0; primes[i] <= n / 2; i++) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3188,"score_of_the_acc":-0.0631,"final_rank":3},{"submission_id":"aoj_0056_8861364","code_snippet":"#include <iostream>\n#include <vector>\n#include <bitset>\nusing namespace std;\n\nint main(void) {\n const int limit = 51000;\n bitset<limit + 1> isPrime;\n isPrime[2] = true;\n for (int i = 3; i <= limit; i += 2) {\n isPrime[i] = true;\n }\n for (int i = 3; i * i <= limit; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j <= limit; j += i) {\n isPrime[j] = false;\n }\n }\n }\n vector<int> primes;\n primes.push_back(2);\n for (int i = 3; i <= limit; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3128,"score_of_the_acc":-0.058,"final_rank":2},{"submission_id":"aoj_0056_8861363","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n int MAX = 51000;\n vector<bool> isPrime(MAX + 1, true); // Initialize all to true\n vector<int> primes;\n\n isPrime[0] = isPrime[1] = false; // 0 and 1 are not prime numbers\n primes.push_back(2); // Add 2 to the list of prime numbers\n\n // Sieve of Eratosthenes algorithm\n for (int i = 2; i * i <= MAX; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= MAX; j += i) {\n isPrime[j] = false;\n }\n }\n }\n \n // Add prime numbers to the list\n for (int i = 3; i <= MAX; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size(); i++) {\n if (primes[i] <= n / 2) {\n if (isPrime[n - primes[i]]) // Use [] instead of at\n kotae++;\n }\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3180,"score_of_the_acc":-0.1033,"final_rank":9},{"submission_id":"aoj_0056_8861361","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n const int limit = 51000;\n vector<bool> isPrime(limit + 1, true);\n isPrime[0] = isPrime[1] = false;\n\n for (int i = 2; i * i <= limit; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= limit; j += i) {\n isPrime[j] = false;\n }\n }\n }\n \n vector<int> primes;\n for (int i = 2; i <= limit; i++) {\n if (isPrime[i])\n primes.push_back(i);\n }\n \n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size() && primes[i] <= n/2; i++) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n cout << kotae << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3216,"score_of_the_acc":-0.0864,"final_rank":8},{"submission_id":"aoj_0056_8861360","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint main(void) {\n int limit = 51000;\n vector<char> isPrime(limit + 1, true);\n isPrime[0] = isPrime[1] = false;\n int sqrt_limit = sqrt(limit);\n \n for (int i = 2; i <= sqrt_limit; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= limit; j += i) {\n isPrime[j] = false;\n }\n }\n }\n \n vector<int> primes;\n if(limit >= 2) primes.push_back(2);\n for (int i = 3; i <= limit; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3220,"score_of_the_acc":-0.0734,"final_rank":5},{"submission_id":"aoj_0056_8861359","code_snippet":"#include <iostream>\n#include <bitset>\nusing namespace std;\nint main(void) {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n \n bitset<51000 + 1> isPrime;\n isPrime[2] = true;\n for (int i = 3; i <= 51000; i += 2) {\n isPrime[i] = true;\n }\n for (int i = 3; i * i <= 51000; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j <= 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 2; i <= n / 2; i++) {\n if (isPrime[i] && isPrime[n - i])\n kotae++;\n }\n cout << kotae << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3176,"score_of_the_acc":-0.3021,"final_rank":16},{"submission_id":"aoj_0056_8836537","code_snippet":"#include <iostream>\n#include <vector>\n#include <bitset>\n#include <cmath>\nusing namespace std;\n\nint main() {\n const int limit = 51000;\n bitset<limit + 1> isPrime;\n isPrime.set();\n isPrime[0] = isPrime[1] = false;\n\n for (int i = 2; i * i <= limit; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= limit; j += i) {\n isPrime[j] = false;\n }\n }\n }\n\n vector<int> primes;\n for (int i = 2; i <= limit; i++) {\n if (isPrime[i]) {\n primes.push_back(i);\n }\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n int left = 0, right = primes.size() - 1;\n while (left <= right) {\n int sum = primes[left] + primes[right];\n if (sum == n) {\n kotae++;\n left++;\n right--;\n } else if (sum < n) {\n left++;\n } else {\n right--;\n }\n }\n cout << kotae << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3136,"score_of_the_acc":-0.1892,"final_rank":12},{"submission_id":"aoj_0056_8818956","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main(void) {\n vector<bool> isPrime(51000 + 1, false);\n isPrime[2] = true;\n for (int i = 3; i < 51000; i += 2) {\n isPrime[i] = true;\n }\n\n int limit = sqrt(51000);\n for (int i = 3; i <= limit; i += 2) {\n if (isPrime[i]) {\n for (int j = i*i; j < 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n\n int n;\n while (cin >> n && n != 0) {\n int count = 0;\n for (int i = 2; i <= n / 2; ++i) {\n if (isPrime[i] && isPrime[n - i]) {\n count++;\n }\n }\n cout << count << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3084,"score_of_the_acc":-0.2867,"final_rank":15},{"submission_id":"aoj_0056_8818955","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n const int maxNum = 51000;\n vector<bool> isPrime(maxNum + 1, false);\n isPrime[2] = true;\n for (int i = 3; i <= maxNum; i += 2) {\n isPrime[i] = true;\n }\n for (int i = 3; i <= maxNum; i += 2) {\n if (isPrime[i]) { // Only check for prime numbers\n for (int j = i + i; j <= maxNum; j += i) {\n isPrime[j] = false;\n }\n }\n }\n vector<int> primes;\n primes.reserve(maxNum/2); // Preallocate memory\n primes.push_back(2);\n for (int i = 3; i <= maxNum; i += 2) {\n if (isPrime[i]) {\n primes.push_back(i);\n }\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\n if (isPrime[n - primes[i]]) {\n kotae++;\n }\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3108,"score_of_the_acc":-0.0516,"final_rank":1},{"submission_id":"aoj_0056_8818954","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint main(void) {\n vector<bool> isPrime(51000 + 1, true);\n vector<int> primes;\n primes.reserve(51000); // Reserve memory in advance\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i*i <= 51000; i++) {\n if (isPrime[i]) {\n for (int j = i*i; j <= 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n for (int i = 2; i <= 51000; i++) {\n if (isPrime[i])\n primes.push_back(i);\n }\n int n;\n int size = primes.size(); // Store size in a variable\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 0; i < size; i++) {\n if (primes[i] <= n / 2) {\n if (isPrime[n - primes[i]]) // Use operator [] instead of at()\n kotae++;\n }\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3060,"score_of_the_acc":-0.0647,"final_rank":4},{"submission_id":"aoj_0056_8818953","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main(void) {\n vector<bool> isPrime(51000 + 1, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i <= sqrt(51000); i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 2; i <= n / 2; i++) {\n if (isPrime[i] && isPrime[n - i])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":2992,"score_of_the_acc":-0.2714,"final_rank":14},{"submission_id":"aoj_0056_8818952","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n const int limit = 51000;\n vector<bool> isPrime(limit + 1, true);\n isPrime[0] = isPrime[1] = false;\n \n for (int i = 2; i*i <= limit; i++) {\n if (isPrime[i]) {\n for (int j = i*i; j <= limit; j += i) {\n isPrime[j] = false;\n }\n }\n }\n\n int n;\n while (cin >> n && n != 0) {\n int count = 0;\n for (int i = 2; i <= n / 2; i++) {\n if (isPrime[i] && isPrime[n - i]) {\n count++;\n }\n }\n cout << count << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":3092,"score_of_the_acc":-0.3179,"final_rank":18},{"submission_id":"aoj_0056_8818950","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\nint main(void) {\n vector<bool> isPrime(51000 + 1, true);\n isPrime[0] = isPrime[1] = false;\n for (int i = 2; i * i <= 51000; i++) {\n if (isPrime[i]) {\n for (int j = i * i; j <= 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 2; i <= n / 2; i++) {\n if (isPrime[i] && isPrime[n - i])\n kotae++;\n }\n cout << kotae << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":3056,"score_of_the_acc":-0.3063,"final_rank":17},{"submission_id":"aoj_0056_8818949","code_snippet":"#include <iostream>\n#include <bitset>\nusing namespace std;\nint main(void) {\n ios::sync_with_stdio(false);\n bitset<51001> isPrime;\n isPrime.set();\n isPrime[0] = isPrime[1] = 0;\n for (int i = 4; i <= 51000; i += 2) {\n isPrime[i] = 0;\n }\n for (int i = 3; i * i <= 51000; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j <= 51000; j += i) {\n isPrime[j] = 0;\n }\n }\n }\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n for (int i = 2; i <= n / 2; ++i) {\n if (isPrime[i] && isPrime[n - i])\n kotae++;\n }\n cout << kotae << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3024,"score_of_the_acc":-0.2532,"final_rank":13},{"submission_id":"aoj_0056_8810068","code_snippet":"#include <iostream>\n#include <bitset>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main(void) {\n const int limit = 51000;\n const int sqrtLimit = sqrt(limit);\n\n bitset<limit + 1> isPrime;\n isPrime[2] = true;\n for (int i = 3; i <= limit; i += 2) {\n isPrime[i] = true;\n }\n for (int i = 3; i <= sqrtLimit; i += 2) {\n if (isPrime[i]) {\n for (int j = i * i; j <= limit; j += i * 2) {\n isPrime[j] = false;\n }\n }\n }\n\n vector<int> primes;\n primes.push_back(2);\n for (int i = 3; i <= limit; i += 2) {\n if (isPrime[i])\n primes.push_back(i);\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n int primesSize = primes.size();\n for (int i = 0; i < primesSize; i++) {\n if (primes[i] <= n / 2) {\n if (isPrime[n - primes[i]])\n kotae++;\n }\n }\n cout << kotae << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3192,"score_of_the_acc":-0.1072,"final_rank":10},{"submission_id":"aoj_0056_8810064","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(void) {\n vector<char> isPrime(51000 + 1, false);\n isPrime[2] = true;\n\n for (int i = 3; i < 51000; i += 2) {\n isPrime[i] = true;\n }\n\n for (int i = 3; i < 51000; i += 2) {\n if (isPrime[i]) {\n for (int j = i + i; j < 51000; j += i) {\n isPrime[j] = false;\n }\n }\n }\n\n vector<int> primes;\n primes.push_back(2);\n\n for (int i = 3; i < 51000; i += 2) {\n if (isPrime[i]) {\n primes.push_back(i);\n }\n }\n\n int n;\n while (cin >> n && n != 0) {\n int kotae = 0;\n int maxSize = n / 2;\n int left = 0;\n int right = primes.size() - 1;\n int lastIndex = -1;\n\n while (left <= right) {\n int mid = left + (right - left) / 2;\n\n if (primes[mid] <= maxSize) {\n lastIndex = mid;\n left = mid + 1;\n } else {\n right = mid - 1;\n }\n }\n\n for (int i = 0; i <= lastIndex; i++) {\n if (isPrime[n - primes[i]]) {\n kotae++;\n }\n }\n\n cout << kotae << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3188,"score_of_the_acc":-0.0773,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_0056_9629737\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(void){\\n vector<int> yakusu(50001, -1);\\n for(int i=2; i<=50000; i++){\\n if(yakusu[i]!=-1) continue;\\n int copy=i;\\n while(copy<=50000){\\n if(yakusu[copy]==-1) yakusu[copy]=i;\\n copy+=i;\\n }\\n }\\n vector<int> prime;\\n for(int i=2; i<=50000; i++){\\n if(yakusu[i]==i) prime.push_back(i);\\n }\\n int m=prime.size();\\n map<int, int> ans;\\n for(int i=0; i<m-1; i++){\\n for(int j=i; j<m; j++){\\n ans[prime[i]+prime[j]]++;\\n }\\n }\\n\\n int n;\\n while(cin >> n){\\n if(n==0) break;\\n cout << ans[n] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 6100,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0056_9147754\",\n \"code_snippet\": \"#pragma region Macros\\n\\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\\\")\\n\\n#include <bits/extc++.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\\n\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \\n\\n#define sqrt __builtin_sqrtl\\n#define cbrt __builtin_cbrtl\\n#define hypot __builtin_hypotl\\n\\n#define next asdnext\\n#define prev asdprev\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\n// const int MOD = 998244353;\\nconst int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n\\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n\\nstruct Edge {\\n int from, to, cost;\\n Edge() : from(-1), to(-1), cost(-1) {}\\n Edge(int to, int cost) : to(to), cost(cost) {}\\n Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}\\n bool operator ==(const Edge& e) {\\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\\n }\\n bool operator !=(const Edge& e) {\\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\\n }\\n};\\n\\nchrono::system_clock::time_point start;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n\\nrandom_device seed_gen;\\nmt19937_64 rng(seed_gen());\\nuniform_int_distribution<int> dist_x(0, 1e9);\\nstruct RNG {\\n unsigned Int(unsigned l, unsigned r) {\\n return dist_x(rng) % (r - l + 1) + l;\\n }\\n ld Double() {\\n return ld(dist_x(rng)) / 1e9;\\n }\\n} rnd;\\n\\nusing i64 = ll;\\n// using i64 = uint64_t;\\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\\n\\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }\\n\\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\\ni64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)\\n// i64 next_bit(i64 x, i64 k) { return 0; }\\n// i64 prev_bit(i64 x, i64 k) { return 0; }\\n// i64 kth_bit(i64 x, i64 k) { return 0; }\\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\\ni64 LSB(i64 x) { return (x & -x); } // mask\\n\\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\\ni64 countl_one(i64 x) {\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n}\\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\\n\\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\\n\\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\\n i64 w = bit_width(x); k %= w;\\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\\n}\\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\\ni64 rotr(i64 x, i64 k) {\\n i64 w = bit_width(x); k %= w;\\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\\n}\\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\\n i64 r = 0, w = bit_width(x);\\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\\n return r;\\n}\\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\\n\\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\\n\\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\\n\\ni64 next_combination(i64 x) {\\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));\\n}\\n\\n\\n__int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n}\\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n}\\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n if (x >= 0) return x % y;\\n __int128_t ret = x % y; // (x < 0)\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n}\\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x >= 0 ? x / y : (x + 1) / y - 1;\\n}\\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x > 0 ? (x - 1) / y + 1 : x / y;\\n}\\nint round(int x, int y) {\\n assert(y != 0);\\n return (x * 2 + y) / (y * 2);\\n}\\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\\n assert(y != 0); // TODO\\n return INF;\\n}\\nint round2(int x, int y) { // 五捨五超入 // 未verify\\n assert(y != 0);\\n if (y < 0) y = -y, x = -x;\\n int z = z / y;\\n if ((z * 2 + 1) * y <= y * 2) z++;\\n return z;\\n}\\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\\n// }\\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\\n// }\\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\\n// }\\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\\n// }\\nint floor(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return floor(x / y);\\n // floor(x) = ceil(x - 1) という話も\\n}\\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\\n assert(!equals(y, 0));\\n return ceil(x / y);\\n // ceil(x) = floor(x + 1)\\n}\\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\\n assert(!equals(y, 0));\\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n}\\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\\n // 未verify. 誤差対策TODO. -0.0が返りうる。\\n assert(!equals(y, 0));\\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\\n return x - fabs(y)*floor(x, fabs(y));\\n}\\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\\nint seisuu(int x, int y) {\\n assert(y != 0);\\n return x / y;\\n}\\nint seisuu(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return (int)(x / y);\\n}\\n\\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\\n return b;\\n}\\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\\n return b;\\n}\\n\\ntemplate <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; } return false;\\n}\\ntemplate <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; } return false;\\n}\\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\\n return a + b + c - max({a, b, c}) - min({a, b, c});\\n}\\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \\n if (rev == false) { // TODO テンプレート引数\\n if (a > b) swap(a, b);\\n } else {\\n if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\\n } else {\\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\\n } else {\\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\\n }\\n}\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n\\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\nclass Compress {\\npublic:\\n int sz = 0;\\n // gp_hash_table<int, int, custom_hash> Z, UZ;\\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\\n\\n Compress(const vector<int> &V, int base = 0) {\\n this->sz = base;\\n set<int> s(V.begin(), V.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\\n this->sz = base;\\n vector<int> V3 = V2;\\n V3.insert(V3.end(), V1.begin(), V1.end());\\n set<int> s(V3.begin(), V3.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n\\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\\n this->sz = base;\\n vector<int> V4 = V1;\\n V4.insert(V4.end(), V2.begin(), V2.end());\\n V4.insert(V4.end(), V3.begin(), V3.end());\\n set<int> s(V4.begin(), V4.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n\\n Compress(const vector<int> &V1, const vector<int> &V2,\\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\\n this->sz = base;\\n vector<int> V5 = V1;\\n V5.insert(V5.end(), V2.begin(), V2.end());\\n V5.insert(V5.end(), V3.begin(), V3.end());\\n V5.insert(V5.end(), V4.begin(), V4.end());\\n set<int> s(V5.begin(), V5.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n\\n vector<int> zip(const vector<int> &V) {\\n vector<int> ret = V;\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = Z[ret[i]];\\n }\\n return ret;\\n }\\n\\n vector<int> unzip(const vector<int> &V) {\\n vector<int> ret = V;\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = UZ[ret[i]];\\n }\\n return ret;\\n }\\n\\n int size() { return sz; }\\n\\n int encode(int x) { return Z[x]; }\\n int decode(int x) {\\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\\n return UZ[x];\\n }\\n};\\n\\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n return true;\\n\\t}\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase( remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }), G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par, sz;\\n};\\n\\ntemplate<typename T>\\nstruct BIT {\\n int N; // 要素数\\n vector<T> bit[2]; // データの格納先\\n BIT(int N_, int x = 0) {\\n N = N_ + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n if (x != 0) {\\n for (int i = 0; i < N; i++) add(i, x);\\n }\\n }\\n BIT(const vector<int> &A) {\\n N = A.size() + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\\n }\\n void add_sub(int p, int i, T x) {\\n while (i < N) { bit[p][i] += x; i += (i & -i); }\\n }\\n void add(int l, int r, T x) {\\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\\n }\\n void add(int i, T x) { add(i, i + 1, x); }\\n T sum_sub(int p, int i) {\\n T ret = 0;\\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\\n return ret;\\n }\\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\\n T sum(int l, int r) { return sum(r) - sum(l); }\\n T get(int i) { return sum(i, i + 1); }\\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\\n};\\n\\ntemplate<int mod> class Modint {\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n\\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator >(const Modint& r) { return this -> val > r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = Modint<MOD>;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t; x = t; return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\nmint modpow(const mint &x, int n) {\\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\\n assert(n >= 0);\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\n\\nint modpow(__int128_t x, int n, int mod) {\\n assert(n >= 0 && mod > 0); // TODO: n <= -1\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\nint modinv(__int128_t x, int mod) {\\n assert(mod > 0);\\n // assert(x > 0);\\n if (x == 1 or x == 0) return 1;\\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n}\\n\\nistream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n}\\nostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128]; char *d = end(buffer);\\n do {\\n --d; *d = \\\"0123456789\\\"[tmp % 10]; tmp /= 10;\\n } while (tmp != 0);\\n if (x < 0) { --d; *d = '-'; }\\n int len = end(buffer) - d;\\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\\n }\\n return os;\\n}\\n\\n__int128_t stoll(string &S) {\\n __int128_t ret = 0; int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n}\\n__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\\n__int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n}\\n\\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\\n assert(k >= 0);\\n stringstream ss;\\n ss << setprecision(k + 2) << x;\\n string s = ss.str();\\n if (s.find('.') == string::npos) s += '.';\\n int pos = s.find('.');\\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\\n s.pop_back();\\n if (s.back() == '.') s.pop_back();\\n return s;\\n\\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\\n // ss << setprecision(k + 1) << x;\\n // string s = ss.str();\\n // if (s.find('.') == string::npos) s += '.';\\n // int pos = s.find('.');\\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\\n // if (s.back() == '.') s.pop_back();\\n // return s;\\n}\\nstring to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) { ret += \\\"-\\\"; x *= -1; }\\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\nstring to_string(char c) { string s = \\\"\\\"; s += c; return s; }\\n\\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n\\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n\\nmint FAC(int N) {\\n if (N < 0) return 0; return _fac[N];\\n}\\nmint COM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\nmint PERM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[N - K];\\n}\\nmint NHK(int N, int K) { // initのサイズに注意\\n if (N == 0 && K == 0) return 1;\\n return COM(N + K - 1, K);\\n}\\n\\n#pragma endregion\\n\\nvector<string> split_str(string S, char c) {\\n vector<string> ret;\\n stringstream ss;\\n for (int i = 0; i < S.size(); i++) {\\n if (S[i] == c) {\\n ret.pb(ss.str());\\n ss.str(\\\"\\\");\\n ss.clear();\\n } else {\\n ss << S[i];\\n }\\n }\\n ret.pb(ss.str());\\n return ret;\\n}\\n\\nvector<int> erat(int N) {\\n vector<bool> prime(N + 1, true);\\n prime[0] = false;\\n if (N >= 1) prime[1] = false;\\n\\n for (int i = 2; i * i <= N; i++) {\\n if (prime[i]) {\\n for (int j = i + i; j <= N; j += i) {\\n prime[j] = false;\\n }\\n }\\n }\\n\\n vector<int> ret;\\n for (int i = 2; i <= N; i++) {\\n if (prime[i]) ret.pb(i);\\n }\\n return ret;\\n}\\nsigned main() {\\n // string S;\\n // unordered_map<string, int> mp;\\n // while (cin >> S) {\\n // vector<string> V = split_str(S, ',');\\n // mp[V[1]]++;\\n // }\\n vector<int> P = erat(5e4);\\n int sz = P.size();\\n vector<int> dp(1e5 + 1);\\n for (int i = 0; i < sz; i++) {\\n for (int j = i; j < sz; j++) {\\n dp[P[i] + P[j]]++;\\n }\\n }\\n\\n int x;\\n while (cin >> x, x) {\\n cout << dp[x] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4116,\n \"score_of_the_acc\": -0.3616,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0056_8861368\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n vector<int> isPrime(51000 + 1, false);\\n isPrime[2] = true;\\n for (int i = 3; i < 51000; i += 2) {\\n isPrime[i] = true;\\n }\\n for (int i = 3; i*i < 51000; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j < 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n vector<int> primes;\\n primes.reserve(51000/2); // Assuming half of the numbers are prime for upper limit\\n primes.push_back(2);\\n for (int i = 3; i < 51000; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n int i = 0, j = primes.size() - 1;\\n while (i <= j) {\\n if (primes[i] + primes[j] > n) {\\n j--;\\n } else if (primes[i] + primes[j] < n) {\\n i++;\\n } else {\\n kotae++;\\n i++;\\n j--;\\n }\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.1763,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0056_8861367\",\n \"code_snippet\": \"#include <iostream>\\n#include <bitset>\\n#include <vector>\\nusing namespace std;\\n\\n#define MAX 51000\\n\\nbitset<MAX + 1> isPrime;\\nvector<int> primes;\\n\\nvoid generatePrimes() {\\n isPrime.set(); // set all bits to 1\\n isPrime[0] = isPrime[1] = false;\\n primes.push_back(2);\\n for (int i = 4; i <= MAX; i += 2)\\n isPrime[i] = false;\\n \\n for (int i = 3; i * i <= MAX; i += 2) {\\n if (isPrime[i]) {\\n primes.push_back(i);\\n for (int j = i * i; j <= MAX; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n for(int i = primes.back() + 2; i <= MAX; i += 2) {\\n if(isPrime[i]) primes.push_back(i);\\n }\\n}\\n\\nint main(void) {\\n generatePrimes();\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.0799,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0056_8861366\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n vector<int> isPrime(51000 + 1, 0);\\n isPrime[2] = 1;\\n for (int i = 3; i < 51000; i += 2) {\\n isPrime[i] = 1;\\n }\\n\\n // Start checking multiples from the square of each prime number\\n for (int i = 3; i * i < 51000; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j < 51000; j += i) {\\n isPrime[j] = 0;\\n }\\n }\\n }\\n\\n vector<int> primes;\\n primes.push_back(2);\\n for (int i = 3; i < 51000; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n // Limit prime number iteration\\n for (int i = 0; primes[i] <= n / 2; i++) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0631,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0056_8861364\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <bitset>\\nusing namespace std;\\n\\nint main(void) {\\n const int limit = 51000;\\n bitset<limit + 1> isPrime;\\n isPrime[2] = true;\\n for (int i = 3; i <= limit; i += 2) {\\n isPrime[i] = true;\\n }\\n for (int i = 3; i * i <= limit; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= limit; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n vector<int> primes;\\n primes.push_back(2);\\n for (int i = 3; i <= limit; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3128,\n \"score_of_the_acc\": -0.058,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0056_8861363\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n int MAX = 51000;\\n vector<bool> isPrime(MAX + 1, true); // Initialize all to true\\n vector<int> primes;\\n\\n isPrime[0] = isPrime[1] = false; // 0 and 1 are not prime numbers\\n primes.push_back(2); // Add 2 to the list of prime numbers\\n\\n // Sieve of Eratosthenes algorithm\\n for (int i = 2; i * i <= MAX; i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= MAX; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n \\n // Add prime numbers to the list\\n for (int i = 3; i <= MAX; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size(); i++) {\\n if (primes[i] <= n / 2) {\\n if (isPrime[n - primes[i]]) // Use [] instead of at\\n kotae++;\\n }\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.1033,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0056_8861361\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n const int limit = 51000;\\n vector<bool> isPrime(limit + 1, true);\\n isPrime[0] = isPrime[1] = false;\\n\\n for (int i = 2; i * i <= limit; i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= limit; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n \\n vector<int> primes;\\n for (int i = 2; i <= limit; i++) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n \\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size() && primes[i] <= n/2; i++) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.0864,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0056_8861360\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\nint main(void) {\\n int limit = 51000;\\n vector<char> isPrime(limit + 1, true);\\n isPrime[0] = isPrime[1] = false;\\n int sqrt_limit = sqrt(limit);\\n \\n for (int i = 2; i <= sqrt_limit; i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= limit; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n \\n vector<int> primes;\\n if(limit >= 2) primes.push_back(2);\\n for (int i = 3; i <= limit; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.0734,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0056_8861359\",\n \"code_snippet\": \"#include <iostream>\\n#include <bitset>\\nusing namespace std;\\nint main(void) {\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n \\n bitset<51000 + 1> isPrime;\\n isPrime[2] = true;\\n for (int i = 3; i <= 51000; i += 2) {\\n isPrime[i] = true;\\n }\\n for (int i = 3; i * i <= 51000; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 2; i <= n / 2; i++) {\\n if (isPrime[i] && isPrime[n - i])\\n kotae++;\\n }\\n cout << kotae << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.3021,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0056_8836537\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <bitset>\\n#include <cmath>\\nusing namespace std;\\n\\nint main() {\\n const int limit = 51000;\\n bitset<limit + 1> isPrime;\\n isPrime.set();\\n isPrime[0] = isPrime[1] = false;\\n\\n for (int i = 2; i * i <= limit; i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= limit; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n\\n vector<int> primes;\\n for (int i = 2; i <= limit; i++) {\\n if (isPrime[i]) {\\n primes.push_back(i);\\n }\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n int left = 0, right = primes.size() - 1;\\n while (left <= right) {\\n int sum = primes[left] + primes[right];\\n if (sum == n) {\\n kotae++;\\n left++;\\n right--;\\n } else if (sum < n) {\\n left++;\\n } else {\\n right--;\\n }\\n }\\n cout << kotae << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -0.1892,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0056_8818956\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(void) {\\n vector<bool> isPrime(51000 + 1, false);\\n isPrime[2] = true;\\n for (int i = 3; i < 51000; i += 2) {\\n isPrime[i] = true;\\n }\\n\\n int limit = sqrt(51000);\\n for (int i = 3; i <= limit; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i*i; j < 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int count = 0;\\n for (int i = 2; i <= n / 2; ++i) {\\n if (isPrime[i] && isPrime[n - i]) {\\n count++;\\n }\\n }\\n cout << count << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -0.2867,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0056_8818955\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n const int maxNum = 51000;\\n vector<bool> isPrime(maxNum + 1, false);\\n isPrime[2] = true;\\n for (int i = 3; i <= maxNum; i += 2) {\\n isPrime[i] = true;\\n }\\n for (int i = 3; i <= maxNum; i += 2) {\\n if (isPrime[i]) { // Only check for prime numbers\\n for (int j = i + i; j <= maxNum; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n vector<int> primes;\\n primes.reserve(maxNum/2); // Preallocate memory\\n primes.push_back(2);\\n for (int i = 3; i <= maxNum; i += 2) {\\n if (isPrime[i]) {\\n primes.push_back(i);\\n }\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < primes.size() && primes[i] <= n / 2; i++) {\\n if (isPrime[n - primes[i]]) {\\n kotae++;\\n }\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3108,\n \"score_of_the_acc\": -0.0516,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0056_8818954\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\nint main(void) {\\n vector<bool> isPrime(51000 + 1, true);\\n vector<int> primes;\\n primes.reserve(51000); // Reserve memory in advance\\n isPrime[0] = isPrime[1] = false;\\n for (int i = 2; i*i <= 51000; i++) {\\n if (isPrime[i]) {\\n for (int j = i*i; j <= 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n for (int i = 2; i <= 51000; i++) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n int n;\\n int size = primes.size(); // Store size in a variable\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 0; i < size; i++) {\\n if (primes[i] <= n / 2) {\\n if (isPrime[n - primes[i]]) // Use operator [] instead of at()\\n kotae++;\\n }\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.0647,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0056_8818953\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(void) {\\n vector<bool> isPrime(51000 + 1, true);\\n isPrime[0] = isPrime[1] = false;\\n for (int i = 2; i <= sqrt(51000); i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 2; i <= n / 2; i++) {\\n if (isPrime[i] && isPrime[n - i])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 2992,\n \"score_of_the_acc\": -0.2714,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0056_8818952\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n const int limit = 51000;\\n vector<bool> isPrime(limit + 1, true);\\n isPrime[0] = isPrime[1] = false;\\n \\n for (int i = 2; i*i <= limit; i++) {\\n if (isPrime[i]) {\\n for (int j = i*i; j <= limit; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int count = 0;\\n for (int i = 2; i <= n / 2; i++) {\\n if (isPrime[i] && isPrime[n - i]) {\\n count++;\\n }\\n }\\n cout << count << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.3179,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0056_8818950\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\nint main(void) {\\n vector<bool> isPrime(51000 + 1, true);\\n isPrime[0] = isPrime[1] = false;\\n for (int i = 2; i * i <= 51000; i++) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 2; i <= n / 2; i++) {\\n if (isPrime[i] && isPrime[n - i])\\n kotae++;\\n }\\n cout << kotae << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.3063,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0056_8818949\",\n \"code_snippet\": \"#include <iostream>\\n#include <bitset>\\nusing namespace std;\\nint main(void) {\\n ios::sync_with_stdio(false);\\n bitset<51001> isPrime;\\n isPrime.set();\\n isPrime[0] = isPrime[1] = 0;\\n for (int i = 4; i <= 51000; i += 2) {\\n isPrime[i] = 0;\\n }\\n for (int i = 3; i * i <= 51000; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= 51000; j += i) {\\n isPrime[j] = 0;\\n }\\n }\\n }\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n for (int i = 2; i <= n / 2; ++i) {\\n if (isPrime[i] && isPrime[n - i])\\n kotae++;\\n }\\n cout << kotae << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3024,\n \"score_of_the_acc\": -0.2532,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0056_8810068\",\n \"code_snippet\": \"#include <iostream>\\n#include <bitset>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(void) {\\n const int limit = 51000;\\n const int sqrtLimit = sqrt(limit);\\n\\n bitset<limit + 1> isPrime;\\n isPrime[2] = true;\\n for (int i = 3; i <= limit; i += 2) {\\n isPrime[i] = true;\\n }\\n for (int i = 3; i <= sqrtLimit; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i * i; j <= limit; j += i * 2) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n\\n vector<int> primes;\\n primes.push_back(2);\\n for (int i = 3; i <= limit; i += 2) {\\n if (isPrime[i])\\n primes.push_back(i);\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n int primesSize = primes.size();\\n for (int i = 0; i < primesSize; i++) {\\n if (primes[i] <= n / 2) {\\n if (isPrime[n - primes[i]])\\n kotae++;\\n }\\n }\\n cout << kotae << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.1072,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0056_8810064\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(void) {\\n vector<char> isPrime(51000 + 1, false);\\n isPrime[2] = true;\\n\\n for (int i = 3; i < 51000; i += 2) {\\n isPrime[i] = true;\\n }\\n\\n for (int i = 3; i < 51000; i += 2) {\\n if (isPrime[i]) {\\n for (int j = i + i; j < 51000; j += i) {\\n isPrime[j] = false;\\n }\\n }\\n }\\n\\n vector<int> primes;\\n primes.push_back(2);\\n\\n for (int i = 3; i < 51000; i += 2) {\\n if (isPrime[i]) {\\n primes.push_back(i);\\n }\\n }\\n\\n int n;\\n while (cin >> n && n != 0) {\\n int kotae = 0;\\n int maxSize = n / 2;\\n int left = 0;\\n int right = primes.size() - 1;\\n int lastIndex = -1;\\n\\n while (left <= right) {\\n int mid = left + (right - left) / 2;\\n\\n if (primes[mid] <= maxSize) {\\n lastIndex = mid;\\n left = mid + 1;\\n } else {\\n right = mid - 1;\\n }\\n }\\n\\n for (int i = 0; i <= lastIndex; i++) {\\n if (isPrime[n - primes[i]]) {\\n kotae++;\\n }\\n }\\n\\n cout << kotae << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0773,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":99,"cells":{"group_id":{"kind":"string","value":"aoj_0088_cpp"},"problem_description":{"kind":"string","value":"博士が愛した符号\n博士 : ピーター君、ついにやったよ。\nピーター : どうしました、デビッド博士？またくだらない発明ですか？\n博士 : この表だよ、この表。\n文字\n符号\n（空白）\n101\n'\n000000\n,\n000011\n-\n10010001\n.\n010001\n?\n000001\nA\n100101\nB\n10011010\n文字\n符号\nC\n0101\nD\n0001\nE\n110\nF\n01001\nG\n10011011\nH\n010000\nI\n0111\nJ\n10011000\n文字\n符号\nK\n0110\nL\n00100\nM\n10011001\nN\n10011110\nO\n00101\nP\n111\nQ\n10011111\nR\n1000\n文字\n符号\nS\n00110\nT\n00111\nU\n10011100\nV\n10011101\nW\n000010\nX\n10010010\nY\n10010011\nZ\n10010000\nピーター : なんですか? この表は。\n博士 : いいから、言う通りにしてみなさい。まず、お前の名前を紙に書いてごらん。\nピーター : はい\"PETER POTTER\" っと。\n博士 : そうしたら、１文字ずつ、この表の「符号」に置き換えるのだよ。\nピーター : えーと\"P\" を「111」にして\"E\" を「110」して…結構面倒ですね。\n111 110 00111 110 1000 101 111 00101 00111 00111 110 1000\nになりました。なんだか、バーコードみたいですね。\n博士 : よろしい。そうしたら、置き換えた文字列を全部つなげて、５文字ごとに区切ってみなさい。\nピーター : はいはい、つなげて区切ると。\n11111 00011 11101 00010 11110 01010 01110 01111 10100 0\nこんな感じになりました。けど、最後の「0」だけのやつはどうしますか?\n博士 : ０を付け加えて５文字にしておいてくれ。\nピーター : えーと最後が０が1個だけだから０をあと４つ加えてやればいいんですね。できました。\n11111 00011 11101 00010 11110 01010 01110 01111 10100 00000\n博士 : 次はこの表を使うのだ。\n符号\n文字\n00000\nA\n00001\nB\n00010\nC\n00011\nD\n00100\nE\n00101\nF\n00110\nG\n00111\nH\n符号\n文字\n01000\nI\n01001\nJ\n01010\nK\n01011\nL\n01100\nM\n01101\nN\n01110\nO\n01111\nP\n符号\n文字\n10000\nQ\n10001\nR\n10010\nS\n10011\nT\n10100\nU\n10101\nV\n10110\nW\n10111\nX\n符号\n文字\n11000\nY\n11001\nZ\n11010\n（空白）\n11011\n.\n11100\n,\n11101\n-\n11110\n'\n11111\n?\nピーター : これをどう使うんですか…そうか!今度は符号から文字に置き換えるのか!\n博士 : そうそう。「11111」だったら「?」に、「00011」だったら「D」にとやってゆけばいいんだよ。\nピーター : これは単純ですね……えーと「?D-C'KOPUA」になりました。でも意味不明ですよ。\n博士 : 文字数を数えてごらん。\nピーター : １０文字ですよ。あっ、「PETER POTTER」は１２文字だったのに２文字減っています。\n博士 : そう、この表を使えば文字を減らすことができるのだよ。じゃあ今度はこの文章で同じことをやっ\n てごらん。\nPETER PIPER PICKED A PECK OF PICKLED PEPPERS. A PECK OF PICKLED PEPPERS\nPETER PIPER PICKED. IF PETER PIPER PICKED A PECK OF PICKLED PEPPERS, WHERE'S\nTHE PECK OF PICKLED PEPPERS PETER PIPER PICKED?\nピーター : ぎょぎょ、行が分かれていますが、どうするんですか?\n博士 : 紙の都合で３行になってしまったが、改行文字のかわりに空白がある長い１行だと思っておくれ。\nピーター : はいはい。行と行の間にあるのは空白だと。しかし面倒だな……。\n博士 : だったらプログラムにやらせればいいではないか。\nということで、ピーターの代わりに、読み込んだ文字列を符号に変換し出力するプログラムを作成してください。\n入力\n複数のデータセットが与えられます。各データセットに文字列１行（表に含まれる文字からなる）が与えられます。文字列に含まれる文字の数は 1 文字以上 100 文字以下です。\nデータセットの数は 200 を超えません。\n出力\n各データセットごとに、変換後の文字列を１行に出力してください。\nSample Input\nPETER POTTER\nOutput for the Sample Input\n?D-C'KOPUA"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_0088_1907220","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\nstring c2s(char c){\n if(c==' ') return \"101\";\n if(c=='\\'') return \"000000\";\n if(c==',') return \"000011\";\n if(c=='-') return \"10010001\";\n if(c=='.') return \"010001\";\n if(c=='?') return \"000001\";\n if(c=='A') return \"100101\";\n if(c=='B') return \"10011010\";\n if(c=='C') return \"0101\";\n if(c=='D') return \"0001\";\n if(c=='E') return \"110\";\n if(c=='F') return \"01001\";\n if(c=='G') return \"10011011\";\n if(c=='H') return \"010000\";\n if(c=='I') return \"0111\";\n if(c=='J') return \"10011000\";\n if(c=='K') return \"0110\";\n if(c=='L') return \"00100\";\n if(c=='M') return \"10011001\";\n if(c=='N') return \"10011110\";\n if(c=='O') return \"00101\";\n if(c=='P') return \"111\";\n if(c=='Q') return \"10011111\";\n if(c=='R') return \"1000\";\n if(c=='S') return \"00110\";\n if(c=='T') return \"00111\";\n if(c=='U') return \"10011100\";\n if(c=='V') return \"10011101\";\n if(c=='W') return \"000010\";\n if(c=='X') return \"10010010\";\n if(c=='Y') return \"10010011\";\n if(c=='Z') return \"10010000\"; \n}\nchar s2c(string x){\n if(x==\"00000\") return 'A';\n if(x==\"00001\") return 'B';\n if(x==\"00010\") return 'C';\n if(x==\"00011\") return 'D';\n if(x==\"00100\") return 'E';\n if(x==\"00101\") return 'F';\n if(x==\"00110\") return 'G';\n if(x==\"00111\") return 'H';\n if(x==\"01000\") return 'I';\n if(x==\"01001\") return 'J';\n if(x==\"01010\") return 'K';\n if(x==\"01011\") return 'L';\n if(x==\"01100\") return 'M';\n if(x==\"01101\") return 'N';\n if(x==\"01110\") return 'O';\n if(x==\"01111\") return 'P';\n if(x==\"10000\") return 'Q';\n if(x==\"10001\") return 'R';\n if(x==\"10010\") return 'S';\n if(x==\"10011\") return 'T';\n if(x==\"10100\") return 'U';\n if(x==\"10101\") return 'V';\n if(x==\"10110\") return 'W';\n if(x==\"10111\") return 'X';\n if(x==\"11000\") return 'Y';\n if(x==\"11001\") return 'Z';\n if(x==\"11010\") return ' ';\n if(x==\"11011\") return '.';\n if(x==\"11100\") return ',';\n if(x==\"11101\") return '-';\n if(x==\"11110\") return '\\'';\n if(x==\"11111\") return '?';\n}\nint main(){\n string s;\n while(getline(cin,s)){\n int i;\n string m;\n for(i=0;i<s.size();i++) m+=c2s(s[i]);\n if(m.size()%5!=0){\n m+=\"0000\";\n }\n string o;\n for(i=0;i+5<=m.size();i+=5){\n o+=s2c(m.substr(i,5));\n }\n cout << o << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1196,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_0088_1665075","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i,n) for(i=0;i<n;++i)\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define sc second\n\nint main(int argc, char const *argv[]) {\n map<char,string> m;\n m[' '] =\"101\";\n m['\\'']=\"000000\";\n m[','] =\"000011\";\n m['-'] =\"10010001\";\n m['.'] =\"010001\";\n m['?'] =\"000001\";\n m['A'] =\"100101\";\n m['B'] =\"10011010\";\n m['C'] =\"0101\";\n m['D'] =\"0001\";\n m['E'] =\"110\";\n m['F'] =\"01001\";\n m['G'] =\"10011011\";\n m['H'] =\"010000\";\n m['I'] =\"0111\";\n m['J'] =\"10011000\";\n m['K'] =\"0110\";\n m['L'] =\"00100\";\n m['M'] =\"10011001\";\n m['N'] =\"10011110\";\n m['O'] =\"00101\";\n m['P'] =\"111\";\n m['Q'] =\"10011111\";\n m['R'] =\"1000\";\n m['S'] =\"00110\";\n m['T'] =\"00111\";\n m['U'] =\"10011100\";\n m['V'] =\"10011101\";\n m['W'] =\"000010\";\n m['X'] =\"10010010\";\n m['Y'] =\"10010011\";\n m['Z'] =\"10010000\";\n\n int i;\n string s;\n string al=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n while (getline(cin,s)){\n string ans=\"\";\n\n string a=\"\";\n rep(i,s.size()) a+=m[s[i]];\n\n int tmp=a.size()%5;\n if(tmp!=0){\n rep(i,5-tmp) a+=\"0\";\n }\n\n //cout << a << endl;\n\n for(int j=0; j<a.size(); j+=5){\n //5???????????¨????????????\n string b=a.substr(j,5);\n if(b==\"11010\") ans+=\" \";\n else if(b==\"11011\") ans+=\".\";\n else if(b==\"11100\") ans+=\",\";\n else if(b==\"11101\") ans+=\"-\";\n else if(b==\"11110\") ans+=\"'\";\n else if(b==\"11111\") ans+=\"?\";\n else{\n int val=0;\n for(int k=0; k<5; ++k){\n val+=(b[k]-'0')*pow(2,4-k);\n }\n ans+=al[val];\n }\n\n }\n\n std::cout << ans << std::endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1240,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_0088_1662841","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n\nchar A1[33] = \" ',-.?ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nchar B1[33] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\";\n\nstring A2[32] = {\n\t\"101\",\n\t\"000000\",\n\t\"000011\",\n\t\"10010001\",\n\t\"010001\",\n\t\"000001\",\n\t\"100101\",\n\t\"10011010\",\n\t\"0101\",\n\t\"0001\",\n\t\"110\",\n\t\"01001\",\n\t\"10011011\",\n\t\"010000\",\n\t\"0111\",\n\t\"10011000\",\n\t\"0110\",\n\t\"00100\",\n\t\"10011001\",\n\t\"10011110\",\n\t\"00101\",\n\t\"111\",\n\t\"10011111\",\n\t\"1000\",\n\t\"00110\",\n\t\"00111\",\n\t\"10011100\",\n\t\"10011101\",\n\t\"000010\",\n\t\"10010010\",\n\t\"10010011\",\n\t\"10010000\"\n};\n\nstring B2[32] = {\n\t\"00000\",\n\t\"00001\",\n\t\"00010\",\n\t\"00011\",\n\t\"00100\",\n\t\"00101\",\n\t\"00110\",\n\t\"00111\",\n\t\"01000\",\n\t\"01001\",\n\t\"01010\",\n\t\"01011\",\n\t\"01100\",\n\t\"01101\",\n\t\"01110\",\n\t\"01111\",\n\t\"10000\",\n\t\"10001\",\n\t\"10010\",\n\t\"10011\",\n\t\"10100\",\n\t\"10101\",\n\t\"10110\",\n\t\"10111\",\n\t\"11000\",\n\t\"11001\",\n\t\"11010\",\n\t\"11011\",\n\t\"11100\",\n\t\"11101\",\n\t\"11110\",\n\t\"11111\"\n};\n\nstring U;\nstring V;\n\nint main() {\n\twhile (getline(cin, U)) {\n\t\tV = \"\";\n\t\tfor (int i = 0; i < U.size(); i++) {\n\t\t\tfor (int j = 0; j < 32; j++) {\n\t\t\t\tif (A1[j] == U[i]) {\n\t\t\t\t\tV += A2[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (V.size() % 5 != 0) {\n\t\t\tV += '0';\n\t\t}\n\t\tU = \"\";\n\t\tfor (int i = 0; i < V.size(); i += 5) {\n\t\t\tfor (int j = 0; j < 32; j++) {\n\t\t\t\tif (B2[j] == V.substr(i, 5)) {\n\t\t\t\t\tU += B1[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << U << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1196,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_0088_1310781","code_snippet":"//The Code A Doctor Loved\n#include<bits/stdc++.h>\nusing namespace std;\n\nstring p(string s, string t){\n for(int i=0; i<t.length(); i++){\n if(s.length()%6==5)s+=' ';\n s+=t[i];\n }\n return s;\n}\n\nstring into(string s){\n string t=\"\";\n for(int i=0; i<s.length(); i++){\n if(s[i]==' ')t=p(t, \"101\");\n if(s[i]=='\\'')t=p(t, \"000000\");\n if(s[i]==',')t=p(t,\"000011\");\n if(s[i]=='-')t=p(t,\"10010001\");\n if(s[i]=='.')t=p(t,\"010001\");\n if(s[i]=='?')t=p(t,\"000001\");\n if(s[i]=='A')t=p(t,\"100101\");\n if(s[i]=='B')t=p(t,\"10011010\");\n if(s[i]=='C')t=p(t,\"0101\");\n if(s[i]=='D')t=p(t,\"0001\");\n if(s[i]=='E')t=p(t,\"110\");\n if(s[i]=='F')t=p(t,\"01001\");\n if(s[i]=='G')t=p(t,\"10011011\");\n if(s[i]=='H')t=p(t,\"010000\");\n if(s[i]=='I')t=p(t,\"0111\");\n if(s[i]=='J')t=p(t,\"10011000\");\n if(s[i]=='K')t=p(t,\"0110\");\n if(s[i]=='L')t=p(t,\"00100\");\n if(s[i]=='M')t=p(t,\"10011001\");\n if(s[i]=='N')t=p(t,\"10011110\");\n if(s[i]=='O')t=p(t,\"00101\");\n if(s[i]=='P')t=p(t,\"111\");\n if(s[i]=='Q')t=p(t,\"10011111\");\n if(s[i]=='R')t=p(t,\"1000\");\n if(s[i]=='S')t=p(t,\"00110\");\n if(s[i]=='T')t=p(t,\"00111\");\n if(s[i]=='U')t=p(t,\"10011100\");\n if(s[i]=='V')t=p(t,\"10011101\");\n if(s[i]=='W')t=p(t,\"000010\");\n if(s[i]=='X')t=p(t,\"10010010\");\n if(s[i]=='Y')t=p(t,\"10010011\");\n if(s[i]=='Z')t=p(t,\"10010000\");\n }\n while(t.length()%6!=5)t+='0';\n stringstream ss(t);\n string ret=\"\", tmp;\n while(getline(ss, tmp, ' ')){\n if(tmp==\"00000\")ret+='A';\n if(tmp==\"00001\")ret+='B';\n if(tmp==\"00010\")ret+='C';\n if(tmp==\"00011\")ret+='D';\n if(tmp==\"00100\")ret+='E';\n if(tmp==\"00101\")ret+='F';\n if(tmp==\"00110\")ret+='G';\n if(tmp==\"00111\")ret+='H';\n if(tmp==\"01000\")ret+='I';\n if(tmp==\"01001\")ret+='J';\n if(tmp==\"01010\")ret+='K';\n if(tmp==\"01011\")ret+='L';\n if(tmp==\"01100\")ret+='M';\n if(tmp==\"01101\")ret+='N';\n if(tmp==\"01110\")ret+='O';\n if(tmp==\"01111\")ret+='P';\n if(tmp==\"10000\")ret+='Q';\n if(tmp==\"10001\")ret+='R';\n if(tmp==\"10010\")ret+='S';\n if(tmp==\"10011\")ret+='T';\n if(tmp==\"10100\")ret+='U';\n if(tmp==\"10101\")ret+='V';\n if(tmp==\"10110\")ret+='W';\n if(tmp==\"10111\")ret+='X';\n if(tmp==\"11000\")ret+='Y';\n if(tmp==\"11001\")ret+='Z';\n if(tmp==\"11010\")ret+=' ';\n if(tmp==\"11011\")ret+='.';\n if(tmp==\"11100\")ret+=',';\n if(tmp==\"11101\")ret+='-';\n if(tmp==\"11110\")ret+='\\'';\n if(tmp==\"11111\")ret+='?';\n }\n return ret;\n}\n\nint main(){\n string s;\n while(getline(cin, s)){\n cout<<into(s)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.5455,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_0088_1907220\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\nstring c2s(char c){\\n if(c==' ') return \\\"101\\\";\\n if(c=='\\\\'') return \\\"000000\\\";\\n if(c==',') return \\\"000011\\\";\\n if(c=='-') return \\\"10010001\\\";\\n if(c=='.') return \\\"010001\\\";\\n if(c=='?') return \\\"000001\\\";\\n if(c=='A') return \\\"100101\\\";\\n if(c=='B') return \\\"10011010\\\";\\n if(c=='C') return \\\"0101\\\";\\n if(c=='D') return \\\"0001\\\";\\n if(c=='E') return \\\"110\\\";\\n if(c=='F') return \\\"01001\\\";\\n if(c=='G') return \\\"10011011\\\";\\n if(c=='H') return \\\"010000\\\";\\n if(c=='I') return \\\"0111\\\";\\n if(c=='J') return \\\"10011000\\\";\\n if(c=='K') return \\\"0110\\\";\\n if(c=='L') return \\\"00100\\\";\\n if(c=='M') return \\\"10011001\\\";\\n if(c=='N') return \\\"10011110\\\";\\n if(c=='O') return \\\"00101\\\";\\n if(c=='P') return \\\"111\\\";\\n if(c=='Q') return \\\"10011111\\\";\\n if(c=='R') return \\\"1000\\\";\\n if(c=='S') return \\\"00110\\\";\\n if(c=='T') return \\\"00111\\\";\\n if(c=='U') return \\\"10011100\\\";\\n if(c=='V') return \\\"10011101\\\";\\n if(c=='W') return \\\"000010\\\";\\n if(c=='X') return \\\"10010010\\\";\\n if(c=='Y') return \\\"10010011\\\";\\n if(c=='Z') return \\\"10010000\\\"; \\n}\\nchar s2c(string x){\\n if(x==\\\"00000\\\") return 'A';\\n if(x==\\\"00001\\\") return 'B';\\n if(x==\\\"00010\\\") return 'C';\\n if(x==\\\"00011\\\") return 'D';\\n if(x==\\\"00100\\\") return 'E';\\n if(x==\\\"00101\\\") return 'F';\\n if(x==\\\"00110\\\") return 'G';\\n if(x==\\\"00111\\\") return 'H';\\n if(x==\\\"01000\\\") return 'I';\\n if(x==\\\"01001\\\") return 'J';\\n if(x==\\\"01010\\\") return 'K';\\n if(x==\\\"01011\\\") return 'L';\\n if(x==\\\"01100\\\") return 'M';\\n if(x==\\\"01101\\\") return 'N';\\n if(x==\\\"01110\\\") return 'O';\\n if(x==\\\"01111\\\") return 'P';\\n if(x==\\\"10000\\\") return 'Q';\\n if(x==\\\"10001\\\") return 'R';\\n if(x==\\\"10010\\\") return 'S';\\n if(x==\\\"10011\\\") return 'T';\\n if(x==\\\"10100\\\") return 'U';\\n if(x==\\\"10101\\\") return 'V';\\n if(x==\\\"10110\\\") return 'W';\\n if(x==\\\"10111\\\") return 'X';\\n if(x==\\\"11000\\\") return 'Y';\\n if(x==\\\"11001\\\") return 'Z';\\n if(x==\\\"11010\\\") return ' ';\\n if(x==\\\"11011\\\") return '.';\\n if(x==\\\"11100\\\") return ',';\\n if(x==\\\"11101\\\") return '-';\\n if(x==\\\"11110\\\") return '\\\\'';\\n if(x==\\\"11111\\\") return '?';\\n}\\nint main(){\\n string s;\\n while(getline(cin,s)){\\n int i;\\n string m;\\n for(i=0;i<s.size();i++) m+=c2s(s[i]);\\n if(m.size()%5!=0){\\n m+=\\\"0000\\\";\\n }\\n string o;\\n for(i=0;i+5<=m.size();i+=5){\\n o+=s2c(m.substr(i,5));\\n }\\n cout << o << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0088_1665075\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n#define rep(i,n) for(i=0;i<n;++i)\\n#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)\\n#define mp make_pair\\n#define pb push_back\\n#define fi first\\n#define sc second\\n\\nint main(int argc, char const *argv[]) {\\n map<char,string> m;\\n m[' '] =\\\"101\\\";\\n m['\\\\'']=\\\"000000\\\";\\n m[','] =\\\"000011\\\";\\n m['-'] =\\\"10010001\\\";\\n m['.'] =\\\"010001\\\";\\n m['?'] =\\\"000001\\\";\\n m['A'] =\\\"100101\\\";\\n m['B'] =\\\"10011010\\\";\\n m['C'] =\\\"0101\\\";\\n m['D'] =\\\"0001\\\";\\n m['E'] =\\\"110\\\";\\n m['F'] =\\\"01001\\\";\\n m['G'] =\\\"10011011\\\";\\n m['H'] =\\\"010000\\\";\\n m['I'] =\\\"0111\\\";\\n m['J'] =\\\"10011000\\\";\\n m['K'] =\\\"0110\\\";\\n m['L'] =\\\"00100\\\";\\n m['M'] =\\\"10011001\\\";\\n m['N'] =\\\"10011110\\\";\\n m['O'] =\\\"00101\\\";\\n m['P'] =\\\"111\\\";\\n m['Q'] =\\\"10011111\\\";\\n m['R'] =\\\"1000\\\";\\n m['S'] =\\\"00110\\\";\\n m['T'] =\\\"00111\\\";\\n m['U'] =\\\"10011100\\\";\\n m['V'] =\\\"10011101\\\";\\n m['W'] =\\\"000010\\\";\\n m['X'] =\\\"10010010\\\";\\n m['Y'] =\\\"10010011\\\";\\n m['Z'] =\\\"10010000\\\";\\n\\n int i;\\n string s;\\n string al=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n while (getline(cin,s)){\\n string ans=\\\"\\\";\\n\\n string a=\\\"\\\";\\n rep(i,s.size()) a+=m[s[i]];\\n\\n int tmp=a.size()%5;\\n if(tmp!=0){\\n rep(i,5-tmp) a+=\\\"0\\\";\\n }\\n\\n //cout << a << endl;\\n\\n for(int j=0; j<a.size(); j+=5){\\n //5???????????¨????????????\\n string b=a.substr(j,5);\\n if(b==\\\"11010\\\") ans+=\\\" \\\";\\n else if(b==\\\"11011\\\") ans+=\\\".\\\";\\n else if(b==\\\"11100\\\") ans+=\\\",\\\";\\n else if(b==\\\"11101\\\") ans+=\\\"-\\\";\\n else if(b==\\\"11110\\\") ans+=\\\"'\\\";\\n else if(b==\\\"11111\\\") ans+=\\\"?\\\";\\n else{\\n int val=0;\\n for(int k=0; k<5; ++k){\\n val+=(b[k]-'0')*pow(2,4-k);\\n }\\n ans+=al[val];\\n }\\n\\n }\\n\\n std::cout << ans << std::endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0088_1662841\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n\\nchar A1[33] = \\\" ',-.?ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nchar B1[33] = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?\\\";\\n\\nstring A2[32] = {\\n\\t\\\"101\\\",\\n\\t\\\"000000\\\",\\n\\t\\\"000011\\\",\\n\\t\\\"10010001\\\",\\n\\t\\\"010001\\\",\\n\\t\\\"000001\\\",\\n\\t\\\"100101\\\",\\n\\t\\\"10011010\\\",\\n\\t\\\"0101\\\",\\n\\t\\\"0001\\\",\\n\\t\\\"110\\\",\\n\\t\\\"01001\\\",\\n\\t\\\"10011011\\\",\\n\\t\\\"010000\\\",\\n\\t\\\"0111\\\",\\n\\t\\\"10011000\\\",\\n\\t\\\"0110\\\",\\n\\t\\\"00100\\\",\\n\\t\\\"10011001\\\",\\n\\t\\\"10011110\\\",\\n\\t\\\"00101\\\",\\n\\t\\\"111\\\",\\n\\t\\\"10011111\\\",\\n\\t\\\"1000\\\",\\n\\t\\\"00110\\\",\\n\\t\\\"00111\\\",\\n\\t\\\"10011100\\\",\\n\\t\\\"10011101\\\",\\n\\t\\\"000010\\\",\\n\\t\\\"10010010\\\",\\n\\t\\\"10010011\\\",\\n\\t\\\"10010000\\\"\\n};\\n\\nstring B2[32] = {\\n\\t\\\"00000\\\",\\n\\t\\\"00001\\\",\\n\\t\\\"00010\\\",\\n\\t\\\"00011\\\",\\n\\t\\\"00100\\\",\\n\\t\\\"00101\\\",\\n\\t\\\"00110\\\",\\n\\t\\\"00111\\\",\\n\\t\\\"01000\\\",\\n\\t\\\"01001\\\",\\n\\t\\\"01010\\\",\\n\\t\\\"01011\\\",\\n\\t\\\"01100\\\",\\n\\t\\\"01101\\\",\\n\\t\\\"01110\\\",\\n\\t\\\"01111\\\",\\n\\t\\\"10000\\\",\\n\\t\\\"10001\\\",\\n\\t\\\"10010\\\",\\n\\t\\\"10011\\\",\\n\\t\\\"10100\\\",\\n\\t\\\"10101\\\",\\n\\t\\\"10110\\\",\\n\\t\\\"10111\\\",\\n\\t\\\"11000\\\",\\n\\t\\\"11001\\\",\\n\\t\\\"11010\\\",\\n\\t\\\"11011\\\",\\n\\t\\\"11100\\\",\\n\\t\\\"11101\\\",\\n\\t\\\"11110\\\",\\n\\t\\\"11111\\\"\\n};\\n\\nstring U;\\nstring V;\\n\\nint main() {\\n\\twhile (getline(cin, U)) {\\n\\t\\tV = \\\"\\\";\\n\\t\\tfor (int i = 0; i < U.size(); i++) {\\n\\t\\t\\tfor (int j = 0; j < 32; j++) {\\n\\t\\t\\t\\tif (A1[j] == U[i]) {\\n\\t\\t\\t\\t\\tV += A2[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (V.size() % 5 != 0) {\\n\\t\\t\\tV += '0';\\n\\t\\t}\\n\\t\\tU = \\\"\\\";\\n\\t\\tfor (int i = 0; i < V.size(); i += 5) {\\n\\t\\t\\tfor (int j = 0; j < 32; j++) {\\n\\t\\t\\t\\tif (B2[j] == V.substr(i, 5)) {\\n\\t\\t\\t\\t\\tU += B1[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << U << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0088_1310781\",\n \"code_snippet\": \"//The Code A Doctor Loved\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstring p(string s, string t){\\n for(int i=0; i<t.length(); i++){\\n if(s.length()%6==5)s+=' ';\\n s+=t[i];\\n }\\n return s;\\n}\\n\\nstring into(string s){\\n string t=\\\"\\\";\\n for(int i=0; i<s.length(); i++){\\n if(s[i]==' ')t=p(t, \\\"101\\\");\\n if(s[i]=='\\\\'')t=p(t, \\\"000000\\\");\\n if(s[i]==',')t=p(t,\\\"000011\\\");\\n if(s[i]=='-')t=p(t,\\\"10010001\\\");\\n if(s[i]=='.')t=p(t,\\\"010001\\\");\\n if(s[i]=='?')t=p(t,\\\"000001\\\");\\n if(s[i]=='A')t=p(t,\\\"100101\\\");\\n if(s[i]=='B')t=p(t,\\\"10011010\\\");\\n if(s[i]=='C')t=p(t,\\\"0101\\\");\\n if(s[i]=='D')t=p(t,\\\"0001\\\");\\n if(s[i]=='E')t=p(t,\\\"110\\\");\\n if(s[i]=='F')t=p(t,\\\"01001\\\");\\n if(s[i]=='G')t=p(t,\\\"10011011\\\");\\n if(s[i]=='H')t=p(t,\\\"010000\\\");\\n if(s[i]=='I')t=p(t,\\\"0111\\\");\\n if(s[i]=='J')t=p(t,\\\"10011000\\\");\\n if(s[i]=='K')t=p(t,\\\"0110\\\");\\n if(s[i]=='L')t=p(t,\\\"00100\\\");\\n if(s[i]=='M')t=p(t,\\\"10011001\\\");\\n if(s[i]=='N')t=p(t,\\\"10011110\\\");\\n if(s[i]=='O')t=p(t,\\\"00101\\\");\\n if(s[i]=='P')t=p(t,\\\"111\\\");\\n if(s[i]=='Q')t=p(t,\\\"10011111\\\");\\n if(s[i]=='R')t=p(t,\\\"1000\\\");\\n if(s[i]=='S')t=p(t,\\\"00110\\\");\\n if(s[i]=='T')t=p(t,\\\"00111\\\");\\n if(s[i]=='U')t=p(t,\\\"10011100\\\");\\n if(s[i]=='V')t=p(t,\\\"10011101\\\");\\n if(s[i]=='W')t=p(t,\\\"000010\\\");\\n if(s[i]=='X')t=p(t,\\\"10010010\\\");\\n if(s[i]=='Y')t=p(t,\\\"10010011\\\");\\n if(s[i]=='Z')t=p(t,\\\"10010000\\\");\\n }\\n while(t.length()%6!=5)t+='0';\\n stringstream ss(t);\\n string ret=\\\"\\\", tmp;\\n while(getline(ss, tmp, ' ')){\\n if(tmp==\\\"00000\\\")ret+='A';\\n if(tmp==\\\"00001\\\")ret+='B';\\n if(tmp==\\\"00010\\\")ret+='C';\\n if(tmp==\\\"00011\\\")ret+='D';\\n if(tmp==\\\"00100\\\")ret+='E';\\n if(tmp==\\\"00101\\\")ret+='F';\\n if(tmp==\\\"00110\\\")ret+='G';\\n if(tmp==\\\"00111\\\")ret+='H';\\n if(tmp==\\\"01000\\\")ret+='I';\\n if(tmp==\\\"01001\\\")ret+='J';\\n if(tmp==\\\"01010\\\")ret+='K';\\n if(tmp==\\\"01011\\\")ret+='L';\\n if(tmp==\\\"01100\\\")ret+='M';\\n if(tmp==\\\"01101\\\")ret+='N';\\n if(tmp==\\\"01110\\\")ret+='O';\\n if(tmp==\\\"01111\\\")ret+='P';\\n if(tmp==\\\"10000\\\")ret+='Q';\\n if(tmp==\\\"10001\\\")ret+='R';\\n if(tmp==\\\"10010\\\")ret+='S';\\n if(tmp==\\\"10011\\\")ret+='T';\\n if(tmp==\\\"10100\\\")ret+='U';\\n if(tmp==\\\"10101\\\")ret+='V';\\n if(tmp==\\\"10110\\\")ret+='W';\\n if(tmp==\\\"10111\\\")ret+='X';\\n if(tmp==\\\"11000\\\")ret+='Y';\\n if(tmp==\\\"11001\\\")ret+='Z';\\n if(tmp==\\\"11010\\\")ret+=' ';\\n if(tmp==\\\"11011\\\")ret+='.';\\n if(tmp==\\\"11100\\\")ret+=',';\\n if(tmp==\\\"11101\\\")ret+='-';\\n if(tmp==\\\"11110\\\")ret+='\\\\'';\\n if(tmp==\\\"11111\\\")ret+='?';\\n }\\n return ret;\\n}\\n\\nint main(){\\n string s;\\n while(getline(cin, s)){\\n cout<<into(s)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.5455,\n \"final_rank\": 2\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":0,"numItemsPerPage":100,"numTotalItems":2103,"offset":0,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODAyNDU0Mywic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc4MDI4MTQzLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.sGfFACkXN4bsnT5OmaV4xxDqdh1Sl8twVlFsn6VwQg0VvQucpBdwgqx5Zsyjj1SMm-nV2i1MdUJKNvmOfZ6xBw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
group_id stringlengths 12 18 | problem_description stringlengths 85 3.02k | candidates listlengths 3 20 |
|---|---|---|
aoj_ALDS1_1_B_cpp | Greatest Common Divisor
Write a program which finds the greatest common divisor of two natural numbers
a
and
b
Input
a
and
b
are given in a line sparated by a single space.
Output
Output the greatest common divisor of
a
and
b
.
Constrants
1 ≤
a
,
b
≤ 10
9
Hint
You can use the following observation:
For integers
x
and
y... | [
{
"submission_id": "aoj_ALDS1_1_B_10915851",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int x, y; cin >> x >> y;\n int d = 2;\n int gcd = 1;\n\n while(d <= x && d <= y){\n if (x % d == 0 && y % d == 0){\n x = x / d;\n y = y / d;\n ... |
aoj_ALDS1_2_D_cpp | Shell Sort
Shell Sort is a generalization of Insertion Sort (ALDS1_1_A) to arrange a list of $n$ elements $A$.
1 insertionSort(A, n, g)
2 for i = g to n-1
3 v = A[i]
4 j = i - g
5 while j >= 0 && A[j] > v
6 A[j+g] = A[j]
7 j = j - g
8 cnt++
9 ... | [
{
"submission_id": "aoj_ALDS1_2_D_11015424",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // 隠すもの。外から見えない\n int *a; // 可変長配列\n int n; // 要素数\n int capacity; // 確保する容量\n\npublic: // 公開するもの\n my... |
aoj_ALDS1_1_D_cpp | Maximum Profit
You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.
Write a program which reads values of a currency $R_t$ at a certain time $t$... | [
{
"submission_id": "aoj_ALDS1_1_D_11066075",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main ( ) {\n\tint n = 0, min = 0, result = -1000000000, temp = 0;\n\tcin >> n;\n\tcin >> min;\n\tfor (int i = 0; i < n-1; i++) {\n\t\tcin >> temp;\n\t\tif (temp - min > result) {\n\t\t\tresult = temp ... |
aoj_ALDS1_1_C_cpp | Prime Numbers
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.
Write a program which reads a list of
N
integers and prints the number of prime numbers in the list.
Input
The first line contains an integ... | [
{
"submission_id": "aoj_ALDS1_1_C_11063301",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nint gcd(int a, int b) {\n while (b != 0) {\n int temp = b;\n b = a % b;\n a = temp;\n }\n return a;\n}\nint lcm(int a, int b) {\n return a / gcd(a, b) * b;\n}\nint m... |
aoj_ALDS1_4_C_cpp | Search III
Your task is to write a program of a simple
dictionary
which implements the following instructions:
insert
str
: insert a string
str
in to the dictionary
find
str
: if the distionary contains
str
, then print '
yes
', otherwise print '
no
'
Input
In the first line
n
, the number of instructions is given. In ... | [
{
"submission_id": "aoj_ALDS1_4_C_11057022",
"code_snippet": "// ██████████████████╗█████╗███╗ ██╗ ██████╗ █████╗████╗ ██╗█████╗███╗ ██╗\n// ╚══██╔══██╚══██╔══██╔══██████╗ ██║ ██╔══████╔══████╚██╗ ██╔██╔══██████╗ ██║\n// ██║ ██║ ██║ █████████╔██╗ ██║ ██████╔█████████║╚████╔╝█████████╔... |
aoj_ALDS1_4_B_cpp | Search II
You are given a sequence of
n
integers S and a sequence of different
q
integers T. Write a program which outputs C, the number of integers in T which are also in the set S.
Input
In the first line
n
is given. In the second line,
n
integers are given. In the third line
q
is given. Then, in the fourth line,
q
i... | [
{
"submission_id": "aoj_ALDS1_4_B_11066403",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n\nint main() {\n int n,q; cin>>n;\n int s[n+5], t;\n int count=0;\n\n for(int i =1; i<=n;i++){\n cin>>s[i];\n }\n cin>>q;\n for(int i=1;i<=q;i++){\n... |
aoj_ALDS1_3_C_cpp | Doubly Linked List
Your task is to implement a double linked list.
Write a program which performs the following operations:
insert x: insert an element with key x into the front of the list.
delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.
... | [
{
"submission_id": "aoj_ALDS1_3_C_11042443",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, x;\nstring s;\nlist<int> l;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0); cout.tie(0);\n\n cin >> n;\n while(n--) {\n cin >> s;\n if(s == \"insert... |
aoj_ALDS1_4_D_cpp | Allocation
You are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packag... | [
{
"submission_id": "aoj_ALDS1_4_D_10995248",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main(){\n int BaggageCount, TrackCount;\n cin >> BaggageCount >> TrackCount;\n vector<int> BaggageWeights(BaggageCount);\n for (int i = 0; i < Baggag... |
aoj_ALDS1_3_B_cpp | There are
n
processes in a queue. Each process has name
i
and time
i
. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a
quantum
(a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then ... | [
{
"submission_id": "aoj_ALDS1_3_B_11064149",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int mod = 1000000007;\n#define srt(v) sort(v.begin(), v.end());\n#define srt_Dec(v) sort(v.begin(), v.end(), greater<int>());\n\nint solve1(){\n\n return 0;\n}\nint... |
aoj_ALDS1_5_A_cpp | Exhaustive Search
Write a program which reads a sequence
A
of
n
elements and an integer
M
, and outputs "
yes
" if you can make
M
by adding elements in
A
, otherwise "
no
". You can use an element only once.
You are given the sequence
A
and
q
questions where each question contains
M
i
.
Input
In the first line
n
is giv... | [
{
"submission_id": "aoj_ALDS1_5_A_11061393",
"code_snippet": "# include <stdio.h>\n\nstatic int N, A[50];\n\nstatic int solve(int i, int m)\n{\n if (m == 0)\n return 1;\n if (i >= N)\n return 0;\n\n /* A[i]を使用するか、しないか */\n int res = (solve(i + 1, m) || solve(i + 1, m - A[i]));\n ... |
aoj_ALDS1_5_B_cpp | Merge Sort
Write a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.
Merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
create array L[0...n1], R[0...n2]
for i = 0 to n1-1
do L[i] = A[left + i]
for ... | [
{
"submission_id": "aoj_ALDS1_5_B_11061501",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long cnt = 0;\n\nvoid merge(vector<int> &A, int left, int mid, int right) {\n int n1 = mid - left;\n int n2 = right - mid;\n\n vector<int> L(n1 + 1), R(n2 + 1);\n\n for (int i = 0... |
aoj_ALDS1_6_B_cpp | Partition
Quick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[... | [
{
"submission_id": "aoj_ALDS1_6_B_11066645",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint partition(vector<int>& A, int p, int r) {\n int x = A[r]; // pivot\n int i = p - 1;\n for (int j = p; j <= r - 1; j++) {\n if (A[j] <= x) {\n i++;... |
aoj_ALDS1_6_C_cpp | Quick Sort
Let's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:
Partition(A, p, r)
1 x = A[r]
2 i = p-1
3 for j = p to r-1
4 do if A[j] <= x
5 then i = i... | [
{
"submission_id": "aoj_ALDS1_6_C_11066665",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Card {\n char suit;\n int value;\n};\n\n// partition (ALDS1_6_B 準拠)\nint partition(vector<Card> &A, int p, int r) {\n int x = A[r].value;\n int i = p - 1;\n for (int j = p; j... |
aoj_ALDS1_5_D_cpp | The Number of Inversions
For a given sequence $A = \{a_0, a_1, ... a_{n-1}\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:
bubbleSort(A)
cnt = 0 // the number o... | [
{
"submission_id": "aoj_ALDS1_5_D_11047972",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<v... |
aoj_ALDS1_6_A_cpp | Counting Sort
Counting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into it... | [
{
"submission_id": "aoj_ALDS1_6_A_11013399",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<int> counting_sort(vector<int>& a, int k)\n{\n vector<int> c;\n c.assign(k+1, 0);\n\n for (int j = 0; j < a.size(); j++)\n c[a[j]]++;\n\n for (int i = 0; i <= k; i++)\n ... |
aoj_ALDS1_7_A_cpp | Rooted Trees
A graph
G
= (
V
,
E
) is a data structure where
V
is a finite set of vertices and
E
is a binary relation on
V
represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).
Fig. 1
A free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the ... | [
{
"submission_id": "aoj_ALDS1_7_A_11041298",
"code_snippet": "#include<iostream>\nusing namespace std;\nstatic const int MAX = 100005;\nstatic const int NIL = -1;\n\nstruct Node {int p, l, r;};\n\nNode T[MAX];\nint n, D[MAX];\n\nvoid print(int u){\n int i,c;\n cout << \"node \" << u << \": \";\n co... |
aoj_ALDS1_8_A_cpp | Binary Search Tree I
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in ... | [
{
"submission_id": "aoj_ALDS1_8_A_11016963",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct binary_node\n{\n int id;\n binary_node* parent;\n binary_node* left;\n binary_node* right;\n\n int key;\n\n void set_left(binary_node& l)\n {\n left = &l;\n }... |
aoj_ALDS1_8_B_cpp | Binary Search Tree II
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
insert
$k$: Insert a node containing $k$ as key into $T$.
find
$k$: Report whether $T$ has a node containing $k$.
print
: Print the keys of the binary search... | [
{
"submission_id": "aoj_ALDS1_8_B_11017045",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct binary_node\n{\n int id;\n binary_node* parent;\n binary_node* left;\n binary_node* right;\n\n int key;\n\n void set_left(binary_node& l)\n {\n left = &l;\n }... |
aoj_ALDS1_9_B_cpp | Maximum Heap
A binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node con... | [
{
"submission_id": "aoj_ALDS1_9_B_11055699",
"code_snippet": "#include <bits/stdc++.h>\n// #include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nll INF = 2e18;\n#define PI 3.14159265358979323846264338327950l\n// namespace multip = boost::multiprec... |
aoj_ALDS1_8_C_cpp | Binary Search Tree III
Write a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.
insert
$k$: Insert a node containing $k$ as key into $T$.
find
$k$: Report whether $T$ has a node containing $k$.
delete
$k$: Delete a node containing $k$.
p... | [
{
"submission_id": "aoj_ALDS1_8_C_11025601",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, s, n) for (int i = (s); i < (n); i++)\n\n\n// vectorを出力する\nvoid vecprint(vector<int> vec) {\n rep(i, vec.si... |
aoj_ALDS1_8_D_cpp | Treap
A binary search tree can be unbalanced depending on features of data. For example, if we insert $n$ elements into a binary search tree in ascending order, the tree become a list, leading to long search times. One of strategies is to randomly shuffle the elements to be inserted. However, we should consider to main... | [
{
"submission_id": "aoj_ALDS1_8_D_10850490",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nstruct point{\n\tint a,b;\n\tpoint *l,*r,*pa;\n\tpoint(){l=r=pa=NULL;}\n\tpoint(int aa,int bb):a(aa),b(bb){l=r=pa=NULL;};\n};\npoint *root;\npoint *rightRotate(point *t){\n\tpoint *s=t->l;\n\tt->l=s... |
aoj_ALDS1_9_D_cpp | Heap Sort
There are a number of sorting algorithms which have different characteristics as follows.
Algorithm
Time Complexity
(Worst)
Time Complexity
(Average)
Stability
Memory
Efficiency
Method
Features
Insertion Sort
ALDS1_1_A
O($N^2$)
O($N^2$)
〇
〇
Insertion
Can be fast for an almost sorted array
Bubble Sort
ALDS1_2_... | [
{
"submission_id": "aoj_ALDS1_9_D_10848487",
"code_snippet": "#include <stdio.h>\n#include <stdlib.h>\n#define gc() getchar()\n#define pc(c) putchar(c)\n#define p(i) i/2\n\nvoid out(int a){\n char i = 0, str[10];\n do str[i++] = (a%10)|0x30, a /= 10; while(a > 0);\n while(i--) pc(str[i]);\n}\n\nint... |
aoj_ALDS1_12_A_cpp | Minimum Spanning Tree
For a given weighted graph $G = (V, E)$, find the minimum spanning tree (MST) of $G$ and print total weight of edges belong to the MST.
Input
In the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, a $n \times n$ adjacency matrix $A$ which rep... | [
{
"submission_id": "aoj_ALDS1_12_A_10644587",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nmap<int, vector<int>> vertex;\nmap<int, vector<int>> edge;\nint sum = 0;\n\nstruct UnionFind {\n vector<int> parent, rank;\n\n UnionFin... |
aoj_ALDS1_10_D_cpp | Optimal Binary Search Tree
Optimal Binary Search Tree is a binary search tree constructed from $n$ keys and $n+1$ dummy keys so as to minimize the expected value of cost for a search operation.
We are given a sequence $K = {k_1, k_2, ..., k_n}$ of $n$ distinct keys in sorted order $(k_1 < k_2 < ... < k_n)$, and we wish... | [
{
"submission_id": "aoj_ALDS1_10_D_11017187",
"code_snippet": "//\n// Created by Manas Choudhary on 04-11-2025 05:05 PM\n//\n#include <algorithm>\n#include <iostream>\n#include <chrono>\n#include <vector>\n#include <cmath>\n#include <unordered_map>\n#include <map>\n#include <queue>\n#define ll long double\n... |
aoj_ALDS1_10_C_cpp | Longest Common Subsequence
For given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \{a,b,c,b,d,a,b\}$ and $Y = \{b,d,c,a,b,a\}$, the sequence $\{b,c,a\}$ is a common subsequence of both $X$ and $Y$. On the other hand, t... | [
{
"submission_id": "aoj_ALDS1_10_C_11058892",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing ll=long long;\nconst ll INF=1ll<<60;\nint main(){\n int q;\n cin>>q;\n while(q--){\n string s,t;\n cin>>s>>t;\n ... |
aoj_ALDS1_13_A_cpp | 8 Queens Problem
The goal of 8 Queens Problem is to put eight queens on a chess-board such that none of them threatens any of others. A queen threatens the squares in the same row, in the same column, or on the same diagonals as shown in the following figure.
For a given chess board where $k$ queens are already placed,... | [
{
"submission_id": "aoj_ALDS1_13_A_10595759",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <functional>\n#include <stack>\n\nusing namespace std;\nusing l = l... |
aoj_ALDS1_9_C_cpp | Priority Queue
A priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:
$insert(S, k)$: insert an element $k$ into the set $S$
$extractMax(S)$: remove and return the element of $S$ with the largest key
Write a program whic... | [
{
"submission_id": "aoj_ALDS1_9_C_11064162",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nconst int mod = 1000000007;\n#define srt(v) sort(v.begin(), v.end());\n#define srt_Dec(v) sort(v.begin(), v.end(), greater<int>());\n\nint solve1(){\n\n return 0;\n}\nint... |
aoj_ALDS1_12_C_cpp | Single Source Shortest Path II
For a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.
Input
In the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the f... | [
{
"submission_id": "aoj_ALDS1_12_C_11041168",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\nstatic const int MAX = 10000;\nstatic const int INFTY = (1<<20);\nstatic const int WHITE = 0;\nstatic const int GRAY = 1;\nstatic const int BLACK = 2;\n\nint n;\nvec... |
aoj_ALDS1_11_D_cpp | Connected Components
Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.
Input
In the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS... | [
{
"submission_id": "aoj_ALDS1_11_D_11066465",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <stack>\nusing namespace std;\nstatic const int MAX = 100000;\nstatic const int NIL = -1;\n\nint n;\nvector<int> G[MAX];\nint color[MAX];\n\nvoid dfs(int r, int c) {\n stack<int> S;\n S.push... |
aoj_ALDS1_13_B_cpp | 8 Puzzle
The goal of the 8 puzzle problem is to complete pieces on $3 \times 3$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 8 as shown below.
1 3 0
4 2 5
7 8 6
You can move a piece toward the empty space at one step. Your g... | [
{
"submission_id": "aoj_ALDS1_13_B_11010942",
"code_snippet": "#include <cstdio>\n#include <queue>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <iostream>\nconst int N=3;//计算零点的上下左右\nconst int N2=9;\nusing namespace std;\nstruct Puzzle{\n int f[N2];//拼图按顺序对应的数字\n int space;//零所在的... |
aoj_ALDS1_15_A_cpp | Change-Making Problem
You want to make change for $n$ cents. Assuming that you have infinite supply of coins of 1, 5, 10 and/or 25 cents coins respectively, find the minimum number of coins you need.
Input
$n$
The integer $n$ is given in a line.
出力
Print the minimum number of coins you need in a line.
Constraints
$1 \l... | [
{
"submission_id": "aoj_ALDS1_15_A_10945998",
"code_snippet": "#include <stdio.h>\n\nint main(){\n\tint count = 0;\n\tint num;\n\tscanf(\"%d\",&num);\n\twhile(num>0){\n\t\twhile(num>=25){\n\t\t\tnum-= 25;\n\t\t\tcount++;\n\t\t}\n\t\twhile(num >= 10){\n\t\t\tnum-= 10;\n\t\t\tcount++;\n\t\t}\n\t\twhile(num >=... |
aoj_ALDS1_13_C_cpp | 15 Puzzle
The goal of the 15 puzzle problem is to complete pieces on $4 \times 4$ cells where one of the cells is empty space.
In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.
1 2 3 4
6 7 8 0
5 10 11 12
9 13 14 15
You can move a piece toward the empty sp... | [
{
"submission_id": "aoj_ALDS1_13_C_11003707",
"code_snippet": "//迭代加深A*/IDA*\n#include <iostream>\n#include <cmath>\n#include <string>\n#include <algorithm>\nusing namespace std;\n#define N 4\n#define N2 16\nconst int LIMIT=100;\nstruct puzzle{\n int f[N2];\n int space;\n int MD;\n};\nint MDT[N2][N... |
aoj_ALDS1_14_C_cpp | Pattern Search
Find places where a
R
×
C
pattern is found within a
H
×
W
region. Print top-left coordinates (
i
,
j
) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (
H
-1,
W
-1) respectively.
Input
In the first line, two integers
H
and
W
are given. In the ... | [
{
"submission_id": "aoj_ALDS1_14_C_10933201",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\nusing ull = unsigned long long;\n#define D1 1000000007\n#define D2 2000000011\n\nint main(){\n\tint H, W;\n\tcin >> H >> W;\n\tvector<string> str(H);\n\tfor(auto& i : ... |
aoj_ALDS1_14_B_cpp | String Search
Find places where a string
P
is found within a text
T
.
Print all indices of
T
where
P
found. The indices of
T
start with 0.
Input
In the first line, a text
T
is given. In the second line, a string
P
is given.
Output
Print an index of
T
where
P
found in a line. Print the indices in ascending order.
Cons... | [
{
"submission_id": "aoj_ALDS1_14_B_10961094",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\n// 失敗関数fの計算\nvoid compf(string p, int f[])\n{\n\tf[0] = -1;\n\t\n\tfor(int i=1; i<p.size()+1; i++){\n\t\tint j = f[i-1];\t\t\t\t\t// 1文字前のf\n\t\t\n\t\twhile(j>=0 && p[i-1]!=p[j]){\n... |
aoj_DSL_1_B_cpp | Weighted Union Find Trees
There is a sequence $A = a_0, a_1, ..., a_{n-1}$. You are given the following information and questions.
relate$(x, y, z)$: $a_y$ is greater than $a_x$ by $z$
diff$(x, y)$: report the difference between $a_x$ and $a_y$ $(a_y - a_x)$
Input
$n \; q$
$query_1$
$query_2$
:
$query_q$
In the first l... | [
{
"submission_id": "aoj_DSL_1_B_11052170",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct Weighted_UnionFind {\n vector<int> par, rank, siz;\n vector<ll> weight;\n\n Weighted_UnionFind(int N) : par(N,-1), rank(N, 0), siz(N,1), weight(N,0) {}\n \n... |
aoj_DSL_1_A_cpp | Disjoint Set
Write a program which manipulates a disjoint set
S = {S
1
, S
2
, . . . , S
k
}
.
First of all, the program should read an integer
n
, then make a disjoint set where each element consists of 0, 1, ...
n−1
respectively.
Next, the program should read an integer
q
and manipulate the set for
q
queries. There a... | [
{
"submission_id": "aoj_DSL_1_A_11063815",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstdint>\n\nnamespace uft { // mst.cc で merge 関数を使用するために、名前空間を定義する\n\nuint16_t root(uint16_t idx, std::vector<uint16_t>& parent) {\n if (parent[idx] == idx) { // 親が自分自身の場合\n return idx;\n ... |
aoj_DSL_2_A_cpp | Range Minimum Query (RMQ)
Write a program which manipulates a sequence
A
= {
a
0
, a
1
, . . . , a
n-1
} with the following operations:
find(s, t)
: report the minimum element in
a
s
, a
s+1
, . . . ,a
t
.
update(i, x)
: change
a
i
to
x
.
Note that the initial values of
a
i
(
i = 0, 1, . . . , n−1
) are 2
31
-1.
Inp... | [
{
"submission_id": "aoj_DSL_2_A_11066373",
"code_snippet": "#ifndef ATCODER_INTERNAL_BITOP_HPP\n#define ATCODER_INTERNAL_BITOP_HPP 1\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#if __cplusplus >= 202002L\n#include <bit>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n#if __cplusplus >= 2020... |
aoj_ALDS1_14_D_cpp | String Search
Determine whether a text
T
includes a pattern
P
. Your program should answer for given queries consisting of
P_i
.
Input
In the first line, a text
T
is given. In the second line, an integer
Q
denoting the number of queries is given. In the following
Q
lines, the patterns
P_i
are given respectively.
Output... | [
{
"submission_id": "aoj_ALDS1_14_D_10853897",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) a.begin(), a.end()\n#define MS(m,v) memset(m,v,sizeof(m))\ntypedef long long ll;\ntypedef lo... |
aoj_DSL_2_B_cpp | Range Sum Query
Write a program which manipulates a sequence
A
= {
a
1
, a
2
, . . . , a
n
} with the following operations:
add(i, x)
: add
x
to
a
i
.
getSum(s, t)
: print the sum of
a
s
, a
s+1
,...,a
t
.
Note that the initial values of
a
i
(
i = 1, 2, . . . , n
) are 0.
Input
n
q
com
1
x
1
y
1
com
2
x
2
y
2
...
com
q... | [
{
"submission_id": "aoj_DSL_2_B_11059888",
"code_snippet": "#include <bits/stdc++.h>\n#include <bit>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nusing pii = pair<int, int>;\nusing pic = pair<int,... |
aoj_DSL_2_C_cpp | Range Search (kD Tree)
The range search problem consists of a set of attributed records
S
to determine which records from
S
intersect with a given range.
For
n
points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.
Inp... | [
{
"submission_id": "aoj_DSL_2_C_11053254",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Point {\n int x, y, idx;\n};\n\nstruct KDNode {\n Point p;\n KDNode *left, *right;\n int minX, maxX, minY, maxY;\n\n KDNode() : left(nullptr), right(nullptr) {}\n};\n\nbool cmp... |
aoj_ALDS1_15_B_cpp | Fractional Knapsack Problem
You have $N$ items that you want to put them into a knapsack of capacity $W$. Item $i$ ($1 \le i \le N$) has weight $w_i$ and value $v_i$ for the weight.
When you put some items into the knapsack, the following conditions must be satisfied:
The total value of the items is as large as possibl... | [
{
"submission_id": "aoj_ALDS1_15_B_11063373",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef struct items{\n int v;\n int w;\n float r;\n int s=0;\n\n}it;\n\nint main (){\n int n, c, tw=0;\n double sum=0;\n it x[100000];\n\n cin >... |
aoj_ALDS1_15_C_cpp | Activity Selection Problem
There are $n$ acitivities with start times $\{s_i\}$ and finish times $\{t_i\}$. Assuming that a person can only work on a single activity at a time, find the maximum number of activities that can be performed by a single person.
Input
$n$
$s_1$ $t_1$
$s_2$ $t_2$
:
$s_n$ $t_n$
The first line ... | [
{
"submission_id": "aoj_ALDS1_15_C_11063446",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef struct time{\n int s;\n int f;\n}tym;\n\nint main(){\n int n, c=1;\n tym t[100000];\n cin >> n;\n\n for(int i=0; i<n; i++){\n cin >> t[i].s >> t[i].f;\n }\n\n ... |
aoj_DSL_3_C_cpp | The Number of Windows
For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and $Q$ integers $x_i$ as queries, for each query, print the number of combinations of two integers $(l, r)$ which satisfies the condition: $1 \leq l \leq r \leq N$ and $a_l + a_{l+1} + ... + a_{r-1} + a_r \leq x_i$.
Constraints
$1 \leq ... | [
{
"submission_id": "aoj_DSL_3_C_11066206",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);\n#define FOR(i,a,b) for(int i=a;i<b;i++)\n#define ROF(i,a,b) for(int i=b-1;i>=a;i--) \n#define vecin(vec,n) for(int i=0;i<n;i++) cin>>... |
aoj_DSL_4_A_cpp | Union of Rectangles
Given a set of $N$ axis-aligned rectangles in the plane, find the area of regions which are covered by at least one rectangle.
Input
The input is given in the following format.
$N$
$x1_1$ $y1_1$ $x2_1$ $y2_1$
$x1_2$ $y1_2$ $x2_2$ $y2_2$
:
$x1_N$ $y1_N$ $x2_N$ $y2_N$
($x1_i, y1_i$) and ($x2_i, y2_i$)... | [
{
"submission_id": "aoj_DSL_4_A_11064592",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; ++i)\n\nint main() {\n int N;\n cin >> N;\n vector<int> X1, X2, Y1, Y2, X, Y;\n rep(i, N) {\n int x1, y1, x2, y2;\n... |
aoj_DSL_5_B_cpp | The Maximum Number of Overlaps
Given a set of $N$ axis-aligned rectangular seals, find the number of overlapped seals on the region which has the maximum number of overlapped seals.
Input
The input is given in the following format.
$N$
$x1_1$ $y1_1$ $x2_1$ $y2_1$
$x1_2$ $y1_2$ $x2_2$ $y2_2$
:
$x1_N$ $y1_N$ $x2_N$ $y2_N... | [
{
"submission_id": "aoj_DSL_5_B_11044734",
"code_snippet": "// --- Start of include: ./../../akakoi_lib/template/template.cpp ---\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3,unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(ll i=0... |
aoj_DSL_5_A_cpp | The Maximum Number of Customers
$N$ persons visited a restaurant. The restaurant is open from 0 to $T$. The $i$-th person entered the restaurant at $l_i$ and left at $r_i$. Find the maximum number of persons during the business hours.
Constraints
$ 1 \leq N \leq 10^5 $
$ 1 \leq T \leq 10^5 $
$ 0 \leq l_i < r_i \leq T $... | [
{
"submission_id": "aoj_DSL_5_A_10994563",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\n#define OVERLOAD_REP(v1, v2, v3, v4, NAME, ...) NAME\n#define REP1(i, n) for (int i = 0; (i) < (n); ++(i))\n#define REP2(i, l, r) for (int i = (l); (i) < (r); ++(i))\n#define REP3(i, l, r, d) for ... |
aoj_GRL_1_B_cpp | Single Source Shortest Path (Negative Edges)
Input
An edge-weighted graph
G
(
V
,
E
) and the source
r
.
|
V
| |
E
|
r
s
0
t
0
d
0
s
1
t
1
d
1
:
s
|E|-1
t
|E|-1
d
|E|-1
|V|
is the number of vertices and
|E|
is the number of edges in
G
. The graph vertices are named with the numbers 0, 1,...,
|V|-1
respectively.
r
is th... | [
{
"submission_id": "aoj_GRL_1_B_10447635",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntypedef pair<ll, ll> P;\n\nint main() {\n ll n, m, s;\n cin >> n >> m >> s;\n\n const ll INF = 8e18;\n vector<vector<ll>> dist(n,vector<ll>(n,INF));\n for (ll i =... |
aoj_DSL_3_B_cpp | The Smallest Window II
For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and an integer $K$, find the smallest sub-array size (smallest window length) where the elements in the sub-array contains all integers in range [$1, 2, ..., K$]. If there is no such sub-array, report 0.
Constraints
$1 \leq N \leq 10^5$... | [
{
"submission_id": "aoj_DSL_3_B_10994705",
"code_snippet": "///***....... In the name of Allah ......***////\n/*...Free Palestine..........Free Al_Aqsa.....*/\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define F first\n#define S second\n#define yes cout<<\"YES\"<<endl\n#... |
aoj_GRL_1_C_cpp | All Pairs Shortest Path
Input
An edge-weighted graph
G
(
V
,
E
).
|
V
| |
E
|
s
0
t
0
d
0
s
1
t
1
d
1
:
s
|E|-1
t
|E|-1
d
|E|-1
|V|
is the number of vertices and
|E|
is the number of edges in
G
. The graph vertices are named with the numbers 0, 1,...,
|V|-1
respectively.
s
i
and
t
i
represent source and target vertices... | [
{
"submission_id": "aoj_GRL_1_C_10776003",
"code_snippet": "// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/1/GRL_1_C\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <climits>\n#include <queue>\nusing namespace std;\n\nstruct Edge\n{\n int s = 0, t = 0;\n int d = 0;\n... |
aoj_DSL_3_A_cpp | The Smallest Window I
For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and an integer $S$, find the smallest sub-array size (smallest window length) where the sum of the sub-array is greater than or equal to $S$. If there is not such sub-array, report 0.
Constraints
$1 \leq N \leq 10^5$
$1 \leq S \leq 10^9$... | [
{
"submission_id": "aoj_DSL_3_A_10929127",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N, S;\n cin >> N >> S;\n vector<int> a(N);\n for(auto& i : a) cin >> i;\n int ans = 1000000000;\n for(int s = 0, t = 0, sum = 0; t < N;){\n sum += a[t];\n ... |
aoj_GRL_1_A_cpp | Single Source Shortest Path
For a given weighted graph
G(V, E)
and a source
r
, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Input
An edge-weighted graph
G
(
V
,
E
) and the source
r
.
|
V
| |
E
|
r
s
0
t
0
d
0
s
1
t
1
d
1
:
s
|E|-1
t
|E|-1
d
|E|-1
|V|
is the number ... | [
{
"submission_id": "aoj_GRL_1_A_11064891",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing P=pair<ll,int>;\n\nint main(){\n int V, E, r;\n cin >> V >> E >> r;\n vector<vector<P>> G(V,vector<P>(0));\n for(int i=0; i<E; i++){\n int s, t;\n ... |
aoj_GRL_2_A_cpp | Minimum Spanning Tree
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph
G
= (
V
,
E
).
Input
|V|
|E|
s
0
t
0
w
0
s
1
t
1
w
1
:
s
|E|-1
t
|E|-1
w
|E|-1
, where
|V|
is the number of vertices and
|E|
is the number of edges in the graph. The graph vertices are named with th... | [
{
"submission_id": "aoj_GRL_2_A_11063691",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint MAX_WEIGHT = 10000;\n\nstruct Node\n{\n vector<pair<int, int>> children; // destination node, weight\n};\n\nvoid tmp(const vector<Node> &nodes, vector<int>... |
aoj_GRL_3_A_cpp | Articulation Points
Find articulation points of a given undirected graph
G(V, E)
.
A vertex in an undirected graph is an articulation point (or cut vertex) iff removing it disconnects the graph.
Input
|V|
|E|
s
0
t
0
s
1
t
1
:
s
|E|-1
t
|E|-1
, where
|V|
is the number of vertices and
|E|
is the number of edges in the g... | [
{
"submission_id": "aoj_GRL_3_A_11037910",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<int> br;\nvector<vector<int>> adj;\nint Time=0;\nvector<int> low, disc;\n\nvoid dfsBR(int u, int p) {\n low[u] = disc[u] = ++Time; int c=0;\n for (int& v : adj[u]) {\n if (v == p) continu... |
aoj_GRL_3_B_cpp | Bridges
Find bridges of an undirected graph
G(V, E)
.
A bridge (also known as a cut-edge) is an edge whose deletion increase the number of connected components.
Input
|V|
|E|
s
0
t
0
s
1
t
1
:
s
|E|-1
t
|E|-1
, where
|V|
is the number of nodes and
|E|
is the number of edges in the graph. The graph nodes are named with ... | [
{
"submission_id": "aoj_GRL_3_B_11030221",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<pair<int, int>> br;\nvector<vector<int>> adj;\nint Time=0;\nvector<int> low, disc;\n\nvoid dfsBR(int u, int p) {\n low[u] = disc[u] = ++Time;\n for (int& v : adj[u]) {\n if (v == p) conti... |
aoj_GRL_3_C_cpp | Strongly Connected Components
A direced graph is strongly connected if every two nodes are reachable from each other. In a strongly connected component of a directed graph, every two nodes of the component are mutually reachable.
Input
A directed graph
G(V, E)
and a sequence of queries where each query contains a pair ... | [
{
"submission_id": "aoj_GRL_3_C_11053568",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n// #include \"all.h\"\n\n#define int long long\n#define uint unsigned int\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define is2pow(n) (n && (!(n & (n - 1))))\... |
aoj_GRL_5_A_cpp | Diameter of a Tree
Given a tree
T
with non-negative weight, find the diameter of the tree.
The diameter of a tree is the maximum distance between two nodes in a tree.
Input
n
s
1
t
1
w
1
s
2
t
2
w
2
:
s
n-1
t
n-1
w
n-1
The first line consists of an integer
n
which represents the number of nodes in the tree. Every node ... | [
{
"submission_id": "aoj_GRL_5_A_11059886",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Node\n{\n vector<pair<int, int>> children; // destination node, length\n int length;\n};\n\npair<int, int> theFurthest(const vector<Node> &nodes, int... |
aoj_GRL_5_B_cpp | Height of a Tree
Given a tree
T
with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Input
n
s
1
t
1
w
1
s
2
t
2
w
2
:
s
n-1
t
n-1
w
n-1
The first line consists of an integer
n
which represents the number of nodes in the tr... | [
{
"submission_id": "aoj_GRL_5_B_10853207",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstring>\n\n#define MAXN 10000\n\nusing namespace std;\n\nstruct edge{\n\tint nn;\n\tint w;\n\tedge(int a, int b){nn = a; w = b;}\n};\n\nvector<edge> node[MAXN];\n\nint maxdist[MAXN];\nint visited[M... |
aoj_GRL_4_B_cpp | Topological Sort
A directed acyclic graph (DAG) can be used to represent the ordering of tasks. Tasks are represented by vertices and constraints where one task can begin before another, are represented by edges. For example, in the above example, you can undertake task B after both task A and task B are finished. You ... | [
{
"submission_id": "aoj_GRL_4_B_11066613",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <climits>\n#include <queue>\n#include <algorithm>\nusing namespace std;\nconst int MAXVEX = 10000;\n\n// 需要有向无环图\n\nclass Graph {\npublic:\n int n; // 顶点数\n int m; // 边数\n vector<vector<int>... |
aoj_GRL_5_C_cpp | LCA: Lowest Common Ancestor
For a rooted tree, find the lowest common ancestor of two nodes
u
and
v
.
The given tree consists of
n
nodes and every node has a unique ID from 0 to
n
-1 where 0 is the root.
Input
n
k
0
c
1
c
2
...
c
k
0
k
1
c
1
c
2
...
c
k
1
:
k
n-1
c
1
c
2
...
c
k
n-1
q
u
1
v
1
u
2
v
2
:
u
q
v
q
The firs... | [
{
"submission_id": "aoj_GRL_5_C_11049323",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vec... |
aoj_DPL_1_B_cpp | 0-1 Knapsack Problem
You have
N
items that you want to put them into a knapsack. Item
i
has value
v
i
and weight
w
i
.
You want to find a subset of items to put such that:
The total value of the items is as large as possible.
The items have combined weight at most
W
, that is capacity of the knapsack.
Find the maximum ... | [
{
"submission_id": "aoj_DPL_1_B_11009038",
"code_snippet": "/*\nAllaih is Almighty\nBismillahhi Rahmanir Rahim\nBaishakh\n*/\n#include<bits/stdc++.h>\n#include<ext/pb_ds/assoc_container.hpp>\n#include<ext/pb_ds/tree_policy.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\ntypedef tree<int, null_type,... |
aoj_GRL_6_B_cpp | Minimum Cost Flow
Find the minimum cost to send a certain amount of flow through a flow network.
The flow network is a directed graph where each edge $e$ has capacity $c(e)$ and cost $d(e)$. Each edge $e$ can send an amount of flow $f(e)$ where $f(e) \leq c(e)$. Find the minimum value of $\sum_{e} (f(e) \times d(e))$ t... | [
{
"submission_id": "aoj_GRL_6_B_8449576",
"code_snippet": "#line 1 \"playspace/main.cpp\"\n#include <bits/stdc++.h>\n#line 2 \"library/gandalfr/graph/flow_graph.hpp\"\n\n#line 7 \"library/gandalfr/graph/base_graph.hpp\"\n\nnamespace internal {\ntemplate <class Weight> struct _base_edge {\n int v[2];\n ... |
aoj_DPL_1_C_cpp | Knapsack Problem
You have
N
kinds of items that you want to put them into a knapsack. Item
i
has value
v
i
and weight
w
i
.
You want to find a subset of items to put such that:
The total value of the items is as large as possible.
The items have combined weight at most
W
, that is capacity of the knapsack.
You can sele... | [
{
"submission_id": "aoj_DPL_1_C_10925361",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(T) T.begin(), T.end()\nusing ll = long long;\nusing P = pair<int, int>;\nconst int di[] = {-1, 0, 1, 0};\nconst int dj[] = {0, -1, 0, ... |
aoj_DPL_1_A_cpp | Coin Changing Problem
Find the minimum number of coins to make change for
n
cents using coins of denominations
d
1
,
d
2
,..,
d
m
. The coins can be used any number of times.
Input
n
m
d
1
d
2
...
d
m
Two integers
n
and
m
are given in the first line. The available denominations are given in the second line.
Output
Prin... | [
{
"submission_id": "aoj_DPL_1_A_10998405",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#inclu... |
aoj_GRL_7_A_cpp | Bipartite Matching
A bipartite graph
G = (V, E)
is a graph in which the vertex set
V
can be divided into two disjoint subsets
X
and
Y
such that every edge
e ∈ E
has one end point in
X
and the other end point in
Y
.
A matching
M
is a subset of edges such that each node in
V
appears in at most one edge in
M
.
Given a bip... | [
{
"submission_id": "aoj_GRL_7_A_8843369",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <typename T>\nvoid p... |
aoj_GRL_6_A_cpp | Maximum Flow
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the maximum flow from the $source$ to the $sink$.
Input
A flow ... | [
{
"submission_id": "aoj_GRL_6_A_11057074",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\nstruct Edge {\n int to; //行き先\n int rev; //逆辺のindex\n int cap; //容量\n};\n\nstruct MaxFlow {\n int N;\n vector<vector<Edge>> graph;\n vector<bool> used;\n\n ... |
aoj_DPL_2_B_cpp | Chinese Postman Problem
For a given weighted undirected graph
G(V, E)
, find the distance of the shortest route that meets the following criteria:
It is a closed cycle where it ends at the same point it starts.
The route must go through every edge at least once.
Input
|V|
|E|
s
0
t
0
d
0
s
1
t
1
d
1
:
s
|E|-1
t
|E|-1
d... | [
{
"submission_id": "aoj_DPL_2_B_6761389",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std ;\n#define MAX 1000000001\n#define NIL -2000000002\n#define INF 1e9\n#define MAXN 20\ntypedef long long int ll;\nconst int debug = 0 ; \nconst int debug1 = 0 ; \n#define REP(i,n) for(int i=0; i<(int)n; i... |
aoj_DPL_2_A_cpp | Traveling Salesman Problem
For a given weighted directed graph
G(V, E)
, find the distance of the shortest route that meets the following criteria:
It is a closed cycle where it ends at the same point it starts.
It visits each vertex exactly once.
Input
|V|
|E|
s
0
t
0
d
0
s
1
t
1
d
1
:
s
|E|-1
t
|E|-1
d
|E|-1
|V|
is t... | [
{
"submission_id": "aoj_DPL_2_A_11044370",
"code_snippet": "// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A&lang=ja\n#include <iostream>\n#include <vector>\n#include <climits>\n\nusing namespace std;\n\nint main(){\n int node, edge;\n cin >> node >> edge;\n vector<vector<int>> ... |
aoj_DPL_3_A_cpp | Largest Square
Given a matrix (
H
×
W
) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.
Input
H
W
c
1,1
c
1,2
...
c
1,W
c
2,1
c
2,2
...
c
2,W
:
c
H,1
c
H,2
...
c
H,W
In the first line, two integers
H
and
W
separated by a space character are given. In the following
H
lines... | [
{
"submission_id": "aoj_DPL_3_A_11010294",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std ;\n#define pb push_back\n#define ll long long \nconst ll mod = 1e9+7;\n\nbool check(ll x , ll n, ll m, vector<vector<ll>>&ps){\n for(ll i=0;i+x-1<n;i++){\n for(ll j=0;j+x-1<m;j++){\n ... |
aoj_DPL_2_C_cpp | Bitonic Traveling Salesman Problem (Bitonic TSP)
For given $N$ points in the 2D Euclidean plane, find the distance of the shortest tour that meets the following criteria:
Visit the points according to the following steps:
It starts from the leftmost point (starting point), goes strictly from left to right, and then vis... | [
{
"submission_id": "aoj_DPL_2_C_10868658",
"code_snippet": "#include <bits/stdc++.h>\n#define reb(i,n) for (int i = 0; i < (n); i++)\n#define rep(i, n0, n) for (int i = (n0); i < (n); i++)\n#define repp(i, n0, n) for (int i = (n0); i <= (n); i++)\n#define rrep(i, n0, n) for (int i = (n0); i >= (n); i--) \n#... |
aoj_DPL_3_B_cpp | Largest Rectangle
Given a matrix (
H
×
W
) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.
Input
H
W
c
1,1
c
1,2
...
c
1,W
c
2,1
c
2,2
...
c
2,W
:
c
H,1
c
H,2
...
c
H,W
In the first line, two integers
H
and
W
separated by a space character are given. In the following
H
lines,... | [
{
"submission_id": "aoj_DPL_3_B_10988570",
"code_snippet": "#include <cstdio>\n#include <stack>\nusing namespace std;\nconst int maxv=1401;\nint C[maxv][maxv];\nint D[maxv][maxv];\nint H,W;\nint maxsquare(){\n int largest=0;\n for(int i=0;i<H;i++){\n stack<pair<int,int>> rect;\n for(int ... |
aoj_DPL_5_A_cpp | Balls and Boxes 1
Balls
Boxes
Any way
At most one ball
At least one ball
Distinguishable
Distinguishable
1
2
3
Indistinguishable
Distinguishable
4
5
6
Distinguishable
Indistinguishable
7
8
9
Indistinguishable
Indistinguishable
10
11
12
Problem
You have $n$ balls and $k$ boxes. You want to put these balls into the boxes... | [
{
"submission_id": "aoj_DPL_5_A_9527776",
"code_snippet": "/*\n Created by Pujx on 2024/8/4.\n*/\n#pragma GCC optimize(2, 3, \"Ofast\", \"inline\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define endl '\\n'\n//#define int long long\n//#define double long double\nusing i64 = long long;\nusing ui6... |
aoj_DPL_4_B_cpp | Coin Combination Problem II
You have
N
coins each of which has a value
a
i
.
Find the number of combinations that result when you choose
K
different coins in such a way that the total value of the coins is greater than or equal to
L
and less than or equal to
R
.
Constraints
1 ≤
K
≤
N
≤ 40
1 ≤
a
i
≤ 10
16
1 ≤
L
≤
R
≤ 10... | [
{
"submission_id": "aoj_DPL_4_B_11055869",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vec... |
aoj_CGL_3_C_cpp | Polygon-Point-Containment
For a given polygon
g
and target points
t
, print "2" if
g
contains
t
, "1" if
t
is on a segment of
g
, "0" otherwise.
g
is represented by a sequence of points
p
1
,
p
2
,...,
p
n
where line segments connecting
p
i
and
p
i+1
(1 ≤
i
≤
n-1
) are sides of the polygon. The line segment connecting
... | [
{
"submission_id": "aoj_CGL_3_C_10650599",
"code_snippet": "# 1 \"tmp.cpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n#define ll long long\n#define ld long double\n#define out(x) cout<<x<<'\\n'\n#define all(v) v.begin(),v.end()\n#define rep(i,n) for(i... |
aoj_DPL_4_A_cpp | Coin Combination Problem
You have 4 bags A, B, C and D each of which includes
N
coins (there are totally
4N
coins). Values of the coins in each bag are
a
i
,
b
i
,
c
i
and
d
i
respectively.
Find the number of combinations that result when you choose one coin from each bag (totally
4
coins) in such a way that the total ... | [
{
"submission_id": "aoj_DPL_4_A_10881124",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n ll N,V; cin>>N>>V;\n vector<ll> A(N),B(N),C(N),D(N);\n for(ll& a:A) cin>>a;\n for(ll& a:B) cin>>a;\n for(ll& a:C) cin>>a;\n for(ll& a:D) cin>>a;\... |
aoj_DPL_3_C_cpp | Largest Rectangle in a Histogram
A histogram is made of a number of contiguous bars, which have same width.
For a given histogram with $N$ bars which have a width of 1 and a height of $h_i$ = $h_1, h_2, ... , h_N$ respectively, find the area of the largest rectangular area.
Constraints
$1 \leq N \leq 10^5$
$0 \leq h_i ... | [
{
"submission_id": "aoj_DPL_3_C_11004547",
"code_snippet": "#include <iostream>\n#include <stack>\n#include <vector>\n#include <utility>\n#define ll long long\nusing namespace std;\n\n// 自身より左にあって自身より小さい要素が一番最後に出てくるインデックス\nvector<int> find_small_left(const vector<ll>& hist){\n stack<pair<ll,int>> s; // p... |
aoj_CGL_4_C_cpp | Convex Cut
As shown in the figure above, cut a convex polygon
g
by a line
p1p2
and print the area of the cut polygon which is on the left-hand side of the line.
g
is represented by a sequence of points
p
1
,
p
2
,...,
p
n
where line segments connecting
p
i
and
p
i+1
(1 ≤
i
≤
n−1
) are sides of the convex polygon. The l... | [
{
"submission_id": "aoj_CGL_4_C_6666641",
"code_snippet": "//my geometry template\n\n#include<bits/stdc++.h>\n//#define double long double\nusing namespace std;\ndouble const INF=1e20;\nint const N=233333;\ndouble const PI=acos(-1.0),EPS=1e-10;\nint les(double x,double y){\n\treturn x<y-EPS;\n}\nint leq(dou... |
aoj_DPL_5_B_cpp | Balls and Boxes 2
Balls
Boxes
Any way
At most one ball
At least one ball
Distinguishable
Distinguishable
1
2
3
Indistinguishable
Distinguishable
4
5
6
Distinguishable
Indistinguishable
7
8
9
Indistinguishable
Indistinguishable
10
11
12
Problem
You have $n$ balls and $k$ boxes. You want to put these balls into the boxes... | [
{
"submission_id": "aoj_DPL_5_B_9527781",
"code_snippet": "/*\n Created by Pujx on 2024/8/4.\n*/\n#pragma GCC optimize(2, 3, \"Ofast\", \"inline\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define endl '\\n'\n//#define int long long\n//#define double long double\nusing i64 = long long;\nusing ui6... |
aoj_DPL_5_C_cpp | Balls and Boxes 3
Balls
Boxes
Any way
At most one ball
At least one ball
Distinguishable
Distinguishable
1
2
3
Indistinguishable
Distinguishable
4
5
6
Distinguishable
Indistinguishable
7
8
9
Indistinguishable
Indistinguishable
10
11
12
Problem
You have $n$ balls and $k$ boxes. You want to put these balls into the boxes... | [
{
"submission_id": "aoj_DPL_5_C_10681358",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#line 2 \"modint/montgomery-modint.hpp\"\n\ntemplate <uint32_t mod>\nstruct LazyMontgomeryModInt {\n using mint = LazyMontgomeryModInt;\n using i32 = int32_t;\n using u32 = uint32_t;\n using u64 =... |
aoj_CGL_7_B_cpp | Incircle of a Triangle
Write a program which prints the central coordinate ($cx$,$cy$) and the radius $r$ of a incircle of a triangle which is constructed by three points ($x_1$, $y_1$), ($x_2$, $y_2$) and ($x_3$, $y_3$) on the plane surface.
Input
The input is given in the following format
$x_1$ $y_1$
$x_2$ $y_2$
$x_3... | [
{
"submission_id": "aoj_CGL_7_B_10750421",
"code_snippet": "#include <bits/stdc++.h>\n\n// from: cpp.json\n#define INF 8e18\n#define int long long\n#define LD long double\nusing namespace std;\n\nvoid solve() {\n LD x1, y1, x2, y2, x3, y3;\n cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;\n\n auto dist = ... |
aoj_CGL_4_A_cpp | Convex Hull
Find the convex hull of a given set of points
P
. In other words, find the smallest convex polygon containing all the points of
P
. Here, in a convex polygon, all interior angles are less than or equal to 180 degrees.
Please note that you should find all the points of
P
on both corner and boundary of the co... | [
{
"submission_id": "aoj_CGL_4_A_11065485",
"code_snippet": "#include <bits/stdc++.h>\n\n#define debug(a) cout << #a << \" = \" << (a) << ' '\n\nusing namespace std;\n\n#define db long double\n// #define db long long\n\nconst db EPS = 1e-9;\n\n#define cross(p1, p2, p3) (p2 - p1).det(p3 - p1)\n#define crossop... |
aoj_NTL_1_B_cpp | Power
For given integers
m
and
n
, compute
m
n
(mod 1,000,000,007). Here,
A
(mod
M
) is the remainder when
A
is divided by
M
.
Input
m
n
Two integers
m
and
n
are given in a line.
Output
Print
m
n
(mod 1,000,000,007) in a line.
Constraints
1 ≤
m
≤ 100
1 ≤
n
≤ 10
9
Sample Input 1
2 3
Sample Output 1
8
Sample Input 2
5 8
... | [
{
"submission_id": "aoj_NTL_1_B_10672756",
"code_snippet": "// This is free and unencumbered software released into the public domain.\n\n// Anyone is free to copy, modify, publish, use, compile, sell, or\n// distribute this software, either in source code form or as a compiled\n// binary, for any purpose, ... |
aoj_CGL_4_B_cpp | Diameter of a Convex Polygon
Find the diameter of a convex polygon
g
. In other words, find a pair of points that have maximum distance between them.
Input
n
x
1
y
1
x
2
y
2
:
x
n
y
n
The first integer
n
is the number of points in
g
.
In the following lines, the coordinate of the
i
-th point
p
i
is given by two real nu... | [
{
"submission_id": "aoj_CGL_4_B_11065558",
"code_snippet": "#include <bits/stdc++.h>\n\n#define debug(a) cout << #a << \" = \" << (a) << ' '\n\nusing namespace std;\n\n#define db long double\n// #define db long long\n\nconst db EPS = 1e-9;\n\n#define cross(p1, p2, p3) (p2 - p1).det(p3 - p1)\n#define crossop... |
aoj_CGL_5_B_cpp | Minimum Enclosing Circle
There are $N$ points on a two-dimensional plane. Find the smallest circle that encloses all of these points.
Such a circle is called the Minimum Enclosing Circle. A Minimum Enclosing Circle can be efficiently found using an algorithm based on the following properties.
Let the sequence of $N$ po... | [
{
"submission_id": "aoj_CGL_5_B_11065578",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define vi vector<int>\n#define vl vector<ll>\n#define ov4(a, b, c, d, name, ...) name\n#define rep3(i, a, b, c) for(ll i = ... |
aoj_CGL_5_A_cpp | Closest Pair
For given
n
points in metric space, find the distance of the closest points.
Input
n
x
0
y
0
x
1
y
1
:
x
n-1
y
n-1
The first integer
n
is the number of points.
In the following
n
lines, the coordinate of the
i
-th point is given by two real numbers
x
i
and
y
i
. Each value is a real number with at most 6 d... | [
{
"submission_id": "aoj_CGL_5_A_11065295",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define vi vector<int>\n#define vl vector<ll>\n#define ov4(a, b, c, d, name, ...) name\n#define rep3(i, a, b, c) for(ll i = ... |
aoj_NTL_1_C_cpp | Least Common Multiple
Find the least common multiple (LCM) of given
n
integers.
Input
n
a
1
a
2
...
a
n
n
is given in the first line. Then,
n
integers are given in the second line.
Output
Print the least common multiple of the given integers in a line.
Constraints
2 ≤
n
≤ 10
1 ≤
a
i
≤ 1000
Product of given integers
a
i... | [
{
"submission_id": "aoj_NTL_1_C_8308574",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n \n vector<int> nums(n);\n cin >> nums[0];\n for (int i = 1; i < n; i++) {\n cin >> nums[i];\n int a = nums[i];\n ... |
aoj_NTL_1_A_cpp | Prime Factorization
Factorize a given integer
n
.
Input
n
An integer
n
is given in a line.
Output
Print the given integer
n
and
:
. Then, print prime factors in ascending order. If
n
is divisible by a prime factor several times, the prime factor should be printed according to the number of times. Print a space before e... | [
{
"submission_id": "aoj_NTL_1_A_10778330",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n int l = n;\n int i = 3;\n int flag = 0;\n cout << n << \":\";\n while (n % 2 == 0) {\n cout << \" 2\";\n n /= 2;\n }\n\n ... |
aoj_CGL_6_A_cpp | Segment Intersections: Manhattan Geometry
For given $n$ segments which are parallel to X-axis or Y-axis, find the number of intersections of them.
Input
In the first line, the number of segments $n$ is given. In the following $n$ lines, the $i$-th segment is given by coordinates of its end points in the following forma... | [
{
"submission_id": "aoj_CGL_6_A_11047895",
"code_snippet": "// --- Start of include: ./../../akakoi_lib/template/template.cpp ---\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3,unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(ll i=0... |
aoj_NTL_2_B_cpp | Difference of Big Integers
Given two integers $A$ and $B$, compute the difference, $A - B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the difference in a line.
Constraints
$-1 \times 10^{100000} \leq A, B \leq 10^{100000}$
Sample Input 1
5 8
Sample Output 1
-3
Sampl... | [
{
"submission_id": "aoj_NTL_2_B_10774191",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\nusing namespace std;... |
aoj_NTL_2_A_cpp | Addition of Big Integers
Given two integers $A$ and $B$, compute the sum, $A + B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the sum in a line.
Constraints
$-1 \times 10^{100000} \leq A, B \leq 10^{100000}$
Sample Input 1
5 8
Sample Output 1
13
Sample Input 2
100 25... | [
{
"submission_id": "aoj_NTL_2_A_10774189",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<queue>\n#include<set>\n#include<deque>\n#include<list>\n#include<bitset>\nusing namespace std;... |
aoj_0030_cpp | 整数の和
0 から 9 の数字から異なる
n
個の数を取り出して合計が
s
となる組み合わせの数を出力するプログラムを作成してください。
n
個の数はおのおの 0 から 9 までとし、１つの組み合わせに同じ数字は使えません。たとえば、
n
が 3 で
s
が 6 のとき、3 個の数字の合計が 6 になる組み合わせは、
1 + 2 + 3 = 6
0 + 1 + 5 = 6
0 + 2 + 4 = 6
の 3 通りとなります。
Input
複数のデータセットが与えられます。各データセットに
n
(1 ≤
n
≤ 9) と
s
(0 ≤
s
≤ 100) が１つのスペースで区切られて１行に与えられます。
n
と
s
が共に 0 のとき入... | [
{
"submission_id": "aoj_0030_7937516",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int lli;\nint n, s;\nbool used[10];\nlli dfs(bool used[10], int now, int sum) {\n if (sum > s)\n return 0;\n if (now == n) {\n if (sum == s)\n return 1;\n return 0;\n }\... |
aoj_NTL_2_C_cpp | Multiplication of Big Integers
Given two integers $A$ and $B$, compute the product, $A \times B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the product in a line.
Constraints
$-1 \times 10^{1000} \leq A, B \leq 10^{1000}$
Sample Input 1
5 8
Sample Output 1
40
Sample... | [
{
"submission_id": "aoj_NTL_2_C_10940298",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\n\nstring fixedNum( string a )\n{\n if( a.size() == 1 )\n return a;\n for( int i = 0; i < a.size(); i++ )\n if( '1'<= a[i] && a[i] <= '9' )\n return a.substr(... |
aoj_0044_cpp | 素数 II
素数というのは、1 よりも大きくそれ自身か 1 でしか割りきれない整数をいいます。例えば、2 は、2 と 1 でしか割り切れないので素数ですが、12 は、12 と 1 のほかに、2, 3, 4, 6 で割りきれる数なので素数ではありません。
整数
n
を入力したとき、
n
より小さい素数のうち最も大きいものと、
n
より大きい素数のうち最も小さいものを出力するプログラムを作成してください。
Input
複数のデータセットが与えられます。各データセットに
n
(3 ≤
n
≤ 50,000) が１行に与えられます。
データセットの数は 50 を超えません。
Output
各データセットに対して、
n
より小さい素数のうち最... | [
{
"submission_id": "aoj_0044_3570869",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n#include <stdlib.h>\nusing namespace std;\n\n\n\nint main(){\n\tint d,arr[100000],count,ch;\n\tarr[0]=2;\n\tcoun... |
aoj_0040_cpp | アフィン暗号
簡単な暗号法の一つに、アフィン暗号というものがあります。まず、アルファベット a〜z を a = 0, b = 1, c = 2,..., x = 23, y = 24, z = 25 と 0〜25 の数字に置き換えます。そして、以下の式で、原文のアルファベットを置換します。
$F(\gamma) = (\alpha \cdot \gamma + \beta)$ mod $26$
ただし、mod 26 は 26 で割った余りを表します。例えば、$\alpha = 3, \beta = 2$ のとき、アルファベットの 'a' (=0) は、$F(0) = (3 \cdot 0 + 2)$ mod $26 = 2$ で ... | [
{
"submission_id": "aoj_0040_2489714",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<functional>\n#include<algorithm>\n#include<cstdio>\n#include<unordered_map>\nusing names... |
aoj_0042_cpp | 泥棒
宝物がたくさん収蔵されている博物館に、泥棒が大きな風呂敷を一つだけ持って忍び込みました。盗み出したいものはたくさんありますが、風呂敷が耐えられる重さが限られており、これを超えると風呂敷が破れてしまいます。そこで泥棒は、用意した風呂敷を破らず且つ最も価値が高くなるようなお宝の組み合わせを考えなくてはなりません。
風呂敷が耐えられる重さ
W
、および博物館にある個々のお宝の価値と重さを読み込んで、重さの総和が
W
を超えない範囲で価値の総和が最大になるときの、お宝の価値総和と重さの総和を出力するプログラムを作成してください。ただし、価値の総和が最大になる組み合わせが複数あるときは、重さの総和が小さいものを出力することとします。
I... | [
{
"submission_id": "aoj_0042_7370385",
"code_snippet": "#include <bits/stdc++.h>\n#include <stdint.h>\n\nusing namespace std;\n\n#define PI M_PI\n#define MOD 1000000007\n#define debug(x) cout << #x << \" = \" << x << endl\n#define MAP_HAS_KEY(m, key) (m.find(key) != m.end())\n\ntemplate<class T> std::vector... |
aoj_0041_cpp | 式
与えられた 4 つの 1 から 9 の整数を使って、答えが 10 になる式をつくります。
4 つの整数
a, b, c, d
を入力したとき、下記の条件に従い、答えが 10 になる式を出力するプログラムを作成してください。また、答えが複数ある時は、最初に見つかった答えだけを出力するものとします。答えがない時は、0 と出力してください。
演算子として、加算 (+)、減算 (-)、乗算 (*) だけを使います。除算 (/) は使いません。使用できる演算子は３個です。
数を4つとも使わなければいけません。
4つの数の順番は自由に入れ換えてかまいません。
カッコを使ってもかまいません。使用できるカッコは３組（６個）以下です。
Inpu... | [
{
"submission_id": "aoj_0041_8027424",
"code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nu... |
aoj_0067_cpp | 島の数
地勢を示す縦 12, 横 12 のマスからなる平面図があります。おのおののマスは白か黒に塗られています。白は海を、黒は陸地を表します。二つの黒いマスが上下、あるいは左右に接しているとき、これらは地続きであるといいます。この平面図では、黒いマス一つのみ、あるいは地続きの黒いマスが作る領域を「島」といいます。例えば下図には、5 つの島があります。
■■■■□□□□■■■■
■■■□□□□□■■■■
■■□□□□□□■■■■
■□□□□□□□■■■■
□□□■□□□■□□□□
□□□□□□■■■□□□
□□□□□■■■■■□□
■□□□■■■■■■■□
■■□□□■■■■■□□
■■■□□□■■■□□□
■■■■□□□■□□□□
... | [
{
"submission_id": "aoj_0067_5246731",
"code_snippet": "#include <bits/stdc++.h>\n#define NIL (-1)\n#define LL long long\nusing namespace std;\nconst int64_t MOD = 1e9 + 7;\nconst int INF = INT_MAX;\nconst double PI = acos(-1.0);\n\nvector<string> island(12);\nvector<vector<bool>> seen(12, vector<bool>(12))... |
aoj_0043_cpp | パズル
1 〜 9 の数字を 14 個組み合わせて完成させるパズルがあります。与えられた 13 個の数字にもうひとつ数字を付け加えて完成させます。
パズルの完成条件は
同じ数字を２つ組み合わせたものが必ずひとつ必要です。
残りの12 個の数字は、３個の数字の組み合わせ４つです。
３個の数字の組み合わせ方は、同じ数字を３つ組み合わせたものか、または３つの連続する数字を組み合わせたものです。ただし、9 1 2 のような並びは連続する数字とは認められません。
同じ数字は4 回まで使えます。
13 個の数字からなる文字列を読み込んで、パズルを完成することができる数字を昇順に全て出力するプログラムを作成してください。なお、1〜9 のどの数字を... | [
{
"submission_id": "aoj_0043_4893249",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_le... |
aoj_0072_cpp | 灯篭
会津若松市は「歴史の町」として知られています。今から約 400 年前、蒲生氏郷により城下町の骨格が作られましたが、その後、徳川三代将軍家光公の異母弟「保科正之」公を藩祖とする会津藩 23 万石の中心都市として発展しました。今でも市内のいたるところに史跡や昔日の面影が残っているため、毎年、全国から多くの観光客が訪れています。
今年は、ＮＨＫ大河ドラマで「新選組！」が放送されているため、新選組ゆかりの地(*1)として、大幅に観光客が増加しています。そこで市では、市内に点在する史跡を結ぶ通り沿いに 100 m 間隔で灯篭を設置して飾りたてることにしました。灯篭を飾ってある通りを辿れば市内の全ての史跡に到達できるように設置することが条... | [
{
"submission_id": "aoj_0072_1759212",
"code_snippet": "// 0072\n#include <iostream>\n#include <vector>\n#include <stdio.h>\n#include <stdlib.h>\nusing namespace std;\n\nstruct road{\n\tint dis;\n\tint v1;\n\tint v2;\n};\n\n\nint findSet(int x, vector<int> &p){\n\tif(x != p[x])\n\t\tp[x] = findSet(p[x], p);... |
aoj_0056_cpp | ゴールドバッハの予想
4 以上の偶数は 2 つの素数の和で表すことができるということが知られています。これはゴールドバッハ予想といい、コンピュータの計算によりかなり大きな数まで正しいことが確かめられています。例えば、10 は、7 + 3、5 + 5 の 2 通りの素数の和で表すことができます。
整数
n
を入力し、
n
を 2 つの素数の和で表す組み合わせ数が何通りあるかを出力するプログラムを作成してください。ただし、
n
は 4 以上、50,000 以下とします。また、入力される
n
は偶数であるとはかぎりません。
Input
複数のデータセットが与えられます。各データセットに
n
が１行に与えられます。
n
が 0 のとき入力の... | [
{
"submission_id": "aoj_0056_9629737",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n vector<int> yakusu(50001, -1);\n for(int i=2; i<=50000; i++){\n if(yakusu[i]!=-1) continue;\n int copy=i;\n while(copy<=50000){\n if(yakusu[copy]==-1) yakusu[copy]=i;\n ... |
aoj_0088_cpp | 博士が愛した符号
博士 : ピーター君、ついにやったよ。
ピーター : どうしました、デビッド博士？またくだらない発明ですか？
博士 : この表だよ、この表。
文字
符号
（空白）
101
'
000000
,
000011
-
10010001
.
010001
?
000001
A
100101
B
10011010
文字
符号
C
0101
D
0001
E
110
F
01001
G
10011011
H
010000
I
0111
J
10011000
文字
符号
K
0110
L
00100
M
10011001
N
10011110
O
00101
P
111
Q
10011111
R
1000
文字
符号
S
001... | [
{
"submission_id": "aoj_0088_1907220",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nstring c2s(char c){\n if(c==' ') return \"101\";\n if(c=='\\'') return \"000000\";\n if(c==',') return \"000011\";\n if(c=='-') return \"10010001\";\n if(c=='.') return \"010001\";\n if(... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.