結果
問題 | No.219 巨大数の概算 |
ユーザー | LayCurse |
提出日時 | 2015-05-29 22:39:09 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 9 ms / 1,500 ms |
コード長 | 2,427 bytes |
コンパイル時間 | 1,297 ms |
コンパイル使用メモリ | 159,640 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-18 10:40:50 |
合計ジャッジ時間 | 3,402 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
6,812 KB |
testcase_01 | AC | 8 ms
6,940 KB |
testcase_02 | AC | 9 ms
6,940 KB |
testcase_03 | AC | 8 ms
6,940 KB |
testcase_04 | AC | 3 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 8 ms
6,944 KB |
testcase_11 | AC | 8 ms
6,948 KB |
testcase_12 | AC | 8 ms
6,940 KB |
testcase_13 | AC | 8 ms
6,940 KB |
testcase_14 | AC | 8 ms
6,940 KB |
testcase_15 | AC | 8 ms
6,944 KB |
testcase_16 | AC | 8 ms
6,940 KB |
testcase_17 | AC | 8 ms
6,944 KB |
testcase_18 | AC | 8 ms
6,944 KB |
testcase_19 | AC | 8 ms
6,940 KB |
testcase_20 | AC | 9 ms
6,944 KB |
testcase_21 | AC | 8 ms
6,940 KB |
testcase_22 | AC | 8 ms
6,944 KB |
testcase_23 | AC | 8 ms
6,940 KB |
testcase_24 | AC | 8 ms
6,944 KB |
testcase_25 | AC | 8 ms
6,940 KB |
testcase_26 | AC | 8 ms
6,940 KB |
testcase_27 | AC | 8 ms
6,944 KB |
testcase_28 | AC | 9 ms
6,944 KB |
testcase_29 | AC | 8 ms
6,944 KB |
testcase_30 | AC | 7 ms
6,940 KB |
testcase_31 | AC | 9 ms
6,944 KB |
testcase_32 | AC | 8 ms
6,940 KB |
testcase_33 | AC | 8 ms
6,940 KB |
testcase_34 | AC | 8 ms
6,940 KB |
testcase_35 | AC | 8 ms
6,940 KB |
testcase_36 | AC | 8 ms
6,944 KB |
testcase_37 | AC | 9 ms
6,944 KB |
testcase_38 | AC | 8 ms
6,944 KB |
testcase_39 | AC | 8 ms
6,940 KB |
testcase_40 | AC | 8 ms
6,940 KB |
testcase_41 | AC | 8 ms
6,944 KB |
testcase_42 | AC | 8 ms
6,944 KB |
testcase_43 | AC | 8 ms
6,940 KB |
testcase_44 | AC | 8 ms
6,944 KB |
testcase_45 | AC | 8 ms
6,944 KB |
testcase_46 | AC | 8 ms
6,940 KB |
testcase_47 | AC | 8 ms
6,944 KB |
testcase_48 | AC | 9 ms
6,940 KB |
testcase_49 | AC | 8 ms
6,940 KB |
testcase_50 | AC | 8 ms
6,944 KB |
testcase_51 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’: main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 15 | void reader(double *x){scanf("%lf",x);} | ~~~~~^~~~~~~~~
ソースコード
#include<bits/stdc++.h> using namespace std; #define REP(i,a,b) for(i=a;i<b;i++) #define rep(i,n) REP(i,0,n) #define mygc(c) (c)=getchar_unlocked() #define mypc(c) putchar_unlocked(c) #define ll long long #define ull unsigned ll void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} void reader(double *x){scanf("%lf",x);} 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;} template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);} template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);} template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);} void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);} void writer(double x, char c){printf("%.15f",x);mypc(c);} void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);} void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);} template<class T> void writerLn(T x){writer(x,'\n');} template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');} template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');} template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');} char memarr[17000000]; void *mem = memarr; #define MD 1000000007 #define EPS 1e-13 ll N, A, B; int main(){ int i, j, k; ll s,t,hoge; double res; reader(&N); while(N--){ reader(&A,&B); res = log10(A) * B; hoge = (ll)floor(res); res -= hoge; for(s=0;s<100;s++) if(log10(0.1*(s+1)) > res+EPS) break; writerLn(s/10,s%10,hoge); } return 0; }