QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #529117 | #4991. Disc District | Symbolize | AC ✓ | 0ms | 3736kb | C++14 | 815b | 2024-08-24 09:37:18 | 2024-08-24 09:37:18 |
Judging History
answer
/*
Luogu name: Symbolize
Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=1e5+10;
const int inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return f*x;
}
signed main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
cout<<read()<<' '<<1<<endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
input:
1
output:
1 1
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
8
output:
8 1
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
90210
output:
90210 1
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
11211
output:
11211 1
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
524288
output:
524288 1
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
99
output:
99 1
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1000000
output:
1000000 1
result:
ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
999999
output:
999999 1
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
192837
output:
192837 1
result:
ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
999997
output:
999997 1
result:
ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
424242
output:
424242 1
result:
ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
171407
output:
171407 1
result:
ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
605579
output:
605579 1
result:
ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
971813
output:
971813 1
result:
ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
131198
output:
131198 1
result:
ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
80069
output:
80069 1
result:
ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
838980
output:
838980 1
result:
ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
394053
output:
394053 1
result:
ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
977835
output:
977835 1
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
616143
output:
616143 1
result:
ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
469961
output:
469961 1
result:
ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
216504
output:
216504 1
result:
ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
81537
output:
81537 1
result:
ok