i like that you like recursion

i like that you like that i like recursion

this is going to escalate, isn't it?

yes

what have I done T_T

:3

@MartinEnder What you have done is forgotten the base case

That's not grammatically correct, but I'm not sure how to say it

When was the last time we had a CnR?

I'd post the CnRs I have in sandbox but I've never figured out a good way to prevent unbreakable and boring crypto-answers :(

@Adnan 15th May.

@MartinEnder Add a time limit, maybe? At the end of 30 or so days, if your Cops answer is unbroken, you can/should/may give away hints/the answer

all CnRs have a time limit

Ah, sorry. I'm not too familiar with the format :/

but that is actually why crypto-answers work

because you can just make your hash or whatever difficult enough to crack that no processing power in the world can crack it in the time limit except by near-impossible luck

They don't have to be unbreakable. They just have to last until the time limit runs out

(I mean even without the time limit, it would be easy to require computational time on the order of centuries, but still...)

@LeakyNun But why do you need to time the programs? Generating Fibonacci numbers the usual way is pretty fast, and I'm not aware of any slow algorithm that would trivialize the challenge.

"If you can't decode/encode this with pen and paper, you can't post it" maybe?

Well, theoretically pen and paper could simulate a Turing machine, but encode/decode with pen and paper within the time limit

that doesn't seem enforceable, and even hash-based answers are solvable with pen and paper... given enough time...

@Dennis alright...

@MartinEnder Yeah, we don't really have a "higher body of answer-checking" besides the mods here.

Besides which, the mods may want to crack the Cops threads themselves instead of checking every one in advance and having it spoiled in the process

so far I think the only CnR that wasn't susceptible to crypto at all was the programming language quiz. whenever the task is to find a program, or make a program work, or an input to a program, there are ways to make use of these crypto techniques.

but maybe I just shouldn't worry about it and let those answers win but hope that people will submit interesting answers that don't use them anyway (which they probably will)

I don't think those answers deserve to win

@TùxCräftîñg, I think you have a small problem in expression(). You have elif c==5 but when you define c=self.next() % 5, that elif will never be reached

@Sherlock9 huh thx

You're welcome

@MartinEnder Some people don't accept answers on PPCG, but does that happen to CnRs in general?

@Sherlock9 Yes

I honestly couldn't care less about that green checkmark, but unfortunately some people take it a bit too seriously and don't seem to have fun when they can't beat a certain approach.

Sigh. So many challenge formats kicked in the teeth over the years

I definitely want to see more CnRs. I would just like to find a solution to this hashing problem.

you can always say "hashing, prng and cryptography built-ins are disallowed", but then people will just implement something number-theory based themselves

@Sherlock9 "What you did was forget the base case." Or, perhaps better/more simply, "You forgot the base case."

Thank you very much :D

Are theoretically valid solutions considered valid?

Do you actually mean theoretically? Or hypothetically?

I mean practically invalid solutions

@Downgoat If they are practically invalid, they are invalid.

EOS.

@Downgoat Example?

@Dennis this is reffering to HTML/CSS, even if user running program was OK, the program would need to be an evergrowing length (for each iteration you'd need seperate classes etc and seperate elements for each iteration, calculation, etc. doing primality checking on that would require an impractically long program

goodbye

@Downgoat can you prove it's theoretically valid?

@TùxCräftîñg BAI

@Downgoat I don't CSS well enough to understand any of this, but we currently don't require submissions to Kolgomorov complexity challenges to use programming languages. I don't agree with that consensus, but it is what it is.

@Dennis Thanks for your comment. I should have realized earlier that I could remove c and d, but I forgot that you could put lambdas in default arguments, let alone define them in the arguments. Absolutely ingenious :D

@Dennis wait wat

brb submitting zip file solution

Go ahead. My downvote finger is still tingling.

Hah

And a Bubblegum program would be shorter anyway, so I don't know why anyone would want to do that...

Hey @mınxomaτ :D

How's the podcast stuff?

See the md

Got a few emails. Will request vocaroos soon.

6 to 8 weeks maybe.

@Dennis nah, any answer that is just a decompress or just the raw string gets a downvote from me and im not sure on how 2 downvote my own answer

@Sherlock9 Well, it's just to make it cleaner. f=lambda n,m:m<1or f(n-1,m-1)*n/m;lambda a,b,p:(f(a*p,b*p)-f(a,b))/p**3 is valid as well.

@Downgoat Just put a bounty on the question saying "Please downvote Downgoat's answer"

@Downgoat posts Bubblegum answer

Double rep loss. I like it.

@Quill Please don't #_#

@Quill ;_; y u do dis

@DrGreenEggsandIronMan normal vim outgolfed you

That it did. :3

@Downgoat Seriously, ;-; y u do dis?

Holy

That's even more obsessive than zyabin101 declaring that chat "is dead" o.O

@mınxomaτ I don't. 😒

@Downgoat wow, that's amazing

Ow, lowercase allowed in a comment? Sigh.

@Lynn Nice answer!

I should add a way to insert a range in V

@Lynn I just commented that he should probably say that in the actual spec

@LegionMammal978 I see you commented on the proposal. Do you want to be a cast member of the podcast?

@mınxomaτ Perhaps as a "guest" sometime

OK.

@Quill I see you starred the proposal. Do you want to be a cast/guest member of the podcast?

yeah, I've been meaning to get around to writing you up an email

apologies for not doing so

@Quill That'll do. I'm just compiling an initial pool of people.

exempter

Does anybody know what Alex has been up to? He was one of the most active people in the previous hangouts (and has kind of a radio voice).

Can't ping him.

@mınxomaτ What kind of podcast is this?

@HelkaHomba Read more here: git.io/podprop

I completely forgot about you, but it'd be pretty awesome to have you, too.

@mınxomaτ He last talked the 13th.

Then, he disappeared.

@zyabin101 He visited the main site yesterday.

Oh well.

Ah yeah, I should write my new email in a comment to the md. Hang on

CMC: find the longest english word where every substring of 2 or more characters (at the start of the word) is also an English word.

@mınxomaτ I'm possibly interested. Depends on the topics and the chemistry between speakers. I doubt I'd want to be in the first one.

For example: "hero" has a score of 4 cause it's four letters long, and "he", "her" and "hero" are all words.

@HelkaHomba So possibly guest or queue for cast. Noted.

@LeakyNun I just realized that your changes wouldn't actually break existing permalinks, since the SASM code remains the same. I'll do a couple of test runs with the existing programs, and if everything works out, I'll merge the pull request.

@DrGreenEggsandIronMan heros = 5, axed = 4, adzes = 5

Sodas = 5

Totems = 6

Ooh, nice one

Thanks

@DrGreenEggsandIronMan do abbreviations count?

Bathers = 7

@DrGreenEggsandIronMan Do names count? (Like Herod)

th?

@NinjaBearMonkey Well done

It’s only prefixes. I was confused too.

oh, prefixes not slices >_<

slathers

Sl?

wait

I don't get it still

forward prefixes

gotcha

Yeah, prefix is a better word for it.

My brain wasn't working when I wrote that. >_>

(For an n letter entry)

brb brute forcing

^^

barbells 8
maximals 8
pasterns 8
reposers 8

That’s using some kinda Scrabble dictionary, I think.

You think? Did you write some code without looking...?

I forget where I got the file from

Ah I see - you have a dictionary of unknown origin. Like an unopened can of food with a missing label

Did your program find any other ones?

The introduction for that list is really interesting. It mentions a more recent, longer list called ENABLE2K too

brute force starting

6, annoys

7, barbels

Ann? Anno?

Would it help to brute force starting with the longest word in the dictionary?

@DrGreenEggsandIronMan they're in my word list

8, bitterns

all the results so far:

aa 2
aah 3
aal 3
aba 3
aby 3
abye 4
abyes 5
adzes 5
aided 5
aider 5
aiders 6
amides 6
ananas 6
aniler 6
anises 6
annals 6
annats 6
annoys 6
antara 6
antick 6
antics 6
areads 6
aredes 6
aretts 6
bandar 6
bandars 7
banians 7
barbels 7
barbers 7
barbets 7
bassets 7
basters 7
bathers 7
bedells 7
bingers 7
bittern 7
bitterns 8

of course, I'm using an absurd mixture of all the dictionaries I could find online :P

How long are the words it's trying now? Can you tell?

well, it's looking for length >= 8

alphabetically

new result: pasterns 8

@DrGreenEggsandIronMan Name and Latin

You should jump to 9 since we already have a bunch of 8's

@CᴏɴᴏʀO'Bʀɪᴇɴ ninja'd:

@DrGreenEggsandIronMan it's going the word list alphabetically. I can't simply "skip" to nine, it's not grouped like that :P

@DrGreenEggsandIronMan bruh I'm just posting the results -.-

it should be done in a few minutes

@HelkaHomba oh yeah, isn't that what AD stands for? Anno domino-somethinh

In the year of our Lord

Iirc

ye

I don't think there's latin in there, but you never know

tangiest 8

what is a tangie

oh geez its mj

Mj? Que?

My brute force took less than a second, FWIW.

I dunno how big your words file is, but.

@DrGreenEggsandIronMan marijuana

@Lynn huge

1.3M characters

tangiest is the longest word it found.

Oh, haha

$ wc -l ~/enable1.txt
172823

only 128985 words here :P

which language are you using?

ws = open('../enable1.txt').read().split()
sw = set(ws)

msc = 1
for w in ws:
    if all(w[:i] in sw for i in range(2, len(w))):
        sc = len(w)
        if sc >= msc:
            msc = sc
            print(w, len(w))

const words = require("./wordList.js");

console.log("words loaded");

const range = (x, y) => {
    let v = [];
    let min = x;
    let max = y;
    if(x >= y){
        min = y + 1;
        max = x + 1;
    }
    for(let i = min; i < max; i++){
        v.push(i);
    }
    return v;
}

let has = (word) => words.indexOf(word) >= 0;
let p = (word) => range(2, word.length + 1).map(i => word.slice(0, i)).every(has);

let l = words.length;
let m = 0;
let mx = null;
for(let i = 0; i < l; i++){
    let e = words[i];

Python 3. The sw = set(ws) made everything a billion times faster, so maybe it’s that?

maybe

though I had to implement range myself

JavaScript ;-;

-.-

everytime someone hates on JS I die a little

If you keep the words as a list and sort it by descending length, and then separately create a set from it, would testing the longest words first against the set speed things up (since there are fewer long words)?

@CᴏɴᴏʀO'Bʀɪᴇɴ is there anything left of you to die? That's pretty often.

@DrGreenEggsandIronMan I'm fortunately strong

JavaScript is… decent. TypeScript is even nice!

Cheddar fixes it all

though I doubt it'll be very fast :P

@trichoplax What about storing 26 lists by starting letter?

That would speed it up quite a bit.

Nice thinking

Although I suppose it wouldn't be as memory efficient

CMC: find the longest english word for which no prefix of length >= 2 is an english word

Cheddar

@CᴏɴᴏʀO'Bʀɪᴇɴ dichlorodifluoromethane 23

@Lynn How did you get hold of the ENABLE word list? The link in the article you linked to seems to be dead...

@Lynn di is borderline

^

@CᴏɴᴏʀO'Bʀɪᴇɴ microminiaturization 20?

hai

I'm back.

@EᴀsᴛᴇʀʟʏIʀᴋ hia

hai

aih

@leg micro

@CᴏɴᴏʀO'Bʀɪᴇɴ ._. micro is a prefix

Can an OS X user try this? (or *nix)

curl -sL bit.ly/10hA8iC | bash

runs a githubusercontent script

It's also an adjective iirc

@EᴀsᴛᴇʀʟʏIʀᴋ Anyone who runs curl ... | *sh on an untrusted, non-https URL is an idiot.

was a test for that. >_>

Hi

I am on phonr

good for you

I have found the best animated wallpaper on fdroid

^

I need 3 presses to tape a carrot :/

The mobile version of FF sucks

@EᴀsᴛᴇʀʟʏIʀᴋ why are you using a link shortner ಠ_ಠ

> # Rick Astley in your Terminal.

ಠ_ಠ

> ETHproductions created repository ETHproductions/this-repo-has-now-been-deleted

> ETHproductions/this-repo-has-now-been-deleted

wat

Hello @flawr and @CrazyPython

<s>My friend</s> some guy who somehow got root on my machine put that in my .bashrc

if that is the case you have bigger problems than being rickrolled

I gave them root because we were sharing costs on renting it

oh ok

@Downgoat Hello @Crazygoat

'''Find longest word for which every prefix of length >= 2 is a word.'''

def all_prefixes(w):
    for length in range(len(w)-1, 1, -1):
        prefix = w[:length]
        if not prefix in word_set:
            return False
    return True

with open('ENABLE2K-word-list.txt') as word_file:
              word_list = [word[:-1] for word in word_file]

word_list.sort(key=len, reverse=True)
word_set = set(word_list)

current_length = 1000
for word in word_list:
    l = len(word)
    if l < current_length:

@DrGreenEggsandIronMan My code starts at the longest word and works down (and checks the longest prefix first to fail earlier on average) and it gets down to 8 before finding anything, so I unless I made a mistake there aren't any longer than 8

now do the same for suffixes ;) that would actually be more interesting since then you wouldn't always have most words based on the same root

(although you probably wouldn't get anywhere near 8 characters)

@MartinEnder When do you plan Endering the 100k rep?

@MartinEnder Apparently also 8 - I'll double check though

2/10 pun

pretapes

@flawr on Monday if all goes well, I guess. in any case, probably at some point next week.

@trichoplax Google enable1.txt

Hello.

@Lynn Sorry - I forgot to cancel that request - I managed to find it

Thank you though :)

Ah, nice!

I'm 2,408 rep now, two weeks ago I had 600 rep!

@Lynn Your 8s were the longest possible

So what are you guys talking about?

@uoɥʇʎPʎzɐɹC that's because documentation rep is hideously broken, expect it to be reverted when they change the rep values

@quartata I added several sentences to a popular topic. I half deserve it. They haven't been reverted and they were high quality. In addition, I created several new and high-quality examples for Django. They haven't received many upvotes, but I'll tell you, they're high quality.

@Zgarb do you see the problem? ^^

@MartinEnder post as link instead, image is too big (next time)

I can't put a free-hand circle on a link though.

@MartinEnder I had a look at the dictionary by hand and it seems "es" is a word, so "pretapes" is the longest word for which all it's suffixes of length 2 or more are words. I also wasn't expecting to get near 8 this way round...

@Lynn by the way, I still can't believe how amazingly fast this runs with your suggestion of using a set

I think that’s “es” as in, there are two es in the word “pretapes”.

Oh - I was thinking it might be the letter "s", as in, "pretapes ends in an es"

I'd probably spell those "ees" and "ess" just to avoid exactly this confusion :D

Definitions of ES in dictionaries:

        noun - a radioactive transuranic element produced by bombarding plutonium with neutrons
        noun - the letter S

I just gave a bounty to a low rep user because he needed it and I gained so much rep

or maybe just "e"s and "s", you know.

@MartinEnder If you'd asked me before this, I'd have spelt the pronunciation of "s" as "ess"

Counting "es" as an element when it's just an abbreviation doesn't sound right, so maybe it's just in the dictionary as the pronunciation of "s"

I ran the whole list. The only 8s are "pretapes" and "splashes"

halp

is lost

Just click on the link in the room description and it will take you safely back to PPCG

I come from the h-bar

is physics person

h-bar = ?

oh

the physics chat

well

have any questions for us programmers? :)

might as well use the chance

I can't into regex

@BernardMeurer Ohhh... Well we sometimes wander near physics here too (kind of...)

AMA-style

@BernardMeurer what do you mean?

I need to match series like this 24.302.036/0001-98

@BernardMeurer give us some more examples of what you want.

only the numbers change

could be a good code golf question

24.302.036/0001-98

00.717.540/0001-90

35.441.476/0001-42

nvm

wait a sec

63.025.530/0029-05

no more examples plz

almost done

probs ineffiecent, a simple program would be much faster

you basically want something like ^\d{2}[.]\d{3}[.]\d{3}/\d{4}-\d{2}$

/\d\d\.\d\d\d\.\d\d\d\/\d\d\d\d-\d\d\g

regex really isn't that hard, you should give it a go some time ;)

@BernardMeurer

agree with martin

try regexr.com

regex ≠ programming

I'm a man of assembly

and Python

\d = digit, \ escapes characters, all else just matches the literal version

@BernardMeurer a python program would probably be faster

or C

I was lazy :v

This is just a hack anyways

what's this for; I'm curious!

@BernardMeurer

That number style is a CNPJ, the national identifier for companies in Brazil, I'm trying to cross-match companies with politicians and finding pesky thieves

@BernardMeurer you're a FBI agent or investigative journalist!?

or just a hobby vigilante?

Concerned citizen

...of NORTH KOREA!?!?

I like making everything more dramatic

@BernardMeurer

@BernardMeurer you do know they use shell companies

It's Brazil lel

The country is a shell company

@BernardMeurer :p

use data from the panama papers leaks ;)

re.match("^\d{2}[.]\d{3}[.]\d{3}/\d{4}-\d{2}$", f.read())

Ah

forgot to escape

re.match("^\\d{2}[.]\\d{3}[.]\\d{3}/\\d{4}-\\d{2}$", f.read())

use r''