QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#484912#6835. A Hero Named MagnusSunnyzbhAC ✓9ms3924kbC++20596b2024-07-20 06:07:042024-07-20 06:07:04

Judging History

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

  • [2024-07-20 06:07:04]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:3924kb
  • [2024-07-20 06:07:04]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
mt19937_64 rnd(time(0));
#define int i64
#define rg(t) for(int i=1;i<=t;i++){
#define rg_(i,t) for(int i=1;i<=t;i++){
#define rrg(t) for(int i=0;i<t;i++){
#define gr }
inline int rd(){
    int fl=1,ret=0;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')ret=(ret<<1)+(ret<<3)+(ch^48),ch=getchar();
    return ret*fl;
}
signed main(){
    int tc=rd();while(tc--)
{
    i64 x=rd();
    i64 ans=x+x-1;
    printf("%lld\n",ans);
}
    return 0;
}
/*
*/

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3924kb

input:

2
1
3

output:

1
5

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 9ms
memory: 3924kb

input:

100000
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
1...

output:

1
3
5
7
9
11
13
15
17
19
21
23
25
27
29
31
33
35
37
39
41
43
45
47
49
51
53
55
57
59
61
63
65
67
69
71
73
75
77
79
81
83
85
87
89
91
93
95
97
99
101
103
105
107
109
111
113
115
117
119
121
123
125
127
129
131
133
135
137
139
141
143
145
147
149
151
153
155
157
159
161
163
165
167
169
171
173
175
177...

result:

ok 100000 lines