Divide the apples - 1#4716

Divide the apples - 1 (شرح الحلول)

To solve the problem, it is sufficient to compute the quotient of $k$ divided by $n$ .

Algorithm implementation

Read the input data.

scanf("%d %d",&n,&k);

Compute and print the answer.

printf("%d\n",k/n);

Java implementation

import java.util.*;

public class Main
{
  public static void main(String[] args)
  {
    Scanner con = new Scanner(System.in);
    int n = con.nextInt();
    int k = con.nextInt();
    System.out.println(k/n);
    con.close();
  }
}

Java

Python implementation

Read the input data.

n = int(input())
k = int(input())

Compute and print the answer.

res = k // n
print(res)