3069 結局蟻本 #include <cstdio> #include <algorithm> using namespace std; int main() { int R, n; while (scanf("%d%d", &R, &n)) { if (R == -1 && n == -1) break; int army[n]; for (int i=0; i</algorithm></cstdio>

0085 漸化式自分では導けないorz #include <cstdio> int dfs(int n, int k) { if (n == 1) return 0; return (dfs(n-1,k)+k)%n; } int main() { int n, m; while (scanf("%d%d", &n, &m)) { if (n == 0 && m == 0) break; printf("%d\n", dfs(n,m)+1); } }</cstdio>