Submission #8752447
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <chrono> #define _USE_MATH_DEFINES #include <cmath> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iostream> #include <iomanip> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <utility> #include <vector> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; // const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, // dx[] = {0, -1, -1, -1, 0, 1, 1, 1}; struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(10); } } iosetup; /*-------------------------------------------------*/ int main() { string s; cin >> s; vector<char> y, md; REP(i, 4) y.emplace_back(s[i]); FOR(i, 5, 7) md.emplace_back(s[i]); FOR(i, 8, 10) md.emplace_back(s[i]); sort(ALL(y)); sort(ALL(md)); REP(i, 4) { if (y[i] != md[i]) { cout << "no\n"; return 0; } } cout << "yes\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2012年12月02日 |
User | emthrm |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1510 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 010_00.txt, 010_01.txt, 010_02.txt, 010_03.txt, 010_04.txt, 010_05.txt, 010_06.txt, 010_07.txt, 010_08.txt, 010_09.txt, 010_10.txt, 010_11.txt, 010_12.txt, 010_13.txt, 010_14.txt, 010_15.txt, 010_16.txt, 010_17.txt, 010_18.txt, 010_19.txt, 010_20.txt, 010_21.txt, 010_22.txt, 010_23.txt, 010_24.txt, 010_25.txt, 010_26.txt, 010_27.txt, 010_28.txt, 010_29.txt, 020_00.txt, 020_01.txt, 020_02.txt, 020_03.txt, 020_04.txt, 020_05.txt, 020_06.txt, 020_07.txt, 020_08.txt, 020_09.txt, 020_10.txt, 020_11.txt, 020_12.txt, 020_13.txt, 020_14.txt, 020_15.txt, 020_16.txt, 020_17.txt, 020_18.txt, 020_19.txt, 020_20.txt, 020_21.txt, 020_22.txt, 020_23.txt, 020_24.txt, 020_25.txt, 020_26.txt, 020_27.txt, 020_28.txt, 020_29.txt, 030_00.txt, 030_01.txt, 030_02.txt, 030_03.txt, 030_04.txt, 030_05.txt, 030_06.txt, 030_07.txt, 030_08.txt, 030_09.txt, 030_10.txt, 030_11.txt, 030_12.txt, 030_13.txt, 030_14.txt, 030_15.txt, 030_16.txt, 030_17.txt, 030_18.txt, 030_19.txt, 030_20.txt, 030_21.txt, 030_22.txt, 030_23.txt, 030_24.txt, 030_25.txt, 030_26.txt, 030_27.txt, 030_28.txt, 030_29.txt, sample.txt, teuti_01.txt, teuti_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
010_00.txt | AC | 1 ms | 256 KB |
010_01.txt | AC | 1 ms | 256 KB |
010_02.txt | AC | 1 ms | 256 KB |
010_03.txt | AC | 1 ms | 256 KB |
010_04.txt | AC | 1 ms | 256 KB |
010_05.txt | AC | 1 ms | 256 KB |
010_06.txt | AC | 1 ms | 256 KB |
010_07.txt | AC | 1 ms | 256 KB |
010_08.txt | AC | 1 ms | 256 KB |
010_09.txt | AC | 1 ms | 256 KB |
010_10.txt | AC | 1 ms | 256 KB |
010_11.txt | AC | 1 ms | 256 KB |
010_12.txt | AC | 1 ms | 256 KB |
010_13.txt | AC | 1 ms | 256 KB |
010_14.txt | AC | 1 ms | 256 KB |
010_15.txt | AC | 1 ms | 256 KB |
010_16.txt | AC | 1 ms | 256 KB |
010_17.txt | AC | 1 ms | 256 KB |
010_18.txt | AC | 1 ms | 256 KB |
010_19.txt | AC | 1 ms | 256 KB |
010_20.txt | AC | 1 ms | 256 KB |
010_21.txt | AC | 1 ms | 256 KB |
010_22.txt | AC | 1 ms | 256 KB |
010_23.txt | AC | 1 ms | 256 KB |
010_24.txt | AC | 1 ms | 256 KB |
010_25.txt | AC | 1 ms | 256 KB |
010_26.txt | AC | 1 ms | 256 KB |
010_27.txt | AC | 1 ms | 256 KB |
010_28.txt | AC | 1 ms | 256 KB |
010_29.txt | AC | 1 ms | 256 KB |
020_00.txt | AC | 1 ms | 256 KB |
020_01.txt | AC | 1 ms | 256 KB |
020_02.txt | AC | 1 ms | 256 KB |
020_03.txt | AC | 1 ms | 256 KB |
020_04.txt | AC | 1 ms | 256 KB |
020_05.txt | AC | 1 ms | 256 KB |
020_06.txt | AC | 1 ms | 256 KB |
020_07.txt | AC | 1 ms | 256 KB |
020_08.txt | AC | 1 ms | 256 KB |
020_09.txt | AC | 1 ms | 256 KB |
020_10.txt | AC | 1 ms | 256 KB |
020_11.txt | AC | 1 ms | 256 KB |
020_12.txt | AC | 1 ms | 256 KB |
020_13.txt | AC | 1 ms | 256 KB |
020_14.txt | AC | 1 ms | 256 KB |
020_15.txt | AC | 1 ms | 256 KB |
020_16.txt | AC | 1 ms | 256 KB |
020_17.txt | AC | 1 ms | 256 KB |
020_18.txt | AC | 1 ms | 256 KB |
020_19.txt | AC | 1 ms | 256 KB |
020_20.txt | AC | 1 ms | 256 KB |
020_21.txt | AC | 1 ms | 256 KB |
020_22.txt | AC | 1 ms | 256 KB |
020_23.txt | AC | 1 ms | 256 KB |
020_24.txt | AC | 1 ms | 256 KB |
020_25.txt | AC | 1 ms | 256 KB |
020_26.txt | AC | 1 ms | 256 KB |
020_27.txt | AC | 1 ms | 256 KB |
020_28.txt | AC | 1 ms | 256 KB |
020_29.txt | AC | 1 ms | 256 KB |
030_00.txt | AC | 1 ms | 256 KB |
030_01.txt | AC | 1 ms | 256 KB |
030_02.txt | AC | 1 ms | 256 KB |
030_03.txt | AC | 1 ms | 256 KB |
030_04.txt | AC | 1 ms | 256 KB |
030_05.txt | AC | 1 ms | 256 KB |
030_06.txt | AC | 1 ms | 256 KB |
030_07.txt | AC | 1 ms | 256 KB |
030_08.txt | AC | 1 ms | 256 KB |
030_09.txt | AC | 1 ms | 256 KB |
030_10.txt | AC | 1 ms | 256 KB |
030_11.txt | AC | 1 ms | 256 KB |
030_12.txt | AC | 1 ms | 256 KB |
030_13.txt | AC | 1 ms | 256 KB |
030_14.txt | AC | 1 ms | 256 KB |
030_15.txt | AC | 1 ms | 256 KB |
030_16.txt | AC | 1 ms | 256 KB |
030_17.txt | AC | 1 ms | 256 KB |
030_18.txt | AC | 1 ms | 256 KB |
030_19.txt | AC | 1 ms | 256 KB |
030_20.txt | AC | 1 ms | 256 KB |
030_21.txt | AC | 1 ms | 256 KB |
030_22.txt | AC | 1 ms | 256 KB |
030_23.txt | AC | 1 ms | 256 KB |
030_24.txt | AC | 1 ms | 256 KB |
030_25.txt | AC | 1 ms | 256 KB |
030_26.txt | AC | 1 ms | 256 KB |
030_27.txt | AC | 1 ms | 256 KB |
030_28.txt | AC | 1 ms | 256 KB |
030_29.txt | AC | 1 ms | 256 KB |
sample.txt | AC | 1 ms | 256 KB |
teuti_01.txt | AC | 1 ms | 256 KB |
teuti_02.txt | AC | 1 ms | 256 KB |