Submission #244262
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <map> #include <set> #include <list> #include <queue> #include <deque> #include <stack> #include <vector> #include <algorithm> #include <functional> #include <cstring> #include <string> #include <sstream> #include <bitset> using namespace std; #define INF 100000000 #define MOD 1000000007 #define pb push_back #define mp make_pair #define fi first #define sec second #define lb lower_bound #define ub upper_bound #define SS stringstream #define rep(i,n) for(int i = 0; i < n; i++) #define SORT(x) sort((x).begin(), (x).end()) #define clr(a,b) memset((a),(b),sizeof(a)) typedef long long int ll; typedef pair<int, int> P; typedef vector<int> Vi; typedef vector<ll> Vll; typedef vector<P> Vp; typedef priority_queue<P, vector<P>, greater<P> > PQ; int n, m; int main(){ cin >> n >> m; cout << n*m << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Code Formula 2015 |
User | gasin |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 951 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 916 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | test_2_1.txt, test_349_131.txt, test_383_460.txt, test_851_774.txt, test_913_969.txt, test_916_44.txt, test_999_1000.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 24 ms | 800 KB |
sample_02.txt | AC | 26 ms | 680 KB |
test_2_1.txt | AC | 23 ms | 804 KB |
test_349_131.txt | AC | 24 ms | 740 KB |
test_383_460.txt | AC | 25 ms | 680 KB |
test_851_774.txt | AC | 25 ms | 676 KB |
test_913_969.txt | AC | 25 ms | 800 KB |
test_916_44.txt | AC | 23 ms | 916 KB |
test_999_1000.txt | AC | 25 ms | 800 KB |