//
// main.cpp
// PATA1096
//
// Created by Phoenix on 2018/2/21.
// Copyright © 2018年 Phoenix. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
scanf("%d", &n);
int m = n, j;
vector<int> v;
int opt = 0, k = 0, end;
for(int i = 2; i <= 100000; i++) {
j = i;
k = 0;
m = n;
while(m % j == 0) {
k++;
m /= j;
j++;
}
if(k > opt) {
opt = k;
end = i;
//printf("%d ", i);
}
}
if(opt == 0) {
printf("1\n%d\n", n);
}else{
printf("%d\n", opt);
for(int i = 0; i < opt; i++) {
printf("%d", end + i);
if(i < opt - 1) printf("*");
else printf("\n");
}
}
return 0;
}
PATA1096题解
最新推荐文章于 2021-08-01 20:19:41 发布