PW6 test

Student/task3/Test/Hard/backpack.out

@@ -1,2 +0,0 @@
-15
-0

Student/task3/Test/Hard/backpack.sy

@@ -1,65 +0,0 @@
-const int len = 200;
-int V[len * len] = {};
-int w[6] = {0,2,2,6,5,4};
-int v[6] = {0,6,3,5,4,6};
-int x[6];
-
-int KnapSack(int n, int C)
-{
-    int i, j;
-    i=1;
-    while(i<=n)
-    {
-    	j=0;
-    	while(j<C+1)
-    	{
-    		if (j<w[i])
-                V[i * len + j] = V[(i - 1) * len + j];
-            else
-            {
-            	int tmp1=V[(i - 1) * len + j];
-            	int tmp2=V[(i - 1) * len + j - w[i]] + v[i];
-            	if(tmp1>tmp2)
-            	{
-            		V[i * len + j] = tmp1;
-				}
-				else
-				{
-					V[i * len + j] = tmp2;
-				}
-            	
-			}
-    		j=j+1;
-		}
-		i=i+1;
-	}
-    
-    j = C;
-    i=n;
-    while(i>=1)
-    {
-    	if (V[i * len + j]>V[(i - 1) * len + j])
-        {
-            x[i] = 1;
-            j = j - w[i];
-        }
-        else
-        {
-		 
-            x[i] = 0;
-        } 
-        i=i-1;
-	}
-    return V[n * len + C];
-}
-
-int main()
-{
-    int s;
-    int n = 5;
-    int C=10;
-    s = KnapSack(n, C);
-    putint(s);
-    return 0;
-
-}

Student/task3/Test/Hard/brainfk.in

@@ -1,2 +0,0 @@
-4010
-++++++++[->++++++++<]>+++++++++.<+++++[->-----<]>---------.<++++++++[->++++++++<]>++++++.<++++++++[->--------<]>-------------.<+++++++[->+++++++<]>++.<+++++[->+++++<]>+++++++++.+++++.-----.--------.----.<++++[->++++<]>.<++++[->----<]>--------.<++++++++[->--------<]>-.<++++++[->++++++<]>++++.<+++++[->+++++<]>.<++++[->++++<]>+.+++.<+++[->---<]>----.+.<++++++++[->--------<]>---------.<++++++++[->++++++++<]>++++++.<+++[->+++<]>+++.---.--.<++++++++[->--------<]>-------------.<+++++++++[->+++++++++<]>+++.<+++[->---<]>---.---.<++++++++[->--------<]>-----.<++++++[->++++++<]>+.<+++++[->+++++<]>+++.<++++[->++++<]>++.+.<+++++++++[->---------<]>---.<++++++[->++++++<]>++++++.<++++++[->++++++<]>+++++++.-------.-----.++++++.+++.<+++++++++[->---------<]>-.<++++++[->++++++<]>++++.<+++++[->+++++<]>++++++++.--.+.<++++++++[->--------<]>--------.<+++++++[->+++++++<]>++.<++++[->++++<]>.+++++.+++++++..---.<++++++++[->--------<]>.<+++[->---<]>---.<++++++++[->++++++++<]>+.<+++[->+++<]>++++.<+++[->---<]>-.<++++++++[->--------<]>----.<++++++[->++++++<]>+++++.<+++++[->-----<]>---------.<++++++++[->++++++++<]>++++++.<++++++++[->--------<]>-------------.<++++++++[->++++++++<]>++++++++++++++.+.+++++.<+++++++++[->---------<]>---.<++++++++[->++++++++<]>+++++++++.+++++.++++++.<+++[->---<]>------.<+++[->+++<]>++++.<+++[->---<]>----.<+++[->+++<]>+++++.+.<+++[->---<]>------.-.<++++++++[->--------<]>----.<++++++++[->++++++++<]>+++++++++.+++++.<++++++++[->--------<]>--------------.<++++++++[->++++++++<]>+++++++++++++++.+++.<+++[->---<]>-----.+++++.+++++.<+++[->---<]>----.<++++[->++++<]>+.+++++++.<+++++++++[->---------<]>--------.<++++++++[->++++++++<]>++++++++.<+++[->+++<]>++++.--------.<+++[->---<]>---.<+++[->+++<]>++++.+++++.<++++++++[->--------<]>-----.<+++[->---<]>-----.<++++++[->++++++<]>+++++.<+++++[->+++++<]>++++.<++++++++[->--------<]>------.<+++++++++[->+++++++++<]>+++.<+++[->---<]>---.---.<+++[->+++<]>++++.<+++[->---<]>----.<++++++++[->--------<]>-----.<+++++++++[->+++++++++<]>++++++.<++++[->----<]>--.<+++[->+++<]>++++.<+++[->---<]>----.<++++++++[->--------<]>-----.<++++++++[->++++++++<]>+.<+++[->+++<]>++++.<++++++++[->--------<]>--------------.<++++++++[->++++++++<]>+.<+++[->+++<]>++.---.----.+++++++++.<++++++++[->--------<]>--.<+++[->---<]>---.<++++++++[->++++++++<]>+.<++++++++[->--------<]>-.<+++++++++[->+++++++++<]>+++.<+++[->---<]>--.++++.--------.<++++++++[->--------<]>-----.<+++++++++[->+++++++++<]>+++.--.<++++[->----<]>-.<++++[->++++<]>+++++.<++++[->----<]>-.+++++++..-------.<+++[->+++<]>++++.<++++++++[->--------<]>------.<+++[->---<]>---.<++++++++[->++++++++<]>+.<+++[->+++<]>++++.<++++++++[->--------<]>--------------.<++++++++[->++++++++<]>+++++++++++++++.+++++.<+++[->---<]>---.---.<+++[->+++<]>++++.+++++.--------.+++.------.--------.+.<+++[->+++<]>++++.<+++++++++[->---------<]>-.<++++++++[->++++++++<]>+++++++++++++++.+++.<+++++++++[->---------<]>-.<++++++++[->++++++++<]>+.<++++++++[->--------<]>-.<+++++++++[->+++++++++<]>++.++.-----.<+++[->---<]>--.<+++[->+++<]>++++.<+++[->---<]>-.---.<+++[->+++<]>++++.---.<++++++++[->--------<]>---------------.<++++++++[->++++++++<]>+.<+++[->+++<]>+++.++.-.-------.<++++++++[->--------<]>-------.<+++++++++[->+++++++++<]>++++++++.<+++[->---<]>-.++++++.<++++++++[->--------<]>---------.<+++[->---<]>---.<++++++++[->++++++++<]>++++++++++++++++.----.-------.----.<++++[->++++<]>++.<+++[->---<]>-----.<++++++++[->--------<]>-----.<++++++++[->++++++++<]>+++.<+++[->+++<]>+++.--.--------.<++++++++[->--------<]>-----.<+++++++++[->+++++++++<]>+++.-----.<++++++++[->--------<]>---------------.<++++++++[->++++++++<]>+++++++++++++.--------..<+++[->+++<]>++++++.<+++++++++[->---------<]>---.<++++++++[->++++++++<]>+++++++++++++.--------.<++++++++[->--------<]>----.-.<+++++++[->+++++++<]>+++.<++++[->++++<]>++++.-------.<++++[->++++<]>+++.<++++++++[->--------<]>-------------.<++++++++[->++++++++<]>++++++++++++.<+++++++++[->---------<]>--.<++++++++[->++++++++<]>+.<+++[->+++<]>++..<+++++++[->-------<]>-------------.<+++++[->-----<]>--------.---.<

Student/task3/Test/Hard/brainfk.out

@@ -1,2 +0,0 @@
-I'm Suzumiya Haruhi from the East Junior High School, and I'm not interested in ordinary humans. If there were an alien, a time traveller, an otherworlder or a superhero among you, please come to meet me! That's all.
-0

Student/task3/Test/Hard/brainfk.sy

@@ -1,75 +0,0 @@
-/*
-a brainfuck interpreter
-reference: https://gist.github.com/maxcountryman/1699708
-*/
-
-// tape, input buffer, and read/write pointer
-const int TAPE_LEN = 65536, BUFFER_LEN = 32768;
-int tape[TAPE_LEN], program[BUFFER_LEN], ptr = 0;
-
-// read the input program
-void read_program() {
-  int i = 0, len = getint();
-  while (i < len) {
-    program[i] = getch();
-    i = i + 1;
-  }
-  program[i] = 0;
-}
-
-// interpret the input program
-void interpret() {
-  int cur_char, loop, i = 0;
-  while (program[i]) {
-    cur_char = program[i];
-    if (cur_char == 62) {
-      // '>'
-      ptr = ptr + 1;
-    }
-    else if (cur_char == 60) {
-      // '<'
-      ptr = ptr - 1;
-    }
-    else if (cur_char == 43) {
-      // '+'
-      tape[ptr] = tape[ptr] + 1;
-    }
-    else if (cur_char == 45) {
-      // '-'
-      tape[ptr] = tape[ptr] - 1;
-    }
-    else if (cur_char == 46) {
-      // '.'
-      putch(tape[ptr]);
-    }
-    else if (cur_char == 44) {
-      // ','
-      tape[ptr] = getch();
-    }
-    else if (cur_char == 93) {
-      if (tape[ptr]) {
-          // ']'
-        loop = 1;
-        while (loop > 0) {
-          i = i - 1;
-          cur_char = program[i];
-          if (cur_char == 91) {
-            // '['
-            loop = loop - 1;
-          }
-          else if (cur_char == 93) {
-            // ']'
-            loop = loop + 1;
-          }
-        }
-      }
-    }
-    i = i + 1;
-  }
-}
-
-int main() {
-  read_program();
-  interpret();
-  return 0;
-}

Student/task3/Test/Hard/expr_eval.in

@@ -1,6 +0,0 @@
-5
-  1+2*   3/4-  2 *411 ;
-0 -1+10*1329000/ 22219 +99    ;
-1199+ 98888/2227 %112-23;
- *     2;
-;

Student/task3/Test/Hard/expr_eval.out

@@ -1,8 +0,0 @@
--820
-696
-1220
-panic!
--1
-panic!
--1
-0

Student/task3/Test/Hard/expr_eval.sy

@@ -1,175 +0,0 @@
-const int TOKEN_NUM = 0, TOKEN_OTHER = 1;
-int last_char = 32, num, other;
-int cur_token;
-int oprs[256] = {}, ops[256] = {};
-
-int next_char() {
-  last_char = getch();
-  return last_char;
-}
-
-int is_space(int c) {
-  if (c == 32) {
-    return 1;
-  }
-  else {
-    if (c == 10) return 1;
-    else return 0;
-  }
-}
-
-int is_num(int c) {
-  if (c >= 48) {
-    if (c <= 57)
-      return 1;
-  }
-  else {
-    return 0;
-  }
-}
-
-int next_token() {
-  while (is_space(last_char)) next_char();
-  if (is_num(last_char)) {
-    num = last_char - 48;
-    while (is_num(next_char())) {
-      num = num * 10 + last_char - 48;
-    }
-    cur_token = TOKEN_NUM;
-  }
-  else {
-    other = last_char;
-    next_char();
-    cur_token = TOKEN_OTHER;
-  }
-  return cur_token;
-}
-
-int panic() {
-  putch(112);
-  putch(97);
-  putch(110);
-  putch(105);
-  putch(99);
-  putch(33);
-  putch(10);
-  return -1;
-}
-
-int get_op_prec(int op) {
-  // +, -
-  if (op == 43) return 10;
-  if (op == 45) return 10;
-  // *, /, %
-  if (op == 42) return 20;
-  if (op == 47) return 20;
-  if (op == 37) return 20;
-  // other
-  return 0;
-}
-
-void stack_push(int flag, int v) {
-  if (flag == 0) {
-    oprs[0] = oprs[0] + 1;
-    oprs[oprs[0]] = v;
-  } else {
-    ops[0] = ops[0] + 1;
-    ops[ops[0]] = v;
-  }
-}
-
-int stack_pop(int flag) {
-  int last;
-  if (flag == 0) {
-    last = oprs[oprs[0]];
-    oprs[0] = oprs[0] - 1;
-  } else {
-    last = ops[ops[0]];
-    ops[0] = ops[0] - 1;
-  }
-  return last;
-}
-
-int stack_peek(int flag) {
-  int val;
-  if (flag == 0)
-    val = oprs[oprs[0]];
-  else
-    val = ops[ops[0]];
-  return val;
-}
-
-int stack_size(int flag) {
-  int val;
-  if (flag == 0)
-    val = oprs[0];
-  else
-    val = ops[0];
-  return val;
-}
-
-int eval_op(int op, int lhs, int rhs) {
-  // +
-  if (op == 43) return lhs + rhs;
-  // -
-  if (op == 45) return lhs - rhs;
-  // *
-  if (op == 42) return lhs * rhs;
-  // /
-  if (op == 47) return lhs / rhs;
-  // %
-  if (op == 37) return lhs % rhs;
-  // other
-  return 0;
-}
-
-int eval() {
-  // get the first value
-  if (cur_token != TOKEN_NUM) return panic();
-  stack_push(0, num);
-  next_token();
-  // evaluate
-  while (cur_token == TOKEN_OTHER) {
-    // get operator
-    int op = other;
-    if (get_op_prec(op) == 0) break;
-    next_token();
-    // handle operator
-    while (stack_size(1)) {
-      if (get_op_prec(stack_peek(1)) >= get_op_prec(op)) {
-        // evaluate the current operation
-        int cur_op = stack_pop(1);
-        int rhs = stack_pop(0), lhs = stack_pop(0);
-        stack_push(0, eval_op(cur_op, lhs, rhs));
-      } else {
-        break;
-      }
-    }
-    stack_push(1, op);
-    // get next expression
-    if (cur_token != TOKEN_NUM) return panic();
-    stack_push(0, num);
-    next_token();
-  }
-  // eat ';'
-  next_token();
-  // clear the operator stack
-  while (stack_size(1)) {
-    int cur_op = stack_pop(1);
-    int rhs = stack_pop(0), lhs = stack_pop(0);
-    stack_push(0, eval_op(cur_op, lhs, rhs));
-  }
-  return stack_peek(0);
-}
-
-int main() {
-  int count = getint();
-  getch();
-  next_token();
-  while (count) {
-    putint(eval());
-    putch(10);
-    count = count - 1;
-  }
-  return 0;
-}

Student/task3/Test/Hard/kmp.in

@@ -1,2 +0,0 @@
-abcabdbca
-aababcabdabdababcabdbcadceadbcababcdcbaabsbda

Student/task3/Test/Hard/kmp.out

@@ -1,2 +0,0 @@
-23
-0

Student/task3/Test/Hard/kmp.sy

@@ -1,75 +0,0 @@
-int dst[4096], src[4096];
-int next[4096];
-
-void get_next()
-{
-    next[0] = -1;
-    int i = 0, j = -1;
-    while (dst[i]) {
-        if (j == -1 || dst[i] == dst[j]) {
-            j = j + 1;
-            i = i + 1;
-            next[i] = j;
-        }
-        else
-            j = next[j];
-    }
-}
-
-int KMP()
-{
-    get_next();
-
-    int i = 0, j = 0;
-    while (src[j]) {
-        if (dst[i] == src[j]) {
-            i = i + 1;
-            j = j + 1;
-            if (dst[i] == 0) {
-                return j;
-            }
-        } else {
-            i = next[i];
-            if (i == -1) {
-                i = i + 1;
-                j = j + 1;
-            }
-        }
-    }
-    return -1;
-}
-
-int read_str(int flag)
-{
-    if (flag == 0) {
-        int i = 0;
-        while (1) {
-            dst[i] = getch();
-            if (dst[i] == 10)
-                break;
-            i = i + 1;
-        }
-        dst[i] = 0;
-        return i;
-    } else {
-        int i = 0;
-        while (1) {
-            src[i] = getch();
-            if (src[i] == 10)
-                break;
-            i = i + 1;
-        }
-        src[i] = 0;
-        return i;
-    }
-    return 0;
-}
-
-int main()
-{
-    read_str(0);
-    read_str(1);
-    putint(KMP());
-    putch(10);
-    return 0;
-}

Student/task3/Test/Hard/long_array.out

@@ -1,2 +0,0 @@
-02425294124166176216218-22282-34782142718170218357718485218672718700218877718865218842718825218832718815218822718825218832718815218822718805218
-216

Student/task3/Test/Hard/long_array.sy

@@ -1,61 +0,0 @@
-const int N = 10000;
-
-int long_array(int k) {
-  int a1[N];
-  int a2[N];
-  int a3[N];
-  int i = 0;
-  while (i < N) {
-    a1[i] = (i * i) % 10;
-    i = i + 1;
-  }
-  i = 0;
-  while (i < N) {
-    a2[i] = (a1[i] * a1[i]) % 10;
-    i = i + 1;
-  }
-  i = 0;
-  while (i < N) {
-    a3[i] = (a2[i] * a2[i]) % 100 + a1[i];
-    i = i + 1;
-  }
-  int ans = 0;
-  i = 0;
-  while (i < N) {
-    if (i < 10) {
-      ans = (ans + a3[i]) % 1333;
-      putint(ans);
-    }
-    else if (i < 20) {
-      int j = N / 2;
-      while (j < N) {
-        ans = ans + a3[i] - a1[j];
-        j = j + 1;
-      }
-      putint(ans);
-    }
-    else if (i < 30) {
-      int j = N / 2;
-      while (j < N) {
-        if (j > 2233) {
-          ans = ans + a2[i] - a1[j];
-          j = j + 1;
-        }
-        else {
-          ans = (ans + a1[i] + a3[j]) % 13333;
-          j = j + 2;
-        }
-      }
-      putint(ans);
-    }
-    else {
-      ans = (ans + a3[i] * k) % 99988;
-    }
-    i = i + 1;
-  }
-  return ans;
-}
-
-int main() {
-  return long_array(9);
-}

Student/task3/Test/Hard/n_queens.in

@@ -1,2 +0,0 @@
-4
-1 5 6 8

Student/task3/Test/Hard/n_queens.out

@@ -1,108 +0,0 @@
-1
-1 3 5 2 4
-1 4 2 5 3
-2 4 1 3 5
-2 5 3 1 4
-3 1 4 2 5
-3 5 2 4 1
-4 1 3 5 2
-4 2 5 3 1
-5 2 4 1 3
-5 3 1 4 2
-2 4 6 1 3 5
-3 6 2 5 1 4
-4 1 5 2 6 3
-5 3 1 6 4 2
-1 5 8 6 3 7 2 4
-1 6 8 3 7 4 2 5
-1 7 4 6 8 2 5 3
-1 7 5 8 2 4 6 3
-2 4 6 8 3 1 7 5
-2 5 7 1 3 8 6 4
-2 5 7 4 1 8 6 3
-2 6 1 7 4 8 3 5
-2 6 8 3 1 4 7 5
-2 7 3 6 8 5 1 4
-2 7 5 8 1 4 6 3
-2 8 6 1 3 5 7 4
-3 1 7 5 8 2 4 6
-3 5 2 8 1 7 4 6
-3 5 2 8 6 4 7 1
-3 5 7 1 4 2 8 6
-3 5 8 4 1 7 2 6
-3 6 2 5 8 1 7 4
-3 6 2 7 1 4 8 5
-3 6 2 7 5 1 8 4
-3 6 4 1 8 5 7 2
-3 6 4 2 8 5 7 1
-3 6 8 1 4 7 5 2
-3 6 8 1 5 7 2 4
-3 6 8 2 4 1 7 5
-3 7 2 8 5 1 4 6
-3 7 2 8 6 4 1 5
-3 8 4 7 1 6 2 5
-4 1 5 8 2 7 3 6
-4 1 5 8 6 3 7 2
-4 2 5 8 6 1 3 7
-4 2 7 3 6 8 1 5
-4 2 7 3 6 8 5 1
-4 2 7 5 1 8 6 3
-4 2 8 5 7 1 3 6
-4 2 8 6 1 3 5 7
-4 6 1 5 2 8 3 7
-4 6 8 2 7 1 3 5
-4 6 8 3 1 7 5 2
-4 7 1 8 5 2 6 3
-4 7 3 8 2 5 1 6
-4 7 5 2 6 1 3 8
-4 7 5 3 1 6 8 2
-4 8 1 3 6 2 7 5
-4 8 1 5 7 2 6 3
-4 8 5 3 1 7 2 6
-5 1 4 6 8 2 7 3
-5 1 8 4 2 7 3 6
-5 1 8 6 3 7 2 4
-5 2 4 6 8 3 1 7
-5 2 4 7 3 8 6 1
-5 2 6 1 7 4 8 3
-5 2 8 1 4 7 3 6
-5 3 1 6 8 2 4 7
-5 3 1 7 2 8 6 4
-5 3 8 4 7 1 6 2
-5 7 1 3 8 6 4 2
-5 7 1 4 2 8 6 3
-5 7 2 4 8 1 3 6
-5 7 2 6 3 1 4 8
-5 7 2 6 3 1 8 4
-5 7 4 1 3 8 6 2
-5 8 4 1 3 6 2 7
-5 8 4 1 7 2 6 3
-6 1 5 2 8 3 7 4
-6 2 7 1 3 5 8 4
-6 2 7 1 4 8 5 3
-6 3 1 7 5 8 2 4
-6 3 1 8 4 2 7 5
-6 3 1 8 5 2 4 7
-6 3 5 7 1 4 2 8
-6 3 5 8 1 4 2 7
-6 3 7 2 4 8 1 5
-6 3 7 2 8 5 1 4
-6 3 7 4 1 8 2 5
-6 4 1 5 8 2 7 3
-6 4 2 8 5 7 1 3
-6 4 7 1 3 5 2 8
-6 4 7 1 8 2 5 3
-6 8 2 4 1 7 5 3
-7 1 3 8 6 4 2 5
-7 2 4 1 8 5 3 6
-7 2 6 3 1 4 8 5
-7 3 1 6 8 5 2 4
-7 3 8 2 5 1 6 4
-7 4 2 5 8 1 3 6
-7 4 2 8 6 1 3 5
-7 5 3 1 6 8 2 4
-8 2 4 1 7 5 3 6
-8 2 5 3 1 7 4 6
-8 3 1 6 2 5 7 4
-8 4 1 3 6 2 7 5
-107

Student/task3/Test/Hard/n_queens.sy

@@ -1,53 +0,0 @@
-int ans[50], sum = 0, n;
-
-int row[50], line1[50], line2[100];
-
-void printans()
-{
-    sum = sum + 1;
-    int i = 1;
-    while (i <= n) {
-        putint(ans[i]);
-        if (i == n) {
-            putch(10);
-            return;
-        } else
-            putch(32);
-        i = i + 1;
-    }
-}
-
-void f(int step)
-{
-    int i = 1;
-    while (i <= n) {
-        if (row[i] != 1) {
-            if (line1[step + i] == 0) {
-                if (line2[n + step - i] == 0) {
-                    ans[step] = i;
-                    if (step == n)
-                        printans();
-                    row[i] = 1;
-                    line1[step + i] = 1;
-                    line2[n + step - i] = 1;
-                    f(step + 1);
-                    row[i] = 0;
-                    line1[step + i] = 0;
-                    line2[n + step - i] = 0;
-                }
-            }
-        }
-        i = i + 1;
-    }
-}
-
-int main()
-{
-    int N = getint();
-    while (N > 0) {
-        n = getint();
-        f(1);
-        N = N - 1;
-    }
-    return sum;
-}

Student/task3/Test/Hard/nested_calls.in

@@ -1,3 +0,0 @@
-1 2 3 4 5
-6 7 8 9 10
-11 12 13 14

Student/task3/Test/Hard/nested_calls.out

@@ -1 +0,0 @@
-250

Student/task3/Test/Hard/nested_calls.sy

@@ -1,96 +0,0 @@
-int func1(int x, int y, int z) {
-  if (z == 0) {
-    return x * y;
-  }
-  else {
-    return func1(x, y - z, 0);
-  }
-}
-
-int func2(int x, int y) {
-  if (y) {
-    return func2(x % y, 0);
-  }
-  else {
-    return x;
-  }
-}
-
-int func3(int x, int y) {
-  if (y == 0) {
-    return x + 1;
-  }
-  else {
-    return func3(x + y, 0);
-  }
-}
-
-int func4(int x, int y, int z) {
-  if (x) {
-    return y;
-  }
-  else {
-    return z;
-  }
-}
-
-int func5(int x) {
-  return -x;
-}
-
-int func6(int x, int y) {
-  if (x) {
-    if (y)
-      return 1;
-  }
-  else {
-    return 0;
-  }
-}
-
-int func7(int x) {
-  if (x == 0) {
-    return 1;
-  }
-  else {
-    return 0;
-  }
-}
-
-int main() {
-  int i1 = getint(), i2 = getint(), i3 = getint(), i4 = getint();
-  int arr[10];
-  int i = 0;
-  while (i < 10) {
-    arr[i] = getint();
-    i = i + 1;
-  }
-  int a = func1(
-      // this
-      func2(
-          // is
-          func1(
-              // comment
-              func3(func4(func5(func3(func2(func6(func7(i1), func5(i2)), i3),
-                                      // this
-                                      i4)),
-                          // is
-                          arr[0],
-                          // function
-                          func1(func2(func3(func4(func5(arr[1]),
-                                                  // call
-                                                  func6(arr[2], func7(arr[3])),
-                                                  func2(arr[4], func7(arr[5]))),
-                                            arr[6]),
-                                      arr[7]),
-                                func3(arr[8], func7(arr[9])), i1)),
-                    func2(i2, func3(func7(i3), i4))),
-              arr[0], arr[1]),
-          arr[2]),
-      arr[3],
-      func3(func2(func1(func2(func3(arr[4], func5(arr[5])), func5(arr[6])),
-                        arr[7], func7(arr[8])),
-                  func5(arr[9])),
-            i1));
-  return a;
-}

Student/task3/Test/Hard/nested_calls2.out

@@ -1,2 +0,0 @@
-4
-0

Student/task3/Test/Hard/nested_calls2.sy

@@ -1,16 +0,0 @@
-int f(int a, int b) {
-	return a * b;
-}
-
-int g(int a, int b) {
-	return a % b;
-}
-
-int h(int a, int b) {
-	return f(f(2, g(a, b)), g(f(a, b), 4));
-}
-
-int main () {
-	putint(h(11, 3));
-	return 0;
-}

Student/task3/Test/Hard/percolation.in

@@ -1,10 +0,0 @@
-2 2
-3 1
-4 2
-4 4
-1 2
-2 3
-2 1
-3 2
-3 4
-3 1

Student/task3/Test/Hard/percolation.out

@@ -1,2 +0,0 @@
-8
-0

Student/task3/Test/Hard/percolation.sy

@@ -1,90 +0,0 @@
-int array[110];
-int n;
-void init(int n) {
-  int i = 1;
-  while (i <= n * n + 1) {
-    array[i] = -1;
-    i = i + 1;
-  }
-}
-
-int findfa(int a) {
-  if (array[a] == a)
-    return a;
-  else {
-    array[a] = findfa(array[a]);
-    return array[a];
-  }
-}
-void mmerge(int a, int b) {
-  int m = findfa(a);
-  int n = findfa(b);
-  if (m != n) array[m] = n;
-}
-int main() {
-  int t, m;
-  int a, b;
-  t = 1;
-  while (t) {
-    t = t - 1;
-    n = 4;
-    m = 10;
-    int i = 0;
-    int flag = 0;
-    init(n);
-    int k = n * n + 1;
-
-    while (i < m) {
-      a = getint();
-      b = getint();
-
-      if (flag==0) {
-        int loc = n * (a - 1) + b;
-
-        array[loc] = loc;
-        if (a == 1) {
-          array[0] = 0;
-          mmerge(loc, 0);
-        }
-        if (a == n) {
-          array[k] = k;
-          mmerge(loc, k);
-        }
-        if (b < n) {
-          if (array[loc + 1] != -1)
-            mmerge(loc, loc + 1);
-        }
-        if (b > 1) {
-          if (array[loc - 1] != -1)
-            mmerge(loc, loc - 1);
-        }
-        if (a < n) {
-          if (array[loc + n] != -1)
-            mmerge(loc, loc + n);
-        }
-        if (a > 1) {
-          if (array[loc - n] != -1)
-            mmerge(loc, loc - n);
-        }
-
-        if (array[0] != -1) {
-          if (array[k] != -1) {
-            if (findfa(0) == findfa(k)) {
-              flag = 1;
-              int tmp = i + 1;
-              putint(tmp);
-              putch(10);
-            }
-          }
-        }
-      }
-
-      i = i + 1;
-    }
-    if (flag == 0) {
-      putint(-1);
-      putch(10);
-    }
-  }
-  return 0;
-}

Student/task3/Test/Hard/scope.out

@@ -1,2 +0,0 @@
--40
-62

Student/task3/Test/Hard/scope.sy

@@ -1,26 +0,0 @@
-int k;
-
-int main() {
-  k = 3389;
-  if (k < 10000) {
-    k = k + 1;
-    int k = 112;
-    while (k > 10) {
-      k = k - 88;
-      if (k < 1000) {
-        int g = 9;
-        {
-          int l = 11;
-          {
-            g = 10;
-            k = k - g;
-            int g = 11;
-            k = k + g + l;
-          }
-        }
-      }
-    }
-    putint(k);
-  }
-  return k;
-}

Student/task3/Test/Medium/add_prior_equal.out

@@ -1,2 +0,0 @@
-0
-0

Student/task3/Test/Medium/add_prior_equal.sy

@@ -1,19 +0,0 @@
-// Add is prior than equal and not equal
-int main () {
-    int a;
-    int b;
-    int c;
-    a = 1;
-    b = 4;
-    c = 28;
-    int t;
-    if (c + a != b) {
-        t = c % -b;
-        putint(t);
-    }
-    if (b - c == a) {
-        t = c%b+b;
-        putint(t);
-    }
-    return 0;
-}

Student/task3/Test/Medium/arr_expr_len.out

@@ -1 +0,0 @@
-51

Student/task3/Test/Medium/arr_expr_len.sy

@@ -1,11 +0,0 @@
-const int N = -1;
-int arr[N + 2 * 4 - 99 / 99] = {1, 2, 33, 4, 5, 6};
-
-int main() {
-  int i = 0, sum = 0;
-  while (i < 6) {
-    sum = sum + arr[i];
-    i = i + 1;
-  }
-  return sum;
-}

Student/task3/Test/Medium/array_test.out

@@ -1 +0,0 @@
-0

Student/task3/Test/Medium/array_test.sy

@@ -1,17 +0,0 @@
-const int arr[5] = {1,3,4,2};
-int a = 0;
-
-int sum(int a, int b){
-    return a+b;
-}
-
-int main(){
-    int cnt = 0;
-    while (a < arr[a]) {
-        a = arr[a];
-        if (arr[a + arr[a] - 1] > arr[a] - 1.5) {
-            cnt = arr[cnt] + 1;
-        }
-    }
-    return sum(arr[a], -cnt);
-}

Student/task3/Test/Medium/assign_after_continue.out

@@ -1 +0,0 @@
-0

Student/task3/Test/Medium/assign_after_continue.sy

@@ -1,14 +0,0 @@
-const int arr[5] = {1,3,4,2};
-int a = 0;
-
-int main(){
-    int cnt = 0;
-    while (a < arr[a]) {
-        a = arr[a];
-        if (arr[a + arr[a] - 1] > arr[a] - 1.5) {
-            continue;
-            cnt = arr[cnt] + 1;
-        }
-    }
-    return cnt;
-}

Student/task3/Test/Medium/assign_complex_expr.out

@@ -1,2 +0,0 @@
--171
-0

Student/task3/Test/Medium/assign_complex_expr.sy

@@ -1,18 +0,0 @@
-// Use complex expression in assign structure
-int main () {
-    int a;
-    int b;
-    int c;
-    int d;
-    int result;
-    a = 5;
-    b = 5;
-    c = 1;
-    d = -2;
-    result = (d * 1 / 2)  + (a - b) - -(c + 3) % 2;
-    putint(result);
-    result = ((d % 2 + 67) + -(a - b) - -((c + 2) % 2));
-    result = result + 3;
-    putint(result);
-    return 0;
-}

Student/task3/Test/Medium/big_int_mul.out

@@ -1,2 +0,0 @@
-3102343761271952753654505476597868729361003112012671299112096683775968059149440439438030623917912792644636180
-0

Student/task3/Test/Medium/big_int_mul.sy

@@ -1,65 +0,0 @@
-const int len = 20;
-
-int main()
-{
-	int i, j, t, n, temp;
-	int mult1[len] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
-	int mult2[len] = {2, 3, 4, 2, 5, 7 ,9 ,9, 0, 1, 9, 8, 7, 6, 4, 3, 2, 1, 2, 2};
-	int len1 = len;
-	int len2 = len;
-	int c1[len + 5];
-	int c2[len + 5];
-	int result[len * 2] = {};
-
-	i = 0;
-	while (i < len1) {
-		c1[i] = mult1[i];
-		i = i + 1;
-	}	
-
-	i = 0;
-	while (i < len2) {
-		c2[i] = mult2[i];
-		i = i + 1;
-	}	
-
-	n = len1 + len2 - 1;
-
-	i = 0;
-	while (i <= n) {
-		result[i]=0;
-		i = i + 1;
-	}	 
-
-	temp=0;
-
-	i = len2 - 1;
-	while (i > -1) {
-		t = c2[i];
-		j = len1 - 1;
-		while (j > -1) {
-			temp = result[n] + t * c1[j];
-			if(temp >= 10) {
-				result[n] = (temp);
-				result[n-1] = result[n-1] + temp / 10;
-			}
-			else
-				result[n] = temp;
-			j = j - 1;
-			n = n - 1;
-		}
-		n = n + len1 - 1;
-		i = i - 1;
-	}
-
-	if(result[0] != 0)
-		putint(result[0]); 
-
-	i = 1;
-	while (i <= len1 + len2 - 1) {
-		putint(result[i]); 
-		i = i + 1;
-	}
-
-	return 0;
-}

Student/task3/Test/Medium/decl_after_return.out

@@ -1 +0,0 @@
-3

Student/task3/Test/Medium/decl_after_return.sy

@@ -1,5 +0,0 @@
-int main(){
-    return 3;
-    int a = 1;
-    return a;
-}

Student/task3/Test/Medium/enc_dec.out

@@ -1,2 +0,0 @@
-401
-0

Student/task3/Test/Medium/enc_dec.sy

@@ -1,38 +0,0 @@
-int enc(int a)
-{
-   if(a>25)
-   a=a+60;
-   else
-   {
-       a=a-15;
-   }
-   
-   return a;
-
-}
-
-int dec(int a)
-{
-    if (a>85)
-    a=a-59;
-    else
-    {
-        a=a+14;
-    }
-
-    return a;
-    
-}
-
-int main()
-{
-    int a;
-    a=400;
-    int res;
-    res=enc(a);
-    res=dec(res);
-    putint(res);
-    res = 10;
-    putch(res);
-    return 0;
-}

Student/task3/Test/Medium/exgcd.out

@@ -1,2 +0,0 @@
-13
-0

Student/task3/Test/Medium/exgcd.sy

@@ -1,23 +0,0 @@
-int x[1] = {1}, y[1] = {1};
-int exgcd(int a,int b) {
-	if(b == 0) {
-		x[0] = 1;
-		y[0] = 0; 
-		return a;			
-	}
-	else {
-		int r = exgcd(b, a % b);		
-		int t = x[0];
-		x[0] = y[0];
-		y[0] = (t - a / b * y[0]);
-		return r;
-	}
-} 
-
-int main() {
-	int a = 7, b = 15;
-	exgcd(a, b);
-	x[0] = (x[0] % b + b) % b;
-	putint(x[0]);
-	return 0;
-}

Student/task3/Test/Medium/go_upstairs.out

@@ -1 +0,0 @@
-8

Student/task3/Test/Medium/go_upstairs.sy

@@ -1,22 +0,0 @@
-int climbStairs(int n) {
-    if(n < 4)
-        return n;
-    int dp[10];
-    dp[0] = 0;
-    dp[1] = 1;
-    dp[2] = 2;
-    int i;
-    i = 3;
-    while(i<n+1){
-        dp[i] = dp[i-1] + dp[i-2];
-        i = i + 1;
-    }
-    return dp[n];
-}
-int main(){
-    int res;
-    int n;
-    n=5;
-    res = climbStairs(n);
-    return res;
-}

Student/task3/Test/Medium/if_side_effect.out

@@ -1 +0,0 @@
-1

Student/task3/Test/Medium/if_side_effect.sy

@@ -1,12 +0,0 @@
-int a;
-
-int inc_a(){
-    a = a + 1;
-    return a - 1;
-}
-
-int main(){
-    if (inc_a())
-        ;
-    return a;
-}

Student/task3/Test/Medium/if_test.out

@@ -1 +0,0 @@
-25

Student/task3/Test/Medium/if_test.sy

@@ -1,18 +0,0 @@
-// test if-{if-else}
-int if_ifElse_() {
-  int a;
-  a = 5;
-  int b;
-  b = 10;
-  if(a == 5){
-    if (b == 10) 
-      a = 25;
-    else 
-      a = a + 15;
-  }
-  return (a);
-}
-
-int main(){
-  return (if_ifElse_());
-}

Student/task3/Test/Medium/if_test2.out

@@ -1 +0,0 @@
-25

Student/task3/Test/Medium/if_test2.sy

@@ -1,18 +0,0 @@
-// test if-{if}-else
-int if_if_Else() {
-  int a;
-  a = 5;
-  int b;
-  b = 10;
-  if(a == 5){
-    if (b == 10) 
-      a = 25;
-  }
-    else 
-      a = a + 15;
-  return (a);
-}
-
-int main(){
-  return (if_if_Else());
-}

Student/task3/Test/Medium/index_arithmetic_expr.out

@@ -1,2 +0,0 @@
-3
-0

Student/task3/Test/Medium/index_arithmetic_expr.sy

@@ -1,15 +0,0 @@
-// Use arithmetic expression as array's index
-int main() {
-    int a;
-    int b;
-    int result[3];
-    a = 56;
-    b = 12;
-    result[0] = 1;
-    result[1] = 2;
-    result[2] = 3;
-    int t;
-    t = result[(a % b + b) / 5 - 2];
-    putint(t);
-    return 0;
-}

Student/task3/Test/Medium/index_complex_expr.out

@@ -1,2 +0,0 @@
-45
-0

Student/task3/Test/Medium/index_complex_expr.sy

@@ -1,23 +0,0 @@
-// Use complex expression in assign structure
-int main () {
-    int a;
-    int b;
-    int c;
-    int d;
-    int result[5];
-    a = 5;
-    b = 5;
-    c = 1;
-    d = -2;
-    result[0] = 1;
-    result[1] = 2;
-    result[2] = 3;
-    result[3] = 4;
-    result[4] = 5;
-    int t;
-    t = result[((d * 1 / 2) + 4 + (a - b) - -(c + 3) % 2) % 5];
-    putint(t);
-    t = result[(((c % 2 + 67) + a - b) - -((c + 2) % 2)) % 5];
-    putint(t);
-    return 0;
-}

Student/task3/Test/Medium/int_literal.out

@@ -1 +0,0 @@
-230

Student/task3/Test/Medium/int_literal.sy

@@ -1,50 +0,0 @@
-int s = 0;
-
-int get_ans_se(int ans, int v0, int v1) {
-  int v = 0;
-  if (v0 == v1) v = 1;
-  ans = ans * 2;
-  ans = ans + v;
-  s = s + ans;
-  return ans;
-}
-
-int get_ans(int ans, int v0, int v1) {
-  int v = 0;
-  if (v0 == v1) v = 1;
-  ans = ans * 2;
-  ans = ans + v;
-  return ans;
-}
-
-int main() {
-  const int k0 = -2147483648;
-  const int k1 = 0x80000000;
-  const int k2 = 0x80000000 + 1;
-  const int k3 = 0x7fFffffF;
-  const int k4 = 0x7fFffffF - 1;
-  int a1, a2, a3, a4;
-  a1 = get_ans( 0, k0, k1);
-  a1 = get_ans(a1, k0 + 1, k2);
-  a1 = get_ans(a1, k0, -k3 - 1);
-  a1 = get_ans(a1, k0, k4 + 1);
-  a1 = get_ans(a1, k1 / 2, k2 / 2);
-  a1 = get_ans(a1, k1, -k3 - 1);
-  a1 = get_ans(a1, k1, k4 + 1);
-  a2 = get_ans( 0, k2, k3);
-  a2 = get_ans(a2, k2, k4);
-  a2 = get_ans(a2, k3, k4);
-  a2 = get_ans(a2, k0 / 2, k1 / 2);
-  a3 = get_ans_se( 0, k0, k1);
-  a3 = get_ans_se(a3, k0 + 1, k2);
-  a3 = get_ans_se(a3, k0, -k3 - 1);
-  a3 = get_ans_se(a3, k0, k4 + 1);
-  a3 = get_ans_se(a3, k1 / 2, k2 / 2);
-  a3 = get_ans_se(a3, k1, -k3 - 1);
-  a3 = get_ans_se(a3, k1, k4 + 1);
-  a4 = get_ans_se( 0, k2, k3);
-  a4 = get_ans_se(a4, k2, k4);
-  a4 = get_ans_se(a4, k3, k4);
-  a4 = get_ans_se(a4, k0 / 2, k1 / 2);
-  return a1 + a2 + a3 + a4;
-}

Student/task3/Test/Medium/itera_sqrt.out

@@ -1,2 +0,0 @@
-20
-0

Student/task3/Test/Medium/itera_sqrt.sy

@@ -1,27 +0,0 @@
-int fsqrt(int a)
-{
-    int x0=0;
-    int x1;
-    x1=a/2;
-    while(x0-x1!=0)
-    {
-        x0=x1;
-        x1=(x0+a/x0);
-        x1=x1/2;
-    }
-
-    return x1;
-
-}
-
-int main()
-{
-    int a;
-    a=400;
-    int res;
-    res=fsqrt(a);
-    putint(res);
-    res = 10;
-    putch(res);
-    return 0;
-}

Student/task3/Test/Medium/long_array.out

@@ -1,2 +0,0 @@
-02425294124166176216218-22282-34782142718170218357718485218672718700218877718865218842718825218832718815218822718825218832718815218822718805218
-216

Student/task3/Test/Medium/long_array.sy

@@ -1,61 +0,0 @@
-const int N = 10000;
-
-int long_array(int k) {
-  int a1[N];
-  int a2[N];
-  int a3[N];
-  int i = 0;
-  while (i < N) {
-    a1[i] = (i * i) % 10;
-    i = i + 1;
-  }
-  i = 0;
-  while (i < N) {
-    a2[i] = (a1[i] * a1[i]) % 10;
-    i = i + 1;
-  }
-  i = 0;
-  while (i < N) {
-    a3[i] = (a2[i] * a2[i]) % 100 + a1[i];
-    i = i + 1;
-  }
-  int ans = 0;
-  i = 0;
-  while (i < N) {
-    if (i < 10) {
-      ans = (ans + a3[i]) % 1333;
-      putint(ans);
-    }
-    else if (i < 20) {
-      int j = N / 2;
-      while (j < N) {
-        ans = ans + a3[i] - a1[j];
-        j = j + 1;
-      }
-      putint(ans);
-    }
-    else if (i < 30) {
-      int j = N / 2;
-      while (j < N) {
-        if (j > 2233) {
-          ans = ans + a2[i] - a1[j];
-          j = j + 1;
-        }
-        else {
-          ans = (ans + a1[i] + a3[j]) % 13333;
-          j = j + 2;
-        }
-      }
-      putint(ans);
-    }
-    else {
-      ans = (ans + a3[i] * k) % 99988;
-    }
-    i = i + 1;
-  }
-  return ans;
-}
-
-int main() {
-  return long_array(9);
-}

Student/task3/Test/Medium/many_locals.out

@@ -1,2 +0,0 @@
-254
-0

Student/task3/Test/Medium/many_locals.sy

@@ -1,39 +0,0 @@
-
-int foo()
-{
-    int arr[16] = {0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3};
-
-    int a = 3, b = 7, c = 5, d = 6, e = 1, f = 0, g = 3, h = 5,
-        i = 4, j = 2, k = 7, l = 9, m = 8, n = 1, o = 4, p = 6;
-
-    int sum1 = a + b + c + d + e + f + g + h;
-    int sum2 = i + j + k + l + m + n + o + p;
-
-    return sum1 + sum2 + arr[a];
-}
-
-int main()
-{
-    int a = 3, b = 7, c = 5, d = 6, e = 1, f = 0, g = 3, h = 5,
-        i = 4, j = 2, k = 7, l = 9, m = 8, n = 1, o = 4, p = 6;
-
-    int sum1 = a + b + c + d + e + f + g + h;
-    int sum2 = i + j + k + l + m + n + o + p;
-
-    sum1 = sum1 + foo();
-
-    int q = 4, r = 7, s = 2, t = 5, u = 8, v = 0, w = 6, x = 3;
-
-    sum2 = sum2 + foo();
-
-    a = i; b = j; c = k; d = l;
-    e = m; f = n; g = o; h = p;
-
-    int sum3 = q + r + s + t + u + v + w + x;
-
-    int sum = sum1 + sum2 + sum3;
-
-    putint(sum);
-    putch(10);
-    return 0;
-}

Student/task3/Test/Medium/many_param_call.out

@@ -1,2 +0,0 @@
-1054100
-0

Student/task3/Test/Medium/many_param_call.sy

@@ -1,112 +0,0 @@
-// Call a func with many params.
-
-int testParam8(int a0, int a1, int a2, int a3,
-        int a4, int a5, int a6, int a7) {
-    return a0 + a1 - a2 - a3 - a4 + a5 + a6 + a7;
-}
-
-int testParam16(int a0, int a1, int a2, int a3,
-        int a4, int a5, int a6, int a7,
-        int a8, int a9, int a10, int a11,
-        int a12, int a13, int a14, int a15) {
-    return a0 + a1 + a2 + a3 + a4 + a5 + a6 + a7 -
-            a8 + a9 + a10 + a11 + a12 + a13 + a14 + a15;
-}
-
-int testParam32(int a0, int a1, int a2, int a3,
-        int a4, int a5, int a6, int a7,
-        int a8, int a9, int a10, int a11,
-        int a12, int a13, int a14, int a15,
-        int a16, int a17, int a18, int a19,
-        int a20, int a21, int a22, int a23,
-        int a24, int a25, int a26, int a27,
-        int a28, int a29, int a30, int a31) {
-    return a0 + a1 + a2 + a3 + a4 + a5 + a6 + a7 +
-            a8 + a9 + a10 + a11 - a12 - a13 - a14 - a15 -
-            a16 - a17 - a18 - a19 - a20 - a21 + a22 + a23 +
-            a24 + a25 + a26 + a27 + a28 + a29 + a30 + a31;
-}
-
-int main() {
-    int a0;
-    int a1;
-    int a2;
-    int a3;
-    int a4;
-    int a5;
-    int a6;
-    int a7;
-    int a8;
-    int a9;
-    int a10;
-    int a11;
-    int a12;
-    int a13;
-    int a14;
-    int a15;
-    int a16;
-    int a17;
-    int a18;
-    int a19;
-    int a20;
-    int a21;
-    int a22;
-    int a23;
-    int a24;
-    int a25;
-    int a26;
-    int a27;
-    int a28;
-    int a29;
-    int a30;
-    int a31;
-    a0 = 0;
-    a1 = 1;
-    a2 = 2;
-    a3 = 3;
-    a4 = 4;
-    a5 = 5;
-    a6 = 6;
-    a7 = 7;
-    a8 = 8;
-    a9 = 9;
-    a10 = 0;
-    a11 = 1;
-    a12 = 2;
-    a13 = 3;
-    a14 = 4;
-    a15 = 5;
-    a16 = 6;
-    a17 = 7;
-    a18 = 8;
-    a19 = 9;
-    a20 = 0;
-    a21 = 1;
-    a22 = 2;
-    a23 = 3;
-    a24 = 4;
-    a25 = 5;
-    a26 = 6;
-    a27 = 7;
-    a28 = 8;
-    a29 = 9;
-    a30 = 0;
-    a31 = 1;
-    a0 = testParam8(a0, a1, a2, a3, a4, a5, a6, a7);
-    putint(a0);
-    a0 = testParam16(a0, a1, a2, a3,
-            a4, a5, a6, a7,
-            a8, a9, a10, a11,
-            a12, a13, a14, a15);
-    putint(a0);
-    a0 = testParam32(a0, a1, a2, a3,
-            a4, a5, a6, a7,
-            a8, a9, a10, a11,
-            a12, a13, a14, a15,
-            a16, a17, a18, a19,
-            a20, a21, a22, a23,
-            a24, a25, a26, a27,
-            a28, a29, a30, a31);
-    putint(a0);
-    return 0;
-}

Student/task3/Test/Medium/max_subsequence_sum.out

@@ -1 +0,0 @@
-25

Student/task3/Test/Medium/max_subsequence_sum.sy

@@ -1,30 +0,0 @@
-int nums[10];
-int maxSubArray(int n) {
-    if(n == 0)
-        return 0;
-    if(n == 1)
-        return nums[0];
-    int sum;
-    sum = nums[0];
-    int max;
-    max = sum;
-    int i;
-    i = 1;
-    while(i < n){
-        if(sum < 0)
-            sum = 0;
-        sum = sum + nums[i];
-        if(max < sum)
-            max = sum;
-        i = i + 1;
-    }
-    return max;
-}
-int main(){
-    int res;
-    nums[0]=-4;nums[1]=3;nums[2]=9;nums[3]=-2;nums[4]=0;
-    nums[5]=1;nums[6]=-6;nums[7]=5;nums[8]=7;nums[9]=8;
-    res = 10;
-    res = maxSubArray(res);
-    return res;
-}

Student/task3/Test/Medium/minus_with_sub.out

@@ -1,2 +0,0 @@
-0
-0

Student/task3/Test/Medium/minus_with_sub.sy

@@ -1,10 +0,0 @@
-// Use minus with sub in one expr
-int main () {
-    int a;
-    int b;
-    a = -2;
-    b = 1;
-    a = a - -b + -(a + b) % -(a - b);
-    putint(a);
-    return 0;
-}

Student/task3/Test/Medium/neg_zero.out

@@ -1 +0,0 @@
-1

Student/task3/Test/Medium/neg_zero.sy

@@ -1,13 +0,0 @@
-int inc(int n){
-    return n + 1;
-}
-
-int zero(){
-    return 0;
-}
-
-int main(){
-    if (-zero())
-        return zero();
-    return inc(zero());
-}

Student/task3/Test/Medium/nested_calls.out

@@ -1,2 +0,0 @@
-4
-0

Student/task3/Test/Medium/nested_calls.sy

@@ -1,16 +0,0 @@
-int f(int a, int b) {
-	return a * b;
-}
-
-int g(int a, int b) {
-	return a % b;
-}
-
-int h(int a, int b) {
-	return f(f(2, g(a, b)), g(f(a, b), 4));
-}
-
-int main () {
-	putint(h(11, 3));
-	return 0;
-}

Student/task3/Test/Medium/recursion_test.out

@@ -1 +0,0 @@
-24

Student/task3/Test/Medium/recursion_test.sy

@@ -1,14 +0,0 @@
-int fact(int n) {
-  if (n == 0) {
-    return 1;
-  }
-  int nn;
-  nn = n-1;
-  return (n * fact(nn));
-}
-
-int main() {
-  int n;
-  n = 4;
-  return fact(n);
-}

Student/task3/Test/Medium/register_realloc.out

@@ -1 +0,0 @@
-132

Student/task3/Test/Medium/register_realloc.sy

@@ -1,52 +0,0 @@
-int func(int a, int b){
-    int i;
-    i = a + b;
-
-    int c1;int c2;int c3;int c4;
-    int d1;int d2;int d3;int d4;
-    int e1;int e2;int e3;int e4;
-    int f1;int f2;int f3;int f4;
-    int g1;int g2;int g3;int g4;
-    int h1;int h2;int h3;int h4;
-    int i1;int i2;int i3;int i4;
-    int j1;int j2;int j3;int j4;
-    int k1;int k2;int k3;int k4;    
-    c1 = 1;c2 = 2;c3 = 3;c4 = 4;
-    d1 = 1 + c1;d2 = 2 + c2;d3 = 3 + c3;d4 = 4 + c4;
-    e1 = 1 + d1;e2 = 2 + d2;e3 = 3 + d3;e4 = 4 + d4;
-    f1 = 1 + e1;f2 = 2 + e2;f3 = 3 + e3;f4 = 4 + e4;
-    g1 = 1 + f1;g2 = 2 + f2;g3 = 3 + f3;g4 = 4 + f4;
-    h1 = 1 + g1;h2 = 2 + g2;h3 = 3 + g3;h4 = 4 + g4;
-    i1 = 1 + h1;i2 = 2 + h2;i3 = 3 + h3;i4 = 4 + h4;
-    j1 = 1 + i1;j2 = 2 + i2;j3 = 3 + i3;j4 = 4 + i4;
-    k1 = 1 + j1;k2 = 2 + j2;k3 = 3 + j3;k4 = 4 + j4;
-
-    i = a - b + 10;
-    k1 = 1 + j1;k2 = 2 + j2;k3 = 3 + j3;k4 = 4 + j4;
-    j1 = 1 + i1;j2 = 2 + i2;j3 = 3 + i3;j4 = 4 + i4;
-    i1 = 1 + h1;i2 = 2 + h2;i3 = 3 + h3;i4 = 4 + h4;
-    h1 = 1 + g1;h2 = 2 + g2;h3 = 3 + g3;h4 = 4 + g4;
-    g1 = 1 + f1;g2 = 2 + f2;g3 = 3 + f3;g4 = 4 + f4;
-    f1 = 1 + e1;f2 = 2 + e2;f3 = 3 + e3;f4 = 4 + e4;
-    e1 = 1 + d1;e2 = 2 + d2;e3 = 3 + d3;e4 = 4 + d4;
-    d1 = 1 + c1;d2 = 2 + c2;d3 = 3 + c3;d4 = 4 + c4;
-    c1 = 1 + k1;c2 = 2 + k2;c3 = 3 + k3;c4 = 4 + k4;
-    return i + c1 + c2 + c3 + c4 
-        - d1 - d2 - d3 - d4 
-        + e1 + e2 + e3 + e4 
-        - f1 - f2 - f3 - f4 
-        + g1 + g2 + g3 + g4 
-        - h1 - h2 - h3 - h4 
-        + i1 + i2 + i3 + i4 
-        - j1 - j2 - j3 - j4 
-        + k1 + k2 + k3 + k4 ;
-}
-
-int main(){
-    int a;
-    int b;
-    a = 1;
-    b = a + 2*9;
-
-    return func(a, b);
-}

Student/task3/Test/Medium/return_after_break.out

@@ -1 +0,0 @@
-2

Student/task3/Test/Medium/return_after_break.sy

@@ -1,16 +0,0 @@
-const int arr[5] = {1,3,4,2};
-int a = 0;
-
-int main(){
-    int cnt = 0;
-    while (a < arr[a]) {
-        a = arr[a];
-        if (arr[a + arr[a] - 1] > arr[a] - 1.5) {
-            cnt = arr[cnt] + 1;
-        } else {
-            break;
-            return 1;
-        }
-    }
-    return cnt;
-}

Student/task3/Test/Medium/reverse_output.in

@@ -1,200 +0,0 @@
-0
-3
-6
-9
-12
-15
-18
-21
-24
-27
-30
-33
-36
-39
-42
-45
-48
-51
-54
-57
-60
-63
-66
-69
-72
-75
-78
-81
-84
-87
-90
-93
-96
-99
-102
-105
-108
-111
-114
-117
-120
-123
-126
-129
-132
-135
-138
-141
-144
-147
-150
-153
-156
-159
-162
-165
-168
-171
-174
-177
-180
-183
-186
-189
-192
-195
-198
-201
-204
-207
-210
-213
-216
-219
-222
-225
-228
-231
-234
-237
-240
-243
-246
-249
-252
-255
-258
-261
-264
-267
-270
-273
-276
-279
-282
-285
-288
-291
-294
-297
-300
-303
-306
-309
-312
-315
-318
-321
-324
-327
-330
-333
-336
-339
-342
-345
-348
-351
-354
-357
-360
-363
-366
-369
-372
-375
-378
-381
-384
-387
-390
-393
-396
-399
-402
-405
-408
-411
-414
-417
-420
-423
-426
-429
-432
-435
-438
-441
-444
-447
-450
-453
-456
-459
-462
-465
-468
-471
-474
-477
-480
-483
-486
-489
-492
-495
-498
-501
-504
-507
-510
-513
-516
-519
-522
-525
-528
-531
-534
-537
-540
-543
-546
-549
-552
-555
-558
-561
-564
-567
-570
-573
-576
-579
-582
-585
-588
-591
-594
-597

Student/task3/Test/Medium/reverse_output.out

@@ -1,2 +0,0 @@
-5975945915885855825795765735705675645615585555525495465435405375345315285255225195165135105075045014984954924894864834804774744714684654624594564534504474444414384354324294264234204174144114084054023993963933903873843813783753723693663633603573543513483453423393363333303273243213183153123093063033002972942912882852822792762732702672642612582552522492462432402372342312282252222192162132102072042011981951921891861831801771741711681651621591561531501471441411381351321291261231201171141111081051029996939087848178757269666360575451484542393633302724211815129630
-0

Student/task3/Test/Medium/reverse_output.sy

@@ -1,18 +0,0 @@
-void reverse(int n) {
-	int next;
-	if (n <= 1) {
-		next=getint();
-		putint(next);
-	}
-	else {
-		next=getint();
-		reverse(n-1);
-		putint(next);
-	}
-}
-
-int main() {
-	int i=200;
-	reverse(i);
-	return 0;
-}

Student/task3/Test/Medium/side_effect.out

@@ -1 +0,0 @@
-5

Student/task3/Test/Medium/side_effect.sy

@@ -1,13 +0,0 @@
-int a = 1;
-
-int inc_a(){
-    a = a + 2;
-    return a - 2;
-}
-
-int main(){
-    if (inc_a() - a > a - inc_a()) {
-        return a;
-    }
-    return inc_a();
-}

Student/task3/Test/Medium/skip_spaces.in

@@ -1,3 +0,0 @@
-1 2 3 4 5 6 7 8 9 10
-11 12 13 14 15 16 17 18 19 20
-23 233 2333 23333 233333 0 0

Student/task3/Test/Medium/skip_spaces.out

@@ -1 +0,0 @@
-55

Student/task3/Test/Medium/skip_spaces.sy

@@ -1,22 +0,0 @@
-// ???  // ????
-  				// ?????
-/*
-
-int main() {
-  int arr[100], i = 0, sum = 0;
-  while (getint()) {
-  	arr[i] = getint();
-    i = i + 1;
-  }*/
-int main() {
-  int arr[100], i = 0, sum = 0;
-  while (getint()) {
-  	arr[i] = getint();
-    i = i + 1;
-  }
-	while (i) {
-    i = i - 1;
-    sum = sum + arr[i];
-  }
-  return sum % 79;
-}

Student/task3/Test/Medium/sort_test1.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test1.sy

@@ -1,41 +0,0 @@
-int n;
-int a[10];
-int bubblesort()
-{
-    int i;
-    int j;
-    i =0; 
-    while(i < n-1){
-    // Last i elements are already in place
-        j = 0;
-        while(j < n-i-1){
-            if (a[j] > a[j+1]) {
-                // swap(&a[j], &a[j+1]); 
-                int tmp;
-                tmp = a[j+1];
-                a[j+1] = a[j];
-                a[j] = tmp;
-            }
-            j = j + 1;
-        }
-        i = i + 1;
-    }
-    return 0;
-}
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = bubblesort();
-    while (i < n) {
-        int tmp;
-        tmp = a[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}

Student/task3/Test/Medium/sort_test2.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test2.sy

@@ -1,43 +0,0 @@
-int n;
-int a[10];
-int insertsort()
-{
-    int i;
-    i = 1;
-    while(i<n)     
-    {
-        int temp;
-        temp=a[i]; 
-        int j;
-        j=i-1;
-        while(j>-1)
-        {
-            if (temp < a[j]) {
-                a[j+1]=a[j];  
-                j = j - 1;
-            } else {
-                break;
-            }
-        }
-        a[j+1]=temp; 
-        i = i + 1;
-    }
-    return 0;
-}
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = insertsort();
-    while (i < n) {
-        int tmp;
-        tmp = a[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}

Student/task3/Test/Medium/sort_test3.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test3.sy

@@ -1,72 +0,0 @@
-int n;
-int a[10];
-int QuickSort(int low, int high)
-{
-    if (low < high)
-    {
-        int i;
-        i = low;
-        int j;
-        j = high;
-        int k;
-        k = a[low];
-        while (i < j)
-        {
-            while(i < j)
-            {
-                if (a[j] > k - 1)
-                    j = j - 1;
-                else
-                    break;
-            }
-
-            if(i < j)
-            {
-                a[i] = a[j];
-                i = i + 1;
-            }
- 
-            while(i < j)
-            {
-                if (a[i] < k)
-                    i = i + 1;
-                else
-                    break;
-            }
-
-            if(i < j)
-            {
-                a[j] = a[i];
-                j = j - 1;
-            }
-        }
- 
-        a[i] = k;
-        int tmp;
-        tmp = i - 1;
-        tmp = QuickSort(low, tmp);
-        tmp = i + 1;
-        tmp = QuickSort(tmp, high);
-    }
-    return 0;
-}
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = 0;
-    int tmp;
-    tmp = 9;
-    i = QuickSort(i, tmp);
-    while (i < n) {
-        int tmp;
-        tmp = a[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}

Student/task3/Test/Medium/sort_test4.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test4.sy

@@ -1,49 +0,0 @@
-int n;
-int a[10];
-int select_sort(int n)
-{
-    int i;
-    int j;
-    int min;
-    i =0;
-    while(i < n-1)
-    {
-        min=i;//
-        j = i + 1;
-        while(j < n)
-        {
-            if(a[min]>a[j])
-            {
-                min=j;
-            }
-            j=j+1;
-        }
-        if(min!=i)
-        {
-            int tmp;
-            tmp = a[min];
-            a[min] = a[i];
-            a[i] = tmp;
-        }
-        i = i + 1;
-    }
-    return 0;
-}
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = 0;
-    i = select_sort(n);
-    while (i < n) {
-        int tmp;
-        tmp = a[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}

Student/task3/Test/Medium/sort_test5.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test5.sy

@@ -1,66 +0,0 @@
-int n;
-int a[10];
-int swap (int i, int j){
-    int temp;
-    temp = a[i];
-    a[i] = a[j];
-    a[j] = temp;
-    return 0;  
-}
-int heap_ajust(int start, int end) {  
-    int dad;
-    dad = start;  
-    int son;
-    son = dad * 2 + 1;  
-    while (son < end + 1) { //   
-        if (son < end)
-            if (a[son] < a[son + 1])
-                son = son + 1;  
-        if (a[dad] > a[son])
-            return 0;  
-        else {
-            dad = swap(dad,son);  
-            dad = son;  
-            son = dad * 2 + 1;  
-        }  
-    }  
-    return 0;  
-}  
-int heap_sort(int len) {  
-    int i;  
-    int tmp;
-    i = len / 2 - 1;
-    while ( i > -1) {
-        tmp = len - 1;
-        tmp = heap_ajust(i, tmp);  
-        i = i - 1;
-    }    
-    i = len - 1;   
-    while ( i > 0) {  
-        int tmp0;
-        tmp0 = 0;
-        tmp = swap(tmp0,i);
-        tmp = i - 1;
-        tmp = heap_ajust(tmp0, tmp);  
-        i = i-1;
-    }  
-    return 0;
-}  
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = 0;
-    i = heap_sort(n);
-    while (i < n) {
-        int tmp;
-        tmp = a[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}

Student/task3/Test/Medium/sort_test6.out

@@ -1,11 +0,0 @@
-0
-1
-2
-3
-4
-5
-6
-7
-8
-9
-0

Student/task3/Test/Medium/sort_test6.sy

@@ -1,53 +0,0 @@
-int n;
-int a[10];
-int b[10];
-
-int counting_sort(int n) {
-	int count_arr[10];
-	int i;
-    int j;
-    int k;
-    k = 0;
-    i = 0;
-    j = 0;
-	while(k < 10){
-		count_arr[k] = 0;
-        k = k + 1;
-    }
-    while(i < n)
-    {
-		count_arr[a[i]] = count_arr[a[i]] + 1;
-        i = i + 1;
-    }
-    k = 1;
-	while(k < 10){
-		count_arr[k] = count_arr[k] + count_arr[k - 1];
-        k = k + 1;
-    }
-    j = n;
-	while( j > 0){
-        count_arr[a[j - 1]] = count_arr[a[j - 1]] - 1;
-		b[count_arr[a[j - 1]]] = a[j - 1];
-        j = j - 1;
-    }
-    return 0;
-}
-
-
-int main(){
-    n = 10;
-    a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
-    a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
-    int i;
-    i = 0;
-    i = counting_sort(n);
-    while (i < n) {
-        int tmp;
-        tmp = b[i];
-        putint(tmp);
-        tmp = 10;
-        putch(tmp);
-        i = i + 1;
-    }
-    return 0;
-}