結果
| 問題 | No.1036 Make One With GCD 2 |
| ユーザー |
 yosupot
|
| 提出日時 | 2021-08-02 04:50:00 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 605 ms / 2,000 ms |
| コード長 | 22,812 bytes |
| コンパイル時間 | 1,993 ms |
| コンパイル使用メモリ | 130,188 KB |
| 実行使用メモリ | 15,204 KB |
| 最終ジャッジ日時 | 2023-10-14 20:46:39 |
| 合計ジャッジ時間 | 10,955 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge12 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 605 ms
15,124 KB |
| testcase_01 | AC | 67 ms
15,180 KB |
| testcase_02 | AC | 85 ms
15,204 KB |
| testcase_03 | AC | 9 ms
8,704 KB |
| testcase_04 | AC | 13 ms
13,568 KB |
| testcase_05 | AC | 1 ms
4,348 KB |
| testcase_06 | AC | 1 ms
4,352 KB |
| testcase_07 | AC | 19 ms
8,688 KB |
| testcase_08 | AC | 16 ms
8,400 KB |
| testcase_09 | AC | 109 ms
15,108 KB |
| testcase_10 | AC | 103 ms
14,936 KB |
| testcase_11 | AC | 112 ms
15,092 KB |
| testcase_12 | AC | 103 ms
14,808 KB |
| testcase_13 | AC | 183 ms
14,852 KB |
| testcase_14 | AC | 188 ms
14,844 KB |
| testcase_15 | AC | 172 ms
14,560 KB |
| testcase_16 | AC | 175 ms
14,852 KB |
| testcase_17 | AC | 177 ms
14,848 KB |
| testcase_18 | AC | 2 ms
4,348 KB |
| testcase_19 | AC | 1 ms
4,352 KB |
| testcase_20 | AC | 2 ms
4,352 KB |
| testcase_21 | AC | 2 ms
4,348 KB |
| testcase_22 | AC | 172 ms
14,728 KB |
| testcase_23 | AC | 127 ms
13,836 KB |
| testcase_24 | AC | 174 ms
14,820 KB |
| testcase_25 | AC | 163 ms
14,412 KB |
| testcase_26 | AC | 163 ms
14,588 KB |
| testcase_27 | AC | 1 ms
4,356 KB |
| testcase_28 | AC | 2 ms
4,352 KB |
| testcase_29 | AC | 2 ms
4,352 KB |
| testcase_30 | AC | 1 ms
4,352 KB |
| testcase_31 | AC | 2 ms
4,352 KB |
| testcase_32 | AC | 2 ms
4,352 KB |
| testcase_33 | AC | 1 ms
4,352 KB |
| testcase_34 | AC | 2 ms
4,352 KB |
| testcase_35 | AC | 1 ms
4,348 KB |
| testcase_36 | AC | 1 ms
4,348 KB |
| testcase_37 | AC | 2 ms
4,352 KB |
| testcase_38 | AC | 83 ms
15,184 KB |
| testcase_39 | AC | 471 ms
15,064 KB |
| testcase_40 | AC | 130 ms
13,812 KB |
| testcase_41 | AC | 359 ms
15,128 KB |
| testcase_42 | AC | 335 ms
15,112 KB |
| testcase_43 | AC | 382 ms
15,172 KB |
| testcase_44 | AC | 403 ms
15,108 KB |
ソースコード
#pragma GCC target("avx,avx2")
//#pragma GCC optimize("Ofast")
//#undef LOCAL
#include <stdexcept>
#include <limits>
#include <unistd.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <type_traits>
#include <vector>
namespace yosupo {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
} // namespace internal
int bsf(unsigned int n) { return __builtin_ctz(n); }
int bsf(unsigned long n) { return __builtin_ctzl(n); }
int bsf(unsigned long long n) { return __builtin_ctzll(n); }
int bsf(unsigned __int128 n) {
unsigned long long low = (unsigned long long)(n);
unsigned long long high = (unsigned long long)(n >> 64);
return low ? __builtin_ctzll(low) : 64 + __builtin_ctzll(high);
}
int bsr(unsigned int n) {
return 8 * (int)sizeof(unsigned int) - 1 - __builtin_clz(n);
}
int bsr(unsigned long n) {
return 8 * (int)sizeof(unsigned long) - 1 - __builtin_clzl(n);
}
int bsr(unsigned long long n) {
return 8 * (int)sizeof(unsigned long long) - 1 - __builtin_clzll(n);
}
int bsr(unsigned __int128 n) {
unsigned long long low = (unsigned long long)(n);
unsigned long long high = (unsigned long long)(n >> 64);
return high ? 127 - __builtin_clzll(high) : 63 - __builtin_ctzll(low);
}
int popcnt(unsigned int n) { return __builtin_popcount(n); }
int popcnt(unsigned long n) { return __builtin_popcountl(n); }
int popcnt(unsigned long long n) { return __builtin_popcountll(n); }
} // namespace yosupo
#include <cassert>
#include <numeric>
#include <type_traits>
namespace yosupo {
namespace internal {
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;
template <class T>
using is_integral =
typename std::conditional<std::is_integral<T>::value ||
internal::is_signed_int128<T>::value ||
internal::is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;
template <class T>
using is_integral_t = std::enable_if_t<is_integral<T>::value>;
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace yosupo
namespace yosupo {
struct Scanner {
public:
Scanner(const Scanner&) = delete;
Scanner& operator=(const Scanner&) = delete;
Scanner(FILE* fp) : fd(fileno(fp)) {}
void read() {}
template <class H, class... T> void read(H& h, T&... t) {
bool f = read_single(h);
assert(f);
read(t...);
}
int read_unsafe() { return 0; }
template <class H, class... T> int read_unsafe(H& h, T&... t) {
bool f = read_single(h);
if (!f) return 0;
return 1 + read_unsafe(t...);
}
int close() { return ::close(fd); }
private:
static constexpr size_t SIZE = 1 << 15;
int fd = -1;
std::array<char, SIZE> line;
size_t st = 0, ed = 0;
bool eof = false;
bool read_single(std::string& ref) {
if (!skip_space()) return false;
ref = "";
while (true) {
char c = top();
if (c <= ' ') break;
ref += c;
st++;
}
return true;
}
bool read_single(double& ref) {
std::string s;
if (!read_single(s)) return false;
ref = std::stod(s);
return true;
}
template <class T,
std::enable_if_t<std::is_same<T, char>::value>* = nullptr>
bool read_single(T& ref) {
if (!skip_space(50)) return false;
ref = top();
st++;
return true;
}
template <class T,
internal::is_signed_int_t<T>* = nullptr,
std::enable_if_t<!std::is_same<T, char>::value>* = nullptr>
bool read_single(T& sref) {
using U = internal::to_unsigned_t<T>;
if (!skip_space(50)) return false;
bool neg = false;
if (line[st] == '-') {
neg = true;
st++;
}
U ref = 0;
do {
ref = 10 * ref + (line[st++] & 0x0f);
} while (line[st] >= '0');
sref = neg ? -ref : ref;
return true;
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<!std::is_same<U, char>::value>* = nullptr>
bool read_single(U& ref) {
if (!skip_space(50)) return false;
ref = 0;
do {
ref = 10 * ref + (line[st++] & 0x0f);
} while (line[st] >= '0');
return true;
}
bool reread() {
if (ed - st >= 50) return true;
if (st > SIZE / 2) {
std::memmove(line.data(), line.data() + st, ed - st);
ed -= st;
st = 0;
}
if (eof) return false;
auto u = ::read(fd, line.data() + ed, SIZE - ed);
if (u == 0) {
eof = true;
line[ed] = '\0';
u = 1;
}
ed += u;
return true;
}
char top() {
if (st == ed) {
bool f = reread();
assert(f);
}
return line[st];
}
bool skip_space(unsigned int token_len = 0) {
while (true) {
while (st != ed && line[st] <= ' ') st++;
if (ed - st > token_len) return true;
for (auto i = st; i < ed; i++) {
if (line[i] <= ' ') return true;
}
if (!reread()) return false;
}
}
};
struct Printer {
public:
template <char sep = ' ', bool F = false> void write() {}
template <char sep = ' ', bool F = false, class H, class... T>
void write(const H& h, const T&... t) {
if (F) write_single(sep);
write_single(h);
write<true>(t...);
}
template <char sep = ' ', class... T> void writeln(const T&... t) {
write<sep>(t...);
write_single('\n');
}
Printer(FILE* _fp) : fd(fileno(_fp)) {}
~Printer() { flush(); }
int close() {
flush();
return ::close(fd);
}
void flush() {
if (pos) {
auto res = ::write(fd, line.data(), pos);
assert(res != -1);
pos = 0;
}
}
private:
static std::array<std::array<char, 2>, 100> small;
static std::array<unsigned long long, 20> tens;
static constexpr size_t SIZE = 1 << 15;
int fd;
std::array<char, SIZE> line;
size_t pos = 0;
std::stringstream ss;
template <class T,
std::enable_if_t<std::is_same<char, T>::value>* = nullptr>
void write_single(const T& val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T,
internal::is_signed_int_t<T>* = nullptr,
std::enable_if_t<!std::is_same<char, T>::value>* = nullptr>
void write_single(const T& val) {
using U = internal::to_unsigned_t<T>;
if (val == 0) {
write_single('0');
return;
}
if (pos > SIZE - 50) flush();
U uval = val;
if (val < 0) {
write_single('-');
uval = -uval;
}
write_unsigned(uval);
}
template <class U, internal::is_unsigned_int_t<U>* = nullptr>
void write_single(U uval) {
if (uval == 0) {
write_single('0');
return;
}
if (pos > SIZE - 50) flush();
write_unsigned(uval);
}
template <class U, internal::is_unsigned_int_t<U>* = nullptr>
static int calc_len(U x) {
int i = (bsr(x) * 3 + 3) / 10;
if (x < tens[i])
return i;
else
return i + 1;
}
template <class U,
internal::is_unsigned_int_t<U>* = nullptr,
std::enable_if_t<8 >= sizeof(U)>* = nullptr>
void write_unsigned(U uval) {
size_t len = calc_len(uval);
pos += len;
char* ptr = line.data() + pos;
while (uval >= 100) {
ptr -= 2;
memcpy(ptr, small[uval % 100].data(), 2);
uval /= 100;
}
if (uval >= 10) {
memcpy(ptr - 2, small[uval].data(), 2);
} else {
*(ptr - 1) = char('0' + uval);
}
}
template <
class U,
std::enable_if_t<internal::is_unsigned_int128<U>::value>* = nullptr>
void write_unsigned(U uval) {
static std::array<char, 50> buf;
size_t len = 0;
while (uval > 0) {
buf[len++] = char((uval % 10) + '0');
uval /= 10;
}
std::reverse(buf.begin(), buf.begin() + len);
memcpy(line.data() + pos, buf.data(), len);
pos += len;
}
void write_single(const std::string& s) {
for (char c : s) write_single(c);
}
void write_single(const char* s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) write_single(s[i]);
}
template <class T> void write_single(const std::vector<T>& val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write_single(' ');
write_single(val[i]);
}
}
};
std::array<std::array<char, 2>, 100> Printer::small = [] {
std::array<std::array<char, 2>, 100> table;
for (int i = 0; i <= 99; i++) {
table[i][1] = char('0' + (i % 10));
table[i][0] = char('0' + (i / 10 % 10));
}
return table;
}();
std::array<unsigned long long, 20> Printer::tens = [] {
std::array<unsigned long long, 20> table;
for (int i = 0; i < 20; i++) {
table[i] = 1;
for (int j = 0; j < i; j++) {
table[i] *= 10;
}
}
return table;
}();
} // namespace yosupo
#include <algorithm>
#include <vector>
#include <initializer_list>
namespace yosupo {
unsigned long long gcd(unsigned long long a, unsigned long long b) {
if (a == 0) return b;
if (b == 0) return a;
int shift;
{
int a_bsf = bsf(a);
a >>= a_bsf;
int b_bsf = bsf(b);
b >>= b_bsf;
shift = std::min(a_bsf, b_bsf);
}
while (a != b) {
if (a > b) std::swap(a, b);
b -= a;
b >>= bsf(b);
}
return (a << shift);
}
long long gcd(long long a, long long b) {
unsigned long long _a = a, _b = b;
if ((unsigned long long)std::numeric_limits<long long>::max() < _a) _a = -_a;
if ((unsigned long long)std::numeric_limits<long long>::max() < _b) _b = -_b;
return gcd(_a, _b);
}
unsigned int gcd(unsigned int a, unsigned int b) {
return (unsigned int)gcd((unsigned long long)a, (unsigned long long)b);
}
int gcd(int a, int b) {
return (int)gcd((long long)a, (long long)b);
}
unsigned long long pow_mod_u64(unsigned long long x, unsigned long long n, unsigned long long m) {
if (m == 1) return 0;
unsigned long long r = 1;
unsigned long long y = x % m;
while (n) {
if (n & 1) r = (unsigned long long)((unsigned __int128)(1) * r * y % m);
y = (unsigned long long)((unsigned __int128)(1) * y * y % m);
n >>= 1;
}
return r;
}
bool is_prime(unsigned int n) {
if (n == 2) return true;
if (n % 2 == 0) return false;
unsigned long long d = n - 1;
while (d % 2 == 0) d /= 2;
for (unsigned long long a : {2, 7, 61}) {
if (a % n == 0) return true;
unsigned long long t = d;
unsigned long long y = pow_mod_u64(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = (unsigned long long)((unsigned __int128)(1) * y * y % n);
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
bool is_prime(unsigned long long n) {
if (n <= std::numeric_limits<unsigned int>::max()) {
return is_prime((unsigned int)n);
}
if (n % 2 == 0) return false;
unsigned long long d = n - 1;
while (d % 2 == 0) d /= 2;
for (unsigned long long a : {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) {
if (a % n == 0) return true;
unsigned long long t = d;
unsigned long long y = pow_mod_u64(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = (unsigned long long)((unsigned __int128)(1) * y * y % n);
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
bool is_prime(int n) {
if (n <= 1) return false;
return is_prime((unsigned int)n);
}
bool is_prime(long long n) {
if (n <= 1) return false;
return is_prime((unsigned long long)n);
}
long long pollard_single(long long n) {
auto f = [&](long long x) { return (long long)(((unsigned __int128)(x) * x + 1) % n); };
if (is_prime((unsigned long long)n)) return n;
if (n % 2 == 0) return 2;
long long st = 0;
while (true) {
st++;
long long x = st, y = f(x);
while (true) {
long long p = gcd((y - x + n), n);
if (p == 0 || p == n) break;
if (p != 1) return p;
x = f(x);
y = f(f(y));
}
}
}
std::vector<long long> factor(long long n) {
if (n == 1) return {};
long long x = pollard_single(n);
if (x == n) return {x};
auto f0 = factor(x), f1 = factor(n / x);
f0.insert(f0.end(), f1.begin(), f1.end());
return f0;
}
}
#include <algorithm>
#include <cassert>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
constexpr int bsf_constexpr(unsigned int n) {
int x = 0;
while (!(n & (1 << x))) x++;
return x;
}
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) const {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) const {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() const { return d[1]; }
template <bool (*f)(S)> int max_right(int l) const {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) const {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) const {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) const {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
using namespace yosupo;
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#ifdef LOCAL
ostream& operator<<(ostream& os, __int128_t x) {
if (x < 0) {
os << "-";
x *= -1;
}
if (x == 0) {
return os << "0";
}
string s;
while (x) {
s += char(x % 10 + '0');
x /= 10;
}
reverse(s.begin(), s.end());
return os << s;
}
ostream& operator<<(ostream& os, __uint128_t x) {
if (x == 0) {
return os << "0";
}
string s;
while (x) {
s += char(x % 10 + '0');
x /= 10;
}
reverse(s.begin(), s.end());
return os << s;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> ostream& operator<<(ostream& os, const V<T>& v);
template <class T> ostream& operator<<(ostream& os, const deque<T>& v);
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T> ostream& operator<<(ostream& os, const set<T>& s);
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& m);
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
return os << "P(" << p.first << ", " << p.second << ")";
}
template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
os << "[";
bool f = false;
for (auto d : v) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T> ostream& operator<<(ostream& os, const deque<T>& v) {
os << "[";
bool f = false;
for (auto d : v) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
os << "[";
bool f = false;
for (auto d : a) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "]";
}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {
os << "{";
bool f = false;
for (auto d : s) {
if (f) os << ", ";
f = true;
os << d;
}
return os << "}";
}
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& s) {
os << "{";
bool f = false;
for (auto p : s) {
if (f) os << ", ";
f = true;
os << p.first << ": " << p.second;
}
return os << "}";
}
struct PrettyOS {
ostream& os;
bool first;
template <class T> auto operator<<(T&& x) {
if (!first) os << ", ";
first = false;
os << x;
return *this;
}
};
template <class... T> void dbg0(T&&... t) {
(PrettyOS{cerr, true} << ... << t);
}
#define dbg(...) \
do { \
cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \
dbg0(__VA_ARGS__); \
cerr << endl; \
} while (false);
#else
#define dbg(...)
#endif
Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);
ll op(ll a, ll b) {
return gcd(a, b);
}
ll e() {
return 0;
}
int main() {
int n;
sc.read(n);
V<ll> a(n);
for (int i = 0; i < n; i++) {
sc.read(a[i]);
}
atcoder::segtree<ll, op, e> seg(a);
ll ans = 0;
for (int l = 0; l < n; l++) {
int r = seg.max_right(l, [&](ll x) { return x != 1; });
dbg(l, r);
ans += n - r;
}
pr.writeln(ans);
}