結果
問題 | No.668 6.0*10^23 |
ユーザー |
![]() |
提出日時 | 2018-03-23 22:39:42 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 1,369 bytes |
コンパイル時間 | 805 ms |
コンパイル使用メモリ | 105,304 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-30 05:10:57 |
合計ジャッジ時間 | 2,135 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> # include <random> # include <chrono> using namespace std; using LL = long long; using ULL = unsigned long long; typedef pair<LL, LL> P; constexpr int INF = 2000000000; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; # define ALL(x) (x).begin(),(x).end() # define UNIQ(c) (c).erase(unique(ALL((c))),(c).end()) # define mp make_pair # define eb emplace_back # define FOR(i,a,b) for(int i=(a);i<(b);i++) # define RFOR(i,a,b) for(int i=(a);i>=(b);i--) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) string s; int main() { cin >> s; double num = s[0] - '0' + (s[1] - '0')*0.1; if (s[2] - '0' >= 5)num += 0.1; if (num >= 10.0) { num /= 10; s = s + "0"; } cout << num<<(num==(int)num?".0":"") << "*10^" << s.size() - 1 << endl; }