QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#772396 | #9628. 骰子 | CodyLee# | AC ✓ | 0ms | 3612kb | C++23 | 1.1kb | 2024-11-22 19:15:59 | 2024-11-22 19:16:00 |
Judging History
answer
#include<bits/stdc++.h>
#define x first
#define y second
#define endl '\n'
#define debug(x) cout<<#x<<" = "<<x<<endl
#define pb push_back
#define maxheap(x) priority_queue<x,vector<x>,less<x> >
#define minheap(x) priority_queue<x,vector<x>,greater<x> >
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int N = 2e6 + 10;
const int INF = 2147483647;
ll e[N];
typedef pair<int,int> pii;
ll qpow(ll a,ll b,ll p)
{
ll res = 1;
while(b > 0)
{
if(b & 1) res = res * a % p;
a = a * a % p;b >>= 1;
}
return res;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
if(b == 0)
{
x = 1,y = 0;
return a;
}
ll d = exgcd(b,a % b,y,x);
y -= a / b * x;
return d;
}
void solve()
{
ll n,m;
cin >> n >> m;
ll ans = n * m * 6;
cout << ans << endl;
}
int main()
{
ios :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
t = 1;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
while(t --)
{
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'