ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 198 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
kil	`12 jul 2007`	Ruby	3	00.02	159
bush	`12 mar 2013`	Ruby	2	00.14	163
kil	`11 jul 2007`	Ruby	1	00.02	171
DAV	`16 jul 2009`	Ruby	1	00.02	172
li0n	`28 aug 2011`	Ruby	3	00.02	172
bush	`12 mar 2013`	Ruby	1	00.09	180
asp	`13 jun 2008`	C++	2	00.01	187
li0n	`28 aug 2011`	C++	7	00.01	191
Kuznetsov_S	`11 jan 2010`	C++	1	00.02	192
tomek	`10 apr 2006`	C++	3	00.01	205
Yagi_Arthur	`24 dec 2009`	FPC	1	00.01	206
faintzw	`11 aug 2005`	FPC	2	?.??	213
asp	`13 jun 2008`	C++	1	00.01	217
mukel	`27 jul 2011`	C++	1	00.01	219

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 a₁, b₁, c₁. They were calculated from a, b c:

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

Input Three integers a₁, b₁, c₁ from the interval [0, 2²⁴).

Output Three integers a, b, c which bring to a₁, b₁, c₁. 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