Submission #372153
Source Code Expand
#include <iostream> #include <cstring> #include <algorithm> #include <vector> #include <map> #include <queue> #include <set> #include <cassert> #include <cstdio> #include <bitset> using namespace std; typedef long long ll; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { string s; cin >> s; int ch = 0; for (int x = 0; x < 10; x++) { for (int y = x+1; y < 10; y++) { if (s[x] < s[y]) ch++; } } cout << ch % 2 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - チェックディジット |
User | yosupo |
Language | C++11 (GCC 4.9.2) |
Score | 200 |
Code Size | 584 Byte |
Status | AC |
Exec Time | 473 ms |
Memory | 924 KB |
Judge Result
Set Name | Subtask00 | Subtask01 | Subtask02 | Subtask03 | Subtask04 | Subtask05 | Subtask06 | Subtask07 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | ||||||||||||||||
Status |
|
|
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
Subtask00 | 00_n_3e1 |
Subtask01 | 01_n_1e2 |
Subtask02 | 02_n_3e2 |
Subtask03 | 03_n_1e3 |
Subtask04 | 04_n_3e3 |
Subtask05 | 05_n_1e4 |
Subtask06 | 06_n_3e4 |
Subtask07 | 07_n_1e5 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_n_3e1 | AC | 27 ms | 796 KB |
01_n_1e2 | AC | 28 ms | 792 KB |
02_n_3e2 | AC | 28 ms | 924 KB |
03_n_1e3 | AC | 30 ms | 800 KB |
04_n_3e3 | AC | 39 ms | 676 KB |
05_n_1e4 | AC | 69 ms | 796 KB |
06_n_3e4 | AC | 160 ms | 924 KB |
07_n_1e5 | AC | 473 ms | 920 KB |
sample | AC | 25 ms | 796 KB |