宁波题库

• 代码如下：

  #include <iostream>
  #include <cstdio>
  int main()
  {
      int n,m,i;
      while(scanf("%d%d",&n,&m)!=EOF)
      {
          int s=0;
          for(i=2; i<=n; i++)
              s=(s+m)%i;
          printf("%d\n",s+1);
      }
      return 0;
  }
  

  
  

  
  
  题目如下：

  [1291] Real And Dummy TT

• 时间限制: 1000 ms　内存限制: 65535 K
• 问题描述
• Today is the wedding of TT and Mr. Cai. In order to make things difficult for Mr. Cai, there are M numbers of TTs, but just one is real.
  If Mr. Cai will do in accordance with the following rules, he will find real TT.
  Rules: Count off the number of cycles from the first start. And who is out if counts the number of N. Finally the left is real TT.
  
• 输入
• The input will consist of a series of pairs of integers M(0 < M <= 1000) and N(0 < N <= 10), separated by a space, one pair of integers per line, input until EOF.
• 输出
• For each pair of output integers that the number of real TT , and with one line of output for each line in input.
  
• 样例输入

• 3 1
  10 2
  

• 样例输出

• 3
  5