problem:
【相关文章:再谈MMX优化】 【扩展阅读:面向对象的CFD程序设计实验——[06]】 recently you must have experienced that when too many people use the bbs simultaneously, the net becomes very, very slow. 【扩展信息:免费的UML1.4开发的面向对象的可视化】 to put an end to this problem, the sysop has developed a contingency scheme for times of peak load to cut off net access for some buildings of the university in a systematic, totally fair manner. our university buildings were enumerated randomly from 1 to n. xwb is number 1, caoguangbiao (cgb) building is number 2, and so on in a purely random order. then a number m would be picked at random, and bbs access would first be cut off in building 1 (clearly the fairest starting point) and then in every mth building after that, wrapping around to 1 after n, and ignoring buildings already cut off. for example, if n=17 and m=5, net access would be cut off to the buildings in the order [1,6,11,16,5,12,2,9,17,10,4,15,14,3,8,13,7]. the problem is that it is clearly fairest to cut off cgb building last (after all, this is where the best programmers come from), so for a given n, the random number m needs to be carefully chosen so that building 2 is the last building selected.your job is to write a program that will read in a number of buildings n and then determine the smallest integer m that will ensure that our cgb building can surf the net while the rest of the university is cut off.
input: the input file will contain one or more lines, each line containing one integer n with 3 <= n < 150, representing the number of buildings in the university. ... 下一页