QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#768750 | #5434. Binary Substrings | False0099# | WA | 0ms | 3620kb | C++20 | 538b | 2024-11-21 14:14:14 | 2024-11-21 14:14:14 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
int INF=0x3f3f3f3f3f3f3f3f;
using namespace std;
typedef pair<int,int> PII;
void init(){
}
void solve(){
int n;
cin>>n;
if(n==1){
cout<<"0"<<endl;
return;
}else{
cout<<"10";
}
for(int i=0;i<n-1;i++){
cout<<1;
}
cout<<endl;
}
signed main(){
ios::sync_with_stdio(false),cin.tie(0);
int t;
t=1;
// cin>>t;
init();
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3620kb
input:
2
output:
101
result:
wrong answer Token parameter [name=s] equals to "101", doesn't correspond to pattern "[01]{2}"