Daily Coding - DAY-1 # Math

aryanarya — Fri, 07 Dec 2018 14:56:14 +0000

Finding the ways
You are given an integer N and a value k . You need to find a minimum number X which when multiplied to N results in the value of N^(1/k) as an integer.

For example let N =6 and k=2 , then the answer will be 6 because 6*6 =36 and if we calculate 36^(1/2) it is equal to 6 which is an integer.

Input
The first line contains two space-separated values N and 6 as input.

Output
Print the minimum number X modulo 10^9 + 7

Sample Input

12 2

Sample Output

If you multiply 6 with 6 then the result becomes 36 which is a perfect power of 2 .

Daily Coding - DAY 1 # typographically smallest

aryanarya — Fri, 07 Dec 2018 14:42:11 +0000

Given a string consisting of lowercase letters only, find the typographically smallest string not present as a substring in it.

Given two string S1 and S2. S1 is considered typographically smaller than S2 if either:

Input:

The first line of input contains the string S.

Output:

Answer as stated above.

Constraints:

Sample Input

saurabh

DEV Community: aryanarya

Daily Coding - DAY-1 # Math

Daily Coding - DAY 1 # typographically smallest

Input:

Output:

Sample Input

Sample Output