Tim Korb's Home Page

User Tools

Site Tools

Trace: • contest_prelude_contest_scoreboard • icypc_challenge_installation • hci_syllabus • administering_subversion • dominator_data
prelude_to_factovisors

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

prelude_to_factovisors [2011/09/25 12:54] – created jtkorbprelude_to_factovisors [2011/09/25 13:08] (current) – jtkorb
Line 10: Line 10:
  
 For each non-zero input value, ''n'', determine find the prime factors.  Print all factors on a single line as a sequence of terms of the form ''p^m'', indicating that prime ''p'' appears ''m'' times in ''n''. For each non-zero input value, ''n'', determine find the prime factors.  Print all factors on a single line as a sequence of terms of the form ''p^m'', indicating that prime ''p'' appears ''m'' times in ''n''.
 +
 +Print the primes in numerical order, lowest to highest.  Do not print any primes whose exponent is 0.
  
 ===== Sample Input ===== ===== Sample Input =====
prelude_to_factovisors.1316980463.txt.gz · Last modified: 2011/09/25 12:54 by jtkorb