OJ Board

At each step as you convert the binary string to a decimal value do a modulus 131071.

Got Accepted

It looks like you figured it out

i am getting WA ,,, but failed to find out what is the wrong!! :roll: #include<stdio.h> #include<string.h> #include<string> #include<algorithm> #include<iostream> using namespace std; int main() { char str[20000],temp[20000]; int i,j=0; while(scanf("%c",&str[0])==1) { j=0; int p=0; if(...

I found my mistake !!

Why this code generate WA ,could anybody give some test cases? #include<cstdio> #include<string> #include<iostream> #define mod 131071 using namespace std; void doit(string s){ int sol=0; for(int i=0;i<s.length();i++){ sol*=2; sol%=mod; sol=(sol+(int)(s[i]-'0'))%mod; } sol%=mod; if(sol==0)puts("...

got acc after a long time,
input processing was wrong actually.

though i use long long it gives WA,is there any critical input,pls help me....thanks for ur eagerness to help, thanks a lot

Use long long.

thanks jan vai,i got accepted,bt another prob in 10176,pls help me on that prob,i m a beginner,Advanced thanks to u.

This is my code,can any one tell me the process of taking inputs in this prob,...advanced thank to the helpers...

Even after reading the hints I still got stuck for long. Now that I understand the pattern, let me throw another hint out. Basically you want to break down the binary input into groups of 17 consecutive digits (because 131071 is 17 consecutive ones as someone pointed out) and do something with them....

you can try to continuous input with continuous mod . it is good runtime take.

jan vi thanx,I got AC now...actually shortage of a space gives me wrong answer but I dont understand it.

Why max is so high? The problem states that the number can have at most 10000 digits. Replace this part if(base[0]=='#')continue; if(base[0]=='0'||base[0]=='1')i=1; else i=0; with i=0; And use while(scanf(" %c",&base[0])==1)// There is a space before %c and it is important Hope these h...