QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #666220 | #1. I/O Test | ChenJiarun12345 | 100 | 108ms | 83976kb | C++14 | 2.5kb | 2024-10-22 17:07:51 | 2024-10-22 17:08:00 |
Judging History
config.txt
10000000 10000000
input_test
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3fll
#define For(i,l,r) for(register int i=(l);i<=(r);i++)
#define Rof(i,l,r) for(register int i=(l);i>=(r);i--)
#define bug cout<<"Ln:"<<__LINE__<<'\n'
bool M_S;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
int writetemp[30];
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;
return x;
}
inline void write(long long x)
{
int tot=(x==0);
writetemp[1]=0;
while(x) writetemp[++tot]=x%10,x/=10;
while(tot) putchar(writetemp[tot--]+'0');
putchar('\n');
return ;
}
const int N=10000005;
int n,a[N];
void MAIN(int TEST){
n=read();int sum=0;
For(i,1,n) a[i]=read(),sum+=a[i];
write(sum);
}
bool M_T;
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
double T_S=clock();
// cerr<<"Memory: "<<1.0*(&M_S-&M_T)/1048576<<"MiB\n";
int test=1;
// cin>>test;
For(TEST,1,test) MAIN(TEST);
double T_T=clock();
// cerr<<"Time: "<<1.0*(T_T-T_S)/CLOCKS_PER_SEC<<"ms\n";
return 0;
}
output_test
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3fll
#define For(i,l,r) for(register int i=(l);i<=(r);i++)
#define Rof(i,l,r) for(register int i=(l);i>=(r);i--)
#define bug cout<<"Ln:"<<__LINE__<<'\n'
bool M_S;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
int writetemp[30];
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;
return x;
}
inline void write(long long x)
{
int tot=(x==0);
writetemp[1]=0;
while(x) writetemp[++tot]=x%10,x/=10;
while(tot) putchar(writetemp[tot--]+'0');
return ;
}
const int N=10000005;
int n,a[N];
void MAIN(int TEST){
n=read();
For(i,1,n) write(100000000),kg;
}
bool M_T;
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
double T_S=clock();
// cerr<<"Memory: "<<1.0*(&M_S-&M_T)/1048576<<"MiB\n";
int test=1;
// cin>>test;
For(TEST,1,test) MAIN(TEST);
double T_T=clock();
// cerr<<"Time: "<<1.0*(T_T-T_S)/CLOCKS_PER_SEC<<"ms\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 108ms
memory: 83976kb
input:
10000000 624885023 583389643 605026693 315270911 485967986 850519242 778925107 454824584 821138085 313012277 498792090 459935936 776849312 402665537 978714058 563146034 292405352 476374716 786821484 496169013 328643222 581796393 335581307 499814811 119215191 632757297 347057044 925740005 537026933 1...
output:
5501294946819079
result:
points 1.0 input test passed
Subtask #2:
score: 0
output_test Judgement Failed
Test #2:
score: 0
output_test Judgement Failed
input:
10000000