| 64 | // } |
| 65 | |
| 66 | void test() { |
| 67 | // for (int i = 0; i < 1000; i++) |
| 68 | // { |
| 69 | // for (int j = 0; j < 1000; j++) |
| 70 | // { |
| 71 | // assert_true(eq(karatsuba(intx(i), intx(j)), intx(i) * intx(j)), true); |
| 72 | // } |
| 73 | // } |
| 74 | |
| 75 | // multiplication_speed(); |
| 76 | // return; |
| 77 | |
| 78 | // cout << (intx(-10) < intx(-5)) << endl; |
| 79 | // cout << intx(-5) << endl; |
| 80 | // cout << intx(-10) << endl; |
| 81 | // cout << intx(-5) - intx(-10) << endl; |
| 82 | // cout << intx(-10) - intx(-5) << endl; |
| 83 | // return; |
| 84 | |
| 85 | ifstream input("intx.test.in"); |
| 86 | |
| 87 | set<string> enabled_ops; |
| 88 | enabled_ops.insert("add"); |
| 89 | enabled_ops.insert("sub"); |
| 90 | enabled_ops.insert("neg"); |
| 91 | enabled_ops.insert("lt"); |
| 92 | enabled_ops.insert("mul"); |
| 93 | enabled_ops.insert("div"); |
| 94 | enabled_ops.insert("mod"); |
| 95 | enabled_ops.insert("fib"); |
| 96 | enabled_ops.insert("fac"); |
| 97 | enabled_ops.insert("gcd"); |
| 98 | |
| 99 | // int line = 0, n; |
| 100 | int n; |
| 101 | string op, s, ans; |
| 102 | intx a, b; |
| 103 | while (input >> op) { |
| 104 | |
| 105 | // printf("%d %s\n", ++line, op.c_str()); |
| 106 | |
| 107 | intx res; |
| 108 | if (op == "add") { |
| 109 | input >> s; |
| 110 | a = intx(s); |
| 111 | input >> s; |
| 112 | b = intx(s); |
| 113 | } else if (op == "sub") { |
| 114 | input >> s; |
| 115 | a = intx(s); |
| 116 | input >> s; |
| 117 | b = intx(s); |
| 118 | } else if (op == "mul") { |
| 119 | input >> s; |
| 120 | a = intx(s); |
| 121 | input >> s; |
| 122 | b = intx(s); |
| 123 | } else if (op == "div") { |
nothing calls this directly
no test coverage detected