There was once young lass called Mary,
Whose jokes were occasionally scary.
On this April's Fool
Fixed limerick rules
Allowed her to trip the unwary.
Can she fill all the lines
To work at all times?
On juggling the words
Right around two-thirds
She nearly ran out of rhymes.
Input
The input contains a single integer $a$ ($4 \le a \le 998$). Not every integer in the range is a valid input for the problem; you are guaranteed that the input will be a valid integer.Output
Output a single number.
Examples input
35
output
57
input
57
output
319
input
391
output
1723
Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
cout << i;
n /= i;
}
}
return 0;
}
Related posts:
Ternary Search
Booking System
King Moves
Block Towers
Primitive Root
Checking a graph for acyclicity and finding a cycle in $O(M)$
Exploration plan
Fence
Generate a String
Dreamoon Likes Sequences
Berland Elections
Deduction Queries
Deleting from a data structure in $O(T(n)\log n)$
Number of paths of fixed length / Shortest paths of fixed length
Preorder Test
Depth First Search
Obsessive String
Giáo trình Thuật toán - Ngọc Anh Thư
Hilbert's Hotel
A Lot of Games
Merging Two Decks
Prüfer code
Good Subsets
Road Repairs
Fast Fourier transform
Fountains
Divide Points
Captain Marmot
Manacher's Algorithm - Finding all sub-palindromes in $O(N)$
Smallest Word
Marbles
Fibonacci Numbers