题解 | #geohash编码#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    while (cin >> n) {
        int high = 90, low = -90;
        vector<int> result;
        
        // 进行6次二分
        for (int i = 0; i < 6; ++i) {
            int mid = (low + high) / 2;
            if (n >= mid) {
                result.push_back(1);
                low = mid;
            } else {
                result.push_back(0);
                high = mid;
            }
        }
        
        // 输出二进制编码
        for (int bit : result) {
            cout << bit;
        }
        cout << endl;
    }
    return 0;
}

import java.util.Scanner;
import java.util.ArrayList;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            int high = 90, low = -90;
            ArrayList<Integer> result = new ArrayList<>();
            
            // 进行6次二分
            for (int i = 0; i < 6; i++) {
                int mid = (low + high) / 2;
                if (n >= mid) {
                    result.add(1);
                    low = mid;
                } else {
                    result.add(0);
                    high = mid;
                }
            }
            
            // 输出二进制编码
            for (int bit : result) {
                System.out.print(bit);
            }
            System.out.println();
        }
    }
}

while True:
    try:
        n = int(input())
        high, low = 90, -90
        result = []
        
        # 进行6次二分
        for _ in range(6):
            mid = int((low + high) / 2)
            if n >= mid:
                result.append(1)
                low = mid
            else:
                result.append(0)
                high = mid
        
        # 输出二进制编码
        print(''.join(map(str, result)))
        
    except EOFError:
        break