ACM getting started Day1

acm website ：【 Deep base 7. example 2】 Prime sieve - Luogu Luogu net

Title Description ：

  The source code is as follows ：

#include<stdio.h>
int main()
{
	int n, i, j;
	int sushu(int n);// Define a function for judging prime numbers , If it is a prime number, return m The value of is 1 
	int a[1000];
	printf("please enter a number:");
	scanf_s("%d", &n);
	for (i = 0; i < n; i++)
		scanf_s("%d", &a[i]);
	for (i = 0; i < n; i++)
	{
		if (sushu(a[i]) == 1)
		{
			printf("%3d", a[i]);
		}// Output prime number  
		
	}
}


int sushu(int j)// Prime function  
{
	int i; int m;
	for (i = 2; i < j; i++)
	{
		if (j % i == 0)
		{
			m = 0;
		}
		else
		{
			m = 1;
		}
		return m;
	}
}

The successful running ：

acm Finish the first day of entry