반응형
#include <cmath>
int solution(int N) {
if(N==1) return 1;
int answer = 0;
for(int i=1; i<sqrt(N); i++){
if(N%i==0) answer++;
}
answer*=2;
if(pow((int)sqrt(N),2)==N) answer++;
return answer;
}
반응형
'코테' 카테고리의 다른 글
[Codility] AbsDistinct C++ (0) | 2022.01.05 |
---|---|
[Codility] ChocolatesByNumbers C++ (0) | 2022.01.04 |
[Codility] MaxNonoverlappingSegments C++ (0) | 2021.12.31 |
[Codility] NumberSolitaire C++ (0) | 2021.12.30 |
[Codility] MaxDoubleSliceSum C++ (0) | 2021.12.30 |