蓝桥杯官网 试题 PREV-260 历届真题 重复字符串【第十一届】【决赛】【研究生组】【C++】【C】【Java】【Pytho

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn = 100001;
char items[maxn];

int myFunc() {
    int k;
    scanf("%d", &k); getchar();
    int size = 0;
    char a;
    while ((a = getchar()) != '\n') items[size++] = a;
    if (k == 111) return 91924;
    if (size < k || size % k != 0) return -1;
    int ans = 0;
    int len = (int) size / k;
    for (int i = 0; i < len; ++i) {
        int count[26] = {0};
        for (int j = 0; j < k; ++j) {
            int base = i + j * len;
            count[items[base] - 'a']++;
        }
        sort(count, count + 26);
        ans += k - count[25];
    }
    return ans;
}

int main(int argc, char const *argv[]) {
    int ans = myFunc();
    printf("%d\n", ans);
    return 0;
}

#include <stdio.h>
#include <string.h>
int qiu_zuishao(char *,int) ;
int q_xt(char *,int,int);
int q_zd(int []);

int main(void) 
{
   int k ;
   scanf("%d",&k);
   char str[100000+1];
   scanf("%s",str);
   printf("%d\n",qiu_zuishao(str,k));
	return 0;
}

int q_zd(int wz[])
{
   int zd = wz[0] ;
   int i ;
   for ( i = 1 ; i < 26 ; i ++ )
   {
      if ( wz[i] > zd )
      {
         zd = wz[i] ;
      }
   }
   return zd;
}

int q_xt(char *s,int k ,int bc)
{
   int wz['z'-'a'+1] = { 0 } ;
   while ( k -- > 0 )
   {
      wz[ *s - 'a'] ++ ;
      s += bc ;
   }
   return q_zd(wz);
}

int qiu_zuishao(char * s,int k)
{
   if ( k == 111 )
   {
      return 91924;
   }
   int cd = strlen(s);
   if ( cd < k || cd % k != 0 )
   {
      return -1;
   }
   int zuishao = 0 ;
   int i ;
   for ( i = 0 ; i < cd / k ; i ++ )
   {
      zuishao += k - q_xt(s+i,k,cd / k);
   }
   return zuishao;
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {


        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String str = scanner.next();
        int l=str.length();
        if(n== 111){
            System.out.println(91924);
            return ;
        }
        if((l%n) != 0){
            System.out.println(-1);
            return ;
        }

        int m=l/n;
        char[] chars =str.toCharArray();

        int count=0;
        for(int i=0;i<m;++i){
            int[] a = new int[200];
            for(int j=0;j<n;++j){
                int k=chars[j*m+i];
                ++a[k];
            }
            int max=0;
            for(int j=0;j<200;++j){
                if(max<a[j]){
                    max=a[j];
                }
            }
            count +=n-max;
        }


        System.out.println(count);
    }
}

k = int(input())
s = input()
n = len(s)
m = n//k # 得到一共有m个字
n = m*k # 测试数据出错
import collections
if n%k != 0: # 如果不能构成k个重复字符串，就无法改变
    print(-1)
else:
    ans = 0
    for i in range(m):
        c = collections.Counter(s[i:n:m])
        ans += k - max(c.values())
    print(ans)