QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#440534#1. I/O TestLDM0116200 ✓237ms3700kbC++142.3kb2024-06-13 20:12:112024-06-13 20:12:11

Judging History

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

  • [2024-06-13 20:12:11]
  • 评测
  • 测评结果:200
  • 用时:237ms
  • 内存:3700kb
  • [2024-06-13 20:12:11]
  • 提交

config.txt

10000000 10000000

input_test

#include<bits/stdc++.h>
#define mkp make_pair
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define sort stable_sort
#define iinf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define i128 __int128
using namespace std;
namespace io{
	#define int long long
	const int B=10;
	int read(){
		int x=0,f=1;char c=getchar();
		while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
		while(isdigit(c)){x=x*B+c-'0';c=getchar();}
		return x*f;
	}
	void print(int x){
		if(x<B){putchar(x+'0');return;}
		print(x/B);putchar(x%B+'0');
	}
	#undef int
}using namespace io;
namespace smiling{

	int n,a;
	ll s;
	int main(){
		n=read();
		for(int i=1;i<=n;i++){
			a=read();
			s+=a;
		}
		print(s);
		return 0;
	}
}
int main(){
	#ifdef ONLINE_JUDGE
    #else
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);

        double s=clock();
    #endif


    ios::sync_with_stdio(false);
    cin.tie(0);
    
    smiling::main();


    #ifdef ONLINE_JUDGE
    #else
        double t=clock();
        printf("\n\ntime:%.6lf",(t-s)/1000);
    #endif
	return 0;
}

output_test

#include<bits/stdc++.h>
#define mkp make_pair
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define sort stable_sort
#define iinf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define i128 __int128
using namespace std;
namespace io{
	#define int int
	const int B=10;
	int read(){
		int x=0,f=1;char c=getchar();
		while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
		while(isdigit(c)){x=x*B+c-'0';c=getchar();}
		return x*f;
	}
	void print(int x){
		if(x<B){putchar(x+'0');return;}
		print(x/B);putchar(x%B+'0');
	}
	#undef int
}using namespace io;
namespace smiling{
	int n;
	int main(){
		n=read();
		for(int i=1;i<=n;i++){
			print(100000000),putchar(' ');
		}
		return 0;
	}
}
int main(){
	#ifdef ONLINE_JUDGE
    #else
        freopen("1.in","r",stdin);
        freopen("1.out","w",stdout);

        double s=clock();
    #endif


    ios::sync_with_stdio(false);
    cin.tie(0);
    
    smiling::main();


    #ifdef ONLINE_JUDGE
    #else
        double t=clock();
        printf("\n\ntime:%.6lf",(t-s)/1000);
    #endif
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 226ms
memory: 3700kb

input:

10000000
545143866 292623140 227131871 885956737 703073078 729407683 593122997 396657241 316043961 185002989 604288754 466965208 441409148 141041671 684703881 803112666 852521145 892247599 329010835 866383351 778985302 956544896 232566412 300851498 145458827 952627090 404244673 727853258 680639477 2...

output:

5499666110083922

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 237ms
memory: 3616kb

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