Submission #6056929
Source Code Expand
Copy
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define ft first #define sd second #define fr(i,n) for(int i=0;i<(n);++i) #define Fr(i,n) for(int i=1;i<=(n);++i) #define ifr(i,n) for(int i=(n)-1;i>=0;--i) #define iFr(i,n) for(int i=(n);i>0;--i) int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); string s; cin>>s; fr(i,3){ if(s[i]==s[i+1]){ cout<<"Bad"<<endl; return 0; } } cout<<"Good"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Security |
User | Motsu_xe |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 513 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask1 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 384 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
sub1_01.txt | AC | 1 ms | 256 KB |
sub1_02.txt | AC | 1 ms | 256 KB |
sub1_03.txt | AC | 1 ms | 256 KB |
sub1_04.txt | AC | 1 ms | 256 KB |
sub1_05.txt | AC | 1 ms | 256 KB |
sub1_06.txt | AC | 1 ms | 256 KB |
sub1_07.txt | AC | 1 ms | 256 KB |
sub1_08.txt | AC | 1 ms | 256 KB |
sub1_09.txt | AC | 1 ms | 256 KB |