首页 > 其他分享 >收藏链接

收藏链接

时间:2023-11-26 17:22:30浏览次数:34  
标签:ch puts int 收藏 inline buf 链接 define

Page Views Count

博客索引

游记类

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测试数据

插件

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

有意思的东西

洛谷试炼场(公开)|烧机神奇

U盘解限:

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

模板题

\(\color{F39C11}普及-\)
\(\color{FFC116}普及/提高-\)
\(\color{52C41A}普及+/提高\)
\(\color{3498DB}提高+/省选-\)
\(\color{9D3DCF}省选/NOI-1\)
\(\color{9D3DCF}省选/NOI- 2\)
\(\color{0E1D69}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;
}

标签:ch,puts,int,收藏,inline,buf,链接,define
From: https://www.cnblogs.com/gsczl71/p/17857576.html

相关文章

  • 14:苏格拉底问答、实践过程截图、遇到问题解决问题截图,代码链接、
    ......
  • 苏格拉底问答、实践过程截图、遇到问题解决问题截图,代码链接
    include<stdio.h>include<stdlib.h>include<sys/types.h>include<sys/socket.h>include<netinet/in.h>include<arpa/inet.h>include<time.h>include<string.h>include<unistd.h>defineMAXLINE256......
  • 值得收藏的一些HTML、JavaScript、ASP代码
    1.CDONTS.NewMail组件使用说明 SetMailObject=Server.CreateObject("CDONTS.NewMail") MailObject.From="发信邮箱" MailObject.To="收信邮箱" MailObject.Cc="抄送邮箱" MailObject.Bcc="密送邮箱" MailObject.Subject=&qu......
  • .net抓取html文本中的链接集合
    publicstaticvoidGetListHtmlString(stringcontent,stringsearchStr,List<string>list){if(string.IsNullOrEmpty(content)||string.IsNullOrEmpty(searchStr))return;intthisIndex=0;while(true){intstartIndex=content.IndexOf(searchStr,......
  • 链接私有库文件
    原文地址:https://www.cnblogs.com/liqinglucky/p/link-libso.html当我们自己编译了个bin文件,这个文件运行依赖自己编译的私有库。在没有做链接的情况,直接运行bin文件会报错#./test-bin-1.0.1./test-bin-1.0.1:errorwhileloadingsharedlibraries:libtest.so.1.0.1:canno......
  • 2023最全的Web自动化测试介绍(建议收藏)
    做测试的同学们都了解,做Web自动化,我们主要用Selenium或者是QTP。有的人可能就会说,我没这个Java基础,没有Selenium基础,能行吗?测试虽然属于计算机行业,但其实并不需要太深入的编程知识!01、行业现状我们先看看目前的行业现状:​测试行业现在70%是以手工测试为主,那么只有20%是自动化......
  • 稳定性保障8个锦囊,建议收藏!
    稳定性保障,是一切技术工作的出发点和落脚点,也是IT工作最核心的价值体现,当然也是技术人员最容易“翻车”的阴沟。8个稳定性保障锦囊,分享给各位技术人员择机使用。#1设定可量化的、业务可理解的可用性目标没有度量就没有改进。GoogleSRE曾在其工程实践中,就引入了针对服务可......
  • 稳定性保障8个锦囊,建议收藏!
    稳定性保障,是一切技术工作的出发点和落脚点,也是IT工作最核心的价值体现,当然也是技术人员最容易“翻车”的阴沟。8个稳定性保障锦囊,分享给各位技术人员择机使用。#1设定可量化的、业务可理解的可用性目标没有度量就没有改进。GoogleSRE曾在其工程实践中,就引入了针对服务可靠性......
  • 为Oracle链接服务器使用分布式事务
    1现象在SQLServer中创建指向Oracle的链接服务器,SQL语句在事务中向链接服务器插入数据。返回链接服务器无法启动分布式事务的报错。 2解决在Windows平台下,SQLServer依赖分布式事务协调器(MSDTC)来使用分布式事务,OracleClient使用OracleServicesforMicrosoftTransact......
  • 如何在 Dash 中使表格的单元格值超链接? (使用 Plotly、Dash、Pandas 等)
    要在Dash中使表格的单元格值超链接,您可以使用dash_table.DataTable组件和Pandas数据框。以下是一个基本示例代码,演示了如何将表格中的某些单元格值转换为超链接:首先,确保已完成以下安装:pipinstalldashpipinstallpandas然后,使用以下代码创建一个具有超链接单元格值的Dash......