Submission #4075818

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long

int mymod(int n,int m){
  int ret = n%m;
  if(n < 0 && m < 0) ret = -ret;
  return ret;
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n; cin >> n;
  int sum = 0;
  string t;
  for(int i = 1; i < 30; i++){
    int m = pow(-2,i);
    int r = mymod(n,m);
    if(r == sum + m/(-2)){
      t = '1' + t;
      sum += m/(-2);
    }
    else t = '0' + t;

    if(abs(n) < abs(m)) break;
  }
  cout << t << endl;

  return 0;
}

Submission Info

Judge Result