CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:1
Submission time:2017-10-08 19:43:57 +0300
Language:C++
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.09 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.06 s2details
#16ACCEPTED0.14 s2details
#17ACCEPTED0.21 s2details
#18ACCEPTED0.08 s2details
#19ACCEPTED0.08 s2details
#20ACCEPTED0.08 s2details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details
#31--4details
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

input/code.cpp: In function 'std::string bfSearch(int)':
input/code.cpp:45:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (uniqueSubsqs(bss) != n) {
                                 ^

Code

#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>

using namespace std;

typedef unsigned long ul;
typedef unsigned long long ull;

ul uniqueSubsqs(string s, bool debug=false) {
    vector <string> subsqs = {};
    ul slength = s.length();
    int supersetSize = pow(2, slength);
    string subsq;
    for (int i = 1; i < supersetSize; i++) {
        subsq = "";
        bitset <32> bs(i);
        for (long j = slength - 1; j >= 0; j--) {
            if (bs[j] == 1) subsq.push_back(s[slength - j - 1]);
        }
        subsqs.push_back(subsq);
    }
    
    set<string> st;
    ul size = subsqs.size();
    for (unsigned i = 0; i < size; ++i) {
        st.insert(subsqs[i]);
    }
    return st.size();
}

string convertToBS(int i) { //convert to binary string
    bitset<32>bs(i);
    string bss = bs.to_string();
    bss.erase(0, min(bss.find_first_not_of('0'), bss.size()-1));
    return bss;
}

string bfSearch(int n) { //brute force search
    int i = 1;
    string bss = convertToBS(i);
    while (uniqueSubsqs(bss) != n) {
        ++i;
        bss = convertToBS(i);
    }
    return bss;
}

int main() {
    int x;
    cin >> x;
    string bsResult = bfSearch(x); //binary string result
    cout << bsResult << endl;
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
11

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
10

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
1111

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
100

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
1000

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
1100

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
1011

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
1101011

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
11011

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
100100010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
101100

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
100010011

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1000011100

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1001001111

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
100011010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
100111010

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100011001

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
(empty)

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
(empty)

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
(empty)

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
(empty)

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
(empty)

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
(empty)

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
(empty)

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)