NGM - A Game with Numbers

no tags 

Nikifor and Trofim play the following game: they write some positive integer smaller than 2,000,000,000 and take turns one after another. Nikifor is the first to make a move. The turn is made by the following rule: from the written integer any non-zero digit is subtracted, and the new integer replaces the old one on the desk. For example for integer 40534, the next move can be: 40530, 40531 or 40529. The winner is the player who writes zero on the desk.

Write a program to decide who will win if both players do their best.


The input contains the positive integer from which the game is started.


In the first line you must write 1 if Nikifor wins and 2 otherwise. If Nikifor wins then in the second line you must output the move in the first turn which guarantees victory for him. If there are many such moves then output any of them.




Author: Filimonenkov D.O.

hide comments
dark_harry: 2017-07-25 20:49:40

what if the number is 0?

hunnychauhan: 2017-07-22 11:32:04

unable to understand problem clearly yet solved it using sample case :)

unlock1997: 2017-07-06 13:04:04

@tuandayhehe you have to print the move in the first turn and not total number of turns.Read the output statement very carefully.

agdeva8: 2017-07-03 15:30:05

use string to store the number

masterbios: 2017-06-21 21:15:44

Silly mistake costs me 2 WA !finally got it.

ramesh_961: 2017-06-03 06:53:59

Just Easy!!Think cool!! You will get definately!! O(1) solution!

sagnik_66: 2017-05-19 18:27:26

Extremely Easy!!

anupamwadhwa: 2017-05-14 19:38:43


rohit9934: 2017-05-01 16:40:50

Hey! this is more easy than it looks.
HInt:Store numbers in strings.

jeelapamy: 2017-03-10 09:40:15

why is long long int gave wrong answer?

Added by:Roman Sol
Time limit:0.620s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ZCon 2007