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

• 問題: No.428 小数から逃げる夢
• ユーザー: IL_msta
• 提出日時: 2017-01-17 22:37:49
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 3,851 bytes
• コンパイル時間: 736 ms
• コンパイル使用メモリ: 98,172 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-24 16:42:42
• 合計ジャッジ時間: 3,822 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

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

ソースコード

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
#ifdef getchar_unlocked
#define mygc(c) (c)=getchar_unlocked()
#else
#define mygc(c) (c)=getchar()
#endif
#ifdef putchar_unlocked
#define mypc(c) putchar_unlocked(c)
#else
#define mypc(c) putchar(c)
#endif
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
#ifdef _DEBUG
#define DEBUG_BOOL(b) assert(b)
#else
#define DEBUG_BOOL(b) 
#endif
/////数値読み込み
#define ENABLE_READER_ON(T)	\
inline void reader(T &x){int k;x = 0;bool flag = true;\
while(true){mygc(k);\
if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\
}\
if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\
else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\
}
//整数
ENABLE_READER_ON(int)
ENABLE_READER_ON(long)
ENABLE_READER_ON(long long)
ENABLE_READER_ON(unsigned int)
ENABLE_READER_ON(unsigned long)
ENABLE_READER_ON(unsigned long long)

//////
//文字読み込み
inline int reader(char c[]){int i,s=0;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c[s++]=i;
for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}
c[s]='\0';return s;
}

inline int reader(string& c,int size=100){int i;c.reserve(size);
for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}
c.push_back(i);
for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}
return c.size();}

/////////
//数値出力
#define ENABLE_WRITER_ON(T)	\
inline void writer(T x){char f[20];int s = 0;\
if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\
else{while(x){f[s++] = (x % 10), x /= 10;}}\
if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}

ENABLE_WRITER_ON(int)
ENABLE_WRITER_ON(long)
ENABLE_WRITER_ON(long long)
ENABLE_WRITER_ON(unsigned int)
ENABLE_WRITER_ON(unsigned long)
ENABLE_WRITER_ON(unsigned long long)
/////////
inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }
inline void writer(const string str){writer( str.c_str() );}
///////////////////////////////////////////////////////////
// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////

inline void solve(){
	string str="1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991";
	ULL N;
	reader(N);

	const int size = str.size();
	vector<ULL> num(19+1,0);
	num[0] = 0;
	for(int i=0;i<19;++i){
		for(int j=0;j<10;++j){
			num[i+1] = num[i+1]*10 + str[i*10+j]-'0';
		}
	}
	const ULL BASE = 10000000000;
	//mul N
	ULL temp;
	ULL CARR = 0;
	for(int i=19;i>=0;--i){
		temp = num[i] * N + CARR;
		num[i] = temp%BASE;
		CARR = temp/BASE;
	}
	
	cout << num[0] << ".";
	ULL R;
	for(int i=1;i<20;++i){
		R = BASE/10;
		while(R){
			cout << num[i]/R;
			num[i] %= R;
			R /=10;
		}
	}
	cout << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//小数を10進数表示
    cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();

	return 0;
}