BOJ 2292 벌집

1 개요

BOJ 2292 벌집

• 백준 온라인 저지 2292번 문제
• BOJ 8단계

• 벌집이 형성되는 규칙을 유추해 문제를 해결해 봅니다

2 C++

#include <iostream>
using namespace std;

int getDistance(int n) {
    int total = 1;
    int distance = 1;
    while( n > total ) {
        total += distance * 6;
        distance++;
    }
    return distance;
}

int main() {
    int N;
    cin >> N;
    cout << getDistance(N) << '\n';
}

3 Java

import java.util.Scanner;
public class Main {
    private static int getDistance(int n) {
        int total = 1;
        int distance = 1;
        while( n > total ) {
            total += distance * 6;
            distance++;
        }
        return distance;
    }
    
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println(getDistance(n));
    }
}

4 Perl

$n = <>;
($total, $distance) = (1) x 2;
while ( $n > $total ) {
    $total += $distance * 6;
    $distance++;
}
printf("%d\n", $distance);

5 PHP

<?php
$n = intval(fgets(STDIN));
$total = 1;
$distance = 1;
while( $total < $n ) {
    $total += $distance * 6;
    $distance++;
}
echo $distance;

6 Python

n = int(input())
total = 1
distance = 1
while total < n:
    total += distance * 6
    distance += 1
print(distance)