Module: Prime numbers and factorization of a number into prime factors


Problem

1 /9


Simplicity test

Problem

Check if a number is prime.

Input 
Enter one natural number n not exceeding 2000000000 and not equal to 1.

Imprint 
Output  string prime if the number is prime, or composite if the number is composite.
 
Examples
# Input Output
1 5 prime

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!