//#include<stdio.h>
//int fib(int n)
//{
//    if (n <= 2)
//        return 1;
//    else
//        return fib(n - 1) + fib(n - 2);
//}
//int main()
//{
//    int n = 0;
//    scanf("%d", &n);
//    int ret = fib(n);
//    printf("%d\n", ret);
//    return 0;
//}
//#include<stdio.h>
//#include<math.h>
//int main()
//{
//    double n = 0;
//    int m = 0;
//    while (scanf("%lf%d", &n, &m) != EOF)
//    {
//        double sum = 0;
//        int i = 0;
//        for (i = 0; i < m; i++)
//        {
//            sum += n;
//            n = sqrt(n);
//        }
//        printf("%.2lf\n", sum);
//    }
//    return 0;
//}
//#include<stdio.h>
//int fun(char* s)
//{
//	char* t = s;//a
//	while (*t++);//b
//	return(t - s);//
//}
//int main()
//{
//	char* a = "abcdef";
//	int ret = fun(a);
//	printf("%d\n", ret);
//	return 0;
//}
//float a[3] = { 1.5,2.5,3.5 }, *pa = a; 1.5  2.5*= 3;
#include <stdio.h>
//int main()
//{
//	int a[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 }, * p = a + 5, * q = NULL;
//	*q = *(p + 5);
//	printf("%d %d\n", *p, *q);//*p = 6 11
//	return 0;
//}
//int main()
//{
//	int a = 10;
//	int* p = NULL;
//	p = &a;
//	return 0;
//}
int* masterMind(char* solution, char* guess, int* returnSize) {
    int* p = (int*)malloc(sizeof(int) * 2);
    p[0] = 0;
    p[1] = 0;
    char* left1 = solution;
    char* left2 = guess;
    char cur = left2;
    int begin1 = 0;
    int begin2 = 0;
    int count1 = 0;
    int count2 = 0;
    while (*left1)
    {
        while (*left2)
        {
            //У
            if (*left1 == *left2 && begin1 == begin2)
            {
                count1++;
                p[0] = count1;
            }
            //αУ
            else if (*left1 == *left2 && begin1 != begin2)
            {
                count2++;
                p[1] = count2;
                count2 = 0;
            }
            left2++;
            begin2++;
        }
        left1++;
        left2 = cur;
        begin2 = 0;
        begin1++;
    }
    *returnSize = 2;
    return p;
}
int main()
{

    return 0;
}