SWUSTOJ #480 Locker doors

最新推荐文章于 2024-01-21 14:19:07 发布

oafseoases

最新推荐文章于 2024-01-21 14:19:07 发布

阅读量2.2k

点赞数 2

分类专栏： SWUST OJ 题解系列文章标签： SWUST SWUSTOJ OJ C++ 题解

本文链接：https://blog.csdn.net/qq_44475551/article/details/106957864

版权

这篇博客介绍了SWUSTOJ的一个编程问题，涉及到一个关于柜子门开关的逻辑问题。在n次经过一系列编号为1到n的柜子时，每次按编号依次操作柜子门。问题求解最后有多少个柜子门是开着的。样例输入为10，输出为3，意味着在所有操作后有3个柜子门是打开的。博主提供了源代码来解决这个问题，适用于C++编程爱好者和参加编程竞赛的人群。

摘要由CSDN通过智能技术生成

题目

There are n lockers in a hallway numbered sequentially from 1 to n. Initially, all the locker doors are closed. You make n passes by the lockers, each time starting with locker #1. On the ith pass, i = 1, 2, …, n, you toggle the door of every ith locker: if the door is closed, you open it, if it is open, you close it. For example, after the first pass every door is open; on the second pass you only toggle the even-numbered lockers (#2, #4, …) so that after the second pass the even doors are closed and the odd ones are opened; the third time through you close the door of locker #3 (opened from the first pass), open the door of locker #6 (closed from the second pass), and so on. After the last pass, which locker doors are open and which are closed? How many of them are open? Your task is write a program to output How many doors are open after the last pass? Assumptions all doors are closed at first.