Problem StatementIn Republic of AtCoder, Snuke Chameleons (Family: Chamaeleonidae, Genus: Bartaberia) are very popular pets. Ringo keeps N" data-mce-tabindex="0">NN Snuke Chameleons in a cage. A Snuke Chameleon that has not eaten anything is blue. It changes its color according to the f
Problem StatementFind the number of the possible tuples of sequences (A0,A1,…,AN) that satisfy all of the following conditions, modulo M: For every i (0≤i≤N), Ai is a sequence of length i consisting of integers between 1 and K (inclusi
Problem StatementWe have a sequence A of length N. On this sequence, we can perform the following two kinds of operations: Swap two adjacent elements. Select one element, and increment it by 1. We will repeatedly perform these operations so that A will be a non-decreasi
描述：给定一个多边形，求对称轴数量。n <= 1000000 输入输出样例输入样例#1： 复制2
12
1 -1
2 -1
2 1
1 1
1 2
-1 2
-1 1
-2 1
-2 -1
-1 -1
-1 -2
1 -2
6
-1 1
-2 0
-1 -1
1 -1
2 0
1 1 输出样例#1： 复制4
2
For long time scientists study the behavior of sharks. Sharks, as many other species, alternate short movements in a certain location and long movements between locations. Max is a young biologist. For n" data-mce-tabindex="0">nn days he watched a specific shark, and now he knows the di
There are two small spaceship, surrounded by two groups of enemy larger spaceships. The space is a two-dimensional plane, and one group of the enemy spaceships is positioned in such a way that they all have integer y" data-mce-tabindex="0">yy-coordinates, and their x" data-mce-tabindex=
一条东西走向的穆西河将巴邻旁市一分为二，分割成了区域 A" data-mce-tabindex="0">AA 和区域 B" data-mce-tabindex="0">BB。 每一块区域沿着河岸都建了恰好 1000000001" data-mce-tabindex="0">10000000011000000001 栋的建筑，每条岸边的建筑都从 0" data-mce-tabindex="0">00 编号到 1000000000" data-mce-tabindex="0">100000
time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Consider a billiard table of rectangular size n×m" data-mce-tabindex="0">n×mn×m with four pockets. Let's introduce a coordinate system with the origin at th
从前一个和谐的班级，所有人都是搞OI的。有 n" data-mce-tabindex="0">nn 个是男生，有 0" data-mce-tabindex="0">00 个是女生。男生编号分别为 1,…,n" data-mce-tabindex="0">1,…,n1,…,n。 现在老师想把他们分成若干个两人小组写动态仙人掌，一个人负责搬砖另一个人负责吐槽。每个人至多属于一个小组。 有若干个这样的条件：第 v" data-mce-tabindex="0">vv 个男生和第
Description
“简单无向图”是指无重边、无自环的无向图（不一定连通）。
一个带标号的图的价值定义为每个点度数的k次方的和。
给定n和k，请计算所有n个点的带标号的简单无向图的价值之和。
因为答案很大，请对998244353取模输出。
Input
第一行包含两个正整数n,k(1<=n<=10^9,1<=k<=200000)。
Output
输出一行一个整数，即答案对998244353取模的结果。
Sample Input
6 5
Sample Output
67584000
HINT
Source
本OJ付费获取
\
Rockdu's Blog