Submission #8092296

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(x, a, b) for(int x = (a); x <= (b); ++x)
#define rop(x, a, b) for(int x = (a); x < (b); ++x)
#define per(x, a, b) for(int x = (a); x >= (b); --x)
using namespace std;
typedef long long LL;
typedef double DB;
int mod = 1000000007;
inline int MOD(int x) {
	return x >= mod ? x - mod : x;
}
int qpow(int a, int b) {
	int as = 1;
	while(b) {
		if(b & 1) as = 1ll * as * a % mod;
		a = 1ll * a * a % mod;
		b >>= 1;
	}
	return as;
}
int a[200005], b[200005];
int n, m, CC[4005][4005];
int F[10005], G[10005];
int& f(int x) {
	return F[x + 3000];
}
int& g(int x) {
	return G[x + 3000];
}
int as;
int C(int n, int m) {
	return CC[n][m];
}
void init() {
	CC[0][0] = 1;
	rep(i, 1, 4000) {
		CC[i][0] = CC[i][i] = 1;
		rop(j, 1, i) {
			CC[i][j] = MOD(CC[i - 1][j - 1] + CC[i - 1][j]);
		}
	}
}
int main() {
	init();
	scanf("%d", &n);
	rep(i, 1, n) scanf("%d%d", &a[i], &b[i]);
	rep(i, 1, n) {
		rep(j, -b[i], a[i]) {
			f(j) = MOD(f(j) + C(a[i] + b[i], a[i] - j));
		}
		rep(j, -a[i], b[i]) {
			g(j) = MOD(g(j) + C(a[i] + b[i], a[i] + j));
		}
		as = MOD(as - C(a[i] + a[i] + b[i] + b[i], a[i] + a[i]) + mod);
	}
	rep(j, -2000, 2000) as = MOD(as + 1ll * f(j) * g(j) % mod);
	cout << 1ll * as * qpow(2, mod - 2) % mod << endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:50:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i, 1, n) scanf("%d%d", &a[i], &b[i]);
                                          ^

Judge Result