Submission #1442184


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<lint, lint> pi;
const int MAXN = 100005;
const int mod = 998244353;

lint ipow(lint x, lint p){
	lint ret = 1, piv = x % mod;
	while(p){
		if(p&1) ret *= piv;
		piv *= piv;
		ret %= mod;
		piv %= mod;
		p >>= 1;
	}
	return ret % mod;
}

lint a[MAXN], b[MAXN];
lint inv[MAXN], m;
int n;

lint bino(int x, int y){
	if(x >= mod) return 0;
	lint ans = 1;
	for(int i=0; i<y; i++){
		ans *= x - i;
		ans %= mod;
		ans *= inv[i+1];
		ans %= mod;
	}
	return ans;
}

int main(){
	for(int i=1; i<MAXN; i++) inv[i] = ipow(i, mod-2);
	cin >> m >> n;
	a[0] = a[1] = b[0] = 1;
	for(int i=2; i<n; i++) a[i] = (a[i-1] + a[i-2]) % mod;
	for(int i=1; i<n; i++) b[i] = b[i-1] * ((m - 2 + i) * inv[i] % mod) % mod;
	lint ans = 0;
	for(int i=0; i<n; i++) ans = (ans + a[i] * b[n-1-i]) % mod;
	printf("%lld\n", ans);
}

Submission Info

Submission Time
Task G - Sum of Fibonacci Sequence
User koosaga
Language C++14 (GCC 5.4.1)
Score 270
Code Size 951 Byte
Status RE
Exec Time 112 ms
Memory 2560 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 Subtask4 Subtask5
Score / Max Score 0 / 0 100 / 100 170 / 170 0 / 230 0 / 420 0 / 480
Status
AC × 3
AC × 8
AC × 13
RE × 5
AC × 3
RE × 10
AC × 13
RE × 15
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
Subtask1 sample_1.txt, sample_2.txt, sample_3.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt
Subtask2 sample_1.txt, sample_2.txt, sample_3.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt, sub2_in5.txt
Subtask3 sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub3_in4.txt, sub3_in5.txt
Subtask4 sample_1.txt, sample_2.txt, sample_3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub3_in4.txt, sub3_in5.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt, sub4_in4.txt, sub4_in5.txt
Subtask5 sample_1.txt, sample_2.txt, sample_3.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt, sub2_in5.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub3_in4.txt, sub3_in5.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt, sub4_in4.txt, sub4_in5.txt, sub5_in1.txt, sub5_in2.txt, sub5_in3.txt, sub5_in4.txt, sub5_in5.txt
Case Name Status Exec Time Memory
sample_1.txt AC 15 ms 1024 KB
sample_2.txt AC 15 ms 1024 KB
sample_3.txt AC 16 ms 1024 KB
sub1_in1.txt AC 16 ms 1024 KB
sub1_in2.txt AC 15 ms 1024 KB
sub1_in3.txt AC 15 ms 1024 KB
sub1_in4.txt AC 15 ms 1024 KB
sub1_in5.txt AC 16 ms 1024 KB
sub2_in1.txt AC 17 ms 2048 KB
sub2_in2.txt AC 17 ms 2304 KB
sub2_in3.txt AC 17 ms 2432 KB
sub2_in4.txt AC 16 ms 1024 KB
sub2_in5.txt AC 17 ms 2560 KB
sub3_in1.txt RE 111 ms 1792 KB
sub3_in2.txt RE 110 ms 1792 KB
sub3_in3.txt RE 110 ms 1920 KB
sub3_in4.txt RE 110 ms 1792 KB
sub3_in5.txt RE 111 ms 1792 KB
sub4_in1.txt RE 112 ms 1792 KB
sub4_in2.txt RE 110 ms 1792 KB
sub4_in3.txt RE 110 ms 1792 KB
sub4_in4.txt RE 110 ms 1792 KB
sub4_in5.txt RE 111 ms 1792 KB
sub5_in1.txt RE 110 ms 1792 KB
sub5_in2.txt RE 110 ms 1792 KB
sub5_in3.txt RE 110 ms 1792 KB
sub5_in4.txt RE 110 ms 1792 KB
sub5_in5.txt RE 110 ms 1792 KB