結果
問題 | No.2314 Backflip |
ユーザー |
|
提出日時 | 2023-10-27 03:24:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,925 bytes |
コンパイル時間 | 4,328 ms |
コンパイル使用メモリ | 254,568 KB |
最終ジャッジ日時 | 2025-02-17 14:06:58 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 8 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using ll = long long;using ld = long double;using st = string;using mint = atcoder::modint998244353;using Mint = atcoder::modint1000000007;#define vl vector<ll>#define vvl vector<vector<ll>>#define vb vector<bool>#define vs vector<string>#define chmax(n,v) n=n<v?v:n#define chmin(n,v) n=n>v?v:n#define all(n) begin(n),end(n)#define rev(n) reverse(all(n))#define sor(n) stable_sort(all(n))#define rep(i,n) for(ll i=0;i<(n);++i)#define rrep(i,a,n) for(ll i=a;i<(n);++i)#define sz(n) n.size()#define bit(n,shift) ((n&(1<<shift))!=0)template <typename T> void input(T &a) { cin >> a; };template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };const ll inf = 1e18;//std::setprecision(13); 出力桁を増やす//2^29<10^9ll di[8]={1,-1,0,0,1,1,-1,-1};ll dj[8]={0,0,1,-1,1,-1,-1,1};//ll da[4]={1,1,-1,-1};//ll db[4]={1,-1,-1,1};//ll na[4]={1,0,1,0};//ll nb[4]={0,1,0,1};template<typename T = ll>vector<T> read(size_t n) {vector<T> ts(n);for (size_t i = 0; i < n; i++) cin >> ts[i];return ts;}bool is_prime(ll N) {if (N == 1) return false;for (ll i = 2; i * i <= N; ++i) {if (N % i == 0) return false;}return true;}int calc_digit(ll N){int res = 0;while(N>0){res++;N/=10;}return res;}ll factorial(ll n, ll mod = 1e18) {ll ans = 1;for(ll i = n; i >= 2; i--) ans = (ans * i) % mod;return ans;}void printl(vl v){ll vsz=v.size();for(ll i=0;i<vsz;i++){cout << v[i] << endl;}}void prints(vs v){ll vsz=v.size();for(ll i=0;i<vsz;i++){cout << v[i] << endl;}}ll round_up(ll x,ll y){return (x+y-1)/y;}bool in_out(ll x,ll y,ll h,ll w){return 0<=x and x<h and 0<=y and y<w;}struct UnionFind{vector<ll> par;vector<ll> size;UnionFind(ll n){par.resize(n+1,-1);size.resize(n+1,1);}ll root(ll x){if (par[x]==-1) return x;return par[x]=root(par[x]);}void unite(ll u,ll v){ll RootU=root(u),RootV=root(v);if(RootU==RootV){return;}if(size[RootU]<size[RootV]){par[RootU]=RootV;size[RootV]+=size[RootU];}else{par[RootV]=RootU;size[RootU]+=size[RootV];}return;}};vector<pair<ll, ll>> prime_factorize(ll N){vector<pair<ll, ll> > res;for (ll a = 2; a * a <= N; ++a) {if (N % a != 0) continue;ll ex = 0;while (N % a == 0) {ex++;N /= a;}res.push_back({a, ex});}if (N != 1) res.push_back({N, 1});return res;}int main(){st s;cin >> s;if(s[s.size()-1]=='0') s[s.size()-1]='1';else s[s.size()-1]='0';cout << s;}