POJ1218THE DRUNK JAILER 快速和一般方法两种解法

本文深入探讨了游戏开发领域的核心技术,包括游戏引擎、图形渲染、音视频处理等关键环节,为开发者提供全面的技术指导。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

THE DRUNK JAILER
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 22155 Accepted: 14012

Description

A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. 
One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes a drink of whiskey,and then runs down the hall unlocking each cell. For round 2, he takes a drink of whiskey, and then runs down the 
hall locking every other cell (cells 2, 4, 6, ?). For round 3, he takes a drink of whiskey, and then runs down the hall. He visits every third cell (cells 3, 6, 9, ?). If the cell is locked, he unlocks it; if it is unlocked, he locks it. He 
repeats this for n rounds, takes a final drink, and passes out. 
Some number of prisoners, possibly zero, realizes that their cells are unlocked and the jailer is incapacitated. They immediately escape. 
Given the number of cells, determine how many prisoners escape jail.

Input

The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines contains a single integer between 5 and 100, inclusive, which is the number of cells n. 

Output

For each line, you must print out the number of prisoners that escape when the prison has n cells. 

Sample Input

2
5
100

Sample Output

2
10
由于最大才为100,所以就算是用枚举一个个的去改变数值最后也能通过,但是如果好好思考下其实很简单,就是一个数学规律,或许大神和菜鸟的区别就在于此,虽然题目简单但是值得我们去思考和延伸..........
-----------------AC代码----------------------------------

菜鸟方法:
#include<stdio.h>
#define MAX 101
int main()
{
	int a[MAX],x,i,j,k,n,m,y;
	scanf("%d",&m);
	for(y=0;y<m;y++)
	{
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		a[i]=1;
	}
	k=1;
	while(k<=n)
	{
		for(j=k;j<=n;j+=k)
		{
			 a[j]=-a[j];
		}
		k++;
	}
	x=0;
	for(i=1;i<=n;i++)
	  if(a[i]==-1) x++;
	printf("%d\n",x);
    }
	return 0;
}

大神方法:
#include<stdio.h>
#include<stdlib.h>
#include<math.h>


int main()
{
    int n,x,i;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
       scanf("%d",&x);
       printf("%d\n",(int)sqrt((double)x));
       
    }
    system("pause");
    return 0;
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值