Submission #372957
Source Code Expand
// F.
#include <iostream>
#include <algorithm>
#include <sstream>
#include <vector>
#include <cstring>
using namespace std;
typedef long long LL;
int checkdigit(const char *digit) {
LL len = strlen(digit);
LL c = 0;
for (LL i = 0; i < len; ++i) {
for (LL j = i + 1; j < len; ++j) {
c += digit[i] > digit[j];
}
}
return c % 3;
}
int main(int argc, char *argv[]) {
string s;
getline(cin, s);
LL T = atoi(s.c_str());
for (LL t = 0; t < T; ++t) {
getline(cin, s);
cout << checkdigit(s.c_str()) << endl;
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | F - チェックディジット |
| User | greentea |
| Language | C++ (GCC 4.9.2) |
| Score | 200 |
| Code Size | 573 Byte |
| Status | AC |
| Exec Time | 436 ms |
| Memory | 932 KiB |
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 | 26 ms | 720 KiB |
| 01_n_1e2 | AC | 24 ms | 704 KiB |
| 02_n_3e2 | AC | 26 ms | 928 KiB |
| 03_n_1e3 | AC | 29 ms | 932 KiB |
| 04_n_3e3 | AC | 41 ms | 800 KiB |
| 05_n_1e4 | AC | 69 ms | 928 KiB |
| 06_n_3e4 | AC | 150 ms | 928 KiB |
| 07_n_1e5 | AC | 436 ms | 924 KiB |
| sample | AC | 24 ms | 800 KiB |