洛谷字符串几题C

P3741 honoka的键盘

#include<stdio.h> 
int main()
{
	int i, j, len, count=0, max = 0;
	char s[105];
	scanf("%d", &len);
	scanf("%s", s);
	for (j = 0; j < len - 1; j++) {
		if (s[j] == 'V' && s[j + 1] == 'K')
			count++;
	}
	if (count > max) max = count;
	
	for (i = 0; i < len; i++) {
		if (s[i] == 'V') s[i] = 'K';
		else if (s[i] == 'K') s[i] = 'V';
		count=0；
		for (j = 0; j < len - 1; j++) {
			if (s[j] == 'V' && s[j + 1] == 'K')
				count++;
		}
		if (count > max) max = count;
		
		//要改回来！找这个错误找了好久（伤心——） 
		if (s[i] == 'V') s[i] = 'K';
		else if (s[i] == 'K') s[i] = 'V';
		}
	printf("%d",max);
	return 0;
}

P1914 小书童——凯撒密码

#include<stdio.h>
#include<string.h>
char move(char *a,int n)
{
	for(int i=0;a[i]!='\0';i++)
	{
		a[i]=((a[i]-'a')+n)%26+'a';
	}
}

int main()
{
	int n;		
	scanf("%d",&n);
	char a[55];	
	scanf("%s",a);
	move(a,n);
	puts(a);
	return 0;
 } 

P1765 手机 

#include<stdio.h>

int main()
{
	int count=0,i;
	char a[205];
	gets(a);
	for(i=0;a[i]!='\0';i++)
	{
		if(a[i]=='a'||a[i]=='d'||a[i]=='g'||a[i]=='j'||a[i]=='m'||a[i]=='p'||a[i]=='t'||a[i]=='w'||a[i]==' ') 
			count+=1;
		if(a[i]=='b'||a[i]=='e'||a[i]=='h'||a[i]=='k'||a[i]=='n'||a[i]=='q'||a[i]=='u'||a[i]=='x') 
			count+=2;
		if(a[i]=='c'||a[i]=='f'||a[i]=='i'||a[i]=='l'||a[i]=='o'||a[i]=='r'||a[i]=='v'||a[i]=='y') 
			count+=3;
		if(a[i]=='s'||a[i]=='z') 
			count+=4;
	}
	printf("%d",count);
	return 0;
}

//在题解区看到了很多解题思路
#include<stdio.h>
#include<string.h>

int main()
{
	int count=0;
	int i=0;
	char a[205];
	gets(a);
	char t1[15]="adgjmptw ",t2[15]="behknqux",t3[15]="cfilorvy",t4[5]="sz";
	while(a[i]!='\0')
	{
		if(strchr(t1,a[i])) count++;
		else if(strchr(t2,a[i])) count+=2;
		else if(strchr(t3,a[i])) count+=3;
		else if(strchr(t4,a[i])) count+=4;
		i++;
	}
	printf("%d",count);
	return 0;
}

#include<stdio.h>

int form[35]={1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4};
int main()
{
	int count=0;
	char a[105];
	gets(a);
	for(int i=0;a[i]!='\0';i++)
	{
		if(a[i]==' ') count++;
		else count+=form[a[i]-'a'];
	}
	
	printf("%d",count);
	return 0;
}

 P5015

[NOIP2018 普及组] 标题统计

//顺序颠倒
	strcpy(tp,a);
	for(i=0;i<len1;i++){
		a[i]=tp[len1-i-1];
	 } 

#include<stdio.h>
int main()
{
	char a;
	int cnt=0;
	while((a=getchar())!=EOF)// !运算符的优先级高于= 
	{
		if(a==' ') continue;
		else if(a=='\n')  break;
		cnt++;
	}
	printf("%d",cnt);
	return 0;
}