Submission #44995938

---

Source Code Expand

#include<bits/stdc++.h>
#define LL long long
#define DB long double
#define MOD 998244353
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define lowbit(x) x & (-x)
#define PII pair<int, int>
#define MP make_pair
#define VI vector<int>
#define VII vector<int>::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define SI set<int>
#define SII set<int>::iterator
#define QI queue<int>
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
int inc(const int &a, const int &b) { return a + b >= MOD ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return a - b < 0 ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		Sqr(x), k >>= 1;
	}
	return res;
}
const int N = 1e6 + 5;
int n, k, C, dp[N];
int main()
{
	scanf("%d %d %d", &n, &k, &C);
	dp[1] = C;
	for(int i = 2; i <= n; ++i)
	{
		Inc(dp[i], dp[i - 1]);
		if(i < k)
		{
			Inc(dp[i], mul(C, C - 1));
			Inc(dp[i], dec(dp[i - 1], C));
		}
		else
		{
			Inc(dp[i], mul(C - 1, dp[i - k + 1]));
			Inc(dp[i], dec(dp[i - 1], dp[i - k + 1]));
		}
	}
	printf("%d\n", dp[n]);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   42 |  scanf("%d %d %d", &n, &k, &C);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Judge Result