three-divisors

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer <code>n</code>, return <code>true</code> if <code>n</code> has exactly three positive divisors. Otherwise, return <code>false</code>.

An integer <code>m</code> is a divisor of <code>n</code> if there exists an integer <code>k</code> such that <code>n = k * m</code>.

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: false
Explantion: 2 has only two divisors: 1 and 2.
</pre>

Example 2:

<pre>
Input: n = 4
Output: true
Explantion: 4 has three divisors: 1, 2, and 4.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 104</code></li>
</ul>

isThree

Three Divisors

Math

Enumeration

Number Theory

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie