#496195 (C++17) No.1076 寿司打

• 問題: No.1076 寿司打
• ユーザー: _lambda00
• 提出日時: 2020-06-12 23:22:20
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 1,801 bytes
• コンパイル時間: 1,194 ms
• コンパイル使用メモリ: 115,804 KB
• 最終ジャッジ日時: 2025-01-11 03:12:25
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 10

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <unordered_map>
#include <queue>
#include <bitset>
#include <limits>
#include <numeric>
using ld = long double;
using ll = long long int;
using ul = unsigned long long int;
namespace lamlib
{
    /* constant */
    constexpr double epsilon = std::numeric_limits<double>::epsilon();
    /* math */
    template<class T> inline T abs(const T &a){ return (a>0) ? a : -a; }
    ul inline digit(const ul &num){ return static_cast<ul>(std::log10(num+epsilon))+1; }
    /* algorithm */
    ul gcd(const ul &a,const ul &b) { return (!b) ? a : gcd(b,a%b); }
    std::vector<bool> eratosthenes(const ul &n)
    {
        std::vector<bool> prime_candidate(n,true);
        prime_candidate[0] = prime_candidate[1] = false;
        for(ul i = 2;i*i < n;++i)
        {
            if(!prime_candidate[i]) continue;
            for(ul j = 2;i*j < n;++j) prime_candidate[i*j] = false;
        }
        return prime_candidate;
    }
    ll rho_method(const ll &n)
    {
        auto f = [&](const ll &xi){ return (xi*xi+1)%n; };
        ll x = 2, y = 2, d = 1;
        while(d == 1)
        {
            x = f(x);
            y = f(f(y));
            d = lamlib::gcd(lamlib::abs(x-y),n);
        }
        return d;
    }
    // 素因数分解(試し割)
    std::vector<ll> prime_factorization_trial(const ll &n)
    {
        ll num = n;
        std::vector<ll> prime;
        for(ll i = 2;i*i <= n;++i)
        {
            while((num%i) == 0)
            {
                prime.emplace_back(i);
                num /= i;
            }
        }
        if(num > 1) prime.emplace_back(num);
        return prime;
    }
    /* string */
    inline ul same_char_count(const std::string s,const char &ch){ return std::count(std::cbegin(s),std::cend(s),ch); }
}
// std::cout << std::fixed << std::setprecision(15) << std::endl;
int main(int argc,char *argv[])
{
    ld p;
    std::cin >> p;
    std::cout << p / (1-p) << std::endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX