J.Prime

最新推荐文章于 2024-10-02 08:00:00 发布

zhang_nuoyan

最新推荐文章于 2024-10-02 08:00:00 发布

阅读量115

点赞数 1

分类专栏：省赛选拔赛

本文链接：https://blog.csdn.net/zhang_nuoyan/article/details/115469283

版权

编程题质数算法溢出条件求解

关键词由CSDN通过智能技术生成

省赛选拔赛专栏收录该内容

4 篇文章 0 订阅

订阅专栏

J.Prime

maybe也是水题

题目描述

Give you a positive integer nn, can you find four prime numbers aa, bb, cc and dd satisfied that a + b + c + d = n and minimizing min(a, b, c, d)?

a, b, c, d are allowed to be the same prime number.

输入格式

The first line contains an integer T for test cases.

Next T lines, each line has an integer n.

1≤T≤10⁵

1≤n≤2³¹

输出格式

For each test case, output an integer to represent the minimum value of min(a, b, c, d)min(a,b,c,d). If it does not exist, you just need to output -1.

输入输出样例

输入 #1

2
1
8

输出 #1

-1
2

#include<bits/stdc++.h>

using namespace std;
#define ll long long

int main()
{
	int t;
	ll n;//开long long
	cin>>t;
	while(t--)
	{
		cin>>n;
		if(n<8) cout<<"-1"<<endl;
		else cout<<"2"<<endl;
	}
	return 0;
}