#qk999999999. 刘承坤 is vrey clever

    ID: 2383 Type: Default 1000ms 256MiB Tried: 1 Accepted: 0 Difficulty: 9 Uploaded By: Tags>Level1顺序结构暴力枚举1数学1条件结构循环结构Level2二维数组数学2排序模拟2函数数组字符串暴力枚举2结构体Level3数学3模拟3思维3暴力枚举3贪心3STLLevel4思维4离散化数学4链表双指针ST表贪心4优先队列二分三分递归递推BFS前缀和差分DFSLevel5并查集搜索进阶思维5数学5树的直径哈希KMP字典树反悔贪心倍增树形结构区间DPBFS进阶DFS进阶背包DP线性DPDP变形DPLevel6概率DP线段树树状数组期望DP单调队列优化DP数位DP状压DP树上DP换根DP单源最短路径floyd最小生成树差分约束AC自动机平衡树二分图矩阵莫队分块博弈论数学6思维6乾坤难题

刘承坤 is vrey clever

Lck=qk+learnLck=q^k+learn

祝你好运连连

AC

//头文件
#include <bits/stdc++.h>
//#incldue <windows.h>

using namespace std;

//转换 
#define fst ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'
#define TRACE 1
#define tcout TRACE && cout
#define int long long
#define FALSE cout << "No";return 0;
#define TRUE cout << "Yes";return 0;
//#define ll long long
//#define ull unsigned long long

//定义 
const int P = 998244353;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e9 + 10, M = 2e6 + 10;
const int dx[]={1,1,1,0,0,-1,-1,-1};
const int dy[]={-1,0,1,-1,1,-1,0,1};
//变量&&函数区 

signed main(void){
	
	return 0; 
}