• 超快读快写 & 火车头


    emm……卡常必备。

    超快读快写

    //#include<bits/stdc++.h>
    #include<iostream>
    #include<iomanip>
    #include<cstring>
    #include<stack>
    #include<vector>
    //#include<conio.h>
    #include<string>
    #include<map>
    #include<cstdlib>
    #include<queue>
    #include<math.h>
    #include<time.h>
    #include<set>
    #include<cstdio>
    #include<stdio.h>
    #include<algorithm>
    using namespace std; 
    using std::cin;
    using std::cout;
    using std::endl;
    namespace IN{
        const int MAX_INPUT = 1000000;
        #define getc() (p1==p2&&(p2=(p1=buf)+inbuf->sgetn(buf,MAX_INPUT),p1==p2)?EOF:*p1++)
        char buf[MAX_INPUT],*p1,*p2;
        template<typename T>inline bool read(T &x) {
            static std::streambuf *inbuf=cin.rdbuf();
            x=0;
            register int f=0,flag=false;
            register char ch=getc();
            while(!isdigit(ch)){
                if (ch=='-') f=1;
                ch=getc();
            }
            if(isdigit(ch)) x=x*10+ch-'0',ch=getc(),flag=true;
            while(isdigit(ch)) {
                x=x*10+ch-48;
                ch=getc();
            }
            x=f?-x:x;
            return flag;
        }
        template<typename T,typename ...Args>inline bool read(T& a,Args& ...args) {
           return read(a)&&read(args...);
        }
        #undef getc
    }
    
    namespace OUT{
        template<typename T>inline void put(T x){
            static std::streambuf *outbuf=cout.rdbuf();
            static char stack[21];
            static int top=0;
            if(x<0){
                outbuf->sputc('-');
                x=-x;
            }
            if(!x){
                outbuf->sputc('0');
                outbuf->sputc('
    ');
                return;
            }
            while(x){
                stack[++top]=x%10+'0';
                x/=10;
            }
            while(top){
                outbuf->sputc(stack[top]);
                --top;
            }
            outbuf->sputc('
    ');
        }
        inline void putc(const char ch){
            static std::streambuf *outbuf=cout.rdbuf();
            outbuf->sputc(ch);
        }
        inline void putstr(string s){
            for(register int i=0;i<s.length();i++) putc(s[i]);
        }
        template<typename T>inline void put(const char ch,T x){
            static std::streambuf *outbuf=cout.rdbuf();
            static char stack[21];
            static int top = 0;
            if(x<0){
                outbuf->sputc('-');
                x=-x;
            }
            if(!x){
                outbuf->sputc('0');
                outbuf->sputc(ch);
                return;
            }
            while(x){
                stack[++top]=x%10+'0';
                x/=10;
            }
            while(top){
                outbuf->sputc(stack[top]);
                --top;
            }
            outbuf->sputc(ch);
        }
        template<typename T,typename ...Args> inline void put(T a,Args ...args){
            put(a);put(args...);
        }
        template<typename T,typename ...Args> inline void put(const char ch,T a,Args ...args){
            put(ch,a);put(ch,args...);
        }
    }
    using namespace IN;
    using namespace OUT;
    
    int main(){
        std::ios::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);
        //read(a, b, c);
        //put('
    ', ans);
        return 0;
    }
    

    火车头

    #pragma GCC diagnostic error "-std=c++11"
    #pragma GCC target("avx")
    #pragma GCC optimize(3)
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize("inline")
    #pragma GCC optimize("-fgcse")
    #pragma GCC optimize("-fgcse-lm")
    #pragma GCC optimize("-fipa-sra")
    #pragma GCC optimize("-ftree-pre")
    #pragma GCC optimize("-ftree-vrp")
    #pragma GCC optimize("-fpeephole2")
    #pragma GCC optimize("-ffast-math")
    #pragma GCC optimize("-fsched-spec")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC optimize("-falign-jumps")
    #pragma GCC optimize("-falign-loops")
    #pragma GCC optimize("-falign-labels")
    #pragma GCC optimize("-fdevirtualize")
    #pragma GCC optimize("-fcaller-saves")
    #pragma GCC optimize("-fcrossjumping")
    #pragma GCC optimize("-fthread-jumps")
    #pragma GCC optimize("-funroll-loops")
    #pragma GCC optimize("-fwhole-program")
    #pragma GCC optimize("-freorder-blocks")
    #pragma GCC optimize("-fschedule-insns")
    #pragma GCC optimize("inline-functions")
    #pragma GCC optimize("-ftree-tail-merge")
    #pragma GCC optimize("-fschedule-insns2")
    #pragma GCC optimize("-fstrict-aliasing")
    #pragma GCC optimize("-fstrict-overflow")
    #pragma GCC optimize("-falign-functions")
    #pragma GCC optimize("-fcse-skip-blocks")
    #pragma GCC optimize("-fcse-follow-jumps")
    #pragma GCC optimize("-fsched-interblock")
    #pragma GCC optimize("-fpartial-inlining")
    #pragma GCC optimize("no-stack-protector")
    #pragma GCC optimize("-freorder-functions")
    #pragma GCC optimize("-findirect-inlining")
    #pragma GCC optimize("-fhoist-adjacent-loads")
    #pragma GCC optimize("-frerun-cse-after-loop")
    #pragma GCC optimize("inline-small-functions")
    #pragma GCC optimize("-finline-small-functions")
    #pragma GCC optimize("-ftree-switch-conversion")
    #pragma GCC optimize("-foptimize-sibling-calls")
    #pragma GCC optimize("-fexpensive-optimizations")
    #pragma GCC optimize("-funsafe-loop-optimizations")
    #pragma GCC optimize("inline-functions-called-once")
    #pragma GCC optimize("-fdelete-null-pointer-checks")
    

    没了。

    本文来自博客园,作者:xixike,转载请注明原文链接:https://www.cnblogs.com/xixike/p/15526209.html

  • 相关阅读:
    SQL update select
    Centos7 update dotnet 无法识别
    asp.net core mvc 在中间件中使用依赖注入问题:System.InvalidOperationException: Cannot resolve scoped service 'IXXXService' from root provider.
    SQL Server类型与C#类型对应关系
    .NET Core ABP
    支付宝小程序获取用户授权
    .Net 多线程,异步且控制并发数量
    SQL:尝试将不可为 NULL 的列的值设置为 NULL
    .Net Core依赖注入和服务注册
    .NET Core配置主机端口的几种方式
  • 原文地址:https://www.cnblogs.com/xixike/p/15526209.html
Copyright © 2020-2023  润新知