![]() |
|
#1
|
|||
|
|||
|
Code:
bool check_key(uint64_t x) {
uint64_t r = x;
for (size_t i = 0; i < 64; ++i) {
for (size_t j = 0; j < 6; ++j) {
r ^= (((x >> (1 << j)) & (i >> j) & 1) << i);
}
}
return (x && r == 0);
}
1. How many valid input keys are there? 2. Can you make a generator to enumerate all valid keys? Z3 (or other SMT/SAT) tools are not allowed as solutions! |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| XP Startup - Must be simple because I can't solve it! | hobferret | General Discussion | 13 | 07-09-2005 07:44 |