Highest Divisor (HDIVISR) Solution — Codechef February Long Challenge

Problem Statement

You are given an integer N. Find the largest integer between 1 and 10 (inclusive) which divides N.

Input

The first and only line of the input contains a single integer N.

Output

Print a single line containing one integer ― the largest divisor of N between 1 and 10.

Constraints

• 2≤N≤1,000

Subtasks

Subtask #1 (100 points): original constraints

Example Input 1

24

Example Output 1

8

Explanation

The divisors of 24 are 1,2,3,4,6,8,12,24 out of which 1,2,3,4,6,8 are in the range [1,10]. Therefore, the answer is max(1,2,3,4,6,8)=8.

Example Input 2

91

Example Output 2

7

Explanation

The divisors of 91 are 1,7,13,91 out of which only 1 and 7 are in the range [1,10]. Therefore, the answer is max(1,7)=7.

Code (Solution)

The code has been implemented in Java.

import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
       Scanner sc = new Scanner(System.in);
       int num =sc.nextInt();
       int max=0;
       for(int i=10;i>0;i--){
           if(num%i == 0){
              System.out.println(i);
              break;
          }
          else{
            continue;
          }
       }
}
}
}
}
}
}

Hope you would have liked the article. Please give 50 claps to this article and follow me for more future programming related blogs.

References

https://www.codechef.com/FEB21C/problems/HDIVISR