Dataset Viewer
question
stringlengths 264
538
| answer
stringlengths 4
32
| metadata
dict | difficulty
int64 2
5
|
|---|---|---|---|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x3a24 - 0x24b8) + (0x1741 >> 0x3))
|
0x1854
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x3a24 - 0x24b8) + (0x1741 >> 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 0
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xacf1 * 0xb3cc) - (0x9a4b << 0x0))
|
0x7975b8c1
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xacf1 * 0xb3cc) - (0x9a4b << 0x0))",
"source_dataset": "bitwise_arithmetic",
"source_index": 1
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x2e39 + 0x622b) >> 0x0)
|
0x9064
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x2e39 + 0x622b) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 2
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x57b7 * 0x687) << 0x0)
|
0x23c8b81
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x57b7 * 0x687) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 3
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xdd1a >> 0x1) << 0x0)
|
0x6e8d
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xdd1a >> 0x1) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 4
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x58ed >> 0x3) << 0x0)
|
0xb1d
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x58ed >> 0x3) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 5
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4e60 >> 0x1) - (0x2b67 << 0x0))
|
-0x437
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4e60 >> 0x1) - (0x2b67 << 0x0))",
"source_dataset": "bitwise_arithmetic",
"source_index": 6
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xc18a * 0x8eea) << 0x2)
|
0x1b02dd090
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xc18a * 0x8eea) << 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 7
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb24a - 0x7a21) * (0x16ce * 0x8ada))
|
0x2b6a540c04c
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb24a - 0x7a21) * (0x16ce * 0x8ada))",
"source_dataset": "bitwise_arithmetic",
"source_index": 8
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd33b - 0xff5d) >> 0x3)
|
-0x585
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xd33b - 0xff5d) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 9
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7cde >> 0x2) + (0x29bd - 0xfc7e))
|
-0xb38a
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7cde >> 0x2) + (0x29bd - 0xfc7e))",
"source_dataset": "bitwise_arithmetic",
"source_index": 10
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xf0de << 0x2) - (0xdcb2 + 0xeed8))
|
0x1f7ee
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xf0de << 0x2) - (0xdcb2 + 0xeed8))",
"source_dataset": "bitwise_arithmetic",
"source_index": 11
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7ca7 * 0xe4cc) - (0x3910 << 0x2))
|
0x6f672cd4
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7ca7 * 0xe4cc) - (0x3910 << 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 12
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd85b * 0x1564) - (0x17a8 * 0x5b04))
|
0x9aae3ec
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xd85b * 0x1564) - (0x17a8 * 0x5b04))",
"source_dataset": "bitwise_arithmetic",
"source_index": 13
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4e17 >> 0x3) >> 0x0)
|
0x9c2
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4e17 >> 0x3) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 14
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x849d - 0x533b) >> 0x3)
|
0x62c
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x849d - 0x533b) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 15
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb8c - 0x3241) - (0xf281 * 0x4ab5))
|
-0x46c4e5ea
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb8c - 0x3241) - (0xf281 * 0x4ab5))",
"source_dataset": "bitwise_arithmetic",
"source_index": 16
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb7e1 * 0x6f4) << 0x3)
|
0x27f443a0
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb7e1 * 0x6f4) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 17
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xcfd2 - 0x7cc7) >> 0x0)
|
0x530b
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xcfd2 - 0x7cc7) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 18
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4c17 * 0x532a) >> 0x2)
|
0x62dfc31
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4c17 * 0x532a) >> 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 19
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xe577 - 0x77f9) - (0x2ccc * 0x830f))
|
-0x16ee9676
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xe577 - 0x77f9) - (0x2ccc * 0x830f))",
"source_dataset": "bitwise_arithmetic",
"source_index": 20
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7cfb * 0xa9e9) * (0x144f + 0xa9cf))
|
0x3d9a6836e17a
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7cfb * 0xa9e9) * (0x144f + 0xa9cf))",
"source_dataset": "bitwise_arithmetic",
"source_index": 21
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x3519 + 0xfdd4) >> 0x1)
|
0x9976
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x3519 + 0xfdd4) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 22
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x729a - 0x765d) * (0xee43 >> 0x3))
|
-0x700758
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x729a - 0x765d) * (0xee43 >> 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 23
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4c46 << 0x0) << 0x0)
|
0x4c46
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4c46 << 0x0) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 24
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4550 << 0x3) << 0x1)
|
0x45500
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4550 << 0x3) << 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 25
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x3f4d >> 0x3) >> 0x2)
|
0x1fa
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x3f4d >> 0x3) >> 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 26
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x9be9 + 0x5938) + (0x6b1e >> 0x3))
|
0x10284
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x9be9 + 0x5938) + (0x6b1e >> 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 27
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x23e8 << 0x0) * (0x386e >> 0x3))
|
0xfd2ac8
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x23e8 << 0x0) * (0x386e >> 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 28
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xfc9c * 0x28a0) >> 0x1)
|
0x140b20c0
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xfc9c * 0x28a0) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 29
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x590f - 0xb3ec) >> 0x1)
|
-0x2d6f
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x590f - 0xb3ec) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 30
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7701 - 0x4d33) >> 0x3)
|
0x539
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7701 - 0x4d33) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 31
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x1fe0 * 0xcdcc) >> 0x3)
|
0x333f8d0
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x1fe0 * 0xcdcc) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 32
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xad67 >> 0x3) << 0x2)
|
0x56b0
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xad67 >> 0x3) << 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 33
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xe82 * 0x6c09) << 0x3)
|
0x30fad490
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xe82 * 0x6c09) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 34
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd393 - 0xf18d) * (0xf4fa << 0x1))
|
-0x395f1c48
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xd393 - 0xf18d) * (0xf4fa << 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 35
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xbf4f * 0x6e6f) + (0xe39c - 0xa7c5))
|
0x52872118
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xbf4f * 0x6e6f) + (0xe39c - 0xa7c5))",
"source_dataset": "bitwise_arithmetic",
"source_index": 36
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x3ff2 - 0xba45) * (0x11ef - 0x5ad5))
|
0x22d53e92
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x3ff2 - 0xba45) * (0x11ef - 0x5ad5))",
"source_dataset": "bitwise_arithmetic",
"source_index": 37
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x5f7b << 0x3) >> 0x1)
|
0x17dec
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x5f7b << 0x3) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 38
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x635c >> 0x0) << 0x2)
|
0x18d70
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x635c >> 0x0) << 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 39
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xf906 * 0xd416) << 0x1)
|
0x19c9cbd08
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xf906 * 0xd416) << 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 40
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x9ce << 0x1) << 0x0)
|
0x139c
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x9ce << 0x1) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 41
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xff52 >> 0x2) + (0x80ac << 0x2))
|
0x24284
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xff52 >> 0x2) + (0x80ac << 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 42
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xe8b9 * 0xf30e) >> 0x1)
|
0x6e7a2a8f
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xe8b9 * 0xf30e) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 43
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xbf3f * 0x413) + (0xbe8c >> 0x2))
|
0x30b5d50
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xbf3f * 0x413) + (0xbe8c >> 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 44
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x1b28 >> 0x2) - (0xe27d * 0xb6bb))
|
-0xa1aa4885
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x1b28 >> 0x2) - (0xe27d * 0xb6bb))",
"source_dataset": "bitwise_arithmetic",
"source_index": 45
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xa123 - 0x4b0) - (0xdb3c + 0x5864))
|
-0x972d
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xa123 - 0x4b0) - (0xdb3c + 0x5864))",
"source_dataset": "bitwise_arithmetic",
"source_index": 46
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x24fd * 0x5922) >> 0x2)
|
0x33837a6
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x24fd * 0x5922) >> 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 47
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x970c >> 0x2) + (0xe46c >> 0x2))
|
0x5ede
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x970c >> 0x2) + (0xe46c >> 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 48
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x67f9 - 0xf3ff) - (0x7827 << 0x2))
|
-0x26ca2
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x67f9 - 0xf3ff) - (0x7827 << 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 49
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4514 >> 0x0) >> 0x2)
|
0x1145
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4514 >> 0x0) >> 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 50
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xe315 * 0x1e15) << 0x0)
|
0x1aaf16b9
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xe315 * 0x1e15) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 51
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x6f42 * 0xda47) + (0x5ff3 << 0x2))
|
0x5ede8f1a
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x6f42 * 0xda47) + (0x5ff3 << 0x2))",
"source_dataset": "bitwise_arithmetic",
"source_index": 52
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xc99b >> 0x1) >> 0x0)
|
0x64cd
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xc99b >> 0x1) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 53
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd25b + 0x5842) << 0x2)
|
0x4aa74
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xd25b + 0x5842) << 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 54
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x9408 + 0x6a2) * (0x53d + 0xe463))
|
0x8d256440
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x9408 + 0x6a2) * (0x53d + 0xe463))",
"source_dataset": "bitwise_arithmetic",
"source_index": 55
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xf9d2 + 0x7a2c) + (0x118d >> 0x3))
|
0x1762f
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xf9d2 + 0x7a2c) + (0x118d >> 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 56
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x4099 - 0x231c) - (0xbba1 * 0x6310))
|
-0x489adf93
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x4099 - 0x231c) - (0xbba1 * 0x6310))",
"source_dataset": "bitwise_arithmetic",
"source_index": 57
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb59c - 0x659d) << 0x0)
|
0x4fff
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb59c - 0x659d) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 58
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xed89 >> 0x3) - (0x37ea >> 0x1))
|
0x1bc
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xed89 >> 0x3) - (0x37ea >> 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 59
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb766 >> 0x1) >> 0x1)
|
0x2dd9
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb766 >> 0x1) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 60
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xb167 - 0x14fa) << 0x3)
|
0x4e368
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xb167 - 0x14fa) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 61
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x651a - 0x55a4) - 0x2107)
|
-0x1191
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x651a - 0x55a4) - 0x2107)",
"source_dataset": "bitwise_arithmetic",
"source_index": 62
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xf49b + 0x182) * (0x56ae >> 0x1))
|
0x29aa82db
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xf49b + 0x182) * (0x56ae >> 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 63
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xd32d >> 0x0) << 0x1)
|
0x1a65a
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xd32d >> 0x0) << 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 64
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7c86 << 0x2) >> 0x2)
|
0x7c86
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7c86 << 0x2) >> 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 65
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xbb70 << 0x3) + (0x4da8 + 0x37fe))
|
0x66126
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0xbb70 << 0x3) + (0x4da8 + 0x37fe))",
"source_dataset": "bitwise_arithmetic",
"source_index": 66
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x1afb + 0x3b47) << 0x0)
|
0x5642
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x1afb + 0x3b47) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 67
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x406d >> 0x3) << 0x2)
|
0x2034
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x406d >> 0x3) << 0x2)",
"source_dataset": "bitwise_arithmetic",
"source_index": 68
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7f71 * 0x32b7) - (0xd0c9 >> 0x1))
|
0x193ec363
|
{
"difficulty": {
"difficulty": 2
},
"problem": "((0x7f71 * 0x32b7) - (0xd0c9 >> 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 69
}
| 2
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xae3c + 0xbe9c) - (0x982a + 0x6d03)) + ((0x9b1d >> 0x1) + (0x6c65 >> 0x3)))
|
0xc2c5
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xae3c + 0xbe9c) - (0x982a + 0x6d03)) + ((0x9b1d >> 0x1) + (0x6c65 >> 0x3)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 0
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x7504 + 0x9a4b) * (0x849a + 0x6fb1)) - ((0xe3f2 >> 0x3) >> 0x0))
|
0x102e6aba7
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x7504 + 0x9a4b) * (0x849a + 0x6fb1)) - ((0xe3f2 >> 0x3) >> 0x0))",
"source_dataset": "bitwise_arithmetic",
"source_index": 1
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x4b21 - 0x872) + (0x341 >> 0x1)) >> 0x1)
|
0x2227
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x4b21 - 0x872) + (0x341 >> 0x1)) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 2
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x7cf8 + 0x3d3) * (0xf5d2 + 0x50a0)) << 0x3)
|
0x521dee330
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x7cf8 + 0x3d3) * (0xf5d2 + 0x50a0)) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 3
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xa370 - 0x8506) >> 0x0) << 0x0)
|
0x1e6a
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xa370 - 0x8506) >> 0x0) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 4
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x63f5 >> 0x0) >> 0x0) << 0x3)
|
0x31fa8
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x63f5 >> 0x0) >> 0x0) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 5
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x3255 >> 0x3) >> 0x1) - ((0x28a8 >> 0x1) >> 0x1))
|
-0x705
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x3255 >> 0x3) >> 0x1) - ((0x28a8 >> 0x1) >> 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 6
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xcfc8 >> 0x0) * (0x2883 * 0x756f)) << 0x3)
|
0x78aad130d940
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xcfc8 >> 0x0) * (0x2883 * 0x756f)) << 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 7
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x16ce * 0x8ada) - (0x16d2 >> 0x1)) * ((0x39ee * 0x3160) + (0xfdf5 * 0x9b91)))
|
0x7ff0429481e7e0f
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x16ce * 0x8ada) - (0x16d2 >> 0x1)) * ((0x39ee * 0x3160) + (0xfdf5 * 0x9b91)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 8
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xd625 - 0x8e65) - (0x8d5c << 0x3)) >> 0x0)
|
-0x42320
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xd625 - 0x8e65) - (0x8d5c << 0x3)) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 9
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x6927 * 0x9b7) >> 0x3) + ((0x9c0 + 0x8c4c) * (0x3dbc + 0x12c2)))
|
0x2fad4b24
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x6927 * 0x9b7) >> 0x3) + ((0x9c0 + 0x8c4c) * (0x3dbc + 0x12c2)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 10
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x5d57 >> 0x3) << 0x2) - ((0x2c53 + 0xd00) * (0x33bd << 0x1)))
|
-0x172b87e6
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x5d57 >> 0x3) << 0x2) - ((0x2c53 + 0xd00) * (0x33bd << 0x1)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 11
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x6261 << 0x3) * (0xe155 << 0x1)) - ((0x74ed >> 0x0) + (0x4c13 >> 0x3)))
|
0x5697e34e1
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x6261 << 0x3) * (0xe155 << 0x1)) - ((0x74ed >> 0x0) + (0x4c13 >> 0x3)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 12
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x4e4b - 0x17a8) * (0x8b63 << 0x3)) - ((0xfe50 << 0x0) * (0xf5f9 + 0x3c09)))
|
-0x42008c58
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x4e4b - 0x17a8) * (0x8b63 << 0x3)) - ((0xfe50 << 0x0) * (0xf5f9 + 0x3c09)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 13
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xfe15 >> 0x3) >> 0x0) >> 0x1)
|
0xfe1
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xfe15 >> 0x3) >> 0x0) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 14
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x4b4d << 0x3) - (0x609 << 0x1)) >> 0x3)
|
0x49ca
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x4b4d << 0x3) - (0x609 << 0x1)) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 15
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x68c8 << 0x2) - (0xf87b * 0x7437)) - ((0x1bc7 >> 0x3) << 0x3))
|
-0x70cb970d
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x68c8 << 0x2) - (0xf87b * 0x7437)) - ((0x1bc7 >> 0x3) << 0x3))",
"source_dataset": "bitwise_arithmetic",
"source_index": 16
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x3b5 >> 0x3) * (0x4d31 >> 0x1)) << 0x0)
|
0x11ca10
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x3b5 >> 0x3) * (0x4d31 >> 0x1)) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 17
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xe3a0 << 0x0) - (0xab72 + 0xdc8e)) >> 0x0)
|
-0xa460
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xe3a0 << 0x0) - (0xab72 + 0xdc8e)) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 18
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x7d75 + 0x5c80) * (0x7719 << 0x1)) >> 0x3)
|
0x19598afb
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x7d75 + 0x5c80) * (0x7719 << 0x1)) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 19
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xe6d3 * 0xacbc) - (0x30e4 >> 0x0)) - ((0x79f9 + 0x7999) - (0xf4a0 * 0x9810)))
|
0x12d0c6c7e
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xe6d3 * 0xacbc) - (0x30e4 >> 0x0)) - ((0x79f9 + 0x7999) - (0xf4a0 * 0x9810)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 20
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x63ff + 0xc0fd) * (0x4b70 - 0x13ec)) * ((0x1060 >> 0x1) * (0x9a5f * 0xad7b)))
|
0xd492a28e4d96b83100
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x63ff + 0xc0fd) * (0x4b70 - 0x13ec)) * ((0x1060 >> 0x1) * (0x9a5f * 0xad7b)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 21
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xb540 * 0xeaa6) + (0xb3db - 0xd2c5)) >> 0x1)
|
0x5310f44b
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xb540 * 0xeaa6) + (0xb3db - 0xd2c5)) >> 0x1)",
"source_dataset": "bitwise_arithmetic",
"source_index": 22
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x726e >> 0x2) - (0xe768 << 0x0)) * ((0xa095 << 0x0) << 0x1))
|
-0xfe6c52a2
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x726e >> 0x2) - (0xe768 << 0x0)) * ((0xa095 << 0x0) << 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 23
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x195e >> 0x3) << 0x2) << 0x0)
|
0xcac
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x195e >> 0x3) << 0x2) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 24
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x6ef1 >> 0x2) << 0x1) << 0x0)
|
0x3778
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x6ef1 >> 0x2) << 0x1) << 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 25
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x44f7 << 0x2) >> 0x0) >> 0x0)
|
0x113dc
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x44f7 << 0x2) >> 0x0) >> 0x0)",
"source_dataset": "bitwise_arithmetic",
"source_index": 26
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xec7d * 0xeb24) + (0x6b1e >> 0x3)) + ((0xd006 >> 0x1) >> 0x1))
|
0xd93841f8
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0xec7d * 0xeb24) + (0x6b1e >> 0x3)) + ((0xd006 >> 0x1) >> 0x1))",
"source_dataset": "bitwise_arithmetic",
"source_index": 27
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x2896 + 0xd2df) << 0x3) * ((0x6159 * 0xc8e3) + (0x18f7 + 0x91d)))
|
0x258478e298458
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x2896 + 0xd2df) << 0x3) * ((0x6159 * 0xc8e3) + (0x18f7 + 0x91d)))",
"source_dataset": "bitwise_arithmetic",
"source_index": 28
}
| 3
|
Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0x446a - 0x1734) * (0x992e + 0x329d)) >> 0x3)
|
0x47fb57a
|
{
"difficulty": {
"difficulty": 3
},
"problem": "(((0x446a - 0x1734) * (0x992e + 0x329d)) >> 0x3)",
"source_dataset": "bitwise_arithmetic",
"source_index": 29
}
| 3
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 30