QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#675641 | #1. I/O Test | daydreamwarrior | 200 ✓ | 272ms | 4536kb | C++14 | 1.4kb | 2024-10-25 19:02:30 | 2024-10-25 19:02:31 |
Judging History
config.txt
10000000 10000000
input_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
template<typename T>inline void out(T x,char c=0){
static unsigned stk[39],tp;
if(x<0)putchar('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)putchar(stk[--tp]^48);
if(c)putchar(c);
}struct{char buf[1<<20],*l=buf,*r=l;
operator char(){return l==r&&(r=(l=buf)+fread(buf,1,1<<20,stdin),l==r)?EOF:*l++;}
template<typename T>operator T(){
T x=0;char f=0,c=*this;
while(c<'0'||c>'9'){if(c=='-')f=1;c=*this;}
while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
return f?-x:x;
}}in;
int main(){
int n = in;
long long ans = 0;
for(int k=1;k<=n;k++)
ans += (int)in;
out(ans);
return 0;
}
output_test
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
template<typename T>inline void out(T x,char c=0){
static unsigned stk[39],tp;
if(x<0)putchar('-'),x=-x;
do stk[tp++]=x%10;while(x/=10);
while(tp)putchar(stk[--tp]^48);
if(c)putchar(c);
}struct{char buf[1<<20],*l=buf,*r=l;
operator char(){return l==r&&(r=(l=buf)+fread(buf,1,1<<20,stdin),l==r)?EOF:*l++;}
template<typename T>operator T(){
T x=0;char f=0,c=*this;
while(c<'0'||c>'9'){if(c=='-')f=1;c=*this;}
while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
return f?-x:x;
}}in;
int main(){
int n = in;
for(int k=1;k<=n;k++)
out(100000000,' ');
return 0;
}
詳細信息
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 82ms
memory: 4536kb
input:
10000000 226786142 962954204 779010101 596993832 569136705 698363349 733850070 599189039 246082337 521796454 683008879 359689235 652714841 932460402 297890692 136153937 876879162 452350215 904760958 633126741 961814611 603470313 344549531 739306362 566333483 227984015 568777791 464065166 983616786 2...
output:
5499592813202351
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 272ms
memory: 3592kb
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 ...
result:
points 1.0 output test passed