QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#166942#6869. SPY finding NPYPPP#WA 12ms3584kbC++17808b2023-09-06 21:22:372023-09-06 21:22:37

Judging History

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

  • [2023-09-06 21:22:37]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:3584kb
  • [2023-09-06 21:22:37]
  • 提交

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;
    }
}


const ld ee = expl(1);

void solve()
{
    ll n;
    cin >> n;
    if (n<=2)
    {
        cout << 0 << "\n";
        return;
    }
    n -= 2;
    cout << (int)ceil(n/ee) << endl;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 12ms
memory: 3584kb

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
7
8
8
9
9
9
10
10
10
11
11
12
12
12
13
13
13
14
14
14
15
15
16
16
16
17
17
17
18
18
19
19
19
20
20
20
21
21
21
22
22
23
23
23
24
24
24
25
25
26
26
26
27
27
27
28
28
28
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
39
40...

result:

wrong answer 21st lines differ - expected: '8', found: '7'