id stringlengths 26 66 | program stringlengths 37 1.08k | src-filename stringlengths 10 28 | semantics-type stringclasses 1
value | syntax stringclasses 1
value | semantics stringclasses 2
values | language stringclasses 1
value | mutated-program stringlengths 37 1.08k | mutated bool 1
class | mutation-pattern stringclasses 2
values | K-evaluatable bool 1
class | ground-truth stringlengths 200 1.67k | sampled-statements listlengths 3 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
srp-mk-K-unseen-pow_x_n.imp | int ans;
int n;
int x;
x = 2;
ans = 1;
n = 10;
while(n != 0)
{
if((n % 2) != 0)
{
ans = (ans * x);
}
else
{
};
x = (x * x);
n = (n / 2);
}; | pow_x_n.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int ans;
int n;
int x;
x 𐕂 2;
ans 𐕂 1;
n 𐕂 10;
𐕕(n 𐕀 0)
{
𐔸((n 𐕖 2) 𐕀 0)
{
ans 𐕂 (ans 𐕊 x);
}
𐕎
{
};
x 𐕂 (x 𐕊 x);
n 𐕂 (n 𐕏 2);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>17</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>8</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-power_of_three.imp | int n;
int ans;
n = 27;
if((n > 0) && ((1162261467 % n) == 0))
{
ans = 1;
}
else
{
}; | power_of_three.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int ans;
n 𐕂 27;
𐔸((n 𐕃 0) 𐕜 ((1162261467 𐕖 n) 𐕟 0))
{
ans 𐕂 1;
}
𐕎
{
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>14</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>19</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
</ans> | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-preimage_size.imp | int a;
int b;
int ans;
int c;
int d;
int e;
int f;
b = 0;
c = 200;
while(c >= d)
{
e = ((c + d) / 2);
f = 5;
a = 0;
while(f <= e)
{
a = (a + (e / f));
f = (f * 5);
};
if(a == b)
{
ans = 5;
halt;
}
else
{
};
if(a < b)
{
d = ... | preimage_size.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int a;
int b;
int ans;
int c;
int d;
int e;
int f;
b 𐕂 0;
c 𐕂 200;
𐕕(c 𐕛 d)
{
e 𐕂 ((c 𐕐 d) 𐕏 2);
f 𐕂 5;
a 𐕂 0;
𐕕(f 𐔷 e)
{
a 𐕂 (a 𐕐 (e 𐕏 f));
f 𐕂 (f 𐕊 5);
};
𐔸(a 𐕟 b)
{
ans 𐕂 5;
𐔱;
}
𐕎
{
};
𐔸(a 𐔳 b)
{
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>6</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>1</rule>
<rule>6</rule>
<rule>3</rule>
<rule>21</rule>
</a... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": 0,
"b": 0,
"c": 0,
"d": 0,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
"B": ... | |
srp-mk-K-unseen-program_0.imp | int n;
int d;
int ans;
int a;
n = 28;
d = 9;
ans = 1;
a = 1;
while(n > (d * a))
{
n = (n - (d * a));
a = (a + 1);
ans = (ans * 10);
d = (d * 10);
};
ans = (ans + ((n - 1) / a)); | program_0.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int d;
int ans;
int a;
n 𐕂 28;
d 𐕂 9;
ans 𐕂 1;
a 𐕂 1;
𐕕(n 𐕃 (d 𐕊 a))
{
n 𐕂 (n 𐕙 (d 𐕊 a));
a 𐕂 (a 𐕐 1);
ans 𐕂 (ans 𐕊 10);
d 𐕂 (d 𐕊 10);
};
ans 𐕂 (ans 𐕐 ((n 𐕙 1) 𐕏 a)); | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answe... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": 0,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-program_1.imp | int ans;
int s;
ans = 23;
s = 0;
while(ans > 9)
{
while(ans != 0)
{
s = (s + (ans % 10));
ans = (ans / 10);
};
ans = s;
s = 0;
}; | program_1.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int ans;
int s;
ans 𐕂 23;
s 𐕂 0;
𐕕(ans 𐕃 9)
{
𐕕(ans 𐕀 0)
{
s 𐕂 (s 𐕐 (ans 𐕖 10));
ans 𐕂 (ans 𐕏 10);
};
ans 𐕂 s;
s 𐕂 0;
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-program_2.imp | int a;
int b;
int ans;
a = 15;
b = 4;
ans = a;
while(a >= b)
{
ans = (ans + (a / b));
a = ((a / b) + (a % b));
}; | program_2.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int a;
int b;
int ans;
a 𐕂 15;
b 𐕂 4;
ans 𐕂 a;
𐕕(a 𐕛 b)
{
ans 𐕂 (ans 𐕐 (a 𐕏 b));
a 𐕂 ((a 𐕏 b) 𐕐 (a 𐕖 b));
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>15</rule>
<rule>22</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": 0,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-program_3.imp | int ans;
int c;
int a;
int b;
ans = 0;
c = 5;
a = 2;
while((a * a) <= c)
{
if((c % a) == 0)
{
b = 0;
while((c % a) == 0)
{
b = (b + 1);
c = (c / a);
};
if(((a % 4) == 3) && ((b % 2) != 0))
{
ans = 0;
halt;
}
... | program_3.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int ans;
int c;
int a;
int b;
ans 𐕂 0;
c 𐕂 5;
a 𐕂 2;
𐕕((a 𐕊 a) 𐔷 c)
{
𐔸((c 𐕖 a) 𐕟 0)
{
b 𐕂 0;
𐕕((c 𐕖 a) 𐕟 0)
{
b 𐕂 (b 𐕐 1);
c 𐕂 (c 𐕏 a);
};
𐔸(((a 𐕖 4) 𐕟 3) 𐕜 ((b 𐕖 2) 𐕀 0))
{
ans 𐕂 0;
𐔱;
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>1</rule>
<rule>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answe... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-program_4.imp | int n;
int k;
int ans;
n = 12;
k = 3;
ans = 1;
while((ans * ans) <= n)
{
if((n % ans) == 0)
{
k = (k - 1);
if(k == 0)
{
halt;
}
else
{
};
}
else
{
};
ans = (ans + 1);
};
ans = (ans - 1);
while(ans >= 1)
{
if((ans * ans... | program_4.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int k;
int ans;
n 𐕂 12;
k 𐕂 3;
ans 𐕂 1;
𐕕((ans 𐕊 ans) 𐔷 n)
{
𐔸((n 𐕖 ans) 𐕟 0)
{
k 𐕂 (k 𐕙 1);
𐔸(k 𐕟 0)
{
𐔱;
}
𐕎
{
};
}
𐕎
{
};
ans 𐕂 (ans 𐕐 1);
};
ans 𐕂 (ans 𐕙 1);
𐕕(ans 𐕛 1)
{
𐔸((ans 𐕊 ans... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>1</rule>
<rule>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answe... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-program_5.imp | int n;
int a;
int b;
int ans;
int i;
n = 14;
a = 2;
b = 1;
ans = 0;
i = (4 / 2);
if(n <= 0)
{
halt;
}
else
{
};
if(n == 1)
{
ans = 1;
halt;
}
else
{
};
if(n == 2)
{
ans = 2;
halt;
}
else
{
};
while(i < n)
{
ans = (a + b);
b = a;
a = ans;
i = (i + 1);
}; | program_5.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int a;
int b;
int ans;
int i;
n 𐕂 14;
a 𐕂 2;
b 𐕂 1;
ans 𐕂 0;
i 𐕂 (4 𐕏 2);
𐔸(n 𐔷 0)
{
𐔱;
}
𐕎
{
};
𐔸(n 𐕟 1)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
𐔸(n 𐕟 2)
{
ans 𐕂 2;
𐔱;
}
𐕎
{
};
𐕕(i 𐔳 n)
{
ans 𐕂 (a 𐕐 b);
b 𐕂 a;
a 𐕂 ans;
i 𐕂 (i 𐕐 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>6</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>13</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="4">
<rule>1</rule>... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-program_6.imp | int a;
int b;
int s;
int p;
int ans;
a = 3;
b = 2;
s = 0;
p = 1;
ans = 0;
while((a > 0) && (a < 6))
{
b = 2;
while((b > 0) && (b < 5))
{
s = (s + b);
p = (p * a);
b = (b + 1);
};
ans = (ans + (s * p));
a = (a - 3);
}; | program_6.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int a;
int b;
int s;
int p;
int ans;
a 𐕂 3;
b 𐕂 2;
s 𐕂 0;
p 𐕂 1;
ans 𐕂 0;
𐕕((a 𐕃 0) 𐕜 (a 𐔳 6))
{
b 𐕂 2;
𐕕((b 𐕃 0) 𐕜 (b 𐔳 5))
{
s 𐕂 (s 𐕐 b);
p 𐕂 (p 𐕊 a);
b 𐕂 (b 𐕐 1);
};
ans 𐕂 (ans 𐕐 (s 𐕊 p));
a 𐕂 (a 𐕙 3);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>14</rule>
<rule>1</rule>
<rule>12</rule>
<rule>19</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<ans... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": 0,
"b": 0,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": 0,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-program_7.imp | int n;
int ans;
n = (50 * 2);
ans = 0;
while(!(n <= 0))
{
ans = (ans + n);
n = (n + (- 1));
}; | program_7.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int ans;
n 𐕂 (50 𐕊 2);
ans 𐕂 0;
𐕕(𐔰(n 𐔷 0))
{
ans 𐕂 (ans 𐕐 n);
n 𐕂 (n 𐕐 (𐕙 1));
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>5</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>13</rule>
<rule>18</rule>
<rule>22</rule>
<rul... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-program_8.imp | int i;
int m;
int n;
int q;
int r;
int ans;
int t;
int x;
int y;
int z;
m = 10;
n = 2;
ans = 0;
while(n <= m)
{
i = 2;
q = (n / i);
t = 1;
while((i <= q) && (1 <= t))
{
x = i;
y = q;
z = 0;
while(!(x <= 0))
{
q = (x / 2);
r = ((q + q) +... | program_8.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int i;
int m;
int n;
int q;
int r;
int ans;
int t;
int x;
int y;
int z;
m 𐕂 10;
n 𐕂 2;
ans 𐕂 0;
𐕕(n 𐔷 m)
{
i 𐕂 2;
q 𐕂 (n 𐕏 i);
t 𐕂 1;
𐕕((i 𐔷 q) 𐕜 (1 𐔷 t))
{
x 𐕂 i;
y 𐕂 q;
z 𐕂 0;
𐕕(𐔰(x 𐔷 0))
{
q 𐕂 (x 𐕏 2);
r 𐕂 ((q �... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>21</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>13</rule>
<rule>18</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>13</rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": 0,
"j": null,
"k": null,
"m": 0,
"p": null,
"q": 0,
"r": 0,
"X": null,
"B": ... | |
srp-mk-K-unseen-program_9.imp | int m;
int n;
int q;
int r;
int ans;
ans = 0;
m = 10;
while(!(m <= 2))
{
n = m;
m = (m + (- 1));
while(!(n <= 1))
{
ans = (ans + 1);
q = (n / 2);
r = ((q + q) + 1);
if(r <= n)
{
n = (((n + n) + n) + 1);
}
else
{
n = ... | program_9.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int m;
int n;
int q;
int r;
int ans;
ans 𐕂 0;
m 𐕂 10;
𐕕(𐔰(m 𐔷 2))
{
n 𐕂 m;
m 𐕂 (m 𐕐 (𐕙 1));
𐕕(𐔰(n 𐔷 1))
{
ans 𐕂 (ans 𐕐 1);
q 𐕂 (n 𐕏 2);
r 𐕂 ((q 𐕐 q) 𐕐 1);
𐔸(r 𐔷 n)
{
n 𐕂 (((n 𐕐 n) 𐕐 n) 𐕐 1);
}
𐕎
{
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>21</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>3</... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": 0,
"p": null,
"q": 0,
"r": 0,
"X": null,
"B... | |
srp-mk-K-unseen-rect_area.imp | int ax1;
int ay1;
int ax2;
int ay2;
int bx1;
int by1;
int bx2;
int by2;
int left;
int right;
int ow;
int oh;
int ans;
int a;
int b;
ax1 = (- 2);
ay1 = (- 2);
ax2 = 2;
ay2 = 2;
bx1 = (- 2);
by1 = (- 2);
bx2 = 2;
by2 = 2;
a = ((ax2 - ax1) * (ay2 - ay1));
b = ((bx2 - bx1) * (by2 - by1));
if(ax1 > bx1)
{
left = ax1;
}
... | rect_area.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int ax1;
int ay1;
int ax2;
int ay2;
int bx1;
int by1;
int bx2;
int by2;
int left;
int right;
int ow;
int oh;
int ans;
int a;
int b;
ax1 𐕂 (𐕙 2);
ay1 𐕂 (𐕙 2);
ax2 𐕂 2;
ay2 𐕂 2;
bx1 𐕂 (𐕙 2);
by1 𐕂 (𐕙 2);
bx2 𐕂 2;
by2 𐕂 2;
a 𐕂 ((ax2 𐕙 ax1) 𐕊 (ay2 𐕙 ay1));
b 𐕂 ((bx2 𐕙 bx1) 𐕊 (by2 𐕙 by1));
𐔸(ax1 𐕃 bx1)... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>11</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>4</rule>
<rule>1</rule>
<rule>1</rule>
<rule>4</rule>
<rule>5<... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-rectangle_overlap.imp | int r1x1;
int r1x2;
int r1y1;
int r1y2;
int r2x1;
int r2x2;
int r2y1;
int r2y2;
int ans;
r1x2 = 2;
r1y2 = 2;
r2x1 = 1;
r2y1 = 1;
r2x2 = 3;
r2y2 = 3;
if(((r1x1 < r2x2) && (r2x1 < r1x2)) && ((r1y1 < r2y2) && (r2y1 < r1y2)))
{
ans = 1;
}
else
{
ans = (- 1);
}; | rectangle_overlap.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int r1x1;
int r1x2;
int r1y1;
int r1y2;
int r2x1;
int r2x2;
int r2y1;
int r2y2;
int ans;
r1x2 𐕂 2;
r1y2 𐕂 2;
r2x1 𐕂 1;
r2y1 𐕂 1;
r2x2 𐕂 3;
r2y2 𐕂 3;
𐔸(((r1x1 𐔳 r2x2) 𐕜 (r2x1 𐔳 r1x2)) 𐕜 ((r1y1 𐔳 r2y2) 𐕜 (r2y1 𐔳 r1y2)))
{
ans 𐕂 1;
}
𐕎
{
ans 𐕂 (𐕙 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>12</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</rule>
<rule>19</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-remove_9.imp | int x;
int ans;
int y;
y = 1;
x = 10;
while(x != 0)
{
ans = (ans + ((x % 9) * y));
x = (x / 9);
y = (y * 10);
}; | remove_9.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int x;
int ans;
int y;
y 𐕂 1;
x 𐕂 10;
𐕕(x 𐕀 0)
{
ans 𐕂 (ans 𐕐 ((x 𐕖 9) 𐕊 y));
x 𐕂 (x 𐕏 9);
y 𐕂 (y 𐕊 10);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>6</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>17</rule>
<rule>22</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-small_int_div_k.imp | int k;
int ans;
int num;
int l;
k = 3;
ans = (- 1);
if(((k % 2) == 0) || ((k % 5) == 0))
{
halt;
}
else
{
};
num = 0;
l = 1;
while(l <= k)
{
num = (((num * 10) + 1) % k);
if(num == 0)
{
ans = l;
halt;
}
else
{
};
l = (l + 1);
};
ans = (- 1); | small_int_div_k.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int k;
int ans;
int num;
int l;
k 𐕂 3;
ans 𐕂 (𐕙 1);
𐔸(((k 𐕖 2) 𐕟 0) 𐔻 ((k 𐕖 5) 𐕟 0))
{
𐔱;
}
𐕎
{
};
num 𐕂 0;
l 𐕂 1;
𐕕(l 𐔷 k)
{
num 𐕂 (((num 𐕊 10) 𐕐 1) 𐕖 k);
𐔸(num 𐕟 0)
{
ans 𐕂 l;
𐔱;
}
𐕎
{
};
l 𐕂 (l 𐕐 1);
};
ans 𐕂 (𐕙 1); | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>11</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-star_pattern.imp | int n;
int i;
int j;
int ans;
n = 5;
i = 1;
j = 1;
ans = 0;
while(i <= n)
{
j = 1;
while(j <= i)
{
j = (j + 1);
ans = (i * j);
};
i = (i + 1);
}; | star_pattern.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int i;
int j;
int ans;
n 𐕂 5;
i 𐕂 1;
j 𐕂 1;
ans 𐕂 0;
𐕕(i 𐔷 n)
{
j 𐕂 1;
𐕕(j 𐔷 i)
{
j 𐕂 (j 𐕐 1);
ans 𐕂 (i 𐕊 j);
};
i 𐕂 (i 𐕐 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>23</rule>
<rule>27</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>21</rule>
... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-sum_of_squares_nums.imp | int a;
int ans;
int x;
int b;
x = 5;
a = 2;
while((a * a) <= x)
{
if((x % a) != 0)
{
a = (a + 1);
continue;
}
else
{
};
while((x % a) == 0)
{
b = (b + 1);
x = (x / a);
};
if(((a % 4) == 3) && ((b % 2) == 1))
{
halt;
}
else
... | sum_of_squares_nums.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int a;
int ans;
int x;
int b;
x 𐕂 5;
a 𐕂 2;
𐕕((a 𐕊 a) 𐔷 x)
{
𐔸((x 𐕖 a) 𐕀 0)
{
a 𐕂 (a 𐕐 1);
𐔲;
}
𐕎
{
};
𐕕((x 𐕖 a) 𐕟 0)
{
b 𐕂 (b 𐕐 1);
x 𐕂 (x 𐕏 a);
};
𐔸(((a 𐕖 4) 𐕟 3) 𐕜 ((b 𐕖 2) 𐕟 1))
{
𐔱;
}
𐕎
{
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>1</rule>
<rule>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answe... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-swap_without_extra.imp | int a;
int ans;
a = 809;
ans = 24;
a = (a + ans);
ans = (a - ans);
a = (a - ans); | swap_without_extra.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int a;
int ans;
a 𐕂 809;
ans 𐕂 24;
a 𐕂 (a 𐕐 ans);
ans 𐕂 (a 𐕙 ans);
a 𐕂 (a 𐕙 ans); | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>4</rule>
<rule>21</rule>
</answer>
... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-tribonacci_num.imp | int n;
int n1;
int n2;
int i;
int n3;
int ans;
n = 9;
n2 = 1;
n3 = 1;
i = 3;
while(i <= n)
{
ans = ((n1 + n2) + n3);
n1 = n2;
n2 = n3;
n3 = ans;
i = (i + 1);
}; | tribonacci_num.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int n1;
int n2;
int i;
int n3;
int ans;
n 𐕂 9;
n2 𐕂 1;
n3 𐕂 1;
i 𐕂 3;
𐕕(i 𐔷 n)
{
ans 𐕂 ((n1 𐕐 n2) 𐕐 n3);
n1 𐕂 n2;
n2 𐕂 n3;
n3 𐕂 ans;
i 𐕂 (i 𐕐 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>21</rule>
</answer>
... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-two_key_keyboard.imp | int n;
int ans;
int a;
n = 3;
a = 2;
while(n > 1)
{
while((n % a) == 0)
{
ans = (ans + a);
n = (n / a);
};
a = (a + 1);
}; | two_key_keyboard.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int n;
int ans;
int a;
n 𐕂 3;
a 𐕂 2;
𐕕(n 𐕃 1)
{
𐕕((n 𐕖 a) 𐕟 0)
{
ans 𐕂 (ans 𐕐 a);
n 𐕂 (n 𐕏 a);
};
a 𐕂 (a 𐕐 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>14</rule>
<rule>22</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-ugly_numbers.imp | int i;
int n;
int ans;
i = 2;
n = 14;
while((i < 6) && (n != 0))
{
while((n % i) == 0)
{
n = (n / i);
};
i = (i + 1);
};
if(n == 1)
{
ans = 1;
}
else
{
}; | ugly_numbers.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int i;
int n;
int ans;
i 𐕂 2;
n 𐕂 14;
𐕕((i 𐔳 6) 𐕜 (n 𐕀 0))
{
𐕕((n 𐕖 i) 𐕟 0)
{
n 𐕂 (n 𐕏 i);
};
i 𐕂 (i 𐕐 1);
};
𐔸(n 𐕟 1)
{
ans 𐕂 1;
}
𐕎
{
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": nu... | |
srp-mk-K-unseen-valid_perfect_square.imp | int x;
int num;
int ans;
num = 16;
x = num;
while((x * x) > num)
{
x = ((x + (num / x)) / 2);
};
if((x * x) == num)
{
ans = 1;
}
else
{
}; | valid_perfect_square.imp | K | module IMP_K_UNSEEN-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "𐕐" AExp [strict]
| "𐕙" AExp [strict]
> left:
... | IMP | int x;
int num;
int ans;
num 𐕂 16;
x 𐕂 num;
𐕕((x 𐕊 x) 𐕃 num)
{
x 𐕂 ((x 𐕐 (num 𐕏 x)) 𐕏 2);
};
𐔸((x 𐕊 x) 𐕟 num)
{
ans 𐕂 1;
}
𐕎
{
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>1</rule>
<rule>6</rule>
<rule>3</rule>
<rule>6</rule>
<rule>21<... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": 0,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.