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. Print the word "yes" if 3 divide evenly into F(n).

as\a.cpp
..\a.dsp
..\a.dsw
..\a.ncb
..\a.opt
..\a.plg
..\as.dsp
..\as.dsw
..\as.ncb
..\as.opt
..\as.plg
..\b.cpp
..\b.dsp
..\b.dsw
..\b.ncb
..\b.opt
..\b.plg
..\c.cpp
..\c.dsp
..\c.dsw
..\c.ncb
..\c.opt
..\c.plg
..\Debug\a.exe
..\.....\a.ilk
..\.....\a.obj
..\.....\a.pch
..\.....\a.pdb
..\.....\b.pch
..\.....\c.exe
..\.....\c.ilk
..\.....\c.obj
..\.....\c.pch
..\.....\c.pdb
..\.....\vc60.idb
..\.....\vc60.pdb
..\Debug
as

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．