window.cnblogsConfig = { homeTopImg: [ "https://cdn.luogu.com.cn/upload/image_hosting/clcd8ydf.png", "https://cdn.luogu.com.cn/upload/image_hosting/clcd8ydf.png" ], }

收藏链接

合集 - 杂项(6)
1.收藏链接
2.【转】浅谈调试--赖特3.ZX帅气的板书们4.2023.12.22大神老师的签名5.如何设置博客园的样式6.如何复制不可复制内容
收起

Page Views Count

博客索引

游记类

2023年

复盘类

2023年

模拟赛复盘

收藏技巧

重要博客(知识点)

算法&技巧

重要板子

动态规划

图论&搜索

数据结构

数论

个人草稿区

网站

【链接汇总】

洛谷|SWOJ|学军OJ|AtCoder |LOJ|Codeforces|UVA|USACO|SPOJ|VJ|OIWiki|数据结构与算法演示 |作图器|CSDN |AC源|Alex_Wei 图论笔记|wjyyy博客|LaTeX公式大全|

文件&安装包

文件题单|devc++6.7.5安装包|微软壁纸

CCF官方文件

GD_2023_CSP-J_code|GD_2023_CSP-S code|GD NOIP 2023 code|2023CSP测试数据|NOIP2023测试数据

插件

at 插件|cf插件|exlg|OIso++

有意思的东西

洛谷试炼场（公开）|烧机神器

copy别人的主页---干货

U盘解限：

  1. HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\USBSTOR\Start 设为 3；
  2. 用户配置→管理模板→Windows组件→Windows资源管理器→防止从“我的电脑”访问驱动器 设为“不限制驱动器”；
  3. 计算机配置→管理模板→系统→可移动存储访问→所有可移动存储类：拒绝所有权限；
  4. 运行cmd命令 sc stop TDFileFilter 和 sc delete TDFileFilter；

模板题

普及−
普及/提高−
普及+/提高
提高+/省选−
省选/NOI−1
省选/NOI−2
NOI/NOI+/CTSC

//好玩的颜色：
//F39C11：普及
//FFC116：普及/提高-
//52C41A：普及+/提高
//3498DB：提高+/省选-
//9D3DCF：省选/NOI-
//9D3DCF：省选/NOI-
//0E1D69：NOI/NOI+/CTSC

My 缺省源：

//#pragma omp parallel for num_threads(64)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize(2,3,"Ofast","inline","-fgcse","-fgcse-lm","-fipa-sra","-ftree-pre","-ftree-vrp","-fpeephole2","-ffast-math","-fsched-spec","unroll-loops","-falign-jumps","-falign-loops","-falign-labels","-fdevirtualize","-fcaller-saves","-fcrossjumping","-fthread-jumps","-funroll-loops","-freorder-blocks","-fschedule-insns","inline-functions","-ftree-tail-merge","-fschedule-insns2","-fstrict-aliasing","-falign-functions","-fcse-follow-jumps","-fsched-interblock","-fpartial-inlining","no-stack-protector","-freorder-functions","-findirect-inlining","-fhoist-adjacent-loads","-frerun-cse-after-loop","inline-small-functions","-finline-small-functions","-ftree-switch-conversion","-foptimize-sibling-calls","-fexpensive-optimizations","inline-functions-called-once","-fdelete-null-pointer-checks")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma comment(linker,"/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//--------------------------------------------------------神奇加速

#include<bits/stdc++.h>
//#include<windows.h>

//--------------------------------------------------------

#define ll long long
//#define int unsigned long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define fir first
#define se second
#define endl '\n'
#define end puts("")
#define debug1 puts("AK IOI -- part 1")
#define debug2 puts("AK IOI -- part 2")
#define debug3 puts("AK IOI -- part 3")
#define debug4 puts("AK IOI -- part 4")
#define re register
#define Yes puts("Yes")
#define No puts("No")
#define YES puts("YES")
#define NO puts("NO")
#define yes puts("yes")
#define no puts("no")
#define error puts("error")
#define IMPOSSIBLE puts("IMPOSSIBLE")
#define Impossible puts("Impossible")
#define fy puts("-1")
#define pll pair<long long, long long>
#define AC exit(0)
//
////-------------------------------------------------------define好习惯
//
using namespace std;
namespace gsczl71_function{
	inline int Min(int a, int b) {	return a < b ? a : b;}
	inline int Max(int a, int b) {	return a > b ? a : b;}
	inline void my_swap(int& a,int& b) {a^=b,b^=a,a^=b;}
	inline void to_min(int& a,int b) {if(a>b)a=b;}
	inline void to_max(int& a,int b) {if(a<b)a=b;}
	inline int my_abs(int x){return (x^(x>>31))-(x >> 31);}
	inline ll gcd(ll a,ll b){
		int i=__builtin_ctz(a),j=__builtin_ctz(b),x=i>j?j:i,y;b>>=j;
	    while(a){a>>=i;y=b-a;i=__builtin_ctz(y);b=a<b?a:b;a=y<0?-y:y;}
	    return b<<x;
	}inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
	inline ll jc(ll x,ll p){ll res=1;if(p)for(ll i(1);i<=x;++i)res=(res*i)%p;else for(ll i(1);i<=x;++i)res=(res*i);return res;}
	inline ll mod(ll x, ll y){return x - y * (x / y);}
}
namespace gsczl71_fastIO{//输入后加 Ctrl + z
    #define BUF_SIZE 100000
    #define OUT_SIZE 100000
    //fread->read
    bool IOerror=0;
    inline char nc(){
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if (p1==pend){
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if (pend==p1){IOerror=1;return -1;}
            //{printf("IO error!\n");system("pause");for (;;);exit(0);}
        }
        return *p1++;
    }
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline void read(int &x){
        bool sign=0; char ch=nc(); x=0;
        for (;blank(ch);ch=nc());
        if (IOerror)return;
        if (ch=='-')sign=1,ch=nc();
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
        if (sign)x=-x;
    }
    inline void read(ll &x){
        bool sign=0; char ch=nc(); x=0;
        for (;blank(ch);ch=nc());
        if (IOerror)return;
        if (ch=='-')sign=1,ch=nc();
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
        if (sign)x=-x;
    }
    inline void read(double &x){
        bool sign=0; char ch=nc(); x=0;
        for (;blank(ch);ch=nc());
        if (IOerror)return;
        if (ch=='-')sign=1,ch=nc();
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
        if (ch=='.'){
            double tmp=1; ch=nc();
            for (;ch>='0'&&ch<='9';ch=nc())tmp/=10.0,x+=tmp*(ch-'0');
        }
        if (sign)x=-x;
    }
    inline void read(char *s){
        char ch=nc();
        for (;blank(ch);ch=nc());
        if (IOerror)return;
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch;
        *s=0;
    }
    inline void read(char &c){
        for (c=nc();blank(c);c=nc());
        if (IOerror){c=-1;return;}
    }
    //fwrite->write
    struct Ostream_fwrite{
        char *buf,*p1,*pend;
        Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;}
        void out(char ch){
            if (p1==pend){
                fwrite(buf,1,BUF_SIZE,stdout);p1=buf;
            }
            *p1++=ch;
        }
        void print(int x){
            static char s[15],*s1;s1=s;
            if (!x)*s1++='0';if (x<0)out('-'),x=-x;
            while(x)*s1++=x%10+'0',x/=10;
            while(s1--!=s)out(*s1);
        }
        void println(int x){
            static char s[15],*s1;s1=s;
            if (!x)*s1++='0';if (x<0)out('-'),x=-x;
            while(x)*s1++=x%10+'0',x/=10;
            while(s1--!=s)out(*s1); out('\n');
        }
        void print(ll x){
            static char s[25],*s1;s1=s;
            if (!x)*s1++='0';if (x<0)out('-'),x=-x;
            while(x)*s1++=x%10+'0',x/=10;
            while(s1--!=s)out(*s1);
        }
        void println(ll x){
            static char s[25],*s1;s1=s;
            if (!x)*s1++='0';if (x<0)out('-'),x=-x;
            while(x)*s1++=x%10+'0',x/=10;
            while(s1--!=s)out(*s1); out('\n');
        }
        void print(double x,int y){
            static ll mul[]={1,10,100,1000,10000,100000,1000000,10000000,100000000,
                1000000000,10000000000LL,100000000000LL,1000000000000LL,10000000000000LL,
                100000000000000LL,1000000000000000LL,10000000000000000LL,100000000000000000LL};
            if (x<-1e-12)out('-'),x=-x;x*=mul[y];
            ll x1=(ll)floor(x); if (x-floor(x)>=0.5)++x1;
            ll x2=x1/mul[y],x3=x1-x2*mul[y]; print(x2);
            if (y>0){out('.'); for (size_t i=1;i<(y&&x3*mul[i]<mul[y]);out('0'),++i); print(x3);}
        }
        void println(double x,int y){print(x,y);out('\n');}
        void print(char *s){while (*s)out(*s++);}
        void println(char *s){while (*s)out(*s++);out('\n');}
        void flush(){if (p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}}
        ~Ostream_fwrite(){flush();}
    }Ostream;
    inline void print(int x){Ostream.print(x);}
    inline void println(int x){Ostream.println(x);}
    inline void print(char x){Ostream.out(x);}
    inline void println(char x){Ostream.out(x);Ostream.out('\n');}
    inline void print(ll x){Ostream.print(x);}
    inline void println(ll x){Ostream.println(x);}
    inline void print(double x,int y){Ostream.print(x,y);}	//y为小数点后几位
    inline void println(double x,int y){Ostream.println(x,y);}
    inline void print(char *s){Ostream.print(s);}
    inline void println(char *s){Ostream.println(s);}
    inline void println(){Ostream.out('\n');}
    inline void flush(){Ostream.flush();}			//清空
    #undef OUT_SIZE
    #undef BUF_SIZE
};
using namespace gsczl71_fastIO;
using namespace gsczl71_function;
//-------------------------------------------------------主程序-----------------------------------------------------
//#define int long long
void solve(){

}
signed main(){
//	freopen("std.in","r",stdin);
//	freopen("std.out","w",stdout);
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int TTT=1;
//	scanf("%d",&TTT);
	while(TTT--){
		solve();
	}
	return 0;
}

__EOF__

本文作者：gsczl71
本文链接：https://www.cnblogs.com/gsczl71/p/17857576.html
关于博主：GDSZ初一蒟蒻，明年拿下七级勾
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！
posted @   gsczl71  阅读(226)  评论(0)  编辑  收藏  举报
编辑推荐：
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列：向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列：如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
阅读排行：
· winform 绘制太阳，地球，月球 运作规律
· TypeScript + Deepseek 打造卜卦网站：技术与玄学的结合
· Manus的开源复刻OpenManus初探
· 写一个简单的SQL生成工具
· AI 智能体引爆开源社区「GitHub 热点速览」
点击右上角即可分享
微信分享提示