3032. 是坚挺数吗？

#include <bits/stdc++.h>

using namespace std;


void solve()
{
    int n;
    cin >> n;
    vector <int> a(10001);
    for(int i = 1; i < 10001; i++)
        a[i] = i;
    for(int j = 2; j < 113; j++)
    {
        for(int i = 1; i < a.size(); i++)
        {
            if(i % j == 0)
                a[i] = -1;
        }
        for(int i = 1; i < a.size(); i++)
            if(a[i] == -1)
                a.erase(a.begin() + i);
    }
    int flag = 0;
    for(int i = 1; i < a.size(); i++)
        if(n == a[i])
        {
            flag = 1;
            cout << "Yes " << i << endl;
            break;
        }
    if(flag == 0)
        cout << "No" << endl;
}

int main()
{
    int T;
    cin >> T;
    for(int i = 0; i < T; i++)
    {
        printf("case #%d:\n", i);
        solve();
    }
    return 0;
}

#include "bits/stdc++.h"
using namespace std;

uint32_t is_firm(uint32_t num, uint32_t div = 2) {
    assert(num > 0 && div >= 2);
    if (num < div)
        return num;
    else if (num % div == 0)
        return 0;
    else
        return is_firm(num - num / div, div + 1);
}

int main() {
    uint32_t t; cin >> t;
    for (uint32_t query = 0; query < t; ++query) {
        printf("case #%u:\n", query);
        if (uint32_t n, check; cin >> n, check = is_firm(n))
            printf("Yes %u\n", check);
        else
            puts("No");
    }
}