算法模板·

atc

#include<bits/stdc++.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using PII = pair<int,int>;
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define lowbit(x) (x) & (-x)
#define endl "\n"
#define pb push_back
#define point(x) setiosflags(ios::fixed)<<setprecision(x)
#define debug(x) cerr << #x << " = " << x << endl
#define gg(...) [](const auto&...x){ char c='='; cerr<<#__VA_ARGS__<<" "; ((cerr<<exchange(c,',')<<" "<<x),...); cerr<<endl; }(__VA_ARGS__);
const int N=1e5+10;
const int INF=0x3f3f3f3f;
const int mod=998244353;

int main()
{
	
	return 0;
}

cf

#include<bits/stdc++.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using PII = pair<int,int>;
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define lowbit(x) (x) & (-x)
#define endl "\n"
#define pb push_back
#define point(x) setiosflags(ios::fixed)<<setprecision(x)
#define debug(x) cerr << #x << " = " << x << endl
const int N=1e5+10;
const int INF=0x3f3f3f3f;
const int mod=998244353;

void solve()
{
	
}
int main()
{
	int T = 1;
	cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}
posted @ 2025-09-07 18:52  zouyua  阅读(6)  评论(0)    收藏  举报