ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

Обсуждение задачи 1179. Числа в тексте

I don't understand the problem please help me
Послано "WRN" 13 мар 2002 09:17

01234B56789
AZA

is this test have 2 numberic text
and  there is not numberic text in 11-base
(01234ЪB56789 is 12-base and AZA is 36-base)

why the answer is 11 4
what is 11 mean
what is 4 mean

Thank you
(+)
Послано MadPsyentist/Sam 14 мар 2002 01:59
hi Wan+ , long time no see ^^

btw, it means numbers in text , not numberic text
so 11 4 means there are 4 numbers in 11-based number system
those are 01234,56789,A,A
thanks
Послано "WRN" 14 мар 2002 22:23
hi, p'Sam  long time no see too.
Thanks for your help
that you told me  it mean  you can spilt the numberic text  into any
part ??  or only 3 part
0,1,2,3,4,5,6,7,8,9  it can be in any base of number that greater than 10
why the answer is 11 12
Hmmm
Послано MadPsyentist/Sam 15 мар 2002 06:47
i'm having a hard time explaining in english ,it's not my language ><

yes, number written in x base can also be y>x-based. but it doesn't
matter at all because this is not mutually exclusive property. anyway,
answering this question won't help. let me explain the problem

you just have to count amount of X-based numbers AMONG the text (i.e.
just ignore those characters that can't fit in X-based number system , or
consider them as delimitors). and pick the system that have maximum
amount of numbers

let's see the sample case
01234B56789
AZA
there are only 1 2-based number , that is 01 (you just can't split them
into 0 and 1)
1 for 3-based : 012
1 for 4 : 0123
1 for 5 : 01234
2 for 6 : 01234 and 5
2 for 7 : 01234 and 56
2 for 8 : 01234 and 567
2 for 9 : 01234 and 5678
2 for 10 : 01234 and 56789
4 for 11 : 01234 , 56789 ,A and A
but only 3 for 12 : 01234B56789 ,A and A
and ofcourse! 2 for 36 : 01234B56789 and AZA

another so long explaination . . .
Re: Hmmm
Послано ECUST Multistar 15 мар 2002 18:19
> i'm having a hard time explaining in english ,it's not my language
><
>
> yes, number written in x base can also be y>x-based. but it doesn't
> matter at all because this is not mutually exclusive property.
anyway,
> answering this question won't help. let me explain the problem
>
> you just have to count amount of X-based numbers AMONG the text
(i.e.
> just ignore those characters that can't fit in X-based number
system , or
> consider them as delimitors). and pick the system that have maximum
> amount of numbers
>
> let's see the sample case
> 01234B56789
> AZA
> there are only 1 2-based number , that is 01 (you just can't split
them
> into 0 and 1)
> 1 for 3-based : 012
> 1 for 4 : 0123
> 1 for 5 : 01234
> 2 for 6 : 01234 and 5
> 2 for 7 : 01234 and 56
> 2 for 8 : 01234 and 567
> 2 for 9 : 01234 and 5678
> 2 for 10 : 01234 and 56789
> 4 for 11 : 01234 , 56789 ,A and A
> but only 3 for 12 : 01234B56789 ,A and A
> and ofcourse! 2 for 36 : 01234B56789 and AZA
>
> another so long explaination . . .
Re: Hmmm
Послано ECUST Multistar 15 мар 2002 18:19
thank you too.
Thanks.
Послано 198808xc 23 май 2005 19:01
Thanks for Explaining the Problem for me.
Re: Hmmm
Послано Yuhc要努力 12 сен 2009 17:21
Thanks so much for explaining the problem!
Re: thanks, thanks, thanks !!!
Послано hoan 25 ноя 2010 15:05