From 3e36fc1e5efe81245491fd9ec609901329f57927 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Fri, 30 Dec 2022 02:55:25 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2030.=20=EC=98=A4?=
 =?UTF-8?q?=EC=A0=84=202:55:24?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/유사 칸토어 비트열/solution.java | 22 ++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 programmers/유사 칸토어 비트열/solution.java

diff --git a/programmers/유사 칸토어 비트열/solution.java b/programmers/유사 칸토어 비트열/solution.java
new file mode 100644
index 0000000..c23ba17
--- /dev/null
+++ b/programmers/유사 칸토어 비트열/solution.java	
@@ -0,0 +1,22 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/148652
+
+class Solution {
+    private int bits(long index){
+        String bar = "11011";
+        int answer = 0, base = 1;
+        if(index <= 5){
+            for(int a = 0; a < index; a++) if(bar.charAt(a)=='1') answer++;
+            return answer;
+        }
+        while(Math.pow(5,base+1)<index) base++;
+        int section = (int)(index / (long)Math.pow(5,base));
+        int remainder = (int)(index % (long)Math.pow(5,base));
+        answer = section * (int)Math.pow(4,base);
+        if(section >= 3) answer -= (int)Math.pow(4,base);
+        if(section == 2) return answer;
+        else return answer + bits(remainder);
+    }
+    public int solution(int n, long l, long r) {
+        return bits(r)-bits(l-1);
+    }
+}
\ No newline at end of file