<PREV Problem:
NEXT>
Solved by 198 users: ...
UserDateAttemptTimeCMSC
kil12 jul 2007Ruby300.02159 
bush12 mar 2013Ruby200.14163 
kil11 jul 2007Ruby100.02171 
DAV16 jul 2009Ruby100.02172 
li0n28 aug 2011Ruby300.02172 
bush12 mar 2013Ruby100.09180 
asp13 jun 2008C++200.01187 
li0n28 aug 2011C++700.01191 
Kuznetsov_S11 jan 2010C++100.02192 
tomek10 apr 2006C++300.01205 
Yagi_Arthur24 dec 2009FPC100.01206 
faintzw11 aug 2005FPC2?.??213 
asp13 jun 2008C++100.01217 
mukel27 jul 2011C++100.01219 
Languages
C++
101
FPC
52
C
20
Kylix
13
Java
9
Ruby
4
Python
1
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

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 210ms

SW soft NIX
ID = 3.209.10.183