zoukankan      html  css  js  c++  java
  • qaq

    -lm -O2 -std=c++11 -Wl,--stack=998244353

    -std=c++11 -Wl,--stack=1024000000 -DGUOBO -O2 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2

    var colors = ['rgb(191, 191, 191)', 'rgb(254, 76, 97)', 'rgb(243, 156, 17)', 'rgb(255, 193, 22)', 'rgb(82, 196, 26)', 'rgb(52, 152, 219)', 'rgb(157, 61, 207)', 'rgb(14, 29, 105)'];
    var problems = [];
    for(var passed of window._feInjection.currentData.passedProblems) problems.push({pid: passed.pid, dif: passed.difficulty, title: passed.title});
    problems=problems.sort(function(a,b){return a.dif-b.dif})
    win= window.open ('', 'newwindow')    
    win.document.write("<h1>Problem</h1>")
    for(var j = 0;j < problems.length;j++)
        win.document.write("<a style='color:"+colors[problems[j].dif]+";font-size:30px' href='https://www.luogu.com.cn/problem/"+problems[j].pid+"' target='_blank'>["+problems[j].pid+"]"+problems[j].title+"</a><br>")
    
    #include<bits/stdc++.h>
    #define For(i,a,b) for(register int i=(a);i<=(b);++i)
    #define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
    using namespace std;
    inline int read()
    {
    	char c=getchar();int x=0;bool f=0;
    	for(;!isdigit(c);c=getchar())f^=!(c^45);
    	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    	if(f)x=-x;return x;
    }
    
    #define fi first
    #define se second
    #define pb push_back
    #define mkp make_pair
    typedef pair<int,int>pii;
    typedef vector<int>vi; 
    
    #define maxn 200005
    #define inf 0x3f3f3f3f
    
    signed main()
    {
    	
    	return 0;
    }
    
    #include<bits/stdc++.h>
    #define For(i,a,b) for(register int i=(a);i<=(b);++i)
    #define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
    using namespace std;
    inline int read()
    {
    	char c=getchar();int x=0;bool f=0;
    	for(;!isdigit(c);c=getchar())f^=!(c^45);
    	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    	if(f)x=-x;return x;
    }
    
    #define mod 998244353
    struct modint{
    	int x;
    	modint(int o=0){x=o;}
    	modint &operator = (int o){return x=o,*this;}
    	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
    	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
    	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
    	modint &operator ^=(int b){
    		modint a=*this,c=1;
    		for(;b;b>>=1,a*=a)if(b&1)c*=a;
    		return x=c.x,*this;
    	}
    	modint &operator /=(modint o){return *this *=o^=mod-2;}
    	modint &operator +=(int o){return x=x+o>=mod?x+o-mod:x+o,*this;}
    	modint &operator -=(int o){return x=x-o<0?x-o+mod:x-o,*this;}
    	modint &operator *=(int o){return x=1ll*x*o%mod,*this;}
    	modint &operator /=(int o){return *this *= ((modint(o))^=mod-2);}
    	template<class I>friend modint operator +(modint a,I b){return a+=b;}
    	template<class I>friend modint operator -(modint a,I b){return a-=b;}
    	template<class I>friend modint operator *(modint a,I b){return a*=b;}
    	template<class I>friend modint operator /(modint a,I b){return a/=b;}
    	friend modint operator ^(modint a,int b){return a^=b;}
    	friend bool operator ==(modint a,int b){return a.x==b;}
    	friend bool operator !=(modint a,int b){return a.x!=b;}
    	bool operator ! () {return !x;}
    	modint operator - () {return x?mod-x:0;}
    	bool operator <(const modint&b)const{return x<b.x;}
    };
    
    vector<modint> fac,ifac,iv;
    inline void initC(int n)
    {
    	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
    	int m=iv.size(); ++n;
    	if(m>=n)return;
    	iv.resize(n),fac.resize(n),ifac.resize(n);
    	For(i,m,n-1){
    		iv[i]=iv[mod%i]*(mod-mod/i);
    		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
    	}
    }
    inline modint C(int n,int m){
    	if(m<0||n<m)return 0;
    	return initC(n),fac[n]*ifac[m]*ifac[n-m];
    }
    inline modint sign(int n){return (n&1)?(mod-1):(1);}
    
    #define fi first
    #define se second
    #define pb push_back
    #define mkp make_pair
    typedef pair<int,int>pii;
    typedef vector<int>vi; 
    
    #define maxn 200005
    #define inf 0x3f3f3f3f
    
    signed main()
    {
    	
    	return 0;
    }
    
    $$\Huge \text{Goodbye OI}$$
  • 相关阅读:
    Android(java)学习笔记68:使用proguard混淆android代码
    SGU 194 Reactor Cooling
    关于流量有上下界的网络流问题的求解
    关于最小割的求解方法
    HDU 5311 Hidden String
    POJ 3548 Restoring the digits
    POJ 2062 HDU 1528 ZOJ 2223 Card Game Cheater
    ZOJ 1967 POJ 2570 Fiber Network
    HDU 1969 Pie
    HDU 1956 POJ 1637 Sightseeing tour
  • 原文地址:https://www.cnblogs.com/Rainbowsjy/p/qaq.html
Copyright © 2011-2022 走看看