• 某蒟蒻的考场编程环境配置


    发现自己最近在几个系统和机子之间反复横跳,有必要记一下自己的相关配置了

    头文件(我不用万能头我自豪

    #include<iostream>
    #include<string.h>
    #include<string>
    #include<stdio.h>
    #include<algorithm>
    #include<vector>
    #include<bitset>
    #include<math.h>
    #include<stack>
    #include<queue>
    #include<set>
    #include<map>
    using namespace std;
    typedef long long ll;
    typedef long double db;
    typedef vector<int> vi;
    typedef pair<int,int> pii;
    const int N=100000+100;
    const db pi=acos(-1.0);
    #define lowbit(x) ((x)&(-x))
    #define sqr(x) (x)*(x)
    #define rep(i,a,b) for (register int i=a;i<=b;i++)
    #define per(i,a,b) for (register int i=a;i>=b;i--)
    #define go(u,i) for (register int i=head[u],v=sq[i].to;i;i=sq[i].nxt,v=sq[i].to)
    #define fir first
    #define sec second
    #define mkp make_pair
    #define pb push_back
    #define maxd 998244353
    #define eps 1e-8
    inline int read()
    {
        int x=0,f=1;char ch=getchar();
        while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
        while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
        return x*f;
    }
    
    inline ll readll()
    {
        ll x=0;int f=1;char ch=getchar();
        while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
        while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
        return x*f;
    }
    
    namespace My_Math{
        #define N 100000
    
        int fac[N+100],invfac[N+100];
    
        int add(int x,int y) {return x+y>=maxd?x+y-maxd:x+y;}
        int dec(int x,int y) {return x<y?x-y+maxd:x-y;}
        int mul(int x,int y) {return 1ll*x*y%maxd;}
        ll qpow(ll x,int y)
        {
            ll ans=1;
            while (y)
            {
                if (y&1) ans=mul(ans,x);
                x=mul(x,x);y>>=1;
            }
            return ans;
        }
        int getinv(int x) {return qpow(x,maxd-2);}
    
        int C(int n,int m)
        {
            if ((n<m) || (n<0) || (m<0)) return 0;
            return mul(mul(fac[n],invfac[m]),invfac[n-m]);
        }
    
        void math_init()
        {
            fac[0]=invfac[0]=1;
            rep(i,1,N) fac[i]=mul(fac[i-1],i);
            invfac[N]=getinv(fac[N]);
            per(i,N-1,1) invfac[i]=mul(invfac[i+1],i+1);
        }
        #undef N
    }
    using namespace My_Math;
    

    (emacs)配置

    (global-set-key [f10] 'compile)
    (global-set-key [f9] 'shell)
    (global-set-key (kbd "C-a") 'mark-whole-buffer)
    (global-set-key (kbd "C-w") 'kill-buffer)
    (global-set-key (kbd "C-s") 'save-buffer)
    (global-set-key (kbd "C-f") 'find-file)
    (global-set-key (kbd "RET") 'newline-and-indent)
    
    (global-linum-mode t)
    (global-hl-line-mode t)
    
    (setq c-basic-offset 4)
    (setq default-tab-width 4)
    (setq-default indent-tabs-mode t)
    (setq c-default-style "awk")
    
    (custom-set-variables
     ;; custom-set-variables was added by Custom.
     ;; If you edit it by hand, you could mess it up, so be careful.
     ;; Your init file should contain only one such instance.
     ;; If there is more than one, they won't work right.
     '(cua-mode t nil (cua-base)))
    (custom-set-faces
     ;; custom-set-faces was added by Custom.
     ;; If you edit it by hand, you could mess it up, so be careful.
     ;; Your init file should contain only one such instance.
     ;; If there is more than one, they won't work right.
     '(default ((t (:family "Ubuntu Mono" :foundry "unknown" :slant normal :weight normal :height 203 :width normal)))))
    
    

    LInux下对拍

    #include<iostream>
    #include<stdio.h>
    //#include<system.h>
    #include<stdlib.h>
    using namespace std;
    int main()
    {
    	int cas=0;
    	while (1)
    	{
    		system("./gen");
    		system("./a");
    		system("./std");
    		if (system("diff a.out b.out"))
    		{
    			puts("Wrong Answer");
    			break;
    		}
    		printf("Case %d:Accepted
    ",++cas);
    	}
    	fgetc(stdin);
    	return 0;
    }
    

    这里使用fgetc(stdin)来替代windows下的system("pause");

  • 相关阅读:
    Spring的AOP深入理解
    枚举和注解学习笔记
    单例模式
    工厂设计模式
    网络编程
    多线程笔记
    IOI2021集训队作业
    计蒜客 mark
    51nod mark
    关于此博客
  • 原文地址:https://www.cnblogs.com/encodetalker/p/11140442.html
Copyright © 2020-2023  润新知