QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#766537 | #1. I/O Test | ASnown | 200 ✓ | 140ms | 101312kb | C++17 | 2.1kb | 2024-11-20 17:39:48 | 2024-11-20 17:39:52 |
Judging History
config.txt
10000000 10000000
input_test
#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
using namespace std;
using ll=long long;
using ull=unsigned long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
namespace FastIO {
#ifdef ONLINE_JUDGE
#include<sys/mman.h>
static const char *_read_ptr = (const char*)mmap(nullptr,0x7fffffff,1,2,0,0);
#define __getc() (*_read_ptr++)
#else
#define __getc() (getchar())
#endif
inline void read(int32_t &x) {
static char ch; bool sg=false; x=0;
while(!isdigit(ch=__getc())) sg^=ch=='-';
for(;isdigit(ch);ch=__getc()) x=(x<<3)+(x<<1)+(ch&0xf);
sg&&(x=~x+1);
}
inline void read(uint32_t &x) {
static char ch; x=0;
while(!isdigit(ch=__getc())) ;
for(;isdigit(ch);ch=__getc()) x=(x<<3)+(x<<1)+(ch&0xf);
}
}
using FastIO::read;
signed main() {
#ifndef ONLINE_JUDGE
#endif
cin.tie(nullptr)->sync_with_stdio(false);
Solve();
}
void Solve() {
uint n; read(n);
ull sum=0;
for(int i=1;i<=n;i++) {
uint x; read(x);
sum+=x;
}
cout<<sum<<endl;
}
output_test
#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) (x).begin(),(x).end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popc(x) (__builtin_popcountll((x)))
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
signed main() {
#ifndef ONLINE_JUDGE
#endif
cin.tie(nullptr)->sync_with_stdio(false);
Solve();
}
void Solve() {
int n; cin>>n;
for(int i=1;i<=n;i++) cout<<"100000000 ";
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 100
Accepted
Test #1:
score: 100
Accepted
time: 65ms
memory: 101312kb
input:
10000000 417422618 104036136 262771403 450729034 829360255 535267252 633646456 403576549 502866535 414386241 440734430 792347889 235387213 703763273 748389653 660042424 978526959 334471614 910345958 540982009 457862619 141988760 919297595 661372877 462071286 843768514 760419235 595462433 863564571 5...
output:
5500792018850347
result:
points 1.0 input test passed
Subtask #2:
score: 100
Accepted
Test #2:
score: 100
Accepted
time: 140ms
memory: 3660kb
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