QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #574849 | #7055. A Hard Problem | 22U069 | AC ✓ | 12ms | 3664kb | C++20 | 408b | 2024-09-19 01:52:01 | 2024-09-19 01:52:01 |
Judging History
answer
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define int long long
#define pii pair<int,int>
using namespace std;
const int N=300010;
int a[N];
int n,k;
void solve()
{
cin>>n;
cout<<(n+1)/2+1<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T=1;
cin>>T;
while(T--) solve();
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
4 2 3 4 5
output:
2 3 3 4
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 12ms
memory: 3664kb
input:
100000 6 18 54 162 486 1458 4374 13122 39366 118098 354294 1062882 3188646 9565938 28697814 86093442 258280326 774840978 324522916 973568748 920706226 762118660 286355962 859067886 577203640 731610911 194832715 584498145 753494426 260483260 781449780 344349322 33047957 99143871 297431613 892294839 6...
output:
4 10 28 82 244 730 2188 6562 19684 59050 177148 531442 1594324 4782970 14348908 43046722 129140164 387420490 162261459 486784375 460353114 381059331 143177982 429533944 288601821 365805457 97416359 292249074 376747214 130241631 390724891 172174662 16523980 49571937 148715808 446147421 338442251 1532...
result:
ok 100000 lines