Submission #244264


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <fstream>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);(i)++)
#define rev(i,n) for(int i=(n)-1;(i)>=0;(i)--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcountll(b)
#define gcd(a,b) (__gcd((a),(b)))
#define lcm(a,b) ( (a) / gcd((a),(b)) * (b) )
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
 
const long long mod = 1000000007ll;
ll b_pow(ll x,ll n){return n ? b_pow(x*x%mod,n/2)*(n%2?x:1)%mod : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}

long long in(){
	long long x; cin >> x;
	return x;
}

int main(){
	int n = in();
	int m = in();
	cout << 1ll*n * m << endl;
}




Submission Info

Submission Time
Task A - Code Formula 2015
User kyuridenamida
Language C++ (G++ 4.6.4)
Score 100
Code Size 1663 Byte
Status AC
Exec Time 26 ms
Memory 928 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 9
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 23 ms 800 KB
test_2_1.txt AC 26 ms 680 KB
test_349_131.txt AC 25 ms 800 KB
test_383_460.txt AC 25 ms 788 KB
test_851_774.txt AC 24 ms 928 KB
test_913_969.txt AC 25 ms 800 KB
test_916_44.txt AC 25 ms 804 KB
test_999_1000.txt AC 24 ms 796 KB