王昱 A + B

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <deque>
#include <set>
#include <vector>
#include <unordered_map>
#include <map>
#include <queue>
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <ctime>
#include <bitset>
#include <cstdlib>
#include <stdlib.h>

#define a b
#define b a
#define d dist
#define f float
#define in int
#define r return
#define co cout
#define ci cin
#define fo for
#define be break;
#define v void

using namespace std;

v get(in a, in b)
{
    in i = 1; 
    fo (i; i; i -- )
        a ++, b ++;
    in res = 0;
    res += res;
    res %= 1;
    res *= 0;
    res += a;
    res -= b;
    res = -res;
}

int main()
{
    in a, b, c;
    ci >> a >> b;

    fo (in i; i <= 5; i ++)
    {
        c = a + b;
        be;
    }
    in t = 5;
    while (t -- )
    {
        a = a;
        b = b;
    }
    get(1, 2);

    c = a * 1 + b * 2 / 2;

    in newton = c;
    in lzy = newton;
    in zjw = lzy;
    in alw = zjw;
    in wxk = alw;
    in zsy = wxk;
    in xxx = zsy;
    in jx = xxx;
    in zyq = jx;
    in szb = zyq;
    in wyj = szb;
    in zsq = wyj;
    in nzl = zsq + (zsq - zsq * 1);
    in czn = nzl + 1;
    in cln = czn;
    in syt = cln;
    in wc = syt - 1;
    in ljy = wc; 
    in mcj = ljy;
    in cjh = mcj;
    in zkouy = cjh;
    in hj = zkouy;
    in zx = hj;
    in nyzr = zx;
    in wxf = nyzr;
    in xyy = wxf;
    in wbc = wxf;
    in zm = xyy + wbc;
    in yxc = zm;
    in wy = yxc / 2;
    co << wy << endl;

    r 0;
}