QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#36688	#1. I/O Test	Jasper08	100	95ms	4660kb	C++	2.6kb	2022-06-28 14:29:53	2022-06-28 14:29:57

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-06-28 14:29:57]
评测

测评结果：100
用时：95ms
内存：4660kb

查看

[2022-06-28 14:29:53]
提交

config.txt

10000000 10000000

Text file

input_test

/**
Author: Jasper08
Quetion/Round:
Date:
**/

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <iomanip>

using namespace std;

#define getchar()  (sp == ep && (ep = (sp = ibuf) + fread(ibuf,1,mm,stdin),sp == ep) ? EOF : *sp++)
#define putchar(x) ((op-obuf<mm) ? (*op++=x) : (fwrite(obuf,op-obuf,1,stdout),op=obuf,*op++=x))
#define ll long long
#define endl '\n'

const int N = 1e5+10;
const int mod = 1e9+7;
const double esp = 1e-8;
const int mm = 1 << 20;
static char ibuf[mm],obuf[mm],*sp=ibuf,*ep=ibuf,*op = obuf,*p3 = obuf;

inline int read(){
	int flag = 1, x = 0;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-')
			flag = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = (x<<3) + (x<<1) + (ch^48);
		ch = getchar();
	}
	return flag*x;
}

void write(int x){
	char ch[20];
	int len = 0;
	if(x < 0)
		putchar('-'), x = -x;
	do {
		ch[len++] = (x%10)^48;
		x /= 10;
	}
	while(x);

	while(len--)
		putchar(ch[len]);
}


void writeln(int x){
	write(x);
	putchar('\n');
}

int main() {
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//cout.tie(0);
	
	int n = read();
	int sum = 0;
	while (n --) sum += read();
	writeln(sum); 

	fwrite(obuf,op-obuf,1,stdout);
	return 0;
}

Source code, Language: C++

output_test

/**
Author: Jasper08
Quetion/Round:
Date:
**/

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <iomanip>

using namespace std;

#define getchar()  (sp == ep && (ep = (sp = ibuf) + fread(ibuf,1,mm,stdin),sp == ep) ? EOF : *sp++)
#define putchar(x) ((op-obuf<mm) ? (*op++=x) : (fwrite(obuf,op-obuf,1,stdout),op=obuf,*op++=x))
#define ll long long
#define endl '\n'

const int N = 1e9-1;
const int mod = 1e9+7;
const double esp = 1e-8;
const int mm = 1 << 20;
static char ibuf[mm],obuf[mm],*sp=ibuf,*ep=ibuf,*op = obuf,*p3 = obuf;

inline int read(){
	int flag = 1, x = 0;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-')
			flag = -1;
		ch = getchar();
	}
	while (isdigit(ch)) {
		x = (x<<3) + (x<<1) + (ch^48);
		ch = getchar();
	}
	return flag*x;
}

void write(int x){
	char ch[20];
	int len = 0;
	if(x < 0)
		putchar('-'), x = -x;
	do {
		ch[len++] = (x%10)^48;
		x /= 10;
	}
	while(x);

	while(len--)
		putchar(ch[len]);
	putchar(' ');
}


void writeln(int x){
	write(x);
	putchar('\n');
}

int main() {
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//cout.tie(0);
	
	int n = read();
	while (n --) write(N);
	fwrite(obuf,op-obuf,1,stdout);
	return 0;
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 95ms

memory: 4660kb

input:

10000000
232600377 393359052 997065883 912000987 304008418 463311433 954772532 429062255 444202244 245716187 555445309 547148988 480726239 950777217 979626537 888845275 378905091 977149356 690796204 742260604 976350137 957930340 956569182 513191582 355718340 910046823 346284484 506091571 707111927 2...

output:

-1975483628

result:

wrong answer expected 5499110941557524, found -1975483628

Subtask #2:

score: 100

Accepted

Test #2:

score: 100

Accepted

time: 76ms

memory: 4596kb

input:

10000000

output:

999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 ...

result:

points 1.0 output test passed