Zoj 2531 traveller (Gray code)

Traveller

Time Limit: 2 seconds memory limit: 65536 kb Special Judge

A traveller plans a round trip through N cities, where n is a power of 2, in which case we simply index them with numeric values from 0 to n-1. the traveller lives in one of them, and
That's where he will start and end his trip. he only visits each city once, and for some special reason the two adjacent cities on his trip shoshould satify an equation that (a xor B) is also a power of 2.

For his odd mind no travel agency is willing to offer any help and finally he comes to you for a solution. You wocould either tell him it's not possible to arrange a trip for him.

Input

Input has two integers n and M, which are respectively the number of cities and the city he lives in.

Proceed through multiple cases until you meet a case n = 0.

Output

Print "no" or a list of N city numbers on a single line separated by a single space.

Sample Input

2 14 00 0

Sample output

1 00 1 3 2

#include <iostream>using namespace std;int DecimaltoGray ( int x ){    return x ^ ( x >> 1 );}int GraytoDecimal ( int x ){    int y = x;    while ( x >>= 1 ) y ^= x;    return y;}int main(){    int n, m;    while ( 1 )    {        cin >> n >> m;        if ( n == 0 ) break;        for ( int i = 0; i < n - 1; i++ )            cout << DecimaltoGray ( (i+m) % n ) << ' ';        cout << DecimaltoGray ( (n-1+m) % n ) << endl;    }    return 0;}