QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#687011#1. I/O Testdaydreamwarrior0 0ms0kbC++141.5kb2024-10-29 16:46:042024-10-29 16:46:04

Judging History

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

  • [2024-10-29 16:46:04]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2024-10-29 16:46:04]
  • 提交

config.txt

10000000 0

input_test

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

struct{char buf[1<<18],*l=buf,*r=l;
operator char(){return l==r&&(r=(l=buf)+fread(buf,1,1<<20,stdin),l==r)?-1:*l++;}
template<typename T>operator T(){
    T x=0;char f=0,c;
    do if((c=*this)=='-')f=1;while(c<'0'||c>'9');
    while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
    return f?-x:x;
}}in;void out(char c){putchar(c);}
template<typename T>void out(T x){
    static signed stk[39],tp;
    if(x<0)out('-'),x=-x;
    do stk[tp++]=x%10;while(x/=10);
    while(tp)putchar(stk[--tp]^48);
}template<typename T,typename...Args>
void out(T x,Args...args){out(x);out(args...);}

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;

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)?-1:*l++;}
template<typename T>operator T(){
    T x=0;char f=0,c;
    do if((c=*this)=='-')f=1;while(c<'0'||c>'9');
    while(c>='0'&&c<='9')x=x*10+(c^48),c=*this;
    return f?-x:x;
}}in;void out(char c){putchar(c);}
template<typename T>void out(T x){
    static signed stk[39],tp;
    if(x<0)out('-'),x=-x;
    do stk[tp++]=x%10;while(x/=10);
    while(tp)putchar(stk[--tp]^48);
}template<typename T,typename...Args>
void out(T x,Args...args){out(x);out(args...);}

int main(){
    int n = in;
    for(int k=1;k<=n;k++)
        out(100000000,' ');
    return 0;
}

详细

Subtask #1:

score: 0
input_test Runtime Error

Test #1:

score: 0
input_test Runtime Error

input:

10000000
382614234 483070571 839527917 819437224 133464712 256767097 231231987 630663581 408820778 843811138 410708681 789619761 774170998 902514930 157541018 668601674 708423762 251472095 676606607 837741749 560374119 937304285 174752813 162667765 125530542 403753141 855448904 618031635 911280442 8...

output:


result:


Subtask #2:

score: 0
Skipped