Leetcode 1952. Triple divisor

Give you an integer n . If n There are exactly three positive divisors , return true ; otherwise , return false .

If there are integers k , Satisfy n = k * m , So integers m Namely n One of the Divisor .

Example 1：

 Input ：n = 2
 Output ：false
 explain ：2  There are only two divisors ：1  and  2 .

Example 2：

 Input ：n = 4
 Output ：true
 explain ：4  There are three divisors ：1、2  and  4 .
 

Tips ：

• 1 <= n <= 10^4

Code:

class Solution {
    
public:
    bool isThree(int n) {
    
        int res=0;
        for(int i=1;i<=n;i++)
        {
    
            if((n%i)==0)
                res++;
        }
        return res==3;
    }
};