Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- unsigned long long int gcd(unsigned long long int a, unsigned long long b) {
- return b ? gcd(b, a % b) : a;
- }
- int main() {
- int n, m;
- std::cin >> n >> m;
- unsigned long long int num = 1, den = 1, c;
- if (n > m) {
- std::vector <int> a(n + 1);
- for (int j = 2; j <= m; j++) {
- a[j] = j;
- }
- for (int i = n + 1; i < n + m; i++) {
- num *= i;
- for (int j = 2;j < m; j++) {
- if (a[j] > -1) {
- if (num % a[j] == 0) {
- num /= a[j];
- a[j] = -1;
- } else {
- den *= a[j];
- a[j] = -1;
- }
- }
- }
- if (num >= den) {
- c = gcd(num, den);
- num /= c;
- den /= c;
- }
- }
- } else if (n == m) {
- std::vector <int> a(n + 1);
- for (int j = 2; j <= n; j++) {
- a[j] = j;
- }
- for (int i = n + 1; i < n + m; i++) {
- num *= i;
- for (int j = 2; j < n; j++) {
- if (a[j] > -1) {
- if (num % a[j] == 0) {
- num /= a[j];
- a[j] = -1;
- } else {
- den *= a[j];
- a[j] = -2;
- }
- }
- }
- if (num > den) {
- c = gcd(num ,den);
- num /= c;
- den /= c;
- }
- }
- } else {
- std::vector <int> a(m);
- for (int j = 2; j < m; j++) {
- a[j] = j;
- }
- for (int i = n + 1; i < n + m; i++) {
- num *= i;
- for (int j = 2; j < m; j++) {
- if (a[j] > -1) {
- if (num % a[j] == 0) {
- num /= a[j];
- a[j] = -1;
- } else {
- den *= a[j];
- a[j] = -2;
- }
- }
- }
- if (num > den) {
- c = gcd(num, den);
- num /= c;
- den /= c;
- }
- }
- }
- std::cout << num;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement