結果
問題 | No.667 Mice's Luck(ネズミ達の運) |
ユーザー |
![]() |
提出日時 | 2018-03-23 22:27:51 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 241 ms / 2,000 ms |
コード長 | 1,361 bytes |
コンパイル時間 | 873 ms |
コンパイル使用メモリ | 103,488 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-24 21:45:05 |
合計ジャッジ時間 | 2,457 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
# 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)double a, b;string s;int main() {cin >> s;REP(i, s.size()) {if (s[i] == 'o')b++;}a = s.size();REP(i, s.size()) {cout << fixed << setprecision(13) << b/a*100 << endl;if (s[i] == 'x')a--;else a--, b--;}}