寒假作业01

HELLOWORLD

public class HELLOWORLD {

	public static void main(String[] args) {
		System.out.println("HELLOWORLD");
	}

}

乘法表

package Multiplication;
import java.util.Scanner;
public class Multiplication {

	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=i;j++)
			{
				System.out.printf("%d*%d=%-4d",j,i,i*j);
			}
			System.out.print("\n");
		}
		
	}

}

金字塔

import java.util.Scanner;
public class Pyramid {

	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n-i;j++)
			{
				System.out.print(" ");
			}
			for(int k=1;k<=(2*i-1);k++)
			{
				System.out.print("*");
			}
			System.out.print("\n");
		}
	}

}

蛇形数组

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

报数

#include<stdio.h>
int main()
{
	int n, m, a, ch[100] = { 0 }, h;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; i++)
	{
		ch[i]=i+1;
	}
	a = n;
	h = 1;
	while (a > 1)
	{
		for (int i = 0; i < n; i++)
		{
			
			if (ch[i] == -1)
			{
				continue;
			}
			if (h == m)
			{
				ch[i] = -1;
				h = 1;
				a--;
				continue;
			}
			h++;
		}
	}
	for (int i = 1; i < n; i++)
	{
		if (ch[i] != -1)
		{
			printf("%d", ch[i]);
		}
	}
	return 0;
}

插入排序

#include<stdio.h>
int main()
{
	int n, ch[100], temp;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &ch[i]);
	} c
	for (int j = 1; j < n; j++)
	{
		for (int k = j; k >= 0; k--)
		{
			if (ch[k] < ch[k - 1])
			{
				temp = ch[k - 1];
				ch[k - 1] = ch[k];
				ch[k] = temp;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		printf("%d ", ch[i]);
	}
	return 0;
}

A+B

#include<stdio.h>
#include<string.h>
int main()
{
	char a[1000] = { 0 }, b[1000] = { 0 };
	int m[1000] = { 0 }, n[1000] = { 0 }, sum[1000] = { 0 };
	int len_1 = 0, len_2 = 0, k=0;
	scanf("%s %s", &a, &b);
	len_1 = strlen(a);
	len_2 = strlen(b);
	for (int i = 0; i < len_1; i++)
	{
		m[i] = a[len_1 - i - 1]- 48 ;
	}
	for (int j = 0; j < len_2; j++)
	{
		n[j] = b[len_2 - j - 1]- 48 ;
	}
	while (len_1 > 0 || len_2 > 0)
	{
		sum[k] = m[k] + n[k]+sum[k];
		if (sum[k] >= 10)
		{
			sum[k] = sum[k] % 10;
			sum[k + 1]++;
		}
		len_1--;
		len_2--;
		k++;
	}
	for (int w=k - 1; w >= 0; w--)
	{
		printf("%d", sum[w]);
	}
	return 0;
}