Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

代码!

Posted by chenxuan123456789 at 2012-07-29 14:40:58 on Problem 1218
#include <stdio.h>
#include <string.h>
#define M 101
int l[M];
int main()
{
	int cases,i,j,n,count;
	scanf("%d",&cases);
	while(cases--)
	{
		scanf("%d",&n);
		memset(l,0,sizeof(l));
		for(i=1;i<=n;i++)
		{
			j=i;
			while(j<=n)
			{
				if(l[j])
					l[j]=0;
				else
					l[j]=1;
				j+=i;
			}
		}
		count=0;
		for(i=1;i<=n;i++)
			if(l[i])
				count++;
			printf("%d\n",count);
	}
	return 1;
}


Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator