#include <bits/stdc++.h>
using namespace std;
int main(){
    int x,z,s=0;
    cin>>x;
    for(z=2;z<=x;z++){
        int k=0;
        for(int i=2;i<z;i++){
            if(z%i==0) k++;
        }
        if(k==0){
            if(x>=z){
                x=x-z;
                cout<<z<<endl;
                s++;
            }
            else break;
        }
    }
    cout<<s;
}

@liveOvO (chuhaoyu) 好像不用vector也能通过"O^O"

#include<bits/stdc++.h>
using namespace std;
bool check(int num) {
    if (num <= 1)
        return false;
    for (int i = 2; i * i <= num; ++i) {
        if (num % i == 0)
            return false;
    }
    return true;
}
int main() {
    int x;
    cin >> x;
    vector<int> primes;
    int sum = 0;
    for (int i = 2; sum + i <= x; ++i) {
        if (check(i)) {
            primes.push_back(i);
            sum += i;
        }
    }
    for (int prime : primes) {
        cout << prime << endl;
    }
    cout << primes.size() << endl;
    return 0;
}

不用 vector 只能度过一个相对失败的人生（

#include<bits/stdc++.h> using namespace std; bool check(int num) { if (num <= 1) return false; for (int i = 2; i * i <= num; ++i) { if (num % i == 0) return false; } return true; } int main() { int x; cin >> x; vector<int> primes; int sum = 0; for (int i = 2; sum + i <= x; ++i) { if (check(i)) { primes.push_back(i); sum += i; } } for (int prime : primes) { cout << prime << endl; } cout << primes.size() << endl; return 0; }