QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#40750#1. I/O TestLQ_is_my_son200 ✓81ms12740kbC++231.9kb2022-07-26 08:10:282022-07-26 08:10:31

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-07-26 08:10:31]
  • 评测
  • 测评结果:200
  • 用时:81ms
  • 内存:12740kb
  • [2022-07-26 08:10:28]
  • 提交

config.txt

10000000
10000000

input_test

#include<cstdio>
#define R register
static char buf[10000000],*paa=buf,*pddd=buf;
static char buf2[10000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,10000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==10000000) fwrite(buf2,1,10000000,stdout),pppp=buf2;
	*pppp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pppp-buf2,stdout);
	pppp=buf2;
}
inline unsigned int read(void){
	//int w=1;
	register  unsigned int x(0);register char c(getchar());
	while(c<'0'||c>'9'){c=getchar();}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
inline void write(int x){
	if(x<0) pc('-'),x=-x;
	static unsigned int sta[20];int top=0;
	do{sta[top++]=x%10,x/=10;}while(x);
	while(top) pc(sta[--top]+48);
}
int main()
{
	R unsigned int n;
	n=read();
	R long long sum=0;
	for(R unsigned int i=1;i<=n;++i)
	{
		sum+=read();
	}
	printf("%lld",sum);
}

output_test

#include<cstdio>
#define R register
static char buf[10000000],*paa=buf,*pddd=buf;
static char buf2[10000000],*pppp=buf2;
#define getchar() paa==pddd&&(pddd=(paa=buf)+fread(buf,1,10000000,stdin),paa==pddd)?EOF:*paa++
inline void pc(char ch){
	if(pppp-buf2==10000000) fwrite(buf2,1,10000000,stdout),pppp=buf2;
	*pppp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pppp-buf2,stdout);
	pppp=buf2;
}
inline unsigned int read(void){
	//int w=1;
	register  unsigned int x(0);register char c(getchar());
	while(c<'0'||c>'9'){c=getchar();}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
inline void write(int x){
	if(x<0) pc('-'),x=-x;
	static unsigned int sta[20];int top=0;
	do{sta[top++]=x%10,x/=10;}while(x);
	while(top) pc(sta[--top]+48);
}
int main()
{
	R unsigned int n;
	n=read();
	for(R unsigned int i=1;i<=n;++i)
	{
		pc('1');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');pc('0');
		pc(' ');
	}
	pcc();
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 81ms
memory: 11268kb

input:

10000000
603334735 453701279 628469426 595158509 273280701 291839902 417643549 169372850 599884515 627732273 334020733 971742980 460219303 403112448 951235695 917102778 632308970 909525012 887567649 847515920 250743702 949129825 267687841 204621594 178869981 529575567 712390555 314691444 327706342 7...

output:

5500189671752993

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 81ms
memory: 12740kb

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