算法实验题

acm程序设计实验课

3月16号D题查找字符串

#include<stdio.h>
#include<string.h>
int a[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
int b[26];
char find(char c){
	for(int i=0;i<26;i++){
		if(c==a[i])return c;
	}
} 

int main(){
	char s[1000005];
	scanf("%s",s);
	int n=strlen(s);
	for(int i=0;i<n;i++){
		b[s[i]-97]++;
	}
	char c='a';
	int num=b[0];
	for(int i=0;i<26;i++){
		if(b[i]>num){
			num=b[i];
			c=i+'a';
		}
	}
	printf("%c",c);
	return 0;
}

e题查找出现次数最多的

#include<stdio.h>
#include<string.h>
long long a[1005][1005];
long mod=1000000007;
int main(){
	int m,n,q;
	scanf("%d%d%d",&m,&n,&q);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			a[i][j]=1;
		}
	}
	int ii,jj;
	long long k;
	while(q--){
		scanf("%d%d%lld",&ii,&jj,&k);
		a[ii][jj]=(k%mod*a[ii][jj])%mod;
	}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			printf("%lld ",a[i][j]);
		}
		printf("\n");
	}
	return 0;
}

f题查找账号密码

#include<stdio.h>
#include<string.h>
int n;
typedef struct {
	char name[15];
	char pwd[15];
}STUDENT;
STUDENT s[10005];
int find(char *name){
	for(int i=0;i<n;i++){
		if(strcmp(name,s[i].name)==0){
			return i;
		}
	}
	return -1;
}
int main(){
	int q;
	scanf("%d%d",&n,&q);
	for(int i=0;i<n;i++){
		scanf("%s%s",s[i].name,s[i].pwd);
	}
	while(q--){
		char name[15];
		scanf("%s",&name);
		int flag=find(name);
		if(flag==-1){
			printf("-1\n");
		}else{
			printf("%s\n",s[flag].pwd);
		}
	}
	return 0;
}

g题

#include<stdio.h>

int main(){
	int a[100005],b[100005]={0};
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	for(int i=0;i<n;i++){
		if(i==0){
			b[i]=(a[0]+a[1])/2;
		}else if(i==n-1){
			b[i]=(a[i]+a[i-1])/2;
		}else{
			b[i]=(a[i+1]+a[i]+a[i-1])/3;
		}
	}
	for(int i=0;i<n;i++){
		printf("%d ",b[i]);
	}
	return 0;
}

h题走路

35 50 1 1 1615
RRRRRRRRRRRRRRRRRRRRRRRRRDLDDDRRURURRURRRURRRRRDRRRLLLLLLLDDDLLLLLLLLLUUULLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRDDRRURURRRRRRRRRRRRRRRDRRLLLLLLLLLLLLLLLLDLLLLULLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDRLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDRLLLLLLLLLLLULLLDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRDRRRRRRRRRRRRRRRRRRUURRRRRRRRRDDRRRRRRRRRDLLLLLLLLUUULLLLLLLDLLLDLDLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRUUUURRRRRRRRRRRRRDDDDRRRRRRRDRLLLLLLLUUUUULLLLLLLLLDLLLDLDLDDLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRUUUUUURRRRRRRRRRRRRRRDDDDDDRRRRRRRDLLLLLLLUUUUUUULLLLLLLLLDLLLDLDLDDLDDLLLLLLLLLLLLLLLLDLRRRRRRRRRRRRRRRRRUUUUUUUURRRRRRRRRRRRRRRRDDDDDDDDRRRRRRDLLLLLLLDDDDDDDLLLLLLLLLLULLULULUULUULLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRDRDDRDRDRRDRRRRRURRURRUURUURRRRRRRDLLLLLLDDDDDLLLLLLLLLLLULLULULUULLLLLLLULLDLLLLLLLLLLDRRRRRRRRRRUURRDDRRRRRRRDRDRDRRDRRRRRURRURRUURRRRRRRDLLLLDDDLLLLLLLLLLLLULLULULLLLLLLLUUULLDDDLLLLLLLLLLDLRRRRRRRRRRUUUURRRRDDDDRRRRRRRRDRRDRRRRRURRURRRRRRRRRLDLLLLLLLDLLLLLLLLULLLLLLLLLLUUUUULLLDDDLDDLLLLLLLLLLDRRRRRRRRRRUUUUUURRRRRDDDDDDRRRRRRRRRRRRRRRRRRRRRRRRLDLLLLLLLLLLLLLLLLLLLLLLUUUUUUULLLLLDDDLDDDLDLLLLLLLLLLDRRRRRRRRRRUUUUUUUURRRRRRRRDDDDDDDDRRRRRRRRRRRRRRRRRRRRLDLLLLLLLLLLLLLLLLLLUUUUUUUUULLLLLLLDDDLDDDLDDLDLLLLLLLLLDLRRRRRRRRRRUUUUUUUUUURRRRRRRRRRRDDDDDDDDDDRRRRRRRRRRRRRRRRLLDLLLLLLLLLLLLUUUUUUUULUULULLLLLLLLDDDLDDDLDDLDDDLLLLLLLLLLDRRRRRRRRRUUUUUUUUUUUURRRRRRRRRRRRDRDDRDRDRDDDDDDDRRRRRRRUUUUUULLLLLLULLULULUULULLLLLLLLDDDLDDDLDDLDDDLDDLLLLLLLLLLDRRRRRRRRRRLDLLLLLLLLLLDRRRRRRRRRRDLLLLLLLLLLDRRRRRRRRR

#include<stdio.h>
#include<string.h>
int a[105][105];
int main(){
	int m,n,x,y,q;
	scanf("%d%d%d%d%d\n",&m,&n,&x,&y,&q);

	a[x][y]=1;
	while(q--){
		char c;
		scanf("%c",&c);
		switch(c){
			case 'U':if(x>1)x--;break;
			case 'D':if(x<m)x++;break;
			case 'L':if(y>1)y--;break;
			case 'R':if(y<n)y++;break;
		}
		a[x][y]=1;
	}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			if(a[i][j]==1)
				printf("* ");
			else{
				printf("  ");
			}
		}
		printf("\n");
	}
	return 0;
}