QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#386276#1863. Yes, Prime MinisterKevin5307WA 877ms33028kbC++231.2kb2024-04-11 14:57:382024-04-11 14:57:40

Judging History

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

  • [2024-04-11 14:57:40]
  • 评测
  • 测评结果:WA
  • 用时:877ms
  • 内存:33028kb
  • [2024-04-11 14:57:38]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
bool isp[30003000];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	memset(isp,1,sizeof(isp));
	isp[0]=isp[1]=0;
	for(int i=2;i<30003000;i++)
		for(int j=i+i;j<30003000;j+=i)
			isp[j]=0;
	int t;
	cin>>t;
	while(t--)
	{
		int x;
		cin>>x;
		if(x<=0)
		{
			x*=-1;
			if(isp[x+1])
				cout<<x+x+2<<'\n';
			else if(isp[x+1+x+2])
				cout<<x+x+3<<'\n';
			else
				cout<<"-1\n";
		}
		else
		{
			if(isp[x])
				cout<<1<<'\n';
			else if(isp[x+x-1]||isp[x+x+1])
				cout<<2<<'\n';
			else
				cout<<"-1\n";
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 877ms
memory: 33028kb

input:

10
-2
-1
0
1
2
3
4
5
6
7

output:

6
4
3
2
1
1
2
1
2
1

result:

ok 10 numbers

Test #2:

score: -100
Wrong Answer
time: 862ms
memory: 32912kb

input:

201
-100
-99
-98
-97
-96
-95
-94
-93
-92
-91
-90
-89
-88
-87
-86
-85
-84
-83
-82
-81
-80
-79
-78
-77
-76
-75
-74
-73
-72
-71
-70
-69
-68
-67
-66
-65
-64
-63
-62
-61
-60
-59
-58
-57
-56
-55
-54
-53
-52
-51
-50
-49
-48
-47
-46
-45
-44
-43
-42
-41
-40
-39
-38
-37
-36
-35
-34
-33
-32
-31
-30
-29
-28
-27...

output:

202
-1
199
197
194
193
191
-1
-1
-1
-1
181
178
-1
-1
173
-1
-1
166
-1
163
-1
158
157
-1
-1
151
149
146
-1
142
-1
139
137
134
-1
131
-1
127
-1
122
-1
118
-1
-1
113
-1
109
106
-1
103
101
-1
97
94
-1
-1
89
86
-1
82
-1
79
-1
74
73
71
-1
67
-1
62
61
58
-1
-1
53
-1
-1
46
-1
43
41
38
37
34
-1
31
29
26
-1
2...

result:

wrong answer 2nd numbers differ - expected: '202', found: '-1'