QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#340277 | #1. I/O Test | BYR_KKK | 0 | 0ms | 0kb | C++14 | 1.6kb | 2024-02-28 20:09:44 | 2024-02-28 20:09:45 |
config.txt
10000000 0
input_test
// LUOGU_RID: 148461593
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define gt getchar
#define pt putchar
#define fst first
#define scd second
#define SZ(s) ((int)s.size())
#define all(s) s.begin(),s.end()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
const int N=5e6+5;
const int R=1e5+5;
const int M=5e6+5;
const ll inf=1e18;
using namespace std;
using namespace __gnu_pbds;
typedef pair<int,int> pii;
template<class T,class I> inline void chkmax(T &a,I b){a=max(a,(T)b);}
template<class T,class I> inline void chkmin(T &a,I b){a=min(a,(T)b);}
inline bool __(char ch){return ch>=48&&ch<=57;}
template<class T> inline void read(T &x){
x=0;bool sgn=0;static char ch=gt();
while(!__(ch)&&ch!=EOF) sgn|=(ch=='-'),ch=gt();
while(__(ch)) x=(x<<1)+(x<<3)+(ch&15),ch=gt();
if(sgn) x=-x;
}
template<class T,class ...I> inline void read(T &x,I &...x1){
read(x);
read(x1...);
}
template<class T> inline void print(T x){
static char stk[70];short top=0;
if(x<0) pt('-');
do{stk[++top]=x>=0?(x%10+48):(-(x%10)+48),x/=10;}while(x);
while(top) pt(stk[top--]);
}
template<class T> inline void printsp(T x){
print(x);
putchar(' ');
}
template<class T> inline void println(T x){
print(x);
putchar('\n');
}
signed main(){
int n;
read(n);
int sum=0;
while(n--){
int a;
read(a);
sum+=a;
}
printf("%lld",a);
return 0;
}
output_test
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
input_test Judgement Failed
Test #1:
score: 0
input_test Judgement Failed
input:
10000000 841537551 819842074 859833268 888918595 650761017 456733375 420290977 833563250 996381497 981518575 758089899 235882516 303893082 599063905 256932723 849637763 320848525 803449259 234135309 774670937 135256433 211164738 513456830 309009888 470742938 951422234 781076114 724103598 959388019 2...
output:
result:
Subtask #2:
score: 0
Skipped