W - Medium Factorization

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);
#define Bye return 0
#define CodeTyper main
using ll = long long;

using namespace std;

const int SZ = 2e5+1, MAX_SIZE = 2e7+1, mod = 1e9 + 7;
vector<bool> visited(SZ, true);
vector<int> primes;

void seive(){
    vector<bool> visited(SZ, true);
    visited[0] = visited[1] = false;
    for (int i = 2; i <= SZ; i++) {
        if (visited[i] && (long long)i * i <= SZ) {
            for (int j = i * i; j <= SZ; j += i)
                visited[j] = false;
        }
    }

    for (int i = 2; i<SZ; i++){
        if(visited[i]){
            primes.push_back(i);
        }
    }

}

void solve() {
    int n;
    int len = primes.size();

    while(scanf("%i", &n) != EOF){

        if(n == 1){
            printf("1\n");
            continue;
        }

        printf("1");
        int j = 0;
        while (primes[j]*primes[j]<=n){

            if(n%primes[j] == 0){
                n /= primes[j];
                printf(" x %d", primes[j]);
            } else{
                j++;
            }

        }

        if(n>1){
            printf(" x %d", n);
        }

        printf("\n");
    }
}

int CodeTyper()
{
    IOS;
    seive();
    solve();
    Bye;
}

/*
    * Think first, then code. - CodeTyper
    ** Think twice, code once. - CodeTyper
*/