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:
Scheduling jobs on two machines
Maximum Waterfall
Packmen
Finding strongly connected components - Building condensation graph
A Lot of Games
Looksery Party
Professor GukiZ and Two Arrays
Shave Beaver!
Clockwork Bomb
Maximum flow - Dinic's algorithm
Search for a pair of intersecting segments
Points on Line
Robot Sequence
Rin and The Unknown Flower
Sharti
Artem and Array
Minimum spanning tree - Kruskal with Disjoint Set Union
Factorial modulo $p$
Tree-String Problem
Subarray Cuts
Card Game
Perfect Pair
TOF
Serega and Fun
String Hashing
Sum of Odd Integers
Robots protection
Berland Elections
Noise Level
Lattice points inside non-lattice polygon
Quantifier Question
Command Line Arguments