zoukankan      html  css  js  c++  java
  • poj 1218 THE DRUNK JAILER

    THE DRUNK JAILER
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 23358   Accepted: 14720

    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

    Source

     1 #include<iostream>  
     2 #include<string.h>  
     3 #include<stdio.h>  
     4 #include<ctype.h>  
     5 #include<algorithm>  
     6 #include<stack>  
     7 #include<queue>  
     8 #include<set>  
     9 #include<math.h>  
    10 #include<vector>  
    11 #include<map>  
    12 #include<deque>  
    13 #include<list>  
    14 using namespace std;
    15 int main()  
    16 {  
    17     int n,i,j,k,a,count,counter;  
    18     scanf("%d",&n);  
    19     for(i=1;i<=n;i++)  
    20     {  
    21         counter=0;   
    22         scanf("%d",&a);  
    23         for(k=1;k<=a;k++)  
    24         {  
    25             count=0;    
    26             for(j=1;j<=a;j++)   
    27                 if(k%j==0)  
    28                     count++;
    29             if(count%2!=0)  
    30                 counter++;
    31         }    
    32         printf("%d
    ",counter);           
    33     }  
    34     return 0;
    35 }   
    View Code
  • 相关阅读:
    [bzoj5483][Usaco2018 Dec]Balance Beam_凸包_概率期望
    [bzoj3829][Poi2014]FarmCraft_树形dp
    [bzoj3420]Poi2013 Triumphal arch_树形dp_二分
    [bzoj4240]有趣的家庭菜园_树状数组
    [CF9D]How Many Trees?_动态规划_树形dp_ntt
    拖拽排序
    windows-build-tools
    阿里云七牛云oss获取视频内的帧图片
    转义符输入的转换
    node脚本下载geo数据
  • 原文地址:https://www.cnblogs.com/qscqesze/p/3880172.html
Copyright © 2011-2022 走看看