B. Non-Coprime Partition
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Find out if it is possible to partition the first nn positive integers into two non-empty disjoint sets S1S1 and S2S2 such that:
gcd(sum(S1),sum(S2))>1gcd(sum(S1),sum(S2))>1
Here sum(S)sum(S) denotes the sum of all elements present in set SS and gcdgcd means thegreatest common divisor.
Every integer number from 11 to nn should be present in exactly one of S1S1 or S2S2.
Input
The only line of the input contains a single integer nn (1≤n≤450001≤n≤45000)
Output
If such partition doesn't exist, print "No" (quotes for clarity).
Otherwise, print "Yes" (quotes for clarity), followed by two lines, describing S1S1 and S2S2 respectively.
Each set description starts with the set size, followed by the elements of the set in any order. Each set must be non-empty.
If there are multiple possible partitions — print any of them.
Examples
input
Copy
1
output
Copy
No
input
Copy
3
output
Copy
Yes
1 2
2 1 3
Note
In the first example, there is no way to partition a single number into two non-empty sets, hence the answer is "No".
In the second example, the sums of the sets are 22 and 44 respectively. The gcd(2,4)=2>1gcd(2,4)=2>1, hence that is one of the possible answers.
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
if(n==1||n==2) cout<<"No"<<endl;
else if(n%2==0)
{
cout<<"Yes"<<endl<<1<<' '<<n/2<<endl;
cout<<n-1<<' ';
for(int i=1;i<=n;i++){
if(i==n/2) continue;
else
cout<<i<<' ';
}
cout<<endl;
}else{
cout<<"Yes"<<endl<<1<<' '<<n<<endl;
cout<<n-1<<' ';
for(int i=1;i<n;i++){
cout<<i<<' ';
}
cout<<endl;
}
}
return 0;
}