提出 #34926870


ソースコード 拡げる

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC target("popcnt")

using namespace std;
using namespace __gnu_pbds;

template <typename t>
using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;

// #pragma gcc optimize("ofast")
// #pragma gcc target("avx,avx2,fma")


#define int long long

#define all(x) (x).begin(), (x).end()


#define pb push_back
#define endl '\n'
#define fi first
#define se second

// const int mod = 1e9 + 7;

const int mod=998'244'353;


const long long INF = 2e18 + 10;
// const int INF=1e9+10;

#define readv(x, n)   \
    vector<int> x(n); \
    for (auto &i : x) \
        cin >> i;



template <typename t>
    using v = vector<t>;

template <typename t>
    using vv = vector<vector<t>>;

template <typename t>
    using vvv = vector<vector<vector<t>>>;

typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<vector<vector<vector<int>>>> vvvvi;
typedef vector<vector<double>> vvd;

typedef pair<int, int> pii;



int multiply(int a, int b, int in_mod) { return (int)(1ll * a * b % in_mod); }
int mult_identity(int a) { return 1; }



const double pi = acosl(-1);



auto power(auto a, auto b, const int in_mod)
{

    auto prod = mult_identity(a);
    auto mult = a % in_mod;
    while (b != 0)
    {
        if (b % 2)
        {
            prod = multiply(prod, mult, in_mod);
        }
        if(b/2)
        mult = multiply(mult, mult, in_mod);
        b /= 2;
    }
    return prod;
}
auto mod_inv(auto q, const int in_mod)
{
    return power(q, in_mod - 2, in_mod);
}


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



#define stp cout << fixed << setprecision(20);


void solv()
{
    int x;
    cin>>x;
    int one = 1;
    vector<int> out;
    for(int j = x;j>0;j= (j-1)&x)
    {
        out.push_back(j);
    }
    out.push_back(0);
    sort(all(out));

    for(auto j:out)
    {
        cout<<j<<endl;
    }
}

void solve()
{
    int t = 1;
    // cin>>t;
    while(t--)
    {
        solv();
    }
}




signed main()
{



    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cerr.tie(NULL);

    auto clk = clock();
    // -------------------------------------Code starts here---------------------------------------------------------------------

    signed t = 1;
    // cin >> t;

    for (signed test = 1; test <= t; test++)
    {
        // cout<<"Case #"<<test<<": ";

        solve();
    }

    // -------------------------------------Code ends here------------------------------------------------------------------

    clk = clock() - clk;

    #ifndef ONLINE_JUDGE
    cerr << fixed << setprecision(6) << "\nTime: " << ((float)clk) / CLOCKS_PER_SEC << "\n";
    #endif
    return 0;
}

/*
000100

1000100

1 0 -1 -2 -1 -2 -3
*/

提出情報

提出日時
問題 C - Submask
ユーザ Wernier
言語 C++ (GCC 9.2.1)
得点 300
コード長 3083 Byte
結果 AC
実行時間 15 ms
メモリ 3712 KiB

コンパイルエラー

./Main.cpp: In function ‘long long int mult_identity(long long int)’:
./Main.cpp:63:23: warning: unused parameter ‘a’ [-Wunused-parameter]
   63 | int mult_identity(int a) { return 1; }
      |                       ^
./Main.cpp: At global scope:
./Main.cpp:71:12: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   71 | auto power(auto a, auto b, const int in_mod)
      |            ^~~~
./Main.cpp:71:20: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   71 | auto power(auto a, auto b, const int in_mod)
      |                    ^~~~
./Main.cpp:88:14: warning: use of ‘auto’ in parameter declaration only available with ‘-fconcepts’
   88 | auto mod_inv(auto q, const int in_mod)
      |              ^~~~
./Main.cpp: In function ‘void solv()’:
./Main.cpp:105:9: warning: unused variable ‘one’ [-Wunused-variable]
  105 |     int one = 1;
      |         ^~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 300 / 300
結果
AC × 3
AC × 33
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt
ケース名 結果 実行時間 メモリ
sample_01.txt AC 8 ms 3488 KiB
sample_02.txt AC 3 ms 3496 KiB
sample_03.txt AC 2 ms 3568 KiB
test_01.txt AC 3 ms 3568 KiB
test_02.txt AC 2 ms 3640 KiB
test_03.txt AC 3 ms 3484 KiB
test_04.txt AC 3 ms 3596 KiB
test_05.txt AC 3 ms 3552 KiB
test_06.txt AC 2 ms 3552 KiB
test_07.txt AC 9 ms 3668 KiB
test_08.txt AC 7 ms 3684 KiB
test_09.txt AC 3 ms 3496 KiB
test_10.txt AC 4 ms 3556 KiB
test_11.txt AC 5 ms 3508 KiB
test_12.txt AC 2 ms 3532 KiB
test_13.txt AC 6 ms 3608 KiB
test_14.txt AC 5 ms 3544 KiB
test_15.txt AC 2 ms 3504 KiB
test_16.txt AC 15 ms 3668 KiB
test_17.txt AC 11 ms 3672 KiB
test_18.txt AC 10 ms 3616 KiB
test_19.txt AC 11 ms 3712 KiB
test_20.txt AC 13 ms 3632 KiB
test_21.txt AC 11 ms 3608 KiB
test_22.txt AC 10 ms 3648 KiB
test_23.txt AC 10 ms 3676 KiB
test_24.txt AC 10 ms 3676 KiB
test_25.txt AC 12 ms 3704 KiB
test_26.txt AC 11 ms 3684 KiB
test_27.txt AC 11 ms 3700 KiB
test_28.txt AC 12 ms 3608 KiB
test_29.txt AC 14 ms 3704 KiB
test_30.txt AC 10 ms 3660 KiB