lightoj 1179 - Josephus Problem 约瑟夫环

约瑟夫环问题，采取递推式求解....

#include<bits/stdc++.h>using namespace std;#define ll long long#define ull unsigned long long#define mod 1000007#define inf 0x3f3f3f3f#define N 100100using namespace std;int a[50];int main(){    int t;    scanf("%d",&t);    for(int cas=1; cas<=t; cas++)    {       int n,m,s=0;       scanf("%d %d",&n,&m);       for(int i=1;i<=n;i++)        s=(s+m)%i;       printf("Case %d: %d\n",cas,s+1);    }    return 0;}