-
CountDivStudy/알고리즘 2018. 1. 12. 14:43
퍼포먼스 0!!
public static int solution(int A, int B, int K){ int result = 0; for(int i = A; i <= B; i++){ if(i%K==0){ result++; } } return result; }
'Study > 알고리즘' 카테고리의 다른 글
Distinct (0) 2018.01.15 Triangle (0) 2018.01.15 MinAvgTwoSlice (0) 2018.01.15 GenomicRangeQuery (0) 2018.01.15 PassingCars (0) 2018.01.12 MaxCounters (0) 2018.01.12 MissingInteger (0) 2018.01.12 FrogRiverOne (0) 2018.01.12 PermCheck (0) 2018.01.11 PermMissingElem (0) 2018.01.11 댓글