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:
P-binary
New Year Present
Cron
Graph Reconstruction
Paint the Digits
Casinos and travel
The Stern-Brocot tree and Farey sequences
Lowest Common Ancestor - Tarjan's off-line algorithm
Dima and Game
Compartments
Replicating Processes
Minimum stack / Minimum queue
Closest Equals
Attack on Red Kingdom
Rock Is Push
Modernization of Treeland
Kate and imperfection
Monopole Magnets
Developing Game
New Year and the Sphere Transmission
Rin and The Unknown Flower
Practice
Sliding Doors
Beautiful Bracket Sequence (easy version)
Suffix Automaton
Restore Cube
Marbles
Design Tutorial: Learn from Math
GCD Table
Colorado Potato Beetle
Sorting by Subsequences
Packets