Submission #1838446


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(n);(i)>=0;(i)--)
#define each(itr,v) for(auto (itr):(v))
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define mp(x,y) make_pair((x),(y))
#define fi first
#define se second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln "\n"
#define show(x) cout << #x << " = " << x ln
#define dbg(x) cout<<#x"="<<x ln

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> mat;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int inf = (int)1e9;
const ll linf = (ll)1e18;
const int mod = (int)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};

struct oreno_initializer {
	oreno_initializer() {
		cin.tie(0);
		ios::sync_with_stdio(0);
	}
} oreno_initializer;

// ⊂ニニニニニニニニニニニニニ( ^ω^)ニニニニニニニニニニニニニ⊃

int a, d;

int main() {
	cin >> a >> d;
	cout << max((a+1)*d, a*(d+1));
}

Submission Info

Submission Time
Task A - ゲーム
User creep04
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1365 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 3
WA × 23
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt
Case Name Status Exec Time Memory
sample-01.txt WA 1 ms 256 KB
sample-02.txt WA 1 ms 256 KB
sample-03.txt WA 1 ms 256 KB
test-01.txt WA 1 ms 256 KB
test-02.txt WA 1 ms 256 KB
test-03.txt WA 1 ms 256 KB
test-04.txt WA 1 ms 256 KB
test-05.txt WA 1 ms 256 KB
test-06.txt WA 1 ms 256 KB
test-07.txt WA 1 ms 256 KB
test-08.txt WA 1 ms 256 KB
test-09.txt WA 1 ms 256 KB
test-10.txt WA 1 ms 256 KB
test-11.txt WA 1 ms 256 KB
test-12.txt WA 1 ms 256 KB
test-13.txt WA 1 ms 256 KB
test-14.txt WA 1 ms 256 KB
test-15.txt WA 1 ms 256 KB
test-16.txt WA 1 ms 256 KB
test-17.txt WA 1 ms 256 KB
test-18.txt WA 1 ms 256 KB
test-19.txt WA 1 ms 256 KB
test-20.txt WA 1 ms 256 KB