[剑指offer]约瑟夫环

来源:互联网 发布:多通道数据采集系统 编辑:程序博客网 时间:2024/06/05 09:30
/*    45:> 约瑟夫环*///数学解法int LastLive(size_t total, size_t key){    if (total < 1 || key < 1)        return -1;    int last = 0;    for (int i = 2; i <= total; ++i)        last = (last + key) % i;    return last;}//void test()//{//  cout <<"live is:> "<< LastLive(10, 3) << endl;//}
2 0