BUEST salary system
All submissions for this problem are available.
Earlier days, in BUEST, salary to teachers is given in the form of special coins named as BUEST coins. Any teacher could exchange it with the bank into three coins n/2,n/3,n/4. But since in the world, it will be very difficult with those decimals to purchase things so simply bank rounds off the values. As the institute has foreign collaboration with universities, so in a faculty exchange program if a teacher goes to Japan, then he could exchange BUEST coins with yen. Suppose you have one BUEST coin . What is the maximum amount of yen you can get to survive in Japan.
The input will contain several test cases . Each test case is a single line with a number n.
It is the number written on your coin
For each test case output the single line , containing the maximum amount of Japanese Yen a teacher can make.
Input: 12 2 Output: 13 2
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, PYP3|
Fetching successful submissions
If you are still having problems, see a sample solution here.