Yes, absolutely.
> At least, good enough?
I think the better question is, can you write good code in a particular language and still make deadline?
In the end brainfuck is just a fancy assembler.
You could very well write nicely formatted, structured etc brainfuck. It will just look weird because the (otherwise very simple operations) have a weird sigil syntax.
Brainfuck doesn't give you macros, function calls, function structures. It doesn't have names for anything. In other words there is zero syntactic and physical abstraction. The programmer must assemble everything on their own, with extreme repetition, making it extremely hard to see structure, or to change it.
You can't even write efficient code in it since basic arithmetic operations (like addition, indexing) are O(n).
https://en.wikipedia.org/wiki/TeX
Had he implemented it directly in C he would be sending checks every day.
He used Pascal maybe not for the reasons you think. Remember it was the early 70s. If you actually look at the TeX source code, I'm pretty sure you won't find the kind of Pascal you envision.
Nowadays, Knuth does use C directly. (FWIW)
Are you familiar with Daniel J Bernstein?
> the best C code isn't good enough
Are you sure _you've_ seen the _best_ code? Are you sure you understood the constraints of those writing that code when you evaluated it?
> I'd say good code meets deadlines
I'm trying to say there's an obvious compromise between the two, which explains the wide spectrum of code quality.
If you're referencing programs where half the source code is written in a theorem proving language like CoQ, that's not really "written in C", now is it?
Can you write good code in any language, though? At least, good enough? It's quite hard to study objectively, but my subjective opinion is "no". Trivially, brainfuck certainly doesn't cut it, but even if you're only looking at serious languages geared toward general, production-quality programming, there's a lot of programming languages that are much easier to make mistakes in or abuse than others.