PAT 1059. Prime Factors

反正知道了就是知道，不知道也想不到，很快

#include <cstdio>

#include <cstdlib>

#include <vector>

using namespace std;

inline void print_prime_k(long long p, long long k) {

       printf("%lld", p);

       if (k > ) {

          printf("^%lld", k);

       }

}

int main() {

    long long n, on;

    scanf("%lld", &n);

    on = n;

    vector<long long> ps;

    vector<long long> count;

    long long i = ;

    long long last = ;

    while (n > ) {

        while (n % i == ) {

              n = n/i;

              if (i != last) {

                 ps.push_back(i);

                 count.push_back();

                 last = i;

              }

              count.back()++;

        }

        i++;

    }

    int len = ps.size();

    if (len > ) {

       printf("%lld=", on);

       print_prime_k(ps[], count[]);

    } else {

      printf("%lld=%lld", on, on);

    }

    for (int i=; i<len; i++) {

        printf("*");

        print_prime_k(ps[i], count[i]);

    }

    system("pause");

    return ;

}

考虑输入是1的情况输出要为1=1