poj1218――THE DRUNK JAILER
2263 단어 자바기술 을 개발 하 다
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
원본 코드:
//1218 // : , 0 , , , 1 , ... // #include<stdio.h> int main() { int n,i,j,k,a,count,counter; scanf("%d",&n); for(i=1;i<=n;i++) { counter=0; scanf("%d",&a); for(k=1;k<=a;k++) // , { count=0; // j j , , j for(j=1;j<=a;j++) if(k%j==0) count++;// , if(count%2!=0) counter++; // 2 , } printf("%d
",counter); } return 0; }
원본 코드 2: (시 뮬 레이 션, 규칙 찾기)
#include <iostream> #include <cmath> using namespace std; int main() { int n, a, k; cin >> n; while(n--) { cin >> k; a = sqrt(k); cout << a <<endl; } return 0; }
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Is Eclipse IDE dying?In 2014 the Eclipse IDE is the leading development environment for Java with a market share of approximately 65%. but ac...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.