c++模板

#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <map>
#include <stack>
#include <cmath>
#include <iomanip>
#include <set>
#include <cmath>
#include <cctype>

#include<climits>
//INT_MAX 32 bit int
//LLONG_MAX 64 bit int
//LONG_MAX 64 bit int

using namespace std;

#define SPO(n) fixed << setprecision(n)
#define endl '\n'
#define ifor(i, l, r) for (long long(i) = (l); (i) <= (r); ++(i))
#define rfor(i, r, l) for (long long(i) = (r); (i) >= (l); --(i))

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned long long ull;

const int IINF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1.0e-9;
const long long MOD = 1e9 + 7;
const long long MAX = 1e5 + 5;
//ll a[MAX];
//memset(a, 0x3f, sizeof(a));


//#define start
#ifndef start
//__int128读取
__int128 read() {
    __int128 f = 1, w = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch <= '9' && ch >= '0') {
        w = w * 10 + ch - '0';
        ch = getchar();
    }
    return f * w;
}

void print(__int128 x) {
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    if (x > 9)print(x / 10);
    putchar(x % 10 + '0');
}

#endif

void solve() {
    ll n;
    scanf("%lld", &n);
    printf("%lld\n", n);
    return;
}

int main() {
//#define start1
#ifndef start1
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif


    return 0;
}