Next Mayor

Next Mayor

#include<iostream>
using namespace std;
#define MAX 50

int n, p, B[MAX], t;

main(){
    while( cin >> n >> p && n && p ){
        for ( int i = 0; i < n; i++ ) B[i] = 0;
        int cur = 0;
        for(t = p; ; cur = (cur+1)%n){
            if ( p ) { 
                B[cur]++; p--;
                if ( p == 0 && B[cur] == t ){
                    cout << cur << endl; break;
                }
            } else { 
                p  = B[cur]; B[cur] = 0; 
            }
        }
    }
}