C. Maximum splitting
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings.
An integer greater than 1 is composite, if it is not prime, i.e. if it has positive divisors not equal to 1 and the integer itself.
Input
The first line contains single integer q (1 ≤ q ≤ 105) — the number of queries.
q lines follow. The (i + 1)-th line contains single integer ni (1 ≤ ni ≤ 109) — the i-th query.
Output
For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.
Examples
input
1
12
output
3
input
2
6
8
output
1
2
input
3
1
2
3
output
-1
-1
-1
Note
12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands.
8 = 4 + 4, 6 can’t be split into several composite summands.
1, 2, 3 are less than any composite number, so they do not have valid splittings.
【题意】:一个数拆分成几个合数之和,求最多能拆分成几个数之和。
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,t;
cin>>t;
while(t--){
cin>>n;
if(n<3) puts("-1");
else if(n==5) puts("-1");
else if(n%4==1) cout<<n/4-1<<"\n";
else if(n%4==0) cout<<n/4<<"\n";
else if(n%4==2) cout<<n/4<<"\n";
else if(n==7||n==11) puts("-1");
else cout<<n/4-1<<"\n";
}
return 0;
}
别人思路:通过观察可以发现,最后为了使得拆分成的合数个数最多,只能够拆分成4,6,9三种合数,对于一个偶数来说,最后拆分的合数只能是4或者6,对于奇数来说,最后拆分成的合数则可能是4或6或9,并且只有一个9。因此我们可以通过num / 4来计算拆分成合数的个数,又因为对于一个奇数来说一定含有一个9,而9/4==2,因此多算了一个,所以当num % 2 == 1 的时候 拆分成的合数的个数应该为 num / 4 - 1, num为偶数是拆分的合数的个数为:num / 4,因此可以得到一个公式:num / 4 - num % 2;