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-addSub_mulDiv_negateRelation-mbpp_646.imp | int i;
int ans;
int l;
int j;
int k;
int n;
n = 5;
k = 2;
i = 0;
while(i < n)
{
j = 0;
while(j < n)
{
l = 0;
while(l < n)
{
if((((i + k) <= n) && ((j + k) <= n)) && ((l + k) <= n))
{
ans = (ans + 1);
}
else
{... | mbpp_646.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int i;
int ans;
int l;
int j;
int k;
int n;
n = 5;
k = 2;
i = 0;
while(i > n)
{
j = 0;
while(j > n)
{
l = 0;
while(l > n)
{
if((((i - k) >= n) || ((j - k) >= n)) || ((l - k) >= n))
{
ans = (ans - 1);
}
else
{... | true | KeywordSwap | 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>13</rule>
<rule>1</rule>
<rule>1</rule>
<rule>3</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": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-mbpp_663.imp | int ans;
int i;
int n;
int x;
int y;
i = 1;
n = 187;
x = 10;
y = 5;
while(i <= n)
{
if((i % x) == y)
{
ans = i;
}
else
{
};
i = (i + 1);
}; | mbpp_663.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
int x;
int y;
i = 1;
n = 187;
x = 10;
y = 5;
while(i >= n)
{
if((i % x) != y)
{
ans = i;
}
else
{
};
i = (i - 1);
}; | true | KeywordSwap | 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>8</rule>
<rule>1</rule>
<rule>16</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_672.imp | int a;
int b;
int c;
int p;
int q;
int ans;
a = 55;
b = 47;
c = 39;
if(a > b)
{
p = a;
q = b;
}
else
{
p = b;
q = a;
};
if(p > c)
{
ans = p;
halt;
}
else
{
};
if(q > c)
{
ans = q;
halt;
}
else
{
}; | mbpp_672.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int b;
int c;
int p;
int q;
int ans;
a = 55;
b = 47;
c = 39;
if(a < b)
{
p = a;
q = b;
}
else
{
p = b;
q = a;
};
if(p < c)
{
ans = p;
halt;
}
else
{
};
if(q < c)
{
ans = q;
halt;
}
else
{
}; | true | KeywordSwap | 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>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="4">... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": 0,
"b": 0,
"c": 0,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": 0,
"q": null,
"r": null,
"X": null,
"B... | |
srp-mk-K-addSub_mulDiv_negateRelation-mbpp_675.imp | int ans;
int x;
int y;
int m;
int n;
x = 15;
y = 17;
m = 1;
n = 10;
ans = (x + y);
if((ans >= m) && (ans <= n))
{
ans = 20;
}
else
{
ans = 32;
}; | mbpp_675.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int x;
int y;
int m;
int n;
x = 15;
y = 17;
m = 1;
n = 10;
ans = (x - y);
if((ans <= m) || (ans >= n))
{
ans = 20;
}
else
{
ans = 32;
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>15</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>19</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": null,
"r": null,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-mbpp_681.imp | int ans;
int i;
int n;
n = 25;
ans = 2;
while(ans < n)
{
if((n % ans) == 0)
{
break;
}
else
{
};
ans = (ans + 1);
}; | mbpp_681.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
n = 25;
ans = 2;
while(ans > n)
{
if((n % ans) != 0)
{
break;
}
else
{
};
ans = (ans - 1);
}; | true | KeywordSwap | 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>12</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<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-addSub_mulDiv_negateRelation-mbpp_692.imp | int a;
int n;
int ans;
a = 1;
n = 7;
while(n > 0)
{
a = (a * n);
n = (n - 1);
};
ans = (a % 100); | mbpp_692.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int n;
int ans;
a = 1;
n = 7;
while(n < 0)
{
a = (a / n);
n = (n + 1);
};
ans = (a % 100); | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>4</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-addSub_mulDiv_negateRelation-mbpp_714.imp | int ans;
int i;
int n;
n = 24;
i = 2;
while((i * i) <= n)
{
if((n % i) == 0)
{
ans = (ans + 1);
}
else
{
};
i = (i + 1);
}; | mbpp_714.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
n = 24;
i = 2;
while((i / i) >= n)
{
if((n % i) != 0)
{
ans = (ans - 1);
}
else
{
};
i = (i - 1);
}; | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-mbpp_72.imp | int ans;
int n;
n = 10;
if((n % 4) != 2)
{
ans = 1;
halt;
}
else
{
};
ans = 0; | mbpp_72.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n;
n = 10;
if((n % 4) == 2)
{
ans = 1;
halt;
}
else
{
};
ans = 0; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>8</rule>
<rule>17</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>21</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-addSub_mulDiv_negateRelation-mbpp_76.imp | int ans;
int n;
int m;
int temp;
m = 4;
n = 3;
if(n < m)
{
temp = m;
m = n;
n = temp;
}
else
{
};
ans = ((((m * (m + 1)) * ((2 * m) + 1)) / 6) + ((((n - m) * m) * (m + 1)) / 2)); | mbpp_76.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n;
int m;
int temp;
m = 4;
n = 3;
if(n > m)
{
temp = m;
m = n;
n = temp;
}
else
{
};
ans = ((((m / (m - 1)) / ((2 / m) - 1)) * 6) - ((((n + m) / m) / (m - 1)) * 2)); | true | KeywordSwap | 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>12</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="4">... | [
{
"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": null,
"r": null,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-mbpp_770.imp | int ans;
int i;
int n;
int j;
n = 3;
i = 1;
while(i <= n)
{
j = ((2 * i) - 1);
ans = (ans + (((j * j) * j) * j));
i = (i + 1);
}; | mbpp_770.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
int j;
n = 3;
i = 1;
while(i >= n)
{
j = ((2 / i) + 1);
ans = (ans - (((j / j) / j) / j));
i = (i - 1);
}; | true | KeywordSwap | 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>1</rule>
<rule>13</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-addSub_mulDiv_negateRelation-mbpp_78.imp | int a;
int b;
int ans;
int c;
c = 15;
a = 0;
b = 0;
while(b < c)
{
if((b % 2) == 0)
{
a = (a + 1);
}
else
{
};
b = (b + 1);
};
ans = a; | mbpp_78.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int b;
int ans;
int c;
c = 15;
a = 0;
b = 0;
while(b > c)
{
if((b % 2) != 0)
{
a = (a - 1);
}
else
{
};
b = (b - 1);
};
ans = a; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>3</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-addSub_mulDiv_negateRelation-mbpp_837.imp | int ans;
int i;
int n;
n = 4;
while(i < n)
{
ans = (ans + ((((2 * i) + 1) * ((2 * i) + 1)) * ((2 * i) + 1)));
i = (i + 1);
}; | mbpp_837.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
n = 4;
while(i > n)
{
ans = (ans - ((((2 / i) - 1) / ((2 / i) - 1)) / ((2 / i) - 1)));
i = (i - 1);
}; | true | KeywordSwap | 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>5</rule>
<rule>3</rule>
<rule>1</rule>
<rule>5</rule>
<rule>3</rule>
<rule>5</rule>
<rule>1</rule>
<rule>5</rule>
<r... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_844.imp | int n;
int k;
int m;
int i;
int j;
int ans;
int p;
int q;
n = 8;
k = 5;
m = (n % k);
i = (n / k);
j = ((i + 1) / k);
p = 1;
q = 2;
while((p < m) && (q < k))
{
if(((p * j) % 2) == 0)
{
ans = 2;
halt;
}
else
{
};
p = (p + 2);
q = (q + 2);
};
p = 1;
q = ((i - 1) / k);
while... | mbpp_844.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int k;
int m;
int i;
int j;
int ans;
int p;
int q;
n = 8;
k = 5;
m = (n % k);
i = (n * k);
j = ((i - 1) * k);
p = 1;
q = 2;
while((p > m) || (q > k))
{
if(((p / j) % 2) != 0)
{
ans = 2;
halt;
}
else
{
};
p = (p - 2);
q = (q - 2);
};
p = 1;
q = ((i + 1) * k);
while... | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>8</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>1</rule>
<rule>6</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>3</... | [
{
"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": 0,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-mbpp_849.imp | int ans;
int i;
int n;
n = 39;
i = 2;
while(i <= n)
{
if((n % i) == 0)
{
ans = (ans + i);
while((n % i) == 0)
{
n = (n / i);
};
}
else
{
};
i = (i + 1);
}; | mbpp_849.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
n = 39;
i = 2;
while(i >= n)
{
if((n % i) != 0)
{
ans = (ans - i);
while((n % i) != 0)
{
n = (n * i);
};
}
else
{
};
i = (i - 1);
}; | true | KeywordSwap | 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>8</rule>
<rule>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>3</rule>
<rule>2... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_850.imp | int ans;
int n1;
int b;
int a;
int n2;
int c;
int n3;
a = 150;
b = 30;
c = 70;
n1 = (b - a);
n2 = (c - b);
n3 = (c - a);
if(((n1 * n2) * n3) <= (((a * a) + (b * b)) + (c * c)))
{
ans = 1;
}
else
{
}; | mbpp_850.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n1;
int b;
int a;
int n2;
int c;
int n3;
a = 150;
b = 30;
c = 70;
n1 = (b + a);
n2 = (c + b);
n3 = (c + a);
if(((n1 / n2) / n3) >= (((a / a) - (b / b)) - (c / c)))
{
ans = 1;
}
else
{
}; | true | KeywordSwap | 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>4</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>1</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-addSub_mulDiv_negateRelation-mbpp_853.imp | int ans;
int i;
int n;
i = 1;
n = 30;
while(i <= n)
{
if((n % i) == 0)
{
ans = (ans + i);
}
else
{
};
i = (i + 2);
}; | mbpp_853.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
i = 1;
n = 30;
while(i >= n)
{
if((n % i) != 0)
{
ans = (ans - i);
}
else
{
};
i = (i - 2);
}; | true | KeywordSwap | 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>8</rule>
<rule>16</rule>
<rule>22... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_855.imp | int x;
int ans;
x = 10;
if(x < 0)
{
if(x < 0)
{
ans = 1;
halt;
}
else
{
halt;
};
}
else
{
if((x % 2) == 0)
{
ans = 1;
halt;
}
else
{
halt;
};
}; | mbpp_855.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int x;
int ans;
x = 10;
if(x > 0)
{
if(x > 0)
{
ans = 1;
halt;
}
else
{
halt;
};
}
else
{
if((x % 2) != 0)
{
ans = 1;
halt;
}
else
{
halt;
};
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<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-addSub_mulDiv_negateRelation-mbpp_86.imp | int ans;
int n;
n = 10;
ans = (((3 * n) * (n - 1)) + 1); | mbpp_86.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n;
n = 10;
ans = (((3 / n) / (n + 1)) - 1); | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>5</rule>
<rule>1</rule>
<rule>4</rule>
<rule>5</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
</ans> | [
{
"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-addSub_mulDiv_negateRelation-mbpp_876.imp | int ans;
int a;
int b;
int c;
int d;
int e;
b = 15;
c = 17;
if(b > c)
{
a = b;
b = c;
c = a;
}
else
{
};
d = 1;
e = 1;
while((e <= b) && (e <= c))
{
if(((b % e) == 0) && ((c % e) == 0))
{
d = e;
}
else
{
};
e = (e + 1);
};
ans = ((b * c) / d); | mbpp_876.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int a;
int b;
int c;
int d;
int e;
b = 15;
c = 17;
if(b < c)
{
a = b;
b = c;
c = a;
}
else
{
};
d = 1;
e = 1;
while((e >= b) || (e >= c))
{
if(((b % e) != 0) || ((c % e) != 0))
{
d = e;
}
else
{
};
e = (e - 1);
};
ans = ((b / c) * d); | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>14</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>8</rule>
<rule>1... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"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-addSub_mulDiv_negateRelation-mbpp_882.imp | int ans;
int h;
int b;
h = 8;
b = 9;
ans = ((2 * h) * b); | mbpp_882.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int h;
int b;
h = 8;
b = 9;
ans = ((2 / h) / b); | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>5</rule>
<rule>1</rule>
<rule>5</rule>
<rule>21</rule>
</answer>
</ans> | [
{
"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-addSub_mulDiv_negateRelation-mbpp_884.imp | int ans;
int l;
int n;
int r;
n = 10;
l = 2;
r = 1;
if(((l <= n) && (r <= n)) && ((n % l) == 0))
{
ans = 1;
}
else
{
}; | mbpp_884.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int l;
int n;
int r;
n = 10;
l = 2;
r = 1;
if(((l >= n) || (r >= n)) || ((n % l) != 0))
{
ans = 1;
}
else
{
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>19</rule>
<rule>1</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>19</rule>
<rule>22<... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_901.imp | int n;
int ans;
int a;
int i;
n = 8;
i = (n * 2);
while(1 > 0)
{
a = 1;
while(a < n)
{
if((i % a) != 0)
{
i = (i + n);
break;
}
else
{
};
if((a == (n - 1)) && ((i % a) == 0))
{
ans = i;
halt;
... | mbpp_901.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int ans;
int a;
int i;
n = 8;
i = (n / 2);
while(1 < 0)
{
a = 1;
while(a > n)
{
if((i % a) == 0)
{
i = (i - n);
break;
}
else
{
};
if((a != (n + 1)) || ((i % a) != 0))
{
ans = i;
halt;
... | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>5</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>21<... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_903.imp | int i;
int n;
int temp;
int ans;
n = 14;
i = 1;
while(i <= n)
{
temp = i;
while(temp != 0)
{
if((temp % 2) == 0)
{
ans = (ans + 1);
}
else
{
};
temp = (temp / 2);
};
i = (i + 1);
}; | mbpp_903.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int i;
int n;
int temp;
int ans;
n = 14;
i = 1;
while(i >= n)
{
temp = i;
while(temp == 0)
{
if((temp % 2) != 0)
{
ans = (ans - 1);
}
else
{
};
temp = (temp * 2);
};
i = (i - 1);
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>3</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-addSub_mulDiv_negateRelation-mbpp_905.imp | int ans;
int i;
int n;
ans = 1;
n = 5;
i = (n + 1);
while(i <= (n * 2))
{
ans = (ans * i);
i = (i + 1);
};
i = 1;
while(i <= n)
{
ans = (ans / i);
i = (i + 1);
}; | mbpp_905.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int n;
ans = 1;
n = 5;
i = (n - 1);
while(i >= (n / 2))
{
ans = (ans / i);
i = (i - 1);
};
i = 1;
while(i >= n)
{
ans = (ans * i);
i = (i - 1);
}; | true | KeywordSwap | 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>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<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-addSub_mulDiv_negateRelation-mbpp_93.imp | int ans;
int i;
int a;
int b;
i = 2;
a = 3;
b = 4;
ans = a;
while(i <= b)
{
ans = (ans * a);
i = (i + 1);
}; | mbpp_93.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int a;
int b;
i = 2;
a = 3;
b = 4;
ans = a;
while(i >= b)
{
ans = (ans / a);
i = (i - 1);
}; | true | KeywordSwap | 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>13</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-addSub_mulDiv_negateRelation-mbpp_935.imp | int ans;
int i;
int number;
number = 7;
i = 1;
while(i <= number)
{
ans = (ans + (i * i));
i = (i + 1);
}; | mbpp_935.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int number;
number = 7;
i = 1;
while(i >= number)
{
ans = (ans - (i / i));
i = (i - 1);
}; | true | KeywordSwap | 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>1</rule>
<rule>5</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_952.imp | int ans;
int n;
int i;
int r;
int p;
ans = 1;
n = 11;
r = 3;
p = 14;
i = 1;
while(i <= r)
{
ans = ((ans * ((n - i) + 1)) / i);
i = (i + 1);
};
ans = (((ans - 1) % p) + 1); | mbpp_952.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n;
int i;
int r;
int p;
ans = 1;
n = 11;
r = 3;
p = 14;
i = 1;
while(i >= r)
{
ans = ((ans / ((n + i) - 1)) * i);
i = (i - 1);
};
ans = (((ans + 1) % p) - 1); | true | KeywordSwap | 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>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<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-addSub_mulDiv_negateRelation-mbpp_957.imp | int ans;
int y;
int x;
x = 16;
while(x > 0)
{
y = (x % 2);
ans = (ans + 1);
x = (x / 2);
if(y == 1)
{
break;
}
else
{
};
}; | mbpp_957.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int y;
int x;
x = 16;
while(x < 0)
{
y = (x % 2);
ans = (ans - 1);
x = (x * 2);
if(y != 1)
{
break;
}
else
{
};
}; | true | KeywordSwap | 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>3</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-addSub_mulDiv_negateRelation-mbpp_960.imp | int n;
int ans;
n = 4;
ans = (- 1);
if(n == 4)
{
ans = 3;
}
else
{
};
if(n == 3)
{
ans = 2;
}
else
{
};
if(n == 5)
{
ans = 5;
}
else
{
}; | mbpp_960.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int ans;
n = 4;
ans = (+ 1);
if(n != 4)
{
ans = 3;
}
else
{
};
if(n != 3)
{
ans = 2;
}
else
{
};
if(n != 5)
{
ans = 5;
}
else
{
}; | true | KeywordSwap | 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>16</rule>
<rule>22</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-addSub_mulDiv_negateRelation-mbpp_962.imp | int ans;
int i;
int l;
int r;
l = 3;
r = 8;
i = l;
while(i <= r)
{
if((i % 2) == 0)
{
ans = (ans + i);
}
else
{
};
i = (i + 1);
}; | mbpp_962.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int i;
int l;
int r;
l = 3;
r = 8;
i = l;
while(i >= r)
{
if((i % 2) != 0)
{
ans = (ans - i);
}
else
{
};
i = (i - 1);
}; | true | KeywordSwap | 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>3</rule>
<rule>21</rule>
</answer>
<answer id="4">
<rule>1</rule>
<rule>8</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-addSub_mulDiv_negateRelation-mbpp_968.imp | int n;
int a;
int b;
int ans;
a = 5;
b = 7;
n = 4;
if(a >= b)
{
ans = n;
}
else
{
ans = ((n + a) - b);
}; | mbpp_968.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int a;
int b;
int ans;
a = 5;
b = 7;
n = 4;
if(a <= b)
{
ans = n;
}
else
{
ans = ((n - a) + b);
}; | true | KeywordSwap | 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>15</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>1... | [
{
"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-addSub_mulDiv_negateRelation-mbpp_970.imp | int ans;
int x;
int y;
x = 19;
y = 15;
if(x < y)
{
ans = x;
}
else
{
ans = y;
}; | mbpp_970.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int x;
int y;
x = 19;
y = 15;
if(x > y)
{
ans = x;
}
else
{
ans = y;
}; | true | KeywordSwap | 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>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>21</rule>
</answer>
</ans> | [
{
"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-addSub_mulDiv_negateRelation-min_factorization.imp | int n;
int m;
int l;
int i;
int ans;
l = 1;
i = 9;
n = 48;
while(i >= 2)
{
if((n % i) == 0)
{
m = (m + (i * l));
l = (l * 10);
n = (n / i);
}
else
{
i = (i - 1);
};
};
if(n == 1)
{
ans = m;
}
else
{
ans = 0;
}; | min_factorization.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int m;
int l;
int i;
int ans;
l = 1;
i = 9;
n = 48;
while(i <= 2)
{
if((n % i) != 0)
{
m = (m - (i / l));
l = (l / 10);
n = (n * i);
}
else
{
i = (i + 1);
};
};
if(n != 1)
{
ans = m;
}
else
{
ans = 0;
}; | true | KeywordSwap | 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>8</rule>
<rule>16</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>1... | [
{
"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": 0,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-mirror_reflection.imp | int x;
int y;
int r;
int s;
int ans;
int t;
int k;
int i;
int j;
int h;
r = 2;
s = 1;
x = r;
y = s;
while(y != 0)
{
t = (x % y);
x = y;
y = t;
};
h = x;
k = ((r * s) / h);
i = (k / r);
j = (k / s);
if(((i % 2) == 0) && ((j % 2) == 1))
{
ans = 0;
}
else
{
};
if(((i % 2) == 1) && ((j % 2) == 1))
{
an... | mirror_reflection.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int x;
int y;
int r;
int s;
int ans;
int t;
int k;
int i;
int j;
int h;
r = 2;
s = 1;
x = r;
y = s;
while(y == 0)
{
t = (x % y);
x = y;
y = t;
};
h = x;
k = ((r / s) * h);
i = (k * r);
j = (k * s);
if(((i % 2) != 0) || ((j % 2) != 1))
{
ans = 0;
}
else
{
};
if(((i % 2) != 1) || ((j % 2) != 1))
{
an... | true | KeywordSwap | 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>1</rule>
<rule... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"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-addSub_mulDiv_negateRelation-n_digit.imp | int a;
int b;
int c;
int x;
int y;
int ans;
int z;
int q;
int r;
a = 1;
b = 10;
c = 1;
x = 12;
y = 1;
while(y <= x)
{
if(y == b)
{
b = (b * 10);
c = (c + 1);
}
else
{
};
if(a == x)
{
z = y;
q = b;
r = (a + c);
while(y > 0)
{
... | n_digit.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int b;
int c;
int x;
int y;
int ans;
int z;
int q;
int r;
a = 1;
b = 10;
c = 1;
x = 12;
y = 1;
while(y >= x)
{
if(y != b)
{
b = (b / 10);
c = (c - 1);
}
else
{
};
if(a != x)
{
z = y;
q = b;
r = (a - c);
while(y < 0)
{
... | true | KeywordSwap | 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>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>2... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": 0,
"b": 0,
"c": 0,
"d": null,
"f": null,
"x": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
"B... | |
srp-mk-K-addSub_mulDiv_negateRelation-num_days.imp | int a;
int b;
int ans;
a = 2000;
b = 2;
if(b == 2)
{
if((a % 100) == 0)
{
if((a % 400) == 0)
{
ans = 29;
halt;
}
else
{
ans = 28;
halt;
};
}
else
{
if((a % 4) == 0)
{
ans = 29;... | num_days.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int b;
int ans;
a = 2000;
b = 2;
if(b != 2)
{
if((a % 100) != 0)
{
if((a % 400) != 0)
{
ans = 29;
halt;
}
else
{
ans = 28;
halt;
};
}
else
{
if((a % 4) != 0)
{
ans = 29;... | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>16</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<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": 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-addSub_mulDiv_negateRelation-pattern.imp | int r;
int c;
int n;
int ans;
n = 5;
r = 1;
c = 0;
ans = n;
while(r <= n)
{
c = 1;
while(c < ans)
{
c = (c + 1);
};
ans = (ans - 1);
c = 1;
while(c <= ((2 * r) - 1))
{
c = (c + 1);
};
r = (r + 1);
}; | pattern.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int r;
int c;
int n;
int ans;
n = 5;
r = 1;
c = 0;
ans = n;
while(r >= n)
{
c = 1;
while(c > ans)
{
c = (c - 1);
};
ans = (ans + 1);
c = 1;
while(c >= ((2 / r) + 1))
{
c = (c - 1);
};
r = (r - 1);
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</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": 0,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": 0,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-perfect_num.imp | int ans;
int n;
int i;
int p;
int s;
s = 1;
i = 2;
n = 7;
while((i * i) <= n)
{
if((n % i) == 0)
{
s = (s + i);
p = (n / i);
if(i != p)
{
s = (s + p);
}
else
{
};
}
else
{
};
i = (i + 1);
};
if(s == n)
{
ans = ... | perfect_num.imp | K | module IMP_K_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int ans;
int n;
int i;
int p;
int s;
s = 1;
i = 2;
n = 7;
while((i / i) >= n)
{
if((n % i) != 0)
{
s = (s - i);
p = (n * i);
if(i == p)
{
s = (s - p);
}
else
{
};
}
else
{
};
i = (i - 1);
};
if(s != n)
{
ans = ... | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</rule>
<rule>17</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>6</rule>
<rule>21</rule>
</answer... | [
{
"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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int ans;
n = 27;
if((n < 0) || ((1162261467 % n) != 0))
{
ans = 1;
}
else
{
}; | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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 = ... | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>15</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>1</rule>
<rule>3</rule>
<rule>6</rule>
<rule>21</rule>
</answer>
<answer id="2">
... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": 0,
"b": 0,
"c": 200,
"d": 0,
"f": 0,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
"B": n... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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)); | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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;
}; | true | KeywordSwap | 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>24</rule>
<rule>25</rule>
<ru... | [
{
"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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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));
}; | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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;
}
... | true | KeywordSwap | 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": 0,
"num": null,
"a": null,
"b": null,
"c": 0,
"d": null,
"f": null,
"x": null,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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... | true | KeywordSwap | 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>8</rule>
<rule>16</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>4</rule>
<rule>2... | [
{
"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": 0,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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": 0,
"num": null,
"a": 0,
"b": 0,
"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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<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>
<answer id="2">
<rule>21</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": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int n;
int ans;
n = (50 / 2);
ans = 0;
while(!(n >= 0))
{
ans = (ans - n);
n = (n - (+ 1));
}; | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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) -... | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>1</rule>
<rule>13</rule>
<rule>19</rule>
<rule>2... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 3,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": 2,
"j": null,
"k": null,
"m": 10,
"p": null,
"q": 1,
"r": 3,
"X": null,
"B":... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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 = ... | true | KeywordSwap | 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>3</rule>
<rule>21</rule>
</answer>
<answer id="4">
<rule>1</rule>
<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": 0,
"p": null,
"q": 0,
"r": 0,
"X": null,
... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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;
}
... | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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>12</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</rule>
<rule>19</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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>1</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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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); | true | KeywordSwap | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>11</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>20</rule>
<rule>23</rule>
<rule>26</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": 0,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>21</rule>
</answer>
<answer id="4">
... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"num": null,
"a": null,
"b": null,
"c": null,
"d": null,
"f": null,
"x": null,
"j": 0,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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
... | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | IMP | int a;
int ans;
a = 809;
ans = 24;
a = (a - ans);
ans = (a + ans);
a = (a + ans); | true | KeywordSwap | 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": 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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);
}; | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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
{
}; | true | KeywordSwap | 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-addSub_mulDiv_negateRelation-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_ADDSUB_MULDIV_NEGATERELATION-SYNTAX
imports INT
imports BOOL
imports LIST
imports MAP
imports ID
imports STRING
imports K-LOCATIONS
syntax AExp ::= Int | Id
| "-" AExp [strict]
| "+" AExp [strict]
> lef... | 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
{
}; | true | KeywordSwap | 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>5</rule>
<rule>1</rule>
<rule>1... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": null,
"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-add_digits.imp | int num;
int ans;
num = 38;
if((num % 9) == 0)
{
ans = 9;
}
else
{
ans = (num % 9);
}; | add_digits.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 num;
int ans;
num 𐕂 38;
𐔸((num 𐕖 9) 𐕟 0)
{
ans 𐕂 9;
}
𐕎
{
ans 𐕂 (num 𐕖 9);
}; | 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>8</rule>
<rule>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>8</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-adding_fractions.imp | int a;
int b;
int c;
int d;
int ans;
int f;
a = 1;
b = 1;
c = 13;
d = 19;
if(c == d)
{
ans = (a + b);
f = c;
}
else
{
ans = ((a * d) + (b * c));
f = (c * d);
}; | adding_fractions.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 c;
int d;
int ans;
int f;
a 𐕂 1;
b 𐕂 1;
c 𐕂 13;
d 𐕂 19;
𐔸(c 𐕟 d)
{
ans 𐕂 (a 𐕐 b);
f 𐕂 c;
}
𐕎
{
ans 𐕂 ((a 𐕊 d) 𐕐 (b 𐕊 c));
f 𐕂 (c 𐕊 d);
}; | 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>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>5</rule>
<rule>1... | [
{
"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-addition.imp | int a;
int b;
int ans;
a = 3045;
b = 1078;
ans = (a + b); | addition.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 𐕂 3045;
b 𐕂 1078;
ans 𐕂 (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>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
</ans> | [
{
"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-area_square.imp | int ans;
int a;
a = 156;
ans = (a * a); | area_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 ans;
int a;
a 𐕂 156;
ans 𐕂 (a 𐕊 a); | 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>5</rule>
<rule>21</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-armstrong_num.imp | int x;
int p;
int q;
int r;
int m;
int k;
int j;
int ans;
x = 153;
q = x;
while(q > 0)
{
p = (p + 1);
q = (q / 10);
};
r = 0;
q = x;
while(x > 0)
{
m = (x % 10);
k = 1;
j = 0;
while(j < p)
{
k = (k * m);
j = (j + 1);
};
r = (r + k);
x = (x / 10);
};
if(r == q)
{
... | armstrong_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 x;
int p;
int q;
int r;
int m;
int k;
int j;
int ans;
x 𐕂 153;
q 𐕂 x;
𐕕(q 𐕃 0)
{
p 𐕂 (p 𐕐 1);
q 𐕂 (q 𐕏 10);
};
r 𐕂 0;
q 𐕂 x;
𐕕(x 𐕃 0)
{
m 𐕂 (x 𐕖 10);
k 𐕂 1;
j 𐕂 0;
𐕕(j 𐔳 p)
{
k 𐕂 (k 𐕊 m);
j 𐕂 (j 𐕐 1);
};
r 𐕂 (r 𐕐 k);
x 𐕂 (x 𐕏 10);
};
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>6</rule>
<rule>21</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": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-arrange_coins.imp | int X;
int ans;
int B;
X = 8;
B = 1;
if((X == 1) || (X == 2))
{
ans = 1;
halt;
}
else
{
};
while(X != 0)
{
if(X >= B)
{
X = (X - B);
ans = (ans + 1);
B = (B + 1);
}
else
{
break;
};
}; | arrange_coins.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 B;
X 𐕂 8;
B 𐕂 1;
𐔸((X 𐕟 1) 𐔻 (X 𐕟 2))
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
𐕕(X 𐕀 0)
{
𐔸(X 𐕛 B)
{
X 𐕂 (X 𐕙 B);
ans 𐕂 (ans 𐕐 1);
B 𐕂 (B 𐕐 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>16</rule>
<rule>1</rule>
<rule>16</rule>
<rule>20</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<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": 0,
... | |
srp-mk-K-unseen-base_seven.imp | int n;
int m;
int num;
int ans;
n = 0;
m = 1;
num = (- 7);
while(num != 0)
{
n = (n + (m * (num % 7)));
num = (num / 7);
m = (m * 10);
};
ans = n; | base_seven.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 m;
int num;
int ans;
n 𐕂 0;
m 𐕂 1;
num 𐕂 (𐕙 7);
𐕕(num 𐕀 0)
{
n 𐕂 (n 𐕐 (m 𐕊 (num 𐕖 7)));
num 𐕂 (num 𐕏 7);
m 𐕂 (m 𐕊 10);
};
ans 𐕂 n; | 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>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>17</rule>
<rule>22</rule>
<rule>26</rule>
</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-bulb_switch.imp | int i;
int ans;
int n;
i = 1;
n = 10;
while((i * i) <= n)
{
i = (i + 1);
ans = (ans + 1);
}; | bulb_switch.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 ans;
int n;
i 𐕂 1;
n 𐕂 10;
𐕕((i 𐕊 i) 𐔷 n)
{
i 𐕂 (i 𐕐 1);
ans 𐕂 (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>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-bulb_switch_2.imp | int n;
int k;
int ans;
n = 3;
k = 1;
if(k == 0)
{
ans = 1;
halt;
}
else
{
};
if(n == 1)
{
ans = 2;
halt;
}
else
{
};
if((n == 2) && (k == 1))
{
ans = 3;
halt;
}
else
{
};
if((n == 2) || (k == 1))
{
ans = 4;
halt;
}
else
{
};
if(k == 2)
{
ans = 7;
halt;
}
else
{
};
ans = 8; | bulb_switch_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 n;
int k;
int ans;
n 𐕂 3;
k 𐕂 1;
𐔸(k 𐕟 0)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
𐔸(n 𐕟 1)
{
ans 𐕂 2;
𐔱;
}
𐕎
{
};
𐔸((n 𐕟 2) 𐕜 (k 𐕟 1))
{
ans 𐕂 3;
𐔱;
}
𐕎
{
};
𐔸((n 𐕟 2) 𐔻 (k 𐕟 1))
{
ans 𐕂 4;
𐔱;
}
𐕎
{
};
𐔸(k 𐕟 2)
{
ans 𐕂 7;
𐔱;
}
𐕎
{
};
ans 𐕂 8; | 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>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>16</rule>
<rule>1</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": 0,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-clumsy_fac.imp | int ans;
int s;
int i;
int n;
int t;
n = 10;
s = 1;
i = n;
while(i > 0)
{
t = i;
if((i - 1) > 0)
{
t = (t * (i - 1));
}
else
{
};
if((i - 2) > 0)
{
t = (t / (i - 2));
}
else
{
};
ans = (ans + (s * t));
if((i - 3) > 0)
{
ans = ((an... | clumsy_fac.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;
int i;
int n;
int t;
n 𐕂 10;
s 𐕂 1;
i 𐕂 n;
𐕕(i 𐕃 0)
{
t 𐕂 i;
𐔸((i 𐕙 1) 𐕃 0)
{
t 𐕂 (t 𐕊 (i 𐕙 1));
}
𐕎
{
};
𐔸((i 𐕙 2) 𐕃 0)
{
t 𐕂 (t 𐕏 (i 𐕙 2));
}
𐕎
{
};
ans 𐕂 (ans 𐕐 (s 𐕊 t));
𐔸((i 𐕙 3) 𐕃 0)
{
... | 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>4</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>1</rule>
<rule>5</... | [
{
"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-codecontest_1581.imp | int t;
int n;
int m;
int k;
int s;
int first;
int tk;
int ans;
t = 5;
n = 4;
m = 5;
k = 3;
while(t > 0)
{
t = (t - 1);
s = (((n - 1) * n) / 2);
first = (n - 1);
if((m > s) || (m < first))
{
ans = 0;
continue;
}
else
{
};
if(m >= s)
{
tk = 1;
}
... | codecontest_1581.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 t;
int n;
int m;
int k;
int s;
int first;
int tk;
int ans;
t 𐕂 5;
n 𐕂 4;
m 𐕂 5;
k 𐕂 3;
𐕕(t 𐕃 0)
{
t 𐕂 (t 𐕙 1);
s 𐕂 (((n 𐕙 1) 𐕊 n) 𐕏 2);
first 𐕂 (n 𐕙 1);
𐔸((m 𐕃 s) 𐔻 (m 𐔳 first))
{
ans 𐕂 0;
𐔲;
}
𐕎
{
};
𐔸(m 𐕛 s)
{
tk 𐕂 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>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>4</rule>
<rule>21</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": 0,
"m": 0,
"p": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-codecontest_1586.imp | int n;
int k;
int ans;
int x;
int y;
int i;
int j;
n = 5;
k = 3;
x = (n - 1);
while(x > 0)
{
x = (x / k);
ans = (ans + 1);
};
i = 1;
while(i < n)
{
j = (i + 1);
while(j <= n)
{
x = (i - 1);
y = (j - 1);
while(x != y)
{
x = (x / k);
y = (y / k);... | codecontest_1586.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;
int x;
int y;
int i;
int j;
n 𐕂 5;
k 𐕂 3;
x 𐕂 (n 𐕙 1);
𐕕(x 𐕃 0)
{
x 𐕂 (x 𐕏 k);
ans 𐕂 (ans 𐕐 1);
};
i 𐕂 1;
𐕕(i 𐔳 n)
{
j 𐕂 (i 𐕐 1);
𐕕(j 𐔷 n)
{
x 𐕂 (i 𐕙 1);
y 𐕂 (j 𐕙 1);
𐕕(x 𐕀 y)
{
x 𐕂 (x 𐕏 k);
y 𐕂 ... | 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>24</rule>
<rule>25</rule>
<ru... | [
{
"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": 0,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-codecontest_1594.imp | int T;
int ans;
int s;
int n;
int k;
T = 4;
s = 100;
n = 50;
k = 200;
while(T > 0)
{
T = (T - 1);
if(((k > s) || (((((n / k) * 2) * k) + (n % k)) <= s)) && (k != s))
{
ans = 0;
}
else
{
ans = 1;
};
}; | codecontest_1594.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 T;
int ans;
int s;
int n;
int k;
T 𐕂 4;
s 𐕂 100;
n 𐕂 50;
k 𐕂 200;
𐕕(T 𐕃 0)
{
T 𐕂 (T 𐕙 1);
𐔸(((k 𐕃 s) 𐔻 (((((n 𐕏 k) 𐕊 2) 𐕊 k) 𐕐 (n 𐕖 k)) 𐔷 s)) 𐕜 (k 𐕀 s))
{
ans 𐕂 0;
}
𐕎
{
ans 𐕂 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>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>4</rule>
<rule>21</rule>
</answer>
<answer id="3">
<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-codecontest_1604_D.imp | int t;
int x;
int y;
int ans;
t = 1;
while(t > 0)
{
t = (t - 1);
x = 4;
y = 8;
if(x > y)
{
ans = (x + y);
continue;
}
else
{
};
ans = ((y + ((y / x) * x)) / 2);
}; | codecontest_1604_D.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 t;
int x;
int y;
int ans;
t 𐕂 1;
𐕕(t 𐕃 0)
{
t 𐕂 (t 𐕙 1);
x 𐕂 4;
y 𐕂 8;
𐔸(x 𐕃 y)
{
ans 𐕂 (x 𐕐 y);
𐔲;
}
𐕎
{
};
ans 𐕂 ((y 𐕐 ((y 𐕏 x) 𐕊 x)) 𐕏 2);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>14</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>4</rule>
<rule>21</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": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-codecontest_1606_B.imp | int a;
int b;
int ans;
int c;
a = 8;
b = 3;
c = 1;
while(c < b)
{
c = (c * 2);
ans = (ans + 1);
};
if(c < a)
{
ans = ((((a - c) + b) - 1) / b);
}
else
{
}; | codecontest_1606_B.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;
a 𐕂 8;
b 𐕂 3;
c 𐕂 1;
𐕕(c 𐔳 b)
{
c 𐕂 (c 𐕊 2);
ans 𐕂 (ans 𐕐 1);
};
𐔸(c 𐔳 a)
{
ans 𐕂 ((((a 𐕙 c) 𐕐 b) 𐕙 1) 𐕏 b);
}
𐕎
{
}; | 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>12</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</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-codecontest_1607_B.imp | int n;
int ans;
ans = 10;
n = 99;
if((ans % 2) != 0)
{
if((n % 2) != 0)
{
if(((n / 2) % 2) != 0)
{
ans = ((ans - n) - 1);
}
else
{
ans = (ans + n);
};
}
else
{
if(((n / 2) % 2) != 0)
{
ans = (ans - 1)... | codecontest_1607_B.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;
ans 𐕂 10;
n 𐕂 99;
𐔸((ans 𐕖 2) 𐕀 0)
{
𐔸((n 𐕖 2) 𐕀 0)
{
𐔸(((n 𐕏 2) 𐕖 2) 𐕀 0)
{
ans 𐕂 ((ans 𐕙 n) 𐕙 1);
}
𐕎
{
ans 𐕂 (ans 𐕐 n);
};
}
𐕎
{
𐔸(((n 𐕏 2) 𐕖 2) 𐕀 0)
{
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>8</rule>
<rule>17</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>8</rule>
<rule>17</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-confusing_number.imp | int a;
int b;
int c;
int ans;
int d;
a = 89;
c = a;
while(a != 0)
{
d = (a % 10);
if(((((d == 2) || (d == 3)) || (d == 4)) || (d == 5)) || (d == 7))
{
ans = 0;
halt;
}
else
{
};
if(d == 6)
{
b = ((b * 10) + 9);
}
else
{
if(d == 9)
... | confusing_number.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 c;
int ans;
int d;
a 𐕂 89;
c 𐕂 a;
𐕕(a 𐕀 0)
{
d 𐕂 (a 𐕖 10);
𐔸(((((d 𐕟 2) 𐔻 (d 𐕟 3)) 𐔻 (d 𐕟 4)) 𐔻 (d 𐕟 5)) 𐔻 (d 𐕟 7))
{
ans 𐕂 0;
𐔱;
}
𐕎
{
};
𐔸(d 𐕟 6)
{
b 𐕂 ((b 𐕊 10) 𐕐 9);
}
𐕎
{
𐔸(d 𐕟 9)
{... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="1">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>17</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</rule>
<rule>21</rule>
</answer>
<answe... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": null,
"a": 89,
"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-divide_two_int.imp | int a;
int b;
int aa;
int bb;
int tmp;
int m;
int ans;
a = 10;
b = 3;
if(a < 0)
{
aa = ((- 1) * a);
}
else
{
aa = a;
};
if(b < 0)
{
bb = ((- 1) * b);
}
else
{
bb = b;
};
while(bb <= aa)
{
m = bb;
tmp = 1;
while(m <= (aa - m))
{
m = (m + m);
tmp = (tmp + tmp);
};
a... | divide_two_int.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 aa;
int bb;
int tmp;
int m;
int ans;
a 𐕂 10;
b 𐕂 3;
𐔸(a 𐔳 0)
{
aa 𐕂 ((𐕙 1) 𐕊 a);
}
𐕎
{
aa 𐕂 a;
};
𐔸(b 𐔳 0)
{
bb 𐕂 ((𐕙 1) 𐕊 b);
}
𐕎
{
bb 𐕂 b;
};
𐕕(bb 𐔷 aa)
{
m 𐕂 bb;
tmp 𐕂 1;
𐕕(m 𐔷 (aa 𐕙 m))
{
m 𐕂 (m 𐕐 m);
tmp 𐕂 (tmp 𐕐 tmp);
... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</rule>
<rule>22</rule>
<rule>26</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-elimination_game.imp | int f;
int c;
int x;
int ans;
ans = 9;
c = 1;
x = ans;
while(x > 1)
{
if(f == 0)
{
if((x % 2) == 1)
{
ans = (ans - c);
}
else
{
};
}
else
{
ans = (ans - c);
};
x = (x / 2);
c = (c * 2);
f = (1 - f);
}; | elimination_game.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 f;
int c;
int x;
int ans;
ans 𐕂 9;
c 𐕂 1;
x 𐕂 ans;
𐕕(x 𐕃 1)
{
𐔸(f 𐕟 0)
{
𐔸((x 𐕖 2) 𐕟 1)
{
ans 𐕂 (ans 𐕙 c);
}
𐕎
{
};
}
𐕎
{
ans 𐕂 (ans 𐕙 c);
};
x 𐕂 (x 𐕏 2);
c 𐕂 (c 𐕊 2);
f 𐕂 (1 𐕙 f);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>21</rule>
</answer>
<answer id="1">
<rule>1</rule>
<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... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 9,
"num": null,
"a": null,
"b": null,
"c": 0,
"d": null,
"f": 0,
"x": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,
"B... | |
srp-mk-K-unseen-factorial.imp | int n;
int i;
int ans;
n = 6;
i = 1;
ans = 1;
while(i <= n)
{
ans = (ans * i);
i = (i + 1);
}; | factorial.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 ans;
n 𐕂 6;
i 𐕂 1;
ans 𐕂 1;
𐕕(i 𐔷 n)
{
ans 𐕂 (ans 𐕊 i);
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>3</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>13</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-factorial_trailing_zeros.imp | int ans;
int n;
int s;
n = 5;
s = 1;
while(n > 0)
{
n = (n / 5);
ans = (ans + n);
}; | factorial_trailing_zeros.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 s;
n 𐕂 5;
s 𐕂 1;
𐕕(n 𐕃 0)
{
n 𐕂 (n 𐕏 5);
ans 𐕂 (ans 𐕐 n);
}; | 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-fibonacci.imp | int n;
int a;
int b;
int i;
int ans;
n = 6;
a = 1;
b = 1;
i = 3;
if((n == 1) || (n == 2))
{
ans = 1;
}
else
{
while(i <= n)
{
ans = (a + b);
b = a;
a = ans;
i = (i + 1);
};
}; | fibonacci.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 i;
int ans;
n 𐕂 6;
a 𐕂 1;
b 𐕂 1;
i 𐕂 3;
𐔸((n 𐕟 1) 𐔻 (n 𐕟 2))
{
ans 𐕂 1;
}
𐕎
{
𐕕(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>1</rule>
<rule>16</rule>
<rule>1</rule>
<rule>16</rule>
<rule>20</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</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-gross_salary.imp | int a;
int b;
int d;
int ans;
d = 100;
a = 20;
b = 20;
ans = ((b + a) * (1 + (d / 100))); | gross_salary.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 d;
int ans;
d 𐕂 100;
a 𐕂 20;
b 𐕂 20;
ans 𐕂 ((b 𐕐 a) 𐕊 (1 𐕐 (d 𐕏 100))); | 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>6</rule>
<rule>3</rule>
<rule>5</rule>
<rule>21</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-humaneval_102.imp | int ans;
int x;
int y;
x = 12;
y = 15;
if(y < x)
{
ans = (- 1);
halt;
}
else
{
};
if((y == x) && ((y % 2) == 1))
{
ans = (- 1);
halt;
}
else
{
};
if((y % 2) == 1)
{
ans = (y - 1);
halt;
}
else
{
};
ans = y; | humaneval_102.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 x;
int y;
x 𐕂 12;
y 𐕂 15;
𐔸(y 𐔳 x)
{
ans 𐕂 (𐕙 1);
𐔱;
}
𐕎
{
};
𐔸((y 𐕟 x) 𐕜 ((y 𐕖 2) 𐕟 1))
{
ans 𐕂 (𐕙 1);
𐔱;
}
𐕎
{
};
𐔸((y 𐕖 2) 𐕟 1)
{
ans 𐕂 (y 𐕙 1);
𐔱;
}
𐕎
{
};
ans 𐕂 y; | 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>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>16</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-humaneval_13.imp | int a;
int b;
int ans;
int m;
a = 10;
b = 15;
while(true)
{
if(a < b)
{
m = a;
a = b;
b = m;
}
else
{
};
a = (a % b);
if(a == 0)
{
ans = b;
halt;
}
else
{
};
}; | humaneval_13.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 m;
a 𐕂 10;
b 𐕂 15;
𐕕(true)
{
𐔸(a 𐔳 b)
{
m 𐕂 a;
a 𐕂 b;
b 𐕂 m;
}
𐕎
{
};
a 𐕂 (a 𐕖 b);
𐔸(a 𐕟 0)
{
ans 𐕂 b;
𐔱;
}
𐕎
{
};
}; | 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>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>1</rule>
<rule>8</rule>
<rule>21</rule>
</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-humaneval_138.imp | int ans;
int n;
n = 8;
if(((n % 2) == 0) && (n >= 8))
{
ans = 1;
halt;
}
else
{
};
ans = 0; | humaneval_138.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;
n 𐕂 8;
𐔸(((n 𐕖 2) 𐕟 0) 𐕜 (n 𐕛 8))
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
ans 𐕂 0; | 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>8</rule>
<rule>16</rule>
<rule>1</rule>
<rule>15</rule>
<rule>19</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<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-humaneval_139.imp | int xyz;
int ans;
int p;
int q;
p = 5;
xyz = 1;
ans = 1;
q = 1;
while(q <= p)
{
xyz = (xyz * q);
ans = (ans * xyz);
q = (q + 1);
};
ans = ans; | humaneval_139.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 xyz;
int ans;
int p;
int q;
p 𐕂 5;
xyz 𐕂 1;
ans 𐕂 1;
q 𐕂 1;
𐕕(q 𐔷 p)
{
xyz 𐕂 (xyz 𐕊 q);
ans 𐕂 (ans 𐕊 xyz);
q 𐕂 (q 𐕐 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>13</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>1</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-humaneval_24.imp | int ans;
int i;
int n;
i = 2;
n = 10;
while((i * i) <= n)
{
if((n % i) == 0)
{
ans = (n / i);
halt;
}
else
{
};
i = (i + 1);
};
ans = 1; | humaneval_24.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 i;
int n;
i 𐕂 2;
n 𐕂 10;
𐕕((i 𐕊 i) 𐔷 n)
{
𐔸((n 𐕖 i) 𐕟 0)
{
ans 𐕂 (n 𐕏 i);
𐔱;
}
𐕎
{
};
i 𐕂 (i 𐕐 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>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-humaneval_31.imp | int ans;
int n;
int i;
n = 61;
if(n < 2)
{
ans = 0;
halt;
}
else
{
};
i = 2;
while((i * i) <= n)
{
if((n % i) == 0)
{
ans = 1;
halt;
}
else
{
};
i = (i + 1);
};
ans = 1; | humaneval_31.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 i;
n 𐕂 61;
𐔸(n 𐔳 2)
{
ans 𐕂 0;
𐔱;
}
𐕎
{
};
i 𐕂 2;
𐕕((i 𐕊 i) 𐔷 n)
{
𐔸((n 𐕖 i) 𐕟 0)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
i 𐕂 (i 𐕐 1);
};
ans 𐕂 1; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>21</rule>
</answer>
<answer id="3">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</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-humaneval_36.imp | int ans;
int i;
int n;
int q;
ans = 0;
i = 0;
n = 100;
while(i < n)
{
if(((i % 11) == 0) || ((i % 13) == 0))
{
q = i;
while(q > 0)
{
if((q % 10) == 7)
{
ans = (ans + 1);
}
else
{
};
q = (... | humaneval_36.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 i;
int n;
int q;
ans 𐕂 0;
i 𐕂 0;
n 𐕂 100;
𐕕(i 𐔳 n)
{
𐔸(((i 𐕖 11) 𐕟 0) 𐔻 ((i 𐕖 13) 𐕟 0))
{
q 𐕂 i;
𐕕(q 𐕃 0)
{
𐔸((q 𐕖 10) 𐕟 7)
{
ans 𐕂 (ans 𐕐 1);
}
𐕎
{
};
q ... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>1</rule>
<rule>8</rule>
<rule>16</rule>
<rule>20</rule>
<rule>22</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>8</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-humaneval_39.imp | int x;
int y;
int a;
int b;
int c;
int d;
int ans;
int e;
x = 1;
y = 2;
e = 5;
d = 0;
while(d < e)
{
x = (x + y);
a = x;
x = y;
y = a;
b = 1;
c = 2;
while((c * c) <= x)
{
if((x % c) == 0)
{
b = 0;
}
else
{
};
c = (c + 1... | humaneval_39.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 y;
int a;
int b;
int c;
int d;
int ans;
int e;
x 𐕂 1;
y 𐕂 2;
e 𐕂 5;
d 𐕂 0;
𐕕(d 𐔳 e)
{
x 𐕂 (x 𐕐 y);
a 𐕂 x;
x 𐕂 y;
y 𐕂 a;
b 𐕂 1;
c 𐕂 2;
𐕕((c 𐕊 c) 𐔷 x)
{
𐔸((x 𐕖 c) 𐕟 0)
{
b 𐕂 0;
}
𐕎
{
};
c �... | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>21</rule>
</answer>
<answer id="2">
<rule>24</rule>
<rule>25</rule>
<rule>1</rule>
<rule>1</rule>
<rule>12</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": 0,
"j": null,
"k": null,
"m": null,
"p": null,
"q": null,
"r": null,
"X": null,... | |
srp-mk-K-unseen-humaneval_41.imp | int ans;
int n;
n = 4;
ans = (n * n); | humaneval_41.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;
n 𐕂 4;
ans 𐕂 (n 𐕊 n); | 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>5</rule>
<rule>21</rule>
</answer>
</ans> | [
{
"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-humaneval_49.imp | int ans;
int n;
int p;
int i;
n = 3;
p = 11;
ans = 1;
i = 0;
while(i < n)
{
ans = (ans * 2);
ans = (ans % p);
i = (i + 1);
}; | humaneval_49.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 p;
int i;
n 𐕂 3;
p 𐕂 11;
ans 𐕂 1;
i 𐕂 0;
𐕕(i 𐔳 n)
{
ans 𐕂 (ans 𐕊 2);
ans 𐕂 (ans 𐕖 p);
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>8</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>5</rule>
<rule>21</rule>
</answer>
<answer id="4">
... | [
{
"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-humaneval_59.imp | int ans;
int n;
int i;
n = 13195;
i = 2;
while((i * i) <= n)
{
while(((n % i) == 0) && (n > i))
{
n = (n / i);
};
i = (i + 1);
};
ans = n; | humaneval_59.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 i;
n 𐕂 13195;
i 𐕂 2;
𐕕((i 𐕊 i) 𐔷 n)
{
𐕕(((n 𐕖 i) 𐕟 0) 𐕜 (n 𐕃 i))
{
n 𐕂 (n 𐕏 i);
};
i 𐕂 (i 𐕐 1);
};
ans 𐕂 n; | 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-humaneval_60.imp | int ans;
int n;
n = 30;
ans = ((n * (n + 1)) / 2); | humaneval_60.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;
n 𐕂 30;
ans 𐕂 ((n 𐕊 (n 𐕐 1)) 𐕏 2); | 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>5</rule>
<rule>6</rule>
<rule>21</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-humaneval_75.imp | int num;
int ans;
int a;
int i;
num = 0;
a = 125;
i = 2;
while((i * i) <= a)
{
while(((a % i) == 0) && (a > i))
{
a = (a / i);
num = (num + 1);
};
i = (i + 1);
};
if(num == 2)
{
ans = 1;
halt;
}
else
{
};
ans = 0; | humaneval_75.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 num;
int ans;
int a;
int i;
num 𐕂 0;
a 𐕂 125;
i 𐕂 2;
𐕕((i 𐕊 i) 𐔷 a)
{
𐕕(((a 𐕖 i) 𐕟 0) 𐕜 (a 𐕃 i))
{
a 𐕂 (a 𐕏 i);
num 𐕂 (num 𐕐 1);
};
i 𐕂 (i 𐕐 1);
};
𐔸(num 𐕟 2)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
ans 𐕂 0; | 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>1</rule>
<rule>5</rule>
<rule>1... | [
{
"line_number": 1,
"prior_state": {
"ble": 0,
"ans": 0,
"num": 0,
"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-humaneval_76.imp | int a;
int b;
int ans;
int c;
int d;
a = 1;
b = 0;
c = 8;
d = 2;
while((a <= c) && (b < 100))
{
if(a == c)
{
ans = 1;
halt;
}
else
{
};
a = (a * d);
b = (b + 1);
};
ans = 0; | humaneval_76.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;
a 𐕂 1;
b 𐕂 0;
c 𐕂 8;
d 𐕂 2;
𐕕((a 𐔷 c) 𐕜 (b 𐔳 100))
{
𐔸(a 𐕟 c)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
a 𐕂 (a 𐕊 d);
b 𐕂 (b 𐕐 1);
};
ans 𐕂 0; | 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>5</rule>
<rule>21</rule>
</answer>
<answer id="3">
<rule>1</rule>
<rule>3</rule>
<rule>21</rule>
</answer>
<answer id="4">
... | [
{
"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": null,
"q": null,
"r": null,
"X": null,
... | |
srp-mk-K-unseen-humaneval_83.imp | int ans;
int n;
int i;
n = 3;
if(n < 1)
{
ans = 0;
halt;
}
else
{
};
if(n == 1)
{
ans = 1;
halt;
}
else
{
};
ans = 18;
i = 2;
while(i < n)
{
ans = (ans * 10);
i = (i + 1);
}; | humaneval_83.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 i;
n 𐕂 3;
𐔸(n 𐔳 1)
{
ans 𐕂 0;
𐔱;
}
𐕎
{
};
𐔸(n 𐕟 1)
{
ans 𐕂 1;
𐔱;
}
𐕎
{
};
ans 𐕂 18;
i 𐕂 2;
𐕕(i 𐔳 n)
{
ans 𐕂 (ans 𐕊 10);
i 𐕂 (i 𐕐 1);
}; | true | KeywordObf | true | <ans>
<answer id="0">
<rule>36</rule>
</answer>
<answer id="1">
<rule>1</rule>
<rule>12</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="2">
<rule>1</rule>
<rule>16</rule>
<rule>23</rule>
<rule>26</rule>
</answer>
<answer id="3">
<rule>21</rule>
</answ... | [
{
"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,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.