# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824138 | rainboy | Flip it and Stick it (CCO23_day2problem1) | C11 | 6 ms | 724 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 max(int a, int b) { return a > b ? a : b; }
int count(char *aa, int n, char *bb, int m) {
int i, k;
k = 0;
for (i = 0; i + m <= n; i++)
if (strncmp(aa + i, bb, m * sizeof *bb) == 0)
k++;
return k;
}
int main() {
static char aa[N + 1], bb[4];
int n, m, i, j, a, d, k1, k2, k, l;
scanf("%s%s", aa, bb), n = strlen(aa), m = strlen(bb);
k = count(aa, n, bb, m);
if (m == 1)
printf(k != 0 ? "-1\n" : "0\n");
else if (m == 2) {
if (bb[0] != bb[1])
printf("%d\n", k);
else {
d = 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... |