Gamma's Code Brevity Contest

[Darryl]

3 in base 10 is 000 in base 1. Seems well-defined to me.

There's a zero in the ones column, a zero in the next ones column, and a zero in the third and final ones column. Still only sums to zero…

Lets count backwards from 3
3- 000
2- 00
1- 0
0- wtf?

[gamma]

<snip>
Lets count backwards from 3
3- 000
2- 00
1- 0
0- wtf?

Yes, my apologies. It doesn't make sense. My f*ckup. I imagined that the numbers of zeroes was the number you want so 3="000" and 0="". Have a good luagh about it

[Togra]

Can we post our code now? Canwe-canwe-canwe?
BTW this thread should be splitted.

Back ontopic: we had lots of Obfuscated Code Contests, I never participated but had fun reading the entries, now we should do some regular contests, like code brevity. Seems to me we already have a volunteer host: Gamma. Maybe in a month or two people feel like having a obfuscated contest again?

[Togra]

Alvaro: Oh I'm currently at 2 tokens

Nah... 22.

Nooooooo! That's friggin' insane. Did I say I gave up at 27? Well, I'm back in business!!

[edit]
Ehh... why has Alvaro's post disappeared?

[Darryl]

<snip>
Lets count backwards from 3
3- 000
2- 00
1- 0
0- wtf?

Yes, my apologies. It doesn't make sense. My f*ckup. I imagined that the numbers of zeroes was the number you want so 3="000" and 0="". Have a good luagh about it

Actually if you start with 0 = 0, so 3 = 0000, it makes sense.

D

[gamma]

Alvaro: Oh I'm currently at 2 tokens

Nah... 22.

Ehh... why has Alvaro's post disappeared?

Don't know, but I guess he made a joke with his awe-inspiring 22 tokens.

[Togra]

Down to 25.

[Alvaro]

Alvaro: Oh I'm currently at 2 tokens

Nah... 22.

Nooooooo! That's friggin' insane. Did I say I gave up at 27? Well, I'm back in business!!

[edit]
Ehh... why has Alvaro's post disappeared?

Well, because I misunderstood what you guys were talking about. Once I read it more carefully, I have 27, like most other people.

edit: the 22 came from this:

Code: Select all

void printAsHex(unsigned decimalNumber){
  if(decimalNumber>=16)
    printAsHex(decimalNumber/16);
  cout << "0123456789ABCDEF"[decimalNumber%16];
}



[Togra]

Lol, I almost had a mental breakdown. And Gamma sent me a pretty frustrated email as well. Please read more carefully next time!


Time for some code I think? This wasn't a real contest anyway.
And I still think a moderator should split all the posts regarding Gamma's exercise away.

[spoiler]

Code: Select all

std::ostream & Base::operator()(std::ostream & ostr) const
{
  m_number >= m_base && ostr << Base( m_number / m_base, m_base );
  return ostr << "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"[ m_number % m_base ];
  // 25
}


[/spoiler]

[gamma]

Can't get lower than 27 . Time to spoil my recursive solution:

Code: Select all

std::ostream & Base::operator()(std::ostream & ostr) const
{
        if (m_number >= m_base)
                ostr << Base(m_number / m_base, m_base);       
        return ostr << "0123456789abcdefghijklmnopqrstuvwxyz"[m_number % m_base];       
}

[gamma]

Time for some code I think? This wasn't a real contest anyway. And I still think a moderator should split all the posts regarding Gamma's exercise away.

I agree. I have hijacked this topic I guess .

[Beer Hunter]

Code: Select all

  m_number >= m_base && ostr << Base( m_number / m_base, m_base );
  return ostr << "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"[ m_number % m_base

Hehe, yep, that's exactly what I had. I also found a minor variant, but it's still 25 tokens.

Code: Select all

{
    return m_number >= m_base && ostr << Base(m_number/m_base, m_base), ostr << "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"[m_number % m_base];
}

[Darobat]

Time for some code I think? This wasn't a real contest anyway.
And I still think a moderator should split all the posts regarding Gamma's exercise away.

Done.