10176 - Ocean Deep ! - Make it shallow !!

[Jehad Uddin]

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

[rmg_91]

Why this code generate WA ,could anybody give some test cases?

Code: Select all

#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("YES");
	else puts("N0");
}

int main(){
	string s,cad="";
	while(cin>>s){
		if(s[s.length()-1]=='#'){
			doit(cad+s.substr(0,s.length()-1));
			cad="";
		}
		else cad+=s;	
	}
}

[rmg_91]

I found my mistake !!

[X123]

i am getting WA ,,, but failed to find out what is the wrong!!


#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(str[0]!=' '&&str[0]!='\n'){
temp[j]=str[0];
j++;
}
for(i=1;i>=0;i++)
{
scanf("%c",&str);
if(str=='#'){
temp[j]='\0';
break;
}
if(str!=' '&&str!='\n'){
temp[j]=str;
j++;
}
}
int l=strlen(temp);
for(i=0;i<l;i++)
{
int k=(temp-48)+p*2;
p=k%131071;
}
if(p==0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}

plz help

[brianfry713]

It looks like you figured it out

[Shahidul.CSE]

Got Accepted

[brianfry713]

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

[seddik11]

I use Finite State Automaton to solve this problem.

Best regards
DM

very efficient way to use automate i just wrote 2 lines and got accepted really interesting !