Bittilista

input/code.cpp: In function 'std::string to_string(int)':
input/code.cpp:88:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < s.length(); i++) t += s[s.length() - i - 1];
                       ^

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <queue>
 
#define uint unsigned int
#define INF 999999999
#define ll long long
#define M 1000000007
#define E 0.0000001
#define N 1<<16;
 
using namespace std;
 
string to_string (const int n);
int stoi (const string s);
 
int gcd (const int a, const int b) {
    if (b == 0) {
        if (a != 0) return a;
        else return 1;
    }
    return gcd(b, a % b);
}
 
int main () {
    cin.sync_with_stdio(false);
    cin.tie(0);
 
    long long n, m;
    cin>>n>>m;
 
    if (m == 1) {
        for (int i = 0; i < n; i++) cout<<0;
        return 0;
    }
    if (m == (1<<(n - 1))) {
        for (int i = 0; i < n; i++) cout<<1;
        return 0;
    }
    m--;
    int x[n];
    for (int i = 1; i < n; i++) {
        x[n - 1 - i] = m % 2;
        m /= 2;
    }
 
    x[n - 1] = x[0];
    for (int i : x) cout<<i;
    cout<<endl;
 
 
    /*for (int i = 0; i < (1<<n); i++) {
        string s;
        int ti = i;
        for (int x = 0; x < n; x++) {
            string c = s;
            s = ('0' + (ti % 2));
            s += c;
            ti /= 2;
        }
        int io = 0;
        int oi = 0;
        for (int i = 0; i < n - 1; i++) {
            if (s[i] == '0' && s[i + 1] == '1') oi++;
            if (s[i] == '1' && s[i + 1] == '0') io++;
        }
        if (io == oi) {
            cout<<s<<endl;
        }
    }*/
 
    return 0;
}
 
string to_string (int n) {
    string s;
    string t;
    while (n) {
        s += (n % 10) + '0';
        n /= 10;
    }
    for (int i = 0; i < s.length(); i++) t += s[s.length() - i - 1];
    return t;
}
 
int stoi (const string s) {
    int n = 0;
    for (char c : s) n = (n * 10) + (c - '0');
    return n;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED