eolymp
bolt
Try our new interface for solving problems

Joke

The problem is to cut the largest possible number of circles with diameter \textbf{y} out of a stripe of length \textbf{x} and width \textbf{y}. \InputFile The only line of input consists of two positive real numbers \textbf{x} and \textbf{y} with \textbf{9}-digit precision separated by spaces. The integers may be written without decimal point. \OutputFile Output a single integer - the maximum number of circles one can cut out of the stripe.
Time limit 1 second
Memory limit 64 MiB
Input example #1
6.3 0.9
Output example #1
7
Source ACM ICPC 2010-2011 NEERC Moscow Subregional