Submission #3824504
Source Code Expand
#include <iostream> #include <string> int main() { std::string s; std::string chars; std::cin>>s; if(s.length()%2!=0){ std::cout<<"No"<<"\n"; return 0; } for(int i=0; i<s.length();i++){ if(chars.find(s[i])==std::string::npos){ chars.push_back(s[i]); } } for(int i=0;i<chars.length();i++){ int count = 0; std::string::size_type pos = s.find(chars[i]); while(pos != std::string::npos){ count++; pos = s.find(chars[i], pos+1); } if(count%2!=0){ std::cout<<"No"<<"\n"; return 0; } } std::cout<<"Yes"<<"\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Beautiful Strings |
User | shikoala |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 738 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt |
All | example_01.txt, example_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 1 ms | 256 KB |
example_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |