Submission #19738

# Submission time Handle Problem Language Result Execution time Memory
19738 2016-02-25T05:08:31 Z sui 창문 (kriii4_C) C++14
100 / 100
0 ms 1716 KB
#define _CRT_SECURE_NO_WARNINGS // scanf(), gets() (needed for Visual C++)

//#define NDEBUG
#include <cassert>

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>

#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <deque>

using namespace std;

#define MEMSET(x, WITH) memset(x, (WITH), sizeof(x))
#define FOR(i, E) for(int i=0; i<(E); i++)
#define REP(i, LO, HI) for(int i=(LO); i<=(HI); i++)

#define GETINT(x) scanf("%d", &x)
#define GETDBL(x) scanf("%lf", &x)
#define GETSTR(x) scanf("%s", x)
#define NEWINT(x) int x; scanf("%d", &x)
#define NEWDBL(x) double x; scanf("%lf", &x)
#define NEWLN putchar('\n')

#ifdef _WIN32
#define popcnt __popcnt
#else
#define popcnt __builtin_popcount
#endif

typedef long long ll;
const ll MOD = 1000000007;
//const double PI = atan(1) * 4;







int main() {
	ll a, b; cin >> a >> b;

	a = (a + 2) % MOD;
	b = (b + 2) % MOD;

	ll ans = (a * b) % MOD;
	cout << ans << endl;


	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1716 KB Output is correct
2 Correct 0 ms 1716 KB Output is correct
3 Correct 0 ms 1716 KB Output is correct
4 Correct 0 ms 1716 KB Output is correct
5 Correct 0 ms 1716 KB Output is correct
6 Correct 0 ms 1716 KB Output is correct
7 Correct 0 ms 1716 KB Output is correct
8 Correct 0 ms 1716 KB Output is correct
9 Correct 0 ms 1716 KB Output is correct
10 Correct 0 ms 1716 KB Output is correct
11 Correct 0 ms 1716 KB Output is correct
12 Correct 0 ms 1716 KB Output is correct
13 Correct 0 ms 1716 KB Output is correct
14 Correct 0 ms 1716 KB Output is correct
15 Correct 0 ms 1716 KB Output is correct
16 Correct 0 ms 1716 KB Output is correct
17 Correct 0 ms 1716 KB Output is correct
18 Correct 0 ms 1716 KB Output is correct
19 Correct 0 ms 1716 KB Output is correct
20 Correct 0 ms 1716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1716 KB Output is correct
2 Correct 0 ms 1716 KB Output is correct
3 Correct 0 ms 1716 KB Output is correct
4 Correct 0 ms 1716 KB Output is correct
5 Correct 0 ms 1716 KB Output is correct
6 Correct 0 ms 1716 KB Output is correct
7 Correct 0 ms 1716 KB Output is correct
8 Correct 0 ms 1716 KB Output is correct
9 Correct 0 ms 1716 KB Output is correct
10 Correct 0 ms 1716 KB Output is correct
11 Correct 0 ms 1716 KB Output is correct
12 Correct 0 ms 1716 KB Output is correct
13 Correct 0 ms 1716 KB Output is correct
14 Correct 0 ms 1716 KB Output is correct
15 Correct 0 ms 1716 KB Output is correct
16 Correct 0 ms 1716 KB Output is correct
17 Correct 0 ms 1716 KB Output is correct
18 Correct 0 ms 1716 KB Output is correct
19 Correct 0 ms 1716 KB Output is correct
20 Correct 0 ms 1716 KB Output is correct
21 Correct 0 ms 1716 KB Output is correct
22 Correct 0 ms 1716 KB Output is correct
23 Correct 0 ms 1716 KB Output is correct
24 Correct 0 ms 1716 KB Output is correct
25 Correct 0 ms 1716 KB Output is correct
26 Correct 0 ms 1716 KB Output is correct
27 Correct 0 ms 1716 KB Output is correct
28 Correct 0 ms 1716 KB Output is correct
29 Correct 0 ms 1716 KB Output is correct
30 Correct 0 ms 1716 KB Output is correct
31 Correct 0 ms 1716 KB Output is correct
32 Correct 0 ms 1716 KB Output is correct
33 Correct 0 ms 1716 KB Output is correct
34 Correct 0 ms 1716 KB Output is correct
35 Correct 0 ms 1716 KB Output is correct
36 Correct 0 ms 1716 KB Output is correct
37 Correct 0 ms 1716 KB Output is correct
38 Correct 0 ms 1716 KB Output is correct
39 Correct 0 ms 1716 KB Output is correct
40 Correct 0 ms 1716 KB Output is correct