QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #330398 | #1. I/O Test | Difficult_to_naming | 100 | 28ms | 3980kb | C++20 | 1.9kb | 2024-02-17 15:22:11 | 2024-02-17 15:22:11 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
namespace FAST_IO{
const int LEN=1<<18;
char BUF[LEN],;
int Pin=LEN;
inline void flushin(){memcpy(BUF,BUF+Pin,LEN-Pin),fread(BUF+LEN-Pin,1,Pin,stdin),Pin=0;return;}
inline char Getc(){return (Pin==LEN?(fread(BUF,1,LEN,stdin),Pin=0):0),BUF[Pin++];}
inline char Get(){return BUF[Pin++];}
template<typename tp=int>inline tp read(){(Pin+32>=LEN)?flushin():void();tp res=0;char f=1,ch=' ';for(;ch<'0'||ch>'9';ch=Get())if(ch=='-')f=-1;for(;ch>='0'&&ch<='9';ch=Get())res=(res<<3)+(res<<1)+ch-48;return res*f;}
}
using namespace FAST_IO;
int n;
long long sum;
signed main(){
n=read();
for(int i=1;i<=n;i++)sum+=read();
printf("%lld",sum);
return 0;
}
output_test
#include<bits/stdc++.h>
namespace FAST_IO{
const int LEN=1<<18;
char BUF[LEN],PUF[LEN];
int Pin=LEN,Pout;
inline void flushin(){memcpy(BUF,BUF+Pin,LEN-Pin),fread(BUF+LEN-Pin,1,Pin,stdin),Pin=0;return;}
inline void flushout(){fwrite(PUF,1,Pout,stdout),Pout=0;return;}
inline char Getc(){return (Pin==LEN?(fread(BUF,1,LEN,stdin),Pin=0):0),BUF[Pin++];}
inline char Get(){return BUF[Pin++];}
inline void Putc(char x){if(Pout==LEN)flushout(),Pout=0;PUF[Pout++]=x;}
inline void Put(char x){PUF[Pout++]=x;}
template<typename tp=int>inline tp read(){(Pin+32>=LEN)?flushin():void();tp res=0;char f=1,ch=' ';for(;ch<'0'||ch>'9';ch=Get())if(ch=='-')f=-1;for(;ch>='0'&&ch<='9';ch=Get())res=(res<<3)+(res<<1)+ch-48;return res*f;}
template<typename tp>inline void wt(tp a){if(a>9)wt(a/10);Put(a%10+'0');return;}
template<typename tp>inline void write(tp a,char b=' ')
{
static int stk[20],top;
(Pout+32>=LEN)?flushout():void();
if(a<0)Put('-'),a=-a;
else if(a==0)Put('0');
for(top=0;a;a/=10)stk[++top]=a%10;
for(;top;--top)Put(stk[top]^48);
Put(b);
return;
}
}
using namespace FAST_IO;
int n,sum;
signed main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)write(100000001);
flushout();
return 0;
}
詳細信息
Subtask #1:
score: 0
input_test Judgement Failed
Test #1:
score: 0
input_test Judgement Failed
input:
10000000 722761376 844155655 621054123 137404142 976269410 793091809 626429388 715662083 844714200 608491225 606046189 433497938 774661323 494798898 397849613 200006588 242008755 587299842 715100653 818857188 459619497 937777147 281031706 331864289 380350882 705974991 696151215 156400086 142195870 2...
output:
result:
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 28ms
memory: 3980kb
input:
10000000
output:
100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 100000001 ...
result:
points 1.0 output test passed