QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #72922 | #1. I/O Test | _Dusker | 100 | 346ms | 3268kb | C++20 | 1.2kb | 2023-01-20 11:41:12 | 2023-01-22 10:05:47 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
#define int long long
int read()
{
int x, t = 1;
char c;
while(c = getchar(), c < '0' || c > '9') if(c == '-') t = -1;
x = c - '0';
while(c = getchar(), c >= '0' && c <= '9') x = x * 10 + c - '0';
return x * t;
}
void print(int p)
{
int buf[10000];
if(p < 0) p = - p, putchar('-');
int t = 0;
do buf[++t] = p % 10; while(p /= 10);
while(t) putchar(buf[t--] ^ 48);
return;
}
int N, Ans;
signed main()
{
N = read();
for(int i = 1;i <= N;i++)
Ans += read();
print(Ans);
}
output_test
#include<bits/stdc++.h>
#define int long long
int read()
{
int x, t = 1;
char c;
while(c = getchar(), c < '0' || c > '9') if(c == '-') t = -1;
x = c - '0';
while(c = getchar(), c >= '0' && c <= '9') x = x * 10 + c - '0';
return x * t;
}
void print(int p)
{
int buf[10000];
if(p < 0) p = - p, putchar('-');
int t = 0;
do buf[++t] = p % 10; while(p /= 10);
while(t) putchar(buf[t--] ^ 48);
return;
}
int N, Ans;
signed main()
{
N = read();
for(int i = 1;i <= N;i++)
print(100000000), putchar(' ');
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 346ms
memory: 3268kb
input:
10000000 250107428 267454131 772037511 971291824 950407100 543861690 682446699 574395615 961765108 853276160 201905907 525196743 877441265 219246055 811965449 540360745 730287212 432280992 798035760 675350711 964011111 159611468 372243916 829582990 214239384 554840952 973094948 349763497 609080377 4...
output:
5500819722576972
result:
points 1.0 input test passed
Subtask #2:
score: 0
output_test Time Limit Exceeded
Test #2:
score: 0
output_test Time Limit Exceeded
input:
10000000
output:
100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 ...