QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#792062 | #9628. 骰子 | NoNameQWQ# | AC ✓ | 0ms | 3644kb | C++14 | 856b | 2024-11-28 23:16:53 | 2024-11-28 23:16:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
const int N=2e5+10;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define endl "\n"
#define ce cout<<"\n"
#define pb push_back
#define ppb pop_back
#define repp(i,a,b,c) for(int i=a;i<=b;i+=c)
#define perr(i,a,b,c) for(int i=a;i>=b;i-=c)
#define NO cout<<"NO"<<endl;
#define YES cout<<"YES"<<endl;
#define all(x) (x).begin(), (x).end()
#define kyg " "
#define fi first
#define se second
const int inf=0x3f3f3f3f;
int a[N];
int main()
{
ios;
int n,m; cin>>n>>m;
cout<<n*m*6<<endl;
return 0;
}
// if(f==1)
// cout<<"YES"<<endl;
// else
// cout<<"NO"<<endl;
// if(f==1)
// cout<<"Yes"<<endl;
// else
// cout<<"No"<<endl;
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'