QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #14880 | #1863. Yes, Prime Minister | Rhodoks | Compile Error | / | / | C | 1.4kb | 2021-10-20 16:16:38 | 2022-05-18 04:02:08 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2022-05-18 04:02:08]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2021-10-20 16:16:38]
- 提交
answer
#include <bits/stdc++.h>
#define DB double
#define LL long long
#define MST(a,b) memset((a),(b),sizeof(a))
#ifdef _DEBUG_
#define MRK() cout<<"Mark"<<endl;
#define WRT(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define MRK() ;
#define WRT(x) ;
#endif
#define MAXN 20100000
#define MAXM 2010000
#define MOD 998244353 //1000000007
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-5
#define _ 0
using namespace std;
int notprime[MAXN];
vector<int> rec1;
vector<int> rec2;
void init()
{
notprime[0]=notprime[1]=1;
for (int i=2;i<MAXN;i++)
{
if (notprime[i])
continue;
if (i&1)
rec2.push_back(i/2+1);
rec1.push_back(i);
for (int j=2*i;j<MAXN;j+=i)
notprime[j]=1;
}
}
int x;
void work()
{
scanf("%d",&x);
if (x>=0 && !notprime[x])
{
cout<<1<<endl;
return;
}
if (x>=1 && (!notprime[2*x-1] || !notprime[2*x+1]))
{
cout<<2<<endl;
return;
}
int ans=INF;
int t;
if (x>=0)
{
t=*lower_bound(rec1.begin(),rec1.end(),x);
ans=min(ans,2*t);
t=*lower_bound(rec2.begin(),rec2.end(),x);
ans=min(ans,2*t-1);
}
else
{
t=*lower_bound(rec1.begin(),rec1.end(),-x+1);
ans=min(ans,2*t);
t=*lower_bound(rec2.begin(),rec2.end(),-x+2);
ans=min(ans,2*t-1);
}
cout<<ans<<endl;
}
int main()
{
init();
int casenum=1;
scanf("%d",&casenum);
for (int testcase=1;testcase<=casenum;testcase++)
{
work();
}
return ~~(0^_^0);
}
Details
answer.code:1:10: fatal error: bits/stdc++.h: No such file or directory
#include <bits/stdc++.h>
^~~~~~~~~~~~~~~
compilation terminated.