#774633 (C++17) No.428 小数から逃げる夢

• 問題: No.428 小数から逃げる夢
• ユーザー: recososo
• 提出日時: 2022-06-30 22:04:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 3,454 bytes
• コンパイル時間: 4,621 ms
• コンパイル使用メモリ: 261,852 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-16 09:53:01
• 合計ジャッジ時間: 8,875 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	1 ms; 4,384 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	2 ms; 4,384 KB
testcase_04	AC	1 ms; 4,384 KB
testcase_05	AC	1 ms; 4,384 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,380 KB
testcase_08	AC	2 ms; 4,380 KB
testcase_09	AC	1 ms; 4,380 KB
testcase_10	AC	1 ms; 4,380 KB
testcase_11	AC	2 ms; 4,384 KB
testcase_12	AC	1 ms; 4,384 KB
testcase_13	AC	2 ms; 4,384 KB
testcase_14	AC	1 ms; 4,384 KB
testcase_15	AC	1 ms; 4,384 KB
testcase_16	AC	2 ms; 4,384 KB
testcase_17	AC	1 ms; 4,384 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	1 ms; 4,380 KB
testcase_20	AC	1 ms; 4,380 KB
testcase_21	AC	2 ms; 4,384 KB
testcase_22	AC	1 ms; 4,384 KB
testcase_23	AC	1 ms; 4,380 KB
testcase_24	AC	1 ms; 4,384 KB
testcase_25	AC	2 ms; 4,384 KB
testcase_26	AC	1 ms; 4,380 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	2 ms; 4,384 KB
testcase_29	AC	2 ms; 4,384 KB
testcase_30	AC	1 ms; 4,384 KB
testcase_31	AC	2 ms; 4,380 KB
testcase_32	AC	2 ms; 4,384 KB
testcase_33	AC	2 ms; 4,380 KB
testcase_34	AC	2 ms; 4,380 KB
testcase_35	AC	2 ms; 4,380 KB
testcase_36	AC	1 ms; 4,380 KB
testcase_37	AC	2 ms; 4,380 KB
testcase_38	AC	1 ms; 4,384 KB
testcase_39	AC	1 ms; 4,384 KB
testcase_40	AC	2 ms; 4,384 KB
testcase_41	AC	2 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	2 ms; 4,380 KB
testcase_44	AC	1 ms; 4,384 KB
testcase_45	AC	2 ms; 4,380 KB
testcase_46	AC	1 ms; 4,380 KB
testcase_47	AC	2 ms; 4,380 KB
testcase_48	AC	1 ms; 4,384 KB
testcase_49	AC	1 ms; 4,384 KB
testcase_50	AC	1 ms; 4,380 KB
testcase_51	AC	2 ms; 4,384 KB
testcase_52	AC	1 ms; 4,380 KB
testcase_53	AC	1 ms; 4,384 KB
testcase_54	AC	2 ms; 4,380 KB
testcase_55	AC	2 ms; 4,380 KB
testcase_56	AC	1 ms; 4,380 KB
testcase_57	AC	1 ms; 4,380 KB
testcase_58	AC	2 ms; 4,384 KB
testcase_59	AC	2 ms; 4,380 KB
testcase_60	AC	2 ms; 4,380 KB
testcase_61	AC	2 ms; 4,380 KB
testcase_62	AC	2 ms; 4,384 KB
testcase_63	AC	2 ms; 4,384 KB
testcase_64	AC	2 ms; 4,380 KB
testcase_65	AC	2 ms; 4,384 KB
testcase_66	AC	1 ms; 4,384 KB
testcase_67	AC	2 ms; 4,384 KB
testcase_68	AC	2 ms; 4,380 KB
testcase_69	AC	2 ms; 4,380 KB
testcase_70	AC	1 ms; 4,384 KB
testcase_71	AC	2 ms; 4,380 KB
testcase_72	AC	2 ms; 4,380 KB
testcase_73	AC	2 ms; 4,380 KB
testcase_74	AC	1 ms; 4,380 KB
testcase_75	AC	2 ms; 4,380 KB
testcase_76	AC	2 ms; 4,380 KB
testcase_77	AC	1 ms; 4,384 KB
testcase_78	AC	2 ms; 4,384 KB
testcase_79	AC	1 ms; 4,380 KB
testcase_80	AC	1 ms; 4,384 KB
testcase_81	AC	2 ms; 4,380 KB
testcase_82	AC	1 ms; 4,384 KB
testcase_83	AC	2 ms; 4,384 KB
testcase_84	AC	1 ms; 4,380 KB
testcase_85	AC	2 ms; 4,380 KB
testcase_86	AC	2 ms; 4,380 KB
testcase_87	AC	1 ms; 4,380 KB
testcase_88	AC	1 ms; 4,384 KB
testcase_89	AC	1 ms; 4,380 KB
testcase_90	AC	2 ms; 4,380 KB
testcase_91	AC	2 ms; 4,384 KB
testcase_92	AC	2 ms; 4,380 KB
testcase_93	AC	2 ms; 4,384 KB
testcase_94	AC	2 ms; 4,380 KB
testcase_95	AC	2 ms; 4,380 KB
testcase_96	AC	2 ms; 4,380 KB
testcase_97	AC	2 ms; 4,380 KB
testcase_98	AC	2 ms; 4,380 KB
testcase_99	AC	2 ms; 4,384 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
#define ALLR(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}};
template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;}
void foo() {cerr << endl;}
template <class Head, class... Tail>void foo(Head&& head, Tail&&... tail){cerr << head << " ";foo(move(tail)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
// const int mod=1e9+7;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};

using mint=modint998244353;
// using mint=modint1000000007;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<int> x(192);
    string s="1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991";
    reverse(ALL(s));
    REP(i,190){
        int p=s[i]-'0';
        int d=p*n;
        int cnt=0;
        while(d){
            x[i+cnt]+=d%10;
            d/=10;
            cnt++;
        }
    }
    REP(i,191){
        x[i+1]+=x[i]/10;
        x[i]%=10;
    }
    string ans;
    REP(i,190) ans+=char('0'+x[i]);
    ans+='.';
    if(!x[190]&&!x[191]) ans+='0';
    else{
        ans+=char('0'+x[190]);
        if(x[191]) ans+=char('0'+x[191]);
    }
    reverse(ALL(ans));
    cout << ans << endl;
}