#include <iostream>
#include <cstddef>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

int a[10010];//自动清零

int main() {
    cout << "SAS 必胜！" << endl;

    short a1;
    int b1;
    long long c1;
    //一般来讲2 4 8字节
    unsigned short ua1;
    unsigned int ub1;
    unsigned long long uc1;

    size_t t1 = SIZE_MAX;
    //C中任何对象所能达到的最大长度，在数组下标和内存管理函数之类的地方广泛使用
    //它默认unsigned

    float a2;//4
    double b2;//8
    long double c2;//16 不常用

    char cc = 'a';
    unsigned char ucc;//一个字节
    int ca = (int)cc;
    //参考ASCII码

    bool flag = true;

    a1 = 2 * 2;
    a1 = a1 / 2;
    a1 /= 2;

    ucc = 0b1111 + 0xFF + 0123;
    ucc = 123 & (321 | 132);
    ucc = 123 << 2;
    ucc >>= 1;
    ucc = ucc ^ 0b11001;

    ucc ^= cc ^= ucc ^= cc;

    flag = (1 + 2 == 0 || (1 - 2 >= -1 && flag));
    //布尔表达式：计算一个命题的真假

    if(flag) {
        cout << "123" << endl;
    }
    else if(ucc >= 1) {
        cout << "312" << endl;
    }
    else {
        cout << "321" << endl;
    }

    if(ucc < 0) {
        a1 = 123;
    }
    else a1 = 321;

    a1 = (ucc < 0) ? 123 : 321;
    //是这样吗？是就123，不是就321

    for(int bot = 1; b1 > 0; bot *= bot) {
        a1 *= bot;
        b1 >>= 1;
    }

    int bot = 1;
    while(b1 > 0) {
        a1 *= bot;
        b1 >>= 1;
        bot *= bot;
    }

    string str;
    cin >> str;
    cout << str + str << endl;
    str = "\r\n\t\b\"\'\\";
    //CR LF

    scanf("%d", &a1);
    printf("%d + %d = %d\n", a1, a1, a1 + a1);
    //占位符，后面的变量会按顺序填到这里面

    int aa[10010], ind = 1;//不自动清零
    aa[ind] = 123;

    vector<double> vec;

    return 0;
}

int gcd(int a, int b) {
    return b ? gcd(b, a % b) : a;
}

struct node {
    int weight;
    int nxt;
}nodes1[10010], anode;

node nodes2[10010], anode2;