結果

問題 No.528 10^9と10^9+7と回文
ユーザー FF256grhy
提出日時 2018-08-02 01:43:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 23 ms / 1,000 ms
コード長 4,636 bytes
コンパイル時間 1,572 ms
コンパイル使用メモリ 170,472 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-23 18:35:26
合計ジャッジ時間 2,735 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)
template<typename T> bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ---- ----
template<int N> class ModInt {
private:
LL v;
static LL m;
public:
ModInt(LL vv = 0) { setval(vv); }
ModInt & setval(LL vv) { v = (vv % m + m) % m; return (*this); }
static void setmod(LL mm) { m = mm; }
LL getval() const { return v; }
ModInt & operator+=(const ModInt & b) { return setval(v + b.v); }
ModInt & operator-=(const ModInt & b) { return setval(v - b.v); }
ModInt & operator*=(const ModInt & b) { return setval(v * b.v); }
ModInt & operator/=(const ModInt & b) { return setval(v * b.inv()); }
ModInt & operator^=( LU b) { return setval(ex(v, b)); }
ModInt operator+ ( ) { return ModInt(+v); }
ModInt operator- ( ) { return ModInt(-v); }
ModInt operator+ (const ModInt & b) { return ModInt(v + b.v); }
ModInt operator- (const ModInt & b) { return ModInt(v - b.v); }
ModInt operator* (const ModInt & b) { return ModInt(v * b.v); }
ModInt operator/ (const ModInt & b) { return ModInt(v * b.inv()); }
ModInt operator^ ( LU b) { return ModInt(ex(v, b)); }
LL inv() const {
LL x = (ex_gcd(v, m).FI + m) % m;
assert(x * v % m == 1);
return x;
}
LL ex(LL a, LU b) const {
LL D = 64, x[64], y = 1;
inc(i, D) { if((b >> i) == 0) { D = i; break; } }
inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % m; }
inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= m; } }
return y;
}
pair<LL, LL> ex_gcd(LL a, LL b) const {
if(b == 0) { return MP(1, 0); }
auto p = ex_gcd(b, a % b);
return MP(p.SE, p.FI - (a / b) * p.SE);
}
};
template<int N> LL ModInt<N>::m;
template<int N> ModInt<N> operator+(LL a, const ModInt<N> & b) { return ModInt<N>(a + b.getval()); }
template<int N> ModInt<N> operator-(LL a, const ModInt<N> & b) { return ModInt<N>(a - b.getval()); }
template<int N> ModInt<N> operator*(LL a, const ModInt<N> & b) { return ModInt<N>(a * b.getval()); }
template<int N> ModInt<N> operator/(LL a, const ModInt<N> & b) { return ModInt<N>(a * b.inv()); }
template<int N> istream & operator>>(istream & is, ModInt<N> & b) { LL v; is >> v; b.setval(v); return is; }
template<int N> ostream & operator<<(ostream & os, const ModInt<N> & b) { return (os << b.getval()); }
// ---- ----
string n;
int m;
template<typename T> T f() {
T ans = 0, v = 9;
inc1(i, m - 1) {
if(i > 1 && i % 2 == 1) { v *= 10; }
ans += v;
}
v = (n[0] - '0') - 1;
incID(j, 1, (m + 1) / 2) { v = v * 10 + (n[j] - '0'); }
v += 1;
ans += v;
return ans;
}
int main() {
cin >> n;
m = n.size();
if(m % 2 == 0) {
dec(i, m / 2) {
if(n[i] != n[m - 1 - i]) {
if(n[i] > n[m - 1 - i]) {
dec(j, m / 2) {
if(n[j] != '0') { n[j]--; break; } else { n[j] = '9'; }
}
}
break;
}
}
} else {
dec(i, m / 2) {
if(n[i] != n[m - 1 - i]) {
if(n[i] > n[m - 1 - i]) {
dec(j, m / 2 + 1) {
if(n[j] != '0') { n[j]--; break; } else { n[j] = '9'; }
}
}
break;
}
}
}
ModInt<123>::setmod(1e9);
ModInt<456>::setmod(1e9 + 7);
cout << f<ModInt<123>>() << endl;
cout << f<ModInt<456>>() << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0