<PREV Problem:
NEXT>
Solved by 197 users: ...
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 

Hacker's attack

Time limit = 3 second(s)

You are given a1, b1, c1. They were calculated from a, b c:

All operations are done in modulus 224 (unsigned integers of size 24 bits are used). The operation designates bitwise XOR. The operation "·" stands for multiplication.

Input Three integers a1, b1, c1 from the interval [0, 224).

Output Three integers a, b, c which bring to a1, b1, c1. If there are no such numbers, then output "-1 -1 -1".

Input#1
11083234 2487810 12413370

Output#1
7936246 8616662 12546078


Author:
Moscow contest, 17 November, 2002.
13 October 2003

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 180ms

SW soft NIX
ID = 54.144.21.195