Programming Question # #: Apples and Worms

Describe

You bought a box of n apples, unfortunately, when you bought it, you got into a bug in the box. Insects can eat an apple every x hours, assuming that the worm does not eat another one before eating an apple, how many complete apples do you have after y hours?

Input

Enter only one row, including N,x and y (all integers).

Output

Output is only one line, the remaining number of apples

#include <iostream>usingnamespace  std; int Main () {    int  n, x, y;     >> n >> x >> y;     int t = (int) (n-(y*1.0)/ x);     if 0 0 ;     << t << Endl;      return 0

Programming Puzzle # #: Apples and worms