Submission #19671

#	Time	Username	Problem	Language	Result	Execution time	Memory
19671		cki86201	창문 (kriii4_C)	C++14	100 / 100	0 ms	1720 KiB

C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pi;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()

const ll MOD = 1e9 + 7;

int main(){
	ll h, w;
	scanf("%lld%lld", &h, &w);
	h += 2, w += 2;
	h %= MOD, w %= MOD;
	printf("%lld", h * w % MOD);
	return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 97 / 97