#P6685. Count Positive Integers Satisfying \(x^m \le n\)

    ID: 19893 Type: Default 1000ms 256MiB

Count Positive Integers Satisfying \(x^m \le n\)

Count Positive Integers Satisfying (x^m \le n)

Given two positive integers \(n\) and \(m\), determine the number of positive integers \(x\) such that \(x^m \le n\).

You are to compute the largest integer \(x\) satisfying the inequality. For instance, if \(n = 10\) and \(m = 2\), then \(x=3\) is the maximum integer since \(3^2 = 9 \le 10\) but \(4^2 = 16 > 10\).

inputFormat

The input consists of a single line containing two integers \(n\) and \(m\) separated by a space.

outputFormat

Output a single integer representing the count of positive integers \(x\) that satisfy \(x^m \le n\).

sample

10 2
3