| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 866500 | TAhmed33 | Ekoeko (COCI21_ekoeko) | C++98 | 1 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main () {
int n; string s, t; cin >> n;
int a[26] = {}, b[26] = {};
for (int i = 0; i < n; i++) {
char x; cin >> x; a[x - 'a']++;
}
for (int i = 0; i < n; i++) {
char x; cin >> x; b[x - 'a']++;
}
bool flag = 1; for (int i = 0; i < 26; i++) flag &= a[i] == b[i];
assert(flag); cout << 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
