結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー |
![]() |
提出日時 | 2017-06-10 00:42:59 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 52 ms / 1,000 ms |
コード長 | 5,401 bytes |
コンパイル時間 | 1,357 ms |
コンパイル使用メモリ | 114,656 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 18:31:08 |
合計ジャッジ時間 | 2,671 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#include <iostream> #include <vector> #include <cstdio> #include <sstream> #include <map> #include <string> #include <algorithm> #include <queue> #include <cmath> #include <functional> #include <set> #include <ctime> #include <random> #include <chrono> #include <cassert> #include <tuple> #include <utility> using namespace std; namespace { using Integer = long long; //__int128; template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;} template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;} template<class T> istream& operator , (istream& is, T& val){ return is >> val;} template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;} template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;} template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template<class H> void print(const H& head){ cout << head; } template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template<class ... T> void println(const T& ... values){ print(values...); cout << endl; } template<class H> void eprint(const H& head){ cerr << head; } template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()); template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } long long calc_(int d, long long mod){ if( d<=0 ) return 0; long long res = 0; //even { vector<long long> dp = {1, 0}; // edge = zero, non-zero for(int dd=2; dd<=d; dd+=2){ vector<long long> dp_(2, 0); (dp_[0] += dp[0] + dp[1]) %= mod; (dp_[1] += (dp[0] + dp[1]) * 9) %= mod; swap(dp, dp_); res += dp[1]; res %= mod; } } //odd { vector<long long> dp = {1, 9}; // edge = zero, non-zero for(int dd=3; dd<=d; dd+=2){ vector<long long> dp_(2, 0); (dp_[0] += dp[0] + dp[1]) %= mod; (dp_[1] += (dp[0] + dp[1]) * 9) %= mod; swap(dp, dp_); res += dp[1]; res %= mod; } res += 9; res %= mod; } return res; } long long calc(string n, long long mod){ vector<vector<long long>> dp((n.size()+1)/2 + 1, vector<long long>(2, 0)); dp[0][1] = n[0] - '1'; dp[0][0] = 1; for(int i=1; i<(n.size()+1)/2; i++){ int d = n[i] - '0'; for(int small : range(2)){ for(int dd=0; dd<10; dd++){ bool small_ = small || dd<d; if( !small && dd > d ) break; (dp[i][small_] += dp[i-1][small]) %= mod; } } } long long res = dp[(n.size()+1)/2-1][0] + dp[(n.size()+1)/2-1][1]; res %= mod; string m = n.substr(0, (n.size()+1)/2); string r = n.substr(0, (n.size())/2 ); reverse(r.begin(), r.end()); assert( n.size() == (m+r).size() ); cerr << m+r << endl; if( n < m+r ){ (res += mod-1) %= mod; } return res; } int main(){ string n; cin >> n; if(n.size() <= 2){ int res = 0; int nn; sscanf(n.c_str(),"%d", &nn); for(int i=1; i<=nn; i++){ stringstream ss; ss << i; string a = ss.str(); string b(a.rbegin(), a.rend()); if( a == b ){ res ++ ; } } println(res); println(res); return 0; } long long a = calc_(n.size()-1, 9_ten); cerr << a << endl; (a += calc(n, 9_ten)) %= 9_ten; long long b = calc_(n.size()-1, 9_ten+7); cerr << b << endl; (b += calc(n, 9_ten+7)) %= (9_ten+7); println(a); println(b); return 0; }