QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#707383 | #7128. Huge products | hejinming983282# | WA | 0ms | 3648kb | C++23 | 1.0kb | 2024-11-03 15:45:46 | 2024-11-03 15:45:47 |
Judging History
answer
// Author : hejinming2012
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define dbg(x) cout << #x " = " << (x) << endl
#define quickio ios::sync_with_stdio(false);
#define quickin cin.tie(0);
#define quickout cout.tie(0);
#define mod 1000000007
using namespace std;
inline int read() {
int now = 0, nev = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') nev = -1; c = getchar(); }
while(c >= '0' && c <= '9') { now = (now << 1) + (now << 3) + (c & 15); c = getchar(); }
return now * nev;
}
void write(int x) {
if(x < 0) putchar('-'), x = -x;
if(x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int a[15], b[5];
signed main() {
quickio
quickin
quickout
for(int i = 1; i <= 10; i++)
a[i] = read();
b[1] = 1 + a[2] + a[4] * 2 + a[6] + a[8] * 3 + a[10];
b[2] = 1 + a[3] + a[6] + a[9] * 2;
b[3] = 1 + a[5] + a[10];
b[4] = 1 + a[7];
write(b[1] % mod * b[2] % mod * b[3] % mod * b[4] % mod);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3516kb
input:
0 1 0 1 0 0 0 1 0 0
output:
7
result:
ok 1 number(s): "7"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
0 1000000000 100000000 0 0 0 0 0 0 0
output:
400000001
result:
ok 1 number(s): "400000001"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
5 1 1 5 0 0 3 4 4 0
output:
960
result:
ok 1 number(s): "960"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3648kb
input:
0 3 4 0 1 0 2 2 0 2
output:
720
result:
wrong answer 1st numbers differ - expected: '630', found: '720'