mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-23 21:28:48 +00:00
T206821 [✗✓OI R1] 铝锤制作
R62441516
This commit is contained in:
parent
242a1604d1
commit
42d5617483
35
Luogu/T206821/T206821.cpp
Normal file
35
Luogu/T206821/T206821.cpp
Normal file
@ -0,0 +1,35 @@
|
||||
#include <bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int n, k, s;
|
||||
vector<int> a, b;
|
||||
|
||||
int main() {
|
||||
cin >> n >> k;
|
||||
for (int i = 2; i * i <= n; i++) {
|
||||
while (n % i == 0) {
|
||||
a.push_back(i);
|
||||
n /= i;
|
||||
}
|
||||
}
|
||||
if (n > 1) a.push_back(n);
|
||||
for (int i : a) {
|
||||
s += i;
|
||||
b.push_back(i);
|
||||
}
|
||||
if (s > k) {
|
||||
cout << -1 << endl;
|
||||
exit(0);
|
||||
}
|
||||
while (s < k) {
|
||||
b.push_back(1);
|
||||
s++;
|
||||
}
|
||||
cout << b.size() << endl;
|
||||
for (int i : b) {
|
||||
cout << i << ' ';
|
||||
}
|
||||
cout << endl;
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user