-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathA.cpp
71 lines (61 loc) · 1.14 KB
/
A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
Author: Zeno_orz
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define el "\n"
#define len(x) x.size()
#define gcd(a, b) __gcd(a, b)
#define ste(v) v.begin(), v.end()
#define stea(arr, n) arr, arr+n
/*----------------Functions---------------*/
void primeSieve(vector<bool> &prime) {
for(ll i=0;i<prime.size();i++) prime[i] = 1;
for (ll i=2;i*i<=prime.size();i++) {
if(prime[i]) {
for(ll j=i*i;j<=prime.size();j+=i) {
prime[j] = 0;
}
}
}
}
/*----------------Functions---------------*/
void solve(){
// Solve here
int n;
cin>>n;
if(n&1) {
int x = (n/2);
cout<<x<<endl;
while(n>3) {
cout<<2<<" ";
n-=2;
}
cout<<3<<endl;
} else {
cout<<n/2<<endl;
while(n){
cout<<2<<" ";
n-=2;
}
}
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}