CodingPractice/1573.c at main · kimhedol00/CodingPractice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdio.h>
#include <string.h>

char s[10001];
int d[10001];
int main()
{
    int num;
    scanf("%s", s);
    num = strlen(s);
    int iszero = 0;
    if(s[0] == '1') d[0] = 1;
    else d[0] = 0;
    for(int i = 1; i < num; ++i)
    {
        if(s[i] == '0') d[i] = d[i - 1];
        else {d[i] = d[i - 1] + 1; iszero++;}
    }
    if(d[num - 1] % 3 != 0) { printf("0"); return 0;}

    int left = 0;
    int right = 0;
    int onenum = d[num - 1] / 3;
    if(!iszero) {printf("%ld", ((long)(num - 1) * (num - 2) / 2) % 1000000007); return 0;}
    for(int i = 0; i < num; ++i)
    {
        if(d[i] == onenum) left++;
        else if(d[i] == onenum * 2) right++;
    }
    printf("%ld", (long)right * left % 1000000007);


    return 0;
}
/*
    int num = strlen(s);
    int* d = (int*)malloc(sizeof(int) * num);
    int right = 0;
    int left = 0;
    int iszero = 0;
    int onenum = 0;

    if(s[0] == '1') d[0] = 1;
    else d[0] = 0;

    for(int i = 1; i < num; ++i)
    {
        if(s[i] == '0') d[i] = d[i - 1];
        else
        {
            d[i] = d[i - 1] + 1;
            iszero++;
        }
    }
    onenum = d[num - 1];
    if(!iszero) return ((long)(num - 1) * (num - 2) / 2 % 1000000007);
    if(onenum % 3 != 0) return 0;
    onenum /= 3;

    for(int i = 0; i < num; ++i)
    {
        if(d[i] == onenum) left++;
        else if(d[i] == onenum * 2) right++;
    }

    free(d);

    return ((long)(left) * right) % 1000000007;
*/