寒假作业01

1. HELLO WORLD!

源代码

#include<stdio.h>
int main()
{
        printf ("HELLO WORLD!");
        return 0;
}

运行截图

2. 乘法表

源代码

#include<stdio.h>
int main()
{
	int n,i,j;
	scanf ("%d",&n);
	for (i=1;i<=n;i++)
	{
		for (j=1;j<=i;j++)
		{
			printf ("%d*%d=%d  ",j,i,i*j);
		}
		printf ("\n");
	}
	return 0;
 } 

运行截图

3. 金字塔

源代码

#include<stdio.h>
int main()
{
 	int i,j,n,k;
 	scanf ("%d",&n);
 	for (i=1;i<=n;i++)
 	{
 		for (k=1;k<=n-i;k++)
 		{
 			printf (" ");
 			
		}
 		for (j=1;j<=i;j++)
 		{
 			printf ("* ");
		}
 		printf ("\n");
	 }
	 return 0;
}

运行截图

4. 蛇形数组

源代码

#include<stdio.h>
int main()
{
	int n,i,j,k=1,t;
	scanf ("%d",&n);
	for (i=1;i<=n;i++)
	{
		t=k;
		for (j=i;j<=n;j++)
		{
			printf ("%d ",t); 
			t=t+j;
			t++;
		}
		printf ("\n");
		k=k+i;
	}
	return 0;
}

运行截图

5. 报数

源代码

#include<stdio.h>
int main()
{
	int n,m,s=0,x;

	scanf("%d %d", &n, &m);

	for (int i=2;i<=n;i++)
	{
		x=(s+m)%i;
		s=x;
	}
	printf("%d",s+1);
	return 0;
}

运行截图

6. 插入排序

源代码

#include<stdio.h>
int main() {
	int ch[7],i,j,t;
	for (i=0; i<7; i++) {
		scanf ("%d",&ch[i]);
	}
	for (i=0; i<6; i++) {
		for (j=0; j<6; j++) {
			if (ch[j]>ch[j+1]) {
				t=ch[j];
				ch[j]=ch[j+1];
				ch[j+1]=t;
			}
		}
	}
	for (i=0; i<7; i++) {
		printf ("%d ",ch[i]);
	}
	return 0;
}

运行截图

7. A + B

源代码

#include<stdio.h>
#include<string.h>
int main()
{
	int a, b, m, num_1[100] = { 0 }, num_2[100] = { 0 }, t[100] = { 0 },n;
	char A[100], B[100];

	scanf("%s %s", &A, &B);

	a = strlen(A);
	b = strlen(B);
	if (a < b)
		m = b;
	else
		m = a;

    n = 0;
	for (int i = a - 1; i >= 0; i--)
	{
		num_1[n] = A[i] - '0';
		n++;
	}
	n = 0;
	for (int i = b - 1; i >= 0; i--)
	{
		num_2[n] = B[i] - '0';
		n++;
	}

	int flag = 0;
	for (int i = 0; i < m; i++)
	{
		if (num_1[i] + num_2[i] >= 10)
		{
			flag = 1;
		}
		else
		{
			flag = 0;
		}
		t[i] += (num_1[i] + num_2[i]) % 10;
		if (flag == 1)
		{
			t[i + 1] = 1;
		}
	}

	for (int i = m - 1; i >= 0; i--)
	{
		printf("%d", t[i]);
	}

	return 0;

}

运行截图

posted @ 2021-01-28 11:41  韦蕊  阅读(112)  评论(1)    收藏  举报