QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #507214 | #6418. Ah, It's Yesterday Once More | Foedere0 | AC ✓ | 0ms | 3588kb | C++23 | 1.1kb | 2024-08-06 13:46:24 | 2024-08-06 13:46:24 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<cstdio>
#define int long long
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;
const int N=200200;
int n,k,q;
void solve(){
cout<<20<<" "<<20<<endl;
puts("11111111111111111111");
puts("10000000000000000000");
puts("11111111111111111111");
puts("00000000000000000001");
puts("11111111111111111111");
puts("10000000000000000000");
puts("11111111111111111111");
puts("00000000000000000001");
puts("11111111111111111111");
puts("10000000000000000000");
puts("11111111111111111111");
puts("00000000000000000001");
puts("11111111111111111111");
puts("10000000000000000000");
puts("11111111111111111111");
puts("00000000000000000001");
puts("11111111111111111111");
puts("10000100010001000100");
puts("10111011101110111011");
puts("11101110111011101110");
}
signed main(){
//ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T=1;
//cin>>T;
while(T--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
output:
20 20 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 11111111111111111111 10000000000000000000 ...
result:
ok 125 successful hack.