Submission #14271723

Source Code Expand

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

#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;

int main() {
  int a,b; cin>>a>>b; cout<<a*b;
}

Submission Info

Submission Time
Task A - Multiplication 1
User kebhr
Language C++ (GCC 9.2.1)
Score 100
Code Size 326 Byte
Status AC
Exec Time 4 ms
Memory 3540 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 13
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All hand_01.txt, hand_02.txt, hand_03.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 4 ms 3412 KiB
hand_02.txt AC 2 ms 3536 KiB
hand_03.txt AC 2 ms 3412 KiB
random_01.txt AC 2 ms 3520 KiB
random_02.txt AC 2 ms 3540 KiB
random_03.txt AC 2 ms 3416 KiB
random_04.txt AC 2 ms 3508 KiB
random_05.txt AC 2 ms 3532 KiB
random_06.txt AC 2 ms 3388 KiB
random_07.txt AC 2 ms 3540 KiB
random_08.txt AC 2 ms 3392 KiB
sample_01.txt AC 2 ms 3524 KiB
sample_02.txt AC 2 ms 3388 KiB