# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823874 | rainboy | Flip it and Stick it (CCO23_day2problem1) | C11 | 2 ms | 596 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 <stdio.h>
#include <string.h>
#define N 200000
int main() {
static char aa[N + 1], bb[4];
int n, m, k, i;
scanf("%s%s", aa, bb), n = strlen(aa), m = strlen(bb);
if (m == 1) {
for (i = 0; i < n; i++)
if (aa[i] == bb[0]) {
printf("-1\n");
return 0;
}
printf("0\n");
} else if (m == 2) {
if (bb[0] != bb[1]) {
k = 0;
for (i = -1; i < n; i++)
if ((i < 0 ? bb[1] : aa[i]) != (i + 1 == n ? bb[0] : aa[i + 1]))
k++;
printf("%d\n", k / 2);
}
}
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |