結果
問題 | No.667 Mice's Luck(ネズミ達の運) |
ユーザー |
![]() |
提出日時 | 2018-03-23 22:33:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 1,780 bytes |
コンパイル時間 | 1,018 ms |
コンパイル使用メモリ | 118,096 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-24 21:49:33 |
合計ジャッジ時間 | 3,201 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
# 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, 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;double sum = 0;rep(i, str.size()) {if (str[i] == 'o')sum += 1;}printf("%.15f\n", (double)(sum*100/str.size()));rep(i, str.size()-1) {if (str[i] == 'o')sum -= 1;printf("%.15f\n", (double)(sum*100 / (str.size() - i - 1)));}return 0;}