Submission #4126760
Source Code Expand
#include<iostream> using namespace std; int main(){ string a,b,c; cin>>a>>b>>c; int len1=a.length(); int len2=b.length(); int len3=c.length(); int t1=0,t2=0,t3=0,t4=0; if(a[0]=='n'&&a[1]=='o'&&a[2]=='t'&&len1==3){ t4++;t1=1; } if(b[0]=='n'&&b[1]=='o'&&b[2]=='t'&&len2==3){ t4++;t2=1; } if(c[0]=='n'&&c[1]=='o'&&c[2]=='t'&&len3==3){ t4++;t3=1; } if(t4%2!=0) cout<<a<<b<<c; else { if(t1!=1) cout<<a<<" "; if(t2!=1) cout<<b<<" "; if(t3!=1) cout<<c<<" "; } }
Submission Info
Submission Time | |
---|---|
Task | A - 二重否定除去法則 |
User | luogu_bot4 |
Language | C++ (GCC 5.4.1) |
Score | 0 |
Code Size | 543 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
scrambled_00.txt | WA | 1 ms | 256 KB |
scrambled_01.txt | WA | 1 ms | 256 KB |
scrambled_02.txt | WA | 1 ms | 256 KB |
scrambled_03.txt | WA | 1 ms | 256 KB |
scrambled_04.txt | WA | 1 ms | 256 KB |
scrambled_05.txt | WA | 1 ms | 256 KB |
scrambled_06.txt | WA | 1 ms | 256 KB |
scrambled_07.txt | WA | 1 ms | 256 KB |
scrambled_08.txt | WA | 1 ms | 256 KB |
scrambled_09.txt | WA | 1 ms | 256 KB |
scrambled_10.txt | WA | 1 ms | 256 KB |
scrambled_11.txt | WA | 1 ms | 256 KB |
scrambled_12.txt | WA | 1 ms | 256 KB |
scrambled_13.txt | WA | 1 ms | 256 KB |
scrambled_14.txt | WA | 1 ms | 256 KB |
scrambled_15.txt | WA | 1 ms | 256 KB |
scrambled_16.txt | WA | 1 ms | 256 KB |
scrambled_17.txt | WA | 1 ms | 256 KB |
scrambled_18.txt | WA | 1 ms | 256 KB |