10093  An Easy Problem!
Moderator: Board moderators
10093 SIGFPE Problem . Please help!
I receive runtime error with the message :
Your program has died with signal 8 (SIGFPE). Meaning:
Floating point exception
Before crash, it ran during 0.000 seconds.
for the following code:
Thx everybody who tried. I found my stupid mistake
I don't see any illegal division. Thanks in advance for any help.
Your program has died with signal 8 (SIGFPE). Meaning:
Floating point exception
Before crash, it ran during 0.000 seconds.
for the following code:
Thx everybody who tried. I found my stupid mistake
I don't see any illegal division. Thanks in advance for any help.

 New poster
 Posts: 10
 Joined: Fri Jun 10, 2005 5:30 pm
I think that there is a problem with your q, because it can easily become very large and so wont fit in a long variabel. So you can after every loop take the mod of q so, instead of q*=base you can use
q := q*base mod (base 1) // i am a pascal programmer, so i think it must be (q*base)%(base1) in C
the same thing you can do with value:
value += q*num[p]; can be
value = (value+q*num[p])%(base1) so there wont be too large values
i did that change and got ACC with your code
q := q*base mod (base 1) // i am a pascal programmer, so i think it must be (q*base)%(base1) in C
the same thing you can do with value:
value += q*num[p]; can be
value = (value+q*num[p])%(base1) so there wont be too large values
i did that change and got ACC with your code
Thank you for your kind reply, GeorgeBusch
I changed my code as your advices, and got AC!
My previous code gives wrong output for following input.
This correct output is 24.
My code had used parameter which reaches overflow.
I couldn't find that.
I appreciate your help.
Best regards.
I changed my code as your advices, and got AC!
My previous code gives wrong output for following input.
Code: Select all
123456789ABCDEFGHIJKLMN
My code had used parameter which reaches overflow.
I couldn't find that.
I appreciate your help.
Best regards.
algorithm
I think the idea behind that problem is the fact that :
An Nbased number R is divisible by (N1) if and
only if the sum of its digits is divisible by (N1)
This allows an elegant solution to be designed.
There's no need to use "long long" or "long" or BigInteger.
1) We read a line from the input file. If the line starts with + sign
or  sign we remove that sign, the sign does not matter.
2) We iterate through the chars of this line and we keep track
ot two things
2.1) the sum of the digits > SUM
2.2) the maximal digit we have encountered > max_digit
Note that the values of the digits do not depend on the BASE of
the number system used ( 'a' / 'z' are always 36 / 61 for example )
3) After the loop from 2) is finished we do this:
If max_digit==0 then max_digit := 1 ( this is a very
special / tricky / case but we have to check for it ) .
4) We then start from N = max_digit + 1 and we iterate up to 62.
For each such N we check if SUM is divisible by N1.
5) If there's such N in the interval [max_digit+1, 62] we print it,
otherwise we print "such number is impossible!"
An Nbased number R is divisible by (N1) if and
only if the sum of its digits is divisible by (N1)
This allows an elegant solution to be designed.
There's no need to use "long long" or "long" or BigInteger.
1) We read a line from the input file. If the line starts with + sign
or  sign we remove that sign, the sign does not matter.
2) We iterate through the chars of this line and we keep track
ot two things
2.1) the sum of the digits > SUM
2.2) the maximal digit we have encountered > max_digit
Note that the values of the digits do not depend on the BASE of
the number system used ( 'a' / 'z' are always 36 / 61 for example )
3) After the loop from 2) is finished we do this:
If max_digit==0 then max_digit := 1 ( this is a very
special / tricky / case but we have to check for it ) .
4) We then start from N = max_digit + 1 and we iterate up to 62.
For each such N we check if SUM is divisible by N1.
5) If there's such N in the interval [max_digit+1, 62] we print it,
otherwise we print "such number is impossible!"
arash_cordi wrote:I think my solution is OK. But, I don't get AC. Don't know why. Are these following inputoutputs correct?
Can anyone give me critical inputoutputs for this problem? Thanks in advance!Code: Select all
Input: z +A Output: 62 such number is impossible!
My AC code gives for above input like this :leo20 wrote:arash_cordi wrote:I think my solution is OK. But, I don't get AC. Don't know why. Are these following inputoutputs correct?
Can anyone give me critical inputoutputs for this problem? Thanks in advance!Code: Select all
Input: z +A Output: 62 such number is impossible!
Code: Select all
62
11
Please try to check
Input :
Code: Select all
3
5
A
+A
A
Z
+Z
Z
265
5464
+265
5464
11111
AAAAA
ABCD
abcd
XYZ
xyz
123456789
987654321
0
1
2
2727
Zz
1010101101
z
41724
123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
123456789ABCDEFGHIJKLMN
Code: Select all
4
6
11
11
11
36
36
36
14
20
14
20
2
11
24
51
52
such number is impossible!
10
10
2
2
3
10
such number is impossible!
2
62
10
62
24
10093 RTE
i getting RTE & RTE & RTE. can anyone tell me the problem?
#include <stdio.h>
#include <string.h>
#include <math.h>
int min(char *s);
int min(char *s) {
int max = 0,i;
for (i = 0; s != '\0'; i++) {
if (s > max) {
max = s;
}
}
if (max == '0') {
return 2;
} else if (max <= '9') {
return max  '0' + 1;
} else if (max <= 'Z') {
return max  'A' + 11;
} else {
return max  'a' + 37;
}
return 1;
}
long long decimal(char *s, int r) {
long long sum = 0;
int i,j;
for (i = strlen(s)  1, j = 0; i >= 0; i,j++) {
if (s >= '0' && s <= '9') {
sum += (s  '0') * (long long) (pow(r,j));
} else if (s >= 'A' && s <= 'Z') {
sum += (s  'A' + 10) * (long long) (pow(r,j));
} else {
sum += (s  'a' + 36) * (long long) (pow(r,j));
}
}
return sum;
}
int main() {
char n[250];
int i;
while (scanf("%s",n) == 1) {
i = min(n);
for ( ; i <= 62; i++) {
if (decimal(n,i) % (i  1) == 0) {
break;
}
}
if (i <= 62) {
printf("%d\n",i);
} else {
printf("such number is impossible!\n");
}
}
return 0;
}
#include <stdio.h>
#include <string.h>
#include <math.h>
int min(char *s);
int min(char *s) {
int max = 0,i;
for (i = 0; s != '\0'; i++) {
if (s > max) {
max = s;
}
}
if (max == '0') {
return 2;
} else if (max <= '9') {
return max  '0' + 1;
} else if (max <= 'Z') {
return max  'A' + 11;
} else {
return max  'a' + 37;
}
return 1;
}
long long decimal(char *s, int r) {
long long sum = 0;
int i,j;
for (i = strlen(s)  1, j = 0; i >= 0; i,j++) {
if (s >= '0' && s <= '9') {
sum += (s  '0') * (long long) (pow(r,j));
} else if (s >= 'A' && s <= 'Z') {
sum += (s  'A' + 10) * (long long) (pow(r,j));
} else {
sum += (s  'a' + 36) * (long long) (pow(r,j));
}
}
return sum;
}
int main() {
char n[250];
int i;
while (scanf("%s",n) == 1) {
i = min(n);
for ( ; i <= 62; i++) {
if (decimal(n,i) % (i  1) == 0) {
break;
}
}
if (i <= 62) {
printf("%d\n",i);
} else {
printf("such number is impossible!\n");
}
}
return 0;
}
 emotional blind
 A great helper
 Posts: 383
 Joined: Mon Oct 18, 2004 8:25 am
 Location: Bangladesh
 Contact:
Code: Select all
while (scanf("%s",n) == 1) {
Code: Select all
while (scanf("%s",&n) == 1) {
 emotional blind
 A great helper
 Posts: 383
 Joined: Mon Oct 18, 2004 8:25 am
 Location: Bangladesh
 Contact:
there's another technique
Though i did not understand ur code properly(as u didn't give any description), it seems that u tried to convert a Nbase number into decimal. Just think if a 62base number with 10 digit is converted into decimal, it would cross long long very easily.
There is another technique for the problem. The clue is
There is another technique for the problem. The clue is
All the best.AN NBASE NUMBER R IS DIVISIBLE BY (N1) IFF THE SUM(10BASE) OF THE DIGITS OF R IS DIVISIBLE BY (N1)
Abhishek Roy
Undergraduate Student,
Department of Computer Science and Engineering,
Bangladesh University of Engineering and Technology, Dhaka.
Undergraduate Student,
Department of Computer Science and Engineering,
Bangladesh University of Engineering and Technology, Dhaka.
Re: 10093  An Easy Problem!
Hi, I could not find any bug in this code . Please help me .Why this code is not accepted By ACM ?
#include<iostream>
#include<string>
using namespace std;
int getValue(char ch)
{
if(ch>='0' && ch<='9')
return ch'0';
else if(ch>='A' && ch<='Z')
return ch'A'+10;
else
return ch'a'+36;
}
int main()
{
string st="";
int i=0,in,sum=0,extra;
bool baseFound=false;
while(cin>>st)
{
if(st.at(0)=='+'  st.at(0)=='')
st.erase(0,1);
in=getValue( st.at(0) );
for(i=0;i<st.length();i++)
{
extra=getValue(st.at(i));
sum+=extra;
if( extra > in)
in=extra;
}
for ( i =in+1; i <= 62; i++ )
{
if ( sum % (i  1) == 0 )
{
printf ("%d\n", i);
baseFound = true;
break;
}
}
if ( !baseFound )
printf ("such number is impossible!\n");
sum=0;
baseFound=false;
}
return 0;
}
#include<iostream>
#include<string>
using namespace std;
int getValue(char ch)
{
if(ch>='0' && ch<='9')
return ch'0';
else if(ch>='A' && ch<='Z')
return ch'A'+10;
else
return ch'a'+36;
}
int main()
{
string st="";
int i=0,in,sum=0,extra;
bool baseFound=false;
while(cin>>st)
{
if(st.at(0)=='+'  st.at(0)=='')
st.erase(0,1);
in=getValue( st.at(0) );
for(i=0;i<st.length();i++)
{
extra=getValue(st.at(i));
sum+=extra;
if( extra > in)
in=extra;
}
for ( i =in+1; i <= 62; i++ )
{
if ( sum % (i  1) == 0 )
{
printf ("%d\n", i);
baseFound = true;
break;
}
}
if ( !baseFound )
printf ("such number is impossible!\n");
sum=0;
baseFound=false;
}
return 0;
}
Why WA for 10093, am I wrong???
help me please if any one seeing my code below:
Code: Select all
#include<stdio.h>
int main()
{
char ch;
while(scanf("%c",&ch)==1)
{
if(ch>47 && ch<58)
printf("%d\n", ch47);
else if(ch>64 && ch<91)
printf("%d\n", ch54);
else if(ch>96 && ch<123)
printf("%d\n", ch60);
}
return 0;
}

 Guru
 Posts: 5947
 Joined: Thu Sep 01, 2011 9:09 am
 Location: San Jose, CA, USA
Re: Why WA for 10093, am I wrong???
Each line can have more than one digit.
Check input and AC output for thousands of problems on uDebug!