fengjunxiao2014的省资源

源码:

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int unsigned long long
#define endl "\n"
#define fast ios::sync_with_stdio(false);cin.tie(nullptr), cout.tie(nullptr);
#define up(i,a,b) for( int i=(a); i<=(b); ++i)
#define down(i,a,b) for( int i=(a); i>=(b); --i)
#define priority_queue pq
#define I using
#define AK namespace
#define IOI std
#define _i return
#define ak 0
#define ioi_ ;
I AK IOI;
inline void read(int& a) {
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        s = s * 10 + ch - '0';
        ch = getchar();
    }
    a = s * w;
}
inline void write(int x) {
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
signed main() {
    fast
    
    _i ak ioi_
}

带注释的:

#pragma GCC optimize(3) //启用O3优化,以求更快的运行速度
#include <bits/stdc++.h> //万能头文件
#define int unsigned long long //这个就是方便一点,不用每次打那么长的数据结构了
#define endl "\n" //都是换行,但是斜杠 n 比 endl 快一点
#define fast ios::sync_with_stdio(false);cin.tie(nullptr), cout.tie(nullptr); //关闭同步流
#define up(i,a,b) for( int i=(a); i<=(b); ++i) //打的方便一点
#define down(i,a,b) for( int i=(a); i>=(b); --i) //也是方便一点
#define priority_queue pq //也是方便一点
#define I using //祈祷
#define AK namespace //祈祷
#define IOI std //祈祷
#define _i return //祈祷
#define ak 0 //祈祷
#define ioi_ ; //祈祷
I AK IOI; //祈祷
inline void read(int& a) { //快读
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        s = s * 10 + ch - '0';
        ch = getchar();
    }
    a = s * w;
}
inline void write(int x) { //快写
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
signed main() {
    fast //关闭同步流(但是其实没用,因为已经用快读快写了)
    
    _i ak ioi_ //祈祷
}
posted @ 2025-08-27 15:26  fengjunxiao2014  阅读(17)  评论(4)    收藏  举报