요세푸스 문제
![[백준 1158번-C++] 요세푸스 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FGtaR4%2Fbtq4pCgAJrS%2FHD2Mc4iOkH4TkAylH4gx6K%2Fimg.png)
[백준 1158번-C++] 요세푸스 문제
http://acmicpc.net/problem/1158 {코드} #include #include using namespace std; int main() { int n, k, tmp; scanf("%d %d", &n, &k); queue q; for (int i = 1; i
http://acmicpc.net/problem/1158 {코드} #include #include using namespace std; int main() { int n, k, tmp; scanf("%d %d", &n, &k); queue q; for (int i = 1; i