Codeforces 460 D. Little Victor and Set, codeforcesvictor

Codeforces 460 D. Little Victor and Set, codeforcesvictor

Violence + Construction

IfRAccept-Encoding-LLimit ≤ limit 4 we can all subsets of size not greaterK. Else, ifKDirection = direction 1, obviusly that answer isL. IfKLatency = Limit 2, answer is 1, becauseXorOf numbers 2XAnd 2XLimit + limit 1 equls 1. IfKLimit ≥ limit 4 answer is 0 becauseXorOf to pairsXor1 is 0.

IfKNumbers = numbers 3, we can choose numbers 2XAnd 2XStarting + starting 1Xor1. So we need to know, if we can getXorEquals 0. Suppose that there are 3 such numbersX,YAndZ(RLimit ≥ limitXLatency> latencyYLatency> latencyZLimit ≥ limitL)XorEquals 0. Consider the most non-zero bit of numberX. At the same bitYIt's also 1, becauseXorEquls 0, andYLatency> latencyZ. Consider the next bit of numbers. IfZHave 0 there, we have to do next: set the previous bit of numbersXAndYEquals 0, and set current bit equals 1. obviuslyXorStill equals 0,ZHadn't changed and numbersXAndYStood closerZ, So they are still [L, Bytes,R]. AndXLatency> latencyY. Consider the next bit of numbers. IfZHas zero here than we will change most bitsXBytesYAt the same way and so on.ZLatency> limit 0, so somewhen we will get to bit in whichZHas 1. SinceXorEquals 0, the same bitXWocould be 1 becauseXLatency> latencyY, AndYWocould have 0 there. At the next bits we will change bit inXTo 0, and in numbersYAndZTo 1. FinallyZWocould be greater or equal than before, andXWocould be less or greater than before, andXLatency> latencyYLatency> latencyZWocould be correct. So, we have the next: if such numbersX,YAndZExist than also exist numbers:

1100... 000

1011... 111

0111... 111

WithXorEquals 0. There are not much such triples, so we can check them.

D. Little Victor and Settime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

Little Victor adores the sets theory. Let us remind you that a set is a group of numbers where all numbers are pairwise distinct. Today Victor wants to find a set of integersSThat has the following properties:

• For allXThe following inequality holdsLLimit ≤ limitXLimit ≤ limitR;
• 1 bytes ≤ bytes |S| Limit ≤ limitK;
• Lets denoteI-Th element of the setSAsSI; Value must be as small as possible.

Help Victor find the described set.

Input

The first line contains three space-separated integersL, Bytes,R, Bytes,K(1 digit ≤ DigitLLimit ≤ limitRLimit ≤ limit 1012; 1 limit ≤ limitKLimit ≤ limitMin(106, average,RAccept-Encoding-LRows + rows 1 )).

Output

Print the minimum possible valueF(S). Then print the cardinality of set |S|. Then print the elements of the set in any order.

If there are multiple optimal sets, you can print any of them.

Sample test (s) input

8 15 3

Output

1210 11

Input

8 30 7

Output

0514 9 28 11 16

Note

Operation represents the operation of bitwise exclusive OR. In other words, it is the XOR operation.

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long int LL;LL L,R,K;LL ans=0x3f3f3f3f3f3f3f3f;int main(){    cin>>L>>R>>K;    if(R-L+1<=4)    {        LL m=R-L+1;        LL sig=0;        for(LL i=1;i<(1LL<<m);i++)        {            LL temp=0;            LL wei=0;            LL si=i;            while(si)            {                wei++;                si=si&(si-1);            }            if(wei>K) continue;            for(LL j=0;j<m;j++)            {                if(i&(1LL<<j))                {                    temp^=L+j;                }            }            if(temp<ans)            {                ans=temp;                sig=i;            }        }        cout<<ans<<endl;        LL wei=0;        LL tsig=sig;        while(tsig)        {            wei++;            tsig=tsig&(tsig-1);        }        cout<<wei<<endl;        for(LL i=0;i<m;i++)        {            if(sig&(1<<i))            {                cout<<L+i<<" ";            }        }        cout<<endl;    }    else    {        if(K==1)        {            cout<<L<<endl;            cout<<1<<endl;            cout<<L<<endl;        }        else if(K==2)        {            if(L%2) L++;            cout<<1<<endl;            cout<<2<<endl;            cout<<L<<" "<<L+1<<endl;        }        else if(K==3)        {            bool flag=false;            LL mx=3,mi=1;            while(mx<=R)            {                if(mi>=L)                {                    flag=true;                    cout<<0<<endl<<3<<endl;                    cout<<mx<<" "<<mx-1<<" "<<mi<<endl;                    break;                }                mx<<=1LL;                mi<<=1LL; mi++;            }            if(flag==false)            {                if(L%2) L++;                cout<<1<<endl;                cout<<2<<endl;                cout<<L<<" "<<L+1<<endl;            }        }        else        {            cout<<0<<endl;            cout<<4<<endl;            if(L%2) L++;            cout<<L<<" "<<L+1<<" "<<L+2<<" "<<L+3<<endl;        }    }    return 0;}