C - 這道題很難

來源:互聯網
上載者:User

標籤:

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status

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

25100 
 

Sample Output

210 
 


#include<stdio.h>int main(){int n,m;scanf("%d",&n);      while(n--)    { int i,x[1000];scanf("%d",&m);for(i=1;i<=m;i++)x[i]=0;int t=2;while(m>=t){x[t]=1;t=t+2;}int w=3,q=3;       int h=m-2;while(h--){    while(m>=w)    {  if(x[w]==0)  x[w]=1;  else x[w]=0;   w=w+q;    }    q++;    w=q;}int sum=0;for(i=1;i<=m;i++)if(x[i]==0)sum++;printf("%d\n",sum);}return 0;}

著作權聲明:本文為博主原創文章,未經博主允許不得轉載。

C - 這道題很難

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.