結果
問題 | No.668 6.0*10^23 |
ユーザー |
![]() |
提出日時 | 2018-03-23 22:40:37 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 1,787 bytes |
コンパイル時間 | 1,114 ms |
コンパイル使用メモリ | 118,648 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-30 05:11:15 |
合計ジャッジ時間 | 2,380 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
ソースコード
# include <iostream># include <algorithm>#include <array># include <cassert>#include <cctype>#include <climits>#include <numeric># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <tuple># include <utility># include <stack># include <queue># include <list># include <bitset># include <complex># include <chrono># include <random># include <limits.h># include <unordered_map># include <unordered_set># include <deque># include <cstdio># include <cstring>using namespace std;using LL = long long;using ULL = unsigned long long;constexpr long long MOD = 1000000000 + 7;constexpr long long INF = std::numeric_limits<long long>::max();const double PI = acos(-1);#define fir first#define sec secondtypedef pair<LL, LL> Pll;typedef pair<LL, pair<LL, LL>> Ppll;typedef pair<LL, pair<LL, bitset<100001>>> Pbll;typedef pair<LL, pair<LL, vector<LL>>> Pvll;typedef pair<LL, LL> Vec2;struct Tll { LL first, second, third; };typedef pair<LL, Tll> Ptll;#define rep(i,rept) for(LL i=0;i<rept;i++)#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)LL h, w, n, m, k, s, t, q, ans,sum, last, cnt, a[10000], d[100000];struct Edge { LL to, cost; };string str;char c[1000][1000];bool flag = 0, f[100000];void YN(bool f) {if (f)cout << "YES" << endl;elsecout << "NO" << endl;}void yn(bool f) {if (f)cout << "Yes" << endl;elsecout << "No" << endl;}vector<Edge>vec[10000];int main() {cin >> str;n = str.size() - 1;if (str[2] > '4') {if (str[1] == '9') {str[1] = '0';if (str[0] == '9') {str[0] = '1';n++;}else str[0] += 1;}else {str[1] += 1;}}cout << str[0] << "." << str[1] << "*10^" << n << endl;return 0;}