oj.uz

Submission #798727

# Submission time Handle Problem Language Result Execution time Memory
798727 2023-07-31T02:10:46 Z tlnk07 Magneti (COCI21_magneti) C++17
0 / 110
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;

long long n, m, x, s = 1, mod = 1e9 + 7;

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; ++i)	cin >> x;
	m -= 1;
	for(int i = 2; i <= n; ++i)
	{
		s *= i;
		m -= x;
		s %= mod;
	}
	if(m < 0)
	{
		cout << 0;
		return 0;
	}
	int t = n + 1;
	for(int i = 1; i <= m; ++i, ++t)
	{
		s = (s * t / i) % mod;
	}
	cout << s;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -