QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#166955#6869. SPY finding NPYPPP#AC ✓92ms3648kbC++171.1kb2023-09-06 21:37:562023-09-06 21:37:57

Judging History

你现在查看的是最新测评结果

  • [2023-09-06 21:37:57]
  • 评测
  • 测评结果:AC
  • 用时:92ms
  • 内存:3648kb
  • [2023-09-06 21:37:56]
  • 提交

answer

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

const ll mod = 1000000007;

#define X first
#define Y second

ll pew(ll a, ll b)
{
    ll res = 1;
    while (b>0)
    {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
}

vector<ld> A;

void prec()
{
    const int mx = 10000;
    A.resize(mx+1);
    int P = 1;
    ld eps = 1e-12;
    for (int n=3;n<=mx;n++)
    {
        ld x = 0;
        for (int i=P;i<n;i++) x += P*1.0/i;
        while (true)
        {
            int P2 = P+1;
            ld x2 = 0;
            for (int i=P2;i<n;i++) x2 += P2*1.0/i;
            if (x>=x2+eps) break;
            x = x2, P = P2;
        }
        A[n] = P;
    }
}

void solve()
{
    int n;
    cin >> n;
    cout << A[n] << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//#ifdef DEBUG
//    freopen("input.txt", "r", stdin);
//#endif
    prec();
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 92ms
memory: 3648kb

input:

10000
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
10...

output:

0
0
1
1
2
2
2
3
3
3
4
4
5
5
5
6
6
6
7
7
8
8
8
9
9
9
10
10
10
11
11
12
12
12
13
13
13
14
14
15
15
15
16
16
16
17
17
17
18
18
19
19
19
20
20
20
21
21
22
22
22
23
23
23
24
24
24
25
25
26
26
26
27
27
27
28
28
29
29
29
30
30
30
31
31
31
32
32
33
33
33
34
34
34
35
35
35
36
36
37
37
37
38
38
38
39
39
40
40...

result:

ok 10000 lines