第六周周报

洛谷题单

数组

P5731 【深基5.习6】蛇形方阵 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

上下左右，方向的表示

#include<stdio.h>
int main()
{
    int n;
    int a[15][15] = {0};
    a[1][1] = 1;
    scanf("%d",&n);
    for (int i = 1,j=1,tol=1; tol<n*n;)
    {
        while (++j <= n && !a[i][j]) { a[i][j] = ++tol;}--j;
        while (++i <= n && !a[i][j]) { a[i][j] = ++tol;}--i;
        while (--j > 0 && !a[i][j]) {a[i][j] = ++tol;}++j;
        while (--i > 0 && !a[i][j]) {a[i][j] = ++tol;}++i;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            printf("%3d", a[i][j]);
        }
        printf("\n");
    }
    return 0; 
}

P1789 【Mc生存】插火把 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

从a[10][10]开始存储计算，就不用担心越界问题了

暴力

#include<stdio.h>
int n,m,k,flag;
int a[150][150];
int main()
{
    
    scanf("%d%d%d",&n,&m,&k);
    for (int i = 1, j = 1, tol = 1; tol <= m;tol++)
    {
        scanf("%d%d", &i, &j);
        a[10 + i - 2][10+j] = 1;
        a[10 + i - 1][10 + j - 1] = 1; a[10 + i - 1][10 + j ] = 1; a[10 + i - 1][10 + j + 1] = 1;
        a[10 + i][10 + j-2] = 1; a[10+i][10+j-1] = 1; a[10 + i][10 + j] = 1; a[10 + i][10 + j+1] = 1; a[10 + i][10 + j+2] = 1;
        a[10 + i + 1][10 + j - 1] = 1; a[10 + i + 1][10 + j] = 1; a[10 + i + 1][10 + j + 1] = 1;
        a[10 + i + 2][10 + j] = 1;
    }
    for (int i = 1,j=1,tol=1; tol<=k;tol++)
    {
        scanf("%d%d", &i, &j);
        for (int k = i - 2; k <= i + 2; k++)
        {
            for (int h = j - 2; h <= j + 2; h++)
            {
                a[10 + k][10 + h] = 1;
            }
        }
    }

    for (int i = 11; i <= 10+n; i++)
    {
        for (int j = 11; j <= 10+n; j++)
        {
            if (a[i][j] == 0) { flag++; }
        }
    }
    printf("%d", flag);
    return 0; 
}

P1319 压缩技术 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

一维数组储存，二维数组输出；存储flag%2

以及while(scanf("%d",&a)!=EOF)

#include<stdio.h>
int n,flag,b;
int a[50000];
int main()
{
    int j = 1,l=1;
    scanf("%d",&n);
    while (scanf("%d", &b) != EOF)
    {
        for (int i = 1; i <= b; i++)
        {
            a[j] = flag % 2;
            j++;
        }
        flag++;
    }

    for (int h = 1; h <=n ; h++)
    {
        for (int k = 1; k <= n; k++)
        {
            printf("%d", a[l]);
            l++;
        }
        printf("\n");
    }
    return 0; 
}

P1320 压缩技术（续集版） - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

注意排除输入的换行符，而第一个输入如果是1则flag[0]=0，不会输出0，可以忽略

#include<stdio.h>
#include<math.h>
char a,b='0';
int n,l;
int flag[50000];
int main()
{
    while ( scanf("%c", &a)!=EOF)
    {
        n++;
        if (a == '\n') { continue; }
        if (a == b) { flag[l]++; }
        else { flag[++l]++; b = a; }
    }
    int t = sqrt(n); int i = 0;
    printf("%d ",t);
    while(1)
    {
        printf("%d ", flag[i]);
        i++;
        if (flag[i] == 0) { break; } 
    }
    return 0; 
}

P1205 [USACO1.2] 方块转换 Transformations - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

不是直接对比，而是采用中间数组进行转换后对比；注意a数组在转换过程中会变形，所以最后需要引入d数组判断6

#include<stdio.h>
#include<stdbool.h>
int n;
char a[15][15], b[15][15], c[15][15], d[15][15];
bool jud1(int n)
{
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            b[j][n - i + 1] = a[i][j];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (b[i][j] != c[i][j])
                return 0;
    return 1;
}
bool jud2(int n)
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            b[n - i + 1][n - j + 1] = a[i][j];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (b[i][j] != c[i][j])
                return 0;
    return 1;
}
bool jud3(int n)
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            b[n - j + 1][i] = a[i][j];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (b[i][j] != c[i][j])
                return 0;
    return 1;
}
bool jud4(int n)
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            b[i][n - j + 1] = a[i][j];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (b[i][j] != c[i][j])
                return 0;
    return 1;
}
bool jud5(int n)
{
    jud4(n);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[i][j] = b[i][j];
    if (jud1(n))
        return 1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[i][j] = b[i][j];
    if (jud2(n))
        return 1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[i][j] = b[i][j];
    if (jud3(n))
        return 1;
    return 0;
}
bool jud6(int n)
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (d[i][j] != c[i][j])
                return 0;
    return 1;
}
void jud(int n)
{
    if (jud1(n)) { printf("1"); }
    else if (jud2(n)) { printf("2"); }
    else if (jud3(n)) { printf("3"); }
    else if (jud4(n)) { printf("4"); }
    else if (jud5(n)) { printf("5"); }
    else if (jud6(n)) { printf("6"); }
    else { printf("7"); }
}
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        getchar(); getchar();
        for (int j = 1; j <= n; j++)
        {
            a[i][j] = getchar();
            d[i][j] = a[i][j];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        getchar(); getchar();
        for (int j = 1; j <= n; j++)
            c[i][j] = getchar();
    } 
    jud(n);
    return 0;
}

字符串

P5733 【深基6.例1】自动修正 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include<stdio.h>
int main()
{
	char a[200];
	gets(a);
	for (int i = 0;i<strlen(a); i++)
	{
		if (a[i] <= 'z' && a[i] >= 'a')
		{
			a[i] -= 'a' - 'A';
		}
	}
	printf("%s", a);
	return 0;
}

P1914 小书童——凯撒密码 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include<stdio.h>
int main()
{
	char a[100];
	int n;
	scanf("%d\n", &n);
	gets(a);
	for (int i = 0;i<strlen(a); i++)
	{
		a[i] = 'a' + (a[i] - 'a' + n) % 26;
	}
	printf("%s", a);
	return 0;
}

P1125 [NOIP2008 提高组] 笨小猴 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

防止Min归零

#include<stdio.h>
#include<math.h>
#include <string.h>
int main()
{
	char a[100];
	int b[26] = { 0 }, maxn = -111, minn = 111, flag = 1;
	gets(a);
	for (int i = 0; i < strlen(a); i++)
	{
		b[a[i] - 'a']++;
	}
	for (int i = 0; i < 26; i++)
	{
		maxn = maxn > b[i] ? maxn : b[i];
		if(b[i] > 0)minn = minn < b[i] ? minn : b[i];//注意，min归零之后不会再更新，所以要跨过b[i]=0
	}
	if ((maxn - minn) == 0 || (maxn - minn) == 1) { flag = 0; }
	for (int i = sqrt(maxn - minn); i > 2; i--)
	{
		if ((maxn - minn) % i == 0) { flag = 0; break; }
	}
	if (flag == 0) { printf("No Answer\n0"); }
	else {  printf("Lucky Word\n%d", maxn - minn);}
	return 0;
}

P1957 口算练习题 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

认识新函数：sscanf;sprintf;atoi

#include<stdio.h>
#include<string.h>
int main()
{
    char a; 
    int n, c, d; 
    char s[100], b[10]; 
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%s", b); 
        if (b[0] >= 'a' && b[0] <= 'z')
        {
            a = b[0]; 
            scanf("%d%d", &c, &d);
        }
        else
        {
            sscanf(b, "%d", &c); 
            scanf("%d", &d); 
        }
        memset(s, 0, sizeof(s)); 
        if (a == 'a') 
            sprintf(s, "%d+%d=%d", c, d, c + d);
        else if (a == 'b')
            sprintf(s, "%d-%d=%d", c, d, c - d);
        else if (a == 'c')
            sprintf(s, "%d*%d=%d", c, d, c * d);
        printf("%s\n%d\n", s, strlen(s)); 
    }
    return 0;
}

P5015 [NOIP2018 普及组] 标题统计 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

不知道为什么题解都是正向计算，不是删除空格

#include<stdio.h>
int main()
{
    char a[100]; 
    gets(a);
    int n = strlen(a);
    int t=n;
    for (int i = 0; i < n; i++)
    {
        if (a[i] == ' ') { t--; }
    }
    printf("%d", t);
    return 0;
}