문제: app.codility.com/programmers/lessons/10-prime_and_composite_numbers/min_perimeter_rectangle/
결과: 70% 난 소수랑 안친한가 봄...
if (N == 1)
return 4;
List<int> perimeter = new List<int>();
for (int i = 1; i <= N / 2; i++)
{
if (N % i == 0)
{
perimeter.Add((i + (N / i)) * 2);
}
}
perimeter.Sort();
return perimeter[0];
'공부하자 > Codility' 카테고리의 다른 글
[Codility] Lesson11. CountNonDivisible (C#) (0) | 2020.11.27 |
---|---|
[Codility] Lesson10. Peaks (C#) (0) | 2020.11.27 |
[Codility] Lesson10. Flags (C#) (0) | 2020.11.20 |
[Codility] Lesson10. CountFactors (C#) (0) | 2020.11.20 |
[Codility] Lesson9. MaxSliceSum (C#) (0) | 2020.11.20 |