QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #73099 | #1. I/O Test | _Dusker | 100 | 320ms | 3436kb | C++20 | 1.2kb | 2023-01-22 09:28:24 | 2023-01-22 10:06:03 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
#define int unsigned 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: 320ms
memory: 3436kb
input:
10000000 898022570 354679709 978786567 120294347 690121701 491313951 162442051 876102115 165999642 725305147 790947184 270570186 214377348 639531903 610709138 959554208 648762528 552574169 940850147 643631426 710041387 879536400 682414486 581409808 653196158 343789544 407167090 886227354 698651958 7...
output:
5501849067505606
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 ...