fsps60312's blog

By fsps60312, history, 9 years ago, In English
code風景區(code scenic)
http://codingsimplifylife.blogspot.tw
No matter you are Taiwanese, Chinese, or anyone who understand English, are all welcome!
歡迎隨時問問題或發言!
Welcome to ask questions or comment anytime!
If you discuss with me or ask questions in English, I'll try to make the solutions English (If I'm able to solve it) , and tag it with "English".
I love solving problems! <3<3<3

p.s. I don't know how to insert new lines, so headings were used.

  • Vote: I like it
  • +26
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by fsps60312 (previous revision, new revision, compare).

»
9 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Could you explain this one : Round 345, Div2 E

»
9 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Your blog become filtered in my country :\

  • »
    »
    9 years ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    Well... I'm afraid I can't help. (It says your internet access is restricted by the government?)
    I'm just a high school student.
    Sorry...
    (I found a software, "UltraSurf". Maybe it can help you get access to google websites?)

»
9 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

can you please discuss the topic about combinator,it will help a hot???

»
9 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Please help with this problem (dp solution)

http://codeforces.me/contest/618/problem/D

»
9 years ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it
  • »
    »
    9 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    can you help me with this question:

    http://codeforces.me/blog/entry/43738

    • »
      »
      »
      9 years ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      I really need to sleep now, sorry...
      It's midnight in our time zone...
      BTW, could you provide the online judge for your problem?
      Without this, I won't be able to test my code and solve problem...

      • »
        »
        »
        »
        9 years ago, # ^ |
          Vote: I like it +8 Vote: I do not like it
        • »
          »
          »
          »
          »
          9 years ago, # ^ |
            Vote: I like it +3 Vote: I do not like it
          • »
            »
            »
            »
            »
            »
            9 years ago, # ^ |
              Vote: I like it +5 Vote: I do not like it

            Interesting

            • »
              »
              »
              »
              »
              »
              »
              9 years ago, # ^ |
                Vote: I like it +5 Vote: I do not like it

              bit i is a number, or a number equals to 0 ⊕ all of the elements of a number set, its i-th bit (⊕ is the sign of XOR) Xi is number X's bit i (X's i-th bit). Can you explain this i think the translator is not working fine.

              • »
                »
                »
                »
                »
                »
                »
                »
                9 years ago, # ^ |
                  Vote: I like it +5 Vote: I do not like it

                He is now editing. It should take few minute.

              • »
                »
                »
                »
                »
                »
                »
                »
                9 years ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                Well... Sorry for that.
                I've described it in another way.
                Please just refresh the page and then you can see the updated page.
                Could you understand it now?

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it +5 Vote: I do not like it

                  concept of maintaining number sets is not clear to me? Can you explain what help is it doing?

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it +1 Vote: I do not like it

                  A number set means a set of numbers. We can choose some numbers (number set) from the origin array. Then our goal is make the XOR of these numbers choosen equals to K. But we can't do it directly. So we slowly maintain which number sets satisfy that after XOR, the first i bits equals to the first i bits of K.

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  corrct me if i am wrong. i think you are building the number set by bits and then if a particular bit int K is 0, and the current set contains number v1,v2,v3..vn then you are leaving numbers containing bitk( k'th bit 0) unchanged while those numbers having kth bit 1 you are combining them even numbers at a time like v1 XOR v2, v2 XOR v3 ... and probably removing the v1,v2.. . BUT how it takes care of cases like v1 XOR v2 XOR v3 XOR v4

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                  Rev. 4   Vote: I like it 0 Vote: I do not like it

                  For v1 XOR v2 XOR v3 XOR v4
                  You can choose (v1 XOR v2) and (v3 XOR v4)
                  Both ((v1 XOR v2) and (v3 XOR v4)) are (s')'s elements.
                  We use a set of numbers, s, to represent a exponential number of number sets.
                  We can restore these 2^N number sets by either to choose and not to choose each element in s.
                  For example, if s={1,2,3}, it represent the following number sets:
                  {},{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}
                  So, s is not the 2^N number sets itself, we just try to represent and store it in this way.

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  BTW, would you mind if I copy our Q&A as comments on my blog, code scenic?
                  I think these would help others understand what I mean.

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  not at all.

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  Thanks!
                  And could you understand it now? :)

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  9 years ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  still on way.