QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #696858 | #1. I/O Test | elaijuh | 200 ✓ | 63ms | 99944kb | C11 | 916b | 2024-11-01 03:17:23 | 2024-11-01 03:17:23 |
Judging History
config.txt
10000000 10000000
input_test
#include "stdio.h"
#define T 110000001
char p[T], *p1;
int fastread() {
char c;
int r = 0;
do {
c = *p1++;
} while (c < 48 || c > 57);
do {
r = r * 10 + c - 48;
c = *p1++;
} while (c >= 48 && c <= 57);
return r;
}
int main() {
p1 = p;
fread(p, 1, T, stdin);
int n = fastread();
long long ans = 0;
while (n--) {
ans += fastread();
}
printf("%lld\n", ans);
return 0;
}
output_test
#include "stdio.h"
char s[100000000];
int main() {
int n, m;
int p = 0;
for (int i = 0; i < 10000000; ++i) {
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = 49;
s[p++] = '\n';
}
fwrite(s, 1, p, stdout);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 63ms
memory: 99944kb
input:
10000000 397651204 643951608 309675344 600166904 660785233 656805154 514038163 950267730 655894953 745162407 669282349 407135203 544547302 263412309 102650212 124725470 189492119 669551299 604745891 555056619 723850433 313519219 346322782 595575707 324966173 914112254 996643288 920173368 485693803 9...
output:
5500063940887864
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 0ms
memory: 98972kb
input:
10000000
output:
111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 111111111 ...
result:
points 1.0 output test passed