제출 #19763

#제출 시각아이디문제언어결과실행 시간메모리
19763noeffserv창문 (kriii4_C)C++98
100 / 100
0 ms1720 KiB
#include <cstdio> #include <cmath> #include <algorithm> #include <vector> #include <stack> #include <queue> #include <functional> #include <cstring> #include <string> #include <map> #include <set> #include <iostream> #define ENP printf("**Entry Point**\n") #define A first #define B second #define MP make_pair using namespace std; typedef long long ll; typedef vector <double> vec_d; typedef vector <vec_d> vvec_d; typedef vector <int> vec_i; typedef vector <vec_i> vvec_i; typedef pair <int, int> pair_i; typedef pair < pair_i, pair_i > pp_i; const int INF = 0x60000000; const int MINF = -1000000000; const ll mod = 1000000007; const int cons = 50000001; int main() { ll h, w; scanf("%lld%lld", &h, &w); h %= mod; w %= mod; printf("%lld\n", ((h + 2)*(w + 2)) % mod); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...