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:
Limak and Shooting Points
Dream Team
Graph Decomposition
Long Beautiful Integer
Finding articulation points in a graph in $O(N+M)$
The Brand New Function
Book of Evil
Two Teams Composing
Close Vertices
Tree Diameter
Paint the edges of the tree
Xor-Set
Slime and Biscuits
Solve RMQ (Range Minimum Query) by finding LCA (Lowest Common Ancestor)
Convex hull trick and Li Chao tree
New Year and Rating
PolandBall and Game
Modernization of Treeland
Coprime Permutation
Ilya and a Colorful Walk
Gena and Second Distance
Colorful Bricks
Team Rocket Rises Again
Berland Miners
Maximum flow - MPM algorithm
Spyke Talks
Maximums
Prefix Enlightenment
Dividing Kingdom
Om Nom and Dark Park
Beautiful Bracket Sequence (hard version)
Knight Tournament