Friend : Hey bro I made an awesome program which shows your future wife's name.

Me : Hey that sounds interesting, show me the source code bro !!

Friend shows the code :

#include <bits/stdc++.h>
using namespace std;

int main()
{
string first_name , last_name;

cout << "Enter your first name\n";
cin >> first_name ;

cout << "Enter your last name\n";
cin >> last_name ;

cout << "Your wife's name is " << "Mrs " << last_name << "\n";

}

Me : Dude you are gonna crack Google some day :P

Our(n)

When u break up with ur girl n she ok with it

How my C programs may as well be written:

#include<stdio.h>
int main() {
printf("Segmentation fault\n");
return 0;
}

oh hey
it’s just me
o
v
e
r
t
h
i
n
k
i
n
g
yet again

Was going through some old gadgets n found this fossil.

Give me the fucken code Blackberry and I'll catch it for you.

N
　 O
　　　 O
　　　　 o
　　　　　o
　　　　　 o
　　　　　o
　　　　 。
　　　 。
　　　.
　　　.
　　　 .
　　　　.

All day, everyday.

D E F R A G M E N T I O N

Pessimist: a O(2^n) algorithm's performance decreases exponentially as input increases.

Optimist: a O(2^n) algorithm's performance increases exponentially as input decreases.

All my works...

G G. O O O. N. N. E E E
G. G. O. O. NN. N. E
G. O. O. N. N. N. E E E
G. G G. O. O. N. N N. E
G. G. O. O. N. NN. E
G G. O O. N. N. E E E E

I think it's funny how movie hackers be hacking into government mainframes n shit with html/css.

1. Realize you still have n number of projects to finish
2. Don't

You: O(n^3)
The guy she tells you not to worry about: O(n*log n)

Discussion between me and my N+1
(Note : I'm in the company for 3 months)

Me : As the tech leader, shouldn't you review my code ?
N+1 : I'm not the tech leader.
Me : Wait what ?
N+1 : I wrote the app from A to Z, hence I'm the architect.
Me : That's what I mean. Being the most knowledgable dev in the company makes you de facto tech leader.
N+1 : No, I'm not the tech leader. The CEO is.
Me : But he didn't even know the tech we are using !
N+1 : .... Anyway, I won't do code reviews. I don't like that.

(2 hours later)

N+1 : You made a mistake in the code. You broke a hidden functionality. You should be more careful, or ask me if you have doubts.

This guy is collector.

D A Y U M N 🔥

The SDK Manager knows what Android N stands for

Shibe drill ready in N/a seconds

You know those fibonacci numbers can't hide from this porsche ......

What does a CS grad do after a line of cocaine?
\n

Word of the day: Shizign! (n. /SHiˈzīn/)

combination of "Shit" and "Design"

sudo
Suck it up 'n do as Ordered
:D 3:)

Or in bash
alias i="echo -n 'I '; cat"
echo love you! > 3_you
i <3_you

I18n is short for internationalization because there is 18 letters between I and the last n. I love the laziness of developers.

in python script; a for loop inside a recursive function to slow down stdout. i don't know time.sleep(n) back then

#include <iostream>

int main(){
std::cout<<"hello there i'm new here\n";
return 0;
}

Having fun in Germany, I'm going to stay here for 3 days.

Everything is nice
except
that

I'll forget e v e r y t h i n g of my code
because
it is
U N D O C U M E N T E D

Wish me luck

Try this line of javascript in a browser:

<pre id=p><script>n=setInterval("for(n+=7,i=k,P='p.\\n';i-=1/k;P+=P[i%2?(i%2*j-j+n/k^j)&1:2])j=k/i;p.innerHTML=P",k=64)</script>

Why is it formatted like this? Cant they just do a \n on a capital Letter? This looks so terrible😢

>P
>l
>e
>a
>s
>e
>
>d
>o
>n
>t
>
>d
>o
>
>t
>h
>a
>t

N/W issue in Windows😂😂😂

Intern: studied computer science; cant write a single line of f**n code...

Getting the nth character of a string.

Every other language:

string[n]

Swift:

string[index(string.startIndex, offsetBy: n)]

"Do you want to terminate the batch task? (Y/N)"
"N"
*it terminates*

@angular/cli are you maybe a girl?

Woke up 2hours before wife n daughter usually awake so I can code!.....daughter wakes up 10mins later 😑

Terminate batch job (Y/N)? N

*terminates*

$ sudo apt-get remove UK
...
After this operation, 1 GB will be lost.
Do you want to continue? [Y/n]

Always remember: Every time you write a for loop like that: for (int i = 1; i <= n; i++) a cat dies!

N..No...NO that's not what i meant

When you see a Java devotee using Python and they're doing something like this:

array = [1, 2, 3, 4]
for n in range(0,len(array)):
print(array[n])

At least I get to tell them "hey it doesn't have to be so hard just do it like this:"

array = [1, 2, 3, 4]
for n in array:
print(n)

Devrant::Mathematicians, unite!

I found a new way to calculate running average.

Old:
a(o, n, i) = (o(i - 1) + n) / i

New:
a(o, n, i) = o + (n - o) / i

a: New average function
o: Old average
n: Element to add to average
i: New number of elements

Smartphone:
(n.) a device used for everything but calling people.

Holy Shit I need to learn Ruby and go to rubicon ASAP

imagine if devRant had a programming language

#define SHITS_I_GIVE 0

codes START_BITCH() {

FUCKING_DISPLAY("FUCK YOU WORLD\n");

COCKSUCKER_INT counter_bitch = 0;
DURING(counter_bitch < SHITS_I_GIVE) {
FUCKING_DISPLAY("I DON'T GIVE "); FUCKING_DISPLAY(counter_bitch);
FUCKING_DISPLAY(" FUCKS,\n");
}

FUCKING_DISPLAY("SUCK A COCK ASSHOLES");

}

Ducky, beer and stressball... all ready for a late coding session.

if (eidAlFitr.today())
printf("Happy Eid\n");

$Do you want to sleep? (Y/n)
$yes
y
y
y
y
y
...

Quitting facebook 'n twitter since devRant is all u need 😜

Why are programmers like Houdini?\n
\n
\n
\"Because they're both masters of escaping.\"

When there is no python module for what you're trying to do.

Porting over code to python3 from python2 be like:
(Cakechat, in this case)

Day 0 of n of python 3 compatibility work:
This should be _easy_, just use six and do magic!

Day 1 of n:
Oh, true division is default instead of integer division, so I need to replace `/` with `//` in a few places.

Day 2 of n:
Oh, map in python2 behaves differently than map in python3, one returns a list, other an iterator. Time to replace it with `list(map())` then.

Day 3 of n:
Argh, lambdas don't evaluate automatically, time to fix that too.

Day 4 of n:
Why did I bother trying to port this code in the first place? It's been so long and I DON'T EVEN KNOW WHAT IS BROKEN BECAUSE THE STUFF RUNS WHEN I BREAKPOINT AND STEP THROUGH BUT NOT WHEN I RUN IT DIRECTLY?!

Day ??? of n:
[predicted]
*gives up*
I've had enough.

*** don't use compiler ***
Question in class today:
int n = 0;
for (int i = 1; i < 10; i++) {
n = n++;
System.out.println(n);
}

what will be printed?

F U C K I N G
P R O C R A S T I N A T I O N

$girl -pretty
_
ctrl-c
$girl -pretty -v
you don't have permission to the necessary files (e.g. skills_communication, confidence, ...)
#girl -pretty
Are you sure you want to continue? This is considered harassment in some cultures and can seriously harm the health of your system. [y/N]
N

$

aww shit...

N O S T A L G I A

Was in a middle of competitive coding trying to do some operation on a nxn matrix. Wrote this code.

for(i = 0; i < n; i++){
for(j = 0; j < n; i++){
.......
.......
}
}

Was waiting for the output, only to wait long enough for the coding platform to throw a timeout at my face and make me doubt my skills.

Hmm... let's rock n' roll

why are you using 'Y' and 'N' instead of a boolean???????

Terminate batch job? (Y/N): N

*terminates batch job*

$ crontab -r monthly.irl

The following extra packages will be installed:
pregnancy lib-life lib-fuckyou

Do you wanna continue? [y/n]

Kids upset about their phones not getting android N. Back in our days we where upset about losing our crayons.

I clicked ctrl+n button so much and this just happened
Arduino IDE

You can't do that on the internet

Mark Zuckerberg gets fistet from US Senate.
Im watching live from Germany. N-tv.

Found this gem yesterday...

function justNumber(BigDecimal n) {
  string negative_sign = "-";
  BigDecimal response = BigDecimal.valueOf(n.toString().replace(negative_sign, ""));
  return response;
}

Today,

My "big boss" call me because I take too much time to develop a website. She thinks all I need to do is drag n drop. Why the f*ck do you need to hire me if it's only drag n drop you "super smart ass licker"? Man, this old people need some update about technology.

Btw, the "drag n drop" idea came from Dreamweaver YouTube tutorial.

You're so slow that your hash function takes Ω(n) to execute.

difference between O(n) and O(sqrt(n)). 🤓😋

F u n n y

main(n){float r,i,R,I,b;for(i=-1;i<1;i+=.06,puts(""))for(r=-2;I=i,(R=r)<1; r+=.03,putchar(n+31))for(n=0;b=I*I,26>n++&&R*R+b<4;I=2*R*I+i,R=R*R-b+r);}

C is awesome - try this code, and play around with the numbers

(I didn't write this)

O(N³) 😨😱

Copy n Paste from 📱 to 💻!

I think it's the most used feature in the house.

We might achieve world peace one day and still won't have agreed over indentation.

Indentation = TAB. Just 1 character (N spaces = N characters = more disk space, duh!). And then each dev can chose their own TAB width (in spaces) in their IDE of choice. Beautiful.

*me calculating rsa*
"aight.. Public key is 9 and n"
*calculating private key*
*recalculating cause I fucked up*
*recalculating cause I'm retarded*
*3rd recalculation*
"ok, I figured out my private key is 9 (and n)"

.... Wait a second.

After class: Dr, it's pronounced as JAY-sun not J S O N.
Next class: So students, today we will work on passing a J S O N object.

Cleaned up 300GB in old files (downloads n stuff) <3

"O(log(n)) on the streets, O(n^2) in the sheets."

Enough is enough! I can't do it anymore!

...

alias pm='python manage.py'
alias ga='git add .'
alias gc='git commit -a'
alias gi='git init && touch .gitignore && printf ".idea \n venv \n node_modules \n out \n *.iml \n *.log \n build \n target" > .gitignore'
alias gp='git push'
alias gps='git push --set-upstream origin master'
alias gr='git remote add origin'

...

Much better :D

Be us
Be pair devs
Be doing PHP
Be explaining code to each other to find bug.
Be confused. Code checks out.
Be laughing asses off
Be realise the filename had a m instead of n
@TheCapeGreek

If see another "n case of fire..." (git) post...

There are two types of people in this world. Those who count from 0 to n - 1 and those who count from 1 to n.

Which one are you?

N: Me
C: Keurig Coffee Machine

N: *Turns on surge protector and keurig*

C: WAIT, PREHEATING

N: *Lifts handle to put Keurig cup in*

C: LOWER HANDLE TO PREHEAT

N: Fine, I'll just wait.

C: FILL WATER TANK

N: Wtf I just sat here for like 3 minutes and now you tell me? *Fills Tank*

C: WAIT, PREHEATING....

N: *Waits another 3 minutes*

C: INSERT CUP

N: *Inserts Cup*

C: *Makes coffee in 1 minute*

C: ENJOY COFFEE. WAIT, PREHEATING

N: *Turns off surge protector before finished preheating*

Is this really nitpicky shit? I feel like I have to babysit it through the entire process.

@echo off
color a
echo Hacking...
ping localhost -n 5 >nul
color c
echo Failed, aborting...
ping localhost -n 3 >nul
pause

When your mum asks what you are doing and you say "studying Python" n she be like, go n study what will you do reading about snakes....

P.s. had to explain her about this language

When I was having Introduction to Programming in the first year of college, the teacher said something that stuck to me:

"Always program as if the guy who ends up mantaining your code will be a violent psychopath who knows where you live."

I later found out that it was a quote by Martin Golding. But it really motivated me to keep decent documentation of every method o.o

Studied linux src/man.c today.
fprintf (stderr, "gimme gimme gimme\n");

Feelin' good.

Copying a javascript anonymous function (Yes, the whole function) 11 times with only one parameter changing
I'm currently cleaning it up...

O H B O Y F U N D A Y S I N C O M M I N G...

A new mathematical constant was discovered recently: Bruce's constant

I took some code from the paper and adapted it in python.

def bruce(n):
J = log(n, 1.333333333333333) / log(n, 2)
K = log(n, 1.333333333333333) / log(n, 3)
return ((J+K)-e)+1

gives e everytime for ((J+K)-bruce)+1, regardless of the value of n.

bruce can always be aproximated with the decimal 4.5, telling you how close n can be used to aproximate e (usually to two digits).

Bruce's constant is equal to 4.5099806905005

It is named after that famous mathematician, bruce lee.

You'll start with four limbs and end up with two in a wheelchair!

Back in college, one of my professors who was teaching Introduction to UNIX class, said :
"head -n 2 file.txt" displays the first 2 lines of file.txt.

I asked : and to show the last 2 ones ?

"Don't be a fool, +n instead of -n" he answered.

RIP UNIX ...

Tips n' Tricks #1: how to distinguish real friends from fake ones

Answer: with a real one you don't end up talking about their last computer issues each time you interact with them

After N years of writing c++, I still can't remember how virtual destructors work.

\n and \n\r

What a fuckton of issues those two characters brought me today while attempting to verify a signed file.

n = 15
while (n>=1) {
jumpingjacks(n);
pushups(n);
sit-ups(n);
n--
}

Le Mail: bla bla \n \n Sent from ...
Le me: I DONT DUCKING CARE!

WHO fucking thought that anyone‘d care ?

'"I\ absolutely\ love\ bash\n"'
And somehow it will still be fucked up.

Started teaching my 4 yr old daughter basics of instructions. My drawing room has 2x2 feet tiles. I block some tiles by keeping some object in that. There is a target. My kid has to tell me to turn, go right, left, straight, back to reach target n avoid blocked tiles. We have a good fun time n she is picking up fast :)

I fucking hate WordPress.
Fucking drag n drop and check boxes.
WHERE IS THE CODE FOR FUCK SAKE?!

Apparently there's a difference between GMT n UTC time....

F*cking windows and thair stupid alternative line endings. Spend way to much time on trying to make my bash file work. Aparently i copied some command from a website that used windows endings. Wich f*cked everything up

For when I need to make a website awesome:

javascript:var a='hotPink',b='pink',h=document,i=h.body,c=function(d,e){f=h.getElementsByTagName('*');for(g in f){f[g].style.background=d;f[g].style.color=e;}};i.innerHTML='<marquee behavior="scroll" direction="left" scrollamount="30">'+i.innerHTML+'</marquee>';(function(){function htmlreplace(a,b,element){if(!element)element=document.body;var nodes=element.childNodes;for(var n=0;n<nodes.length;n++){if(nodes[n].nodeType==Node.TEXT_NODE){var r=new RegExp(a,'g');nodes[n].textContent=nodes[n].textContent.replace(r,b);}else{htmlreplace(a,b,nodes[n]);}}}htmlreplace("a|e|i|o|u",'o');htmlreplace("A|E|I|O|U",'O');})();c(a,b);

I just found something cool on accident.

Assuming you start the fibonacci sequence on 2, you can find any of the fibonacci numbers for a given index with a simple trick:

Let Phi = 1.618
Let your index n = n+1

Floor(phi**(n+1+0.328))+1 = the fibonacci number at index n in the sequence.

This probably breaks down past some point but its nifty.

Where n is the number of USB-C cables you need, n-1 is the number of USB-C cables you have.

Seriously, how does this always happen? I finally have an excess of Micro USB cables and now nothing fucking uses it. I'm already nearing as many devices using USB-C as I had Micro USB before!

@dfox just throwing a suggestion out there. How about creating a weekly tips section in which everyone could share useful insight about different tehnologies/OS/languages? Or even create topics in which people could share such things?

What's your devTune?

What music do you listen to that makes what you make?

I'm Drum n' Bass

Ever wanted to have undefined behavior in Python? Do this in Python 2 (yes this was supposed to be a fibonacci number calculator with a limit but one of my classmates forgot the conversion just as seen below):
#Begin
def fib(n):
a,b=0,1
while a<n:
print a
a,b=b,a+b

fib(raw_input)
#End

Programmer's proposal:
(CLI:)

Will you marry me?[Y/n]

#include<stdio.h>
int main()
{
printf("True. True. Every. Single. Fucking. Time.\n");
return 0;
}

n@2.1.8:
wanted {"os":"!win32","arch":"any"}
(current: {"os":"win32","arch":"x64"})

Fuck me and windows I guess....

I think you guys n girls will enjoy this (found on twitter)

Time required to fix a simple CSS issue:

- Under normal cirumstance: 2 minutes
- When webpack goes all awry: n + 2 minutes!

TIL 'echo -n' is a thing.
Time to replace all those unnecessary printf's

Hexdump oneliner

php -r 'for(;$r=fread(STDIN,16);)printf("%08x %s $r\n",$i++*16,join(unpack("h*",$r)));'

Working with surds recently, and found some cool new identities that I don't think were known before now.

if n = x*y, and z = n.sqrt(), assuming n is known but x and y are not..

q = (surd(n, (1/(1/((n+z)-1))))*(n**2))
r = (surd(n, (surd(n, x)-surd(n, y)))*surd(n, n))

s = abs(surd(abs((surd(n, q)-q)), n)/(surd(n, q)-q))
t = (abs(surd(abs((surd(n, q)-q)), n)/(surd(n, q)-q)) - abs(surd(n, abs(surd(n, q)+r)))+1)

(surd(n, (1/(1/((n+z)-1))))*(n**2)) ~=
(surd(n, (surd(n, x)-surd(n, y)))*surd(n, n))

for every n I checked.

likewise.

s/t == r.sqrt() / q.sqrt()

and

(surd(n, q) - surd(s, q)) ==
(surd(n, t) - surd(s, t))

Even without knowing x, y, r, or t.

Not sure if its useful, but its cool.

surd() is just..

surd(j, k ) = return (j+k.sqrt())*(j-k.sqrt())

and d() is just the python decimal module for ease of use.

$n = 2 * $n + 1; /* I can't even */

Today is Independence Day here in Brazil. Holiday n the middle of the week. I swear to not touch a computer today :P

Found a clever little algorithm for computing the product of all primes between n-m without recomputing them.

We'll start with the product of all primes up to some n.

so [2, 2*3, 2*3*5, 2*3*5*,7..] etc

prods = []
i = 0
total = 1
while i < 100:
....total = total*primes[i]
....prods.append(total)
....i = i + 1

Terrible variable names, can't be arsed at the moment.
The result is a list with the values

2, 6, 30, 210, 2310, 30030, etc.

Now assume you have two factors,with indexes i, and j, where j>i

You can calculate the gap between the two corresponding primes easily.
A gap is defined at the product of all primes that fall between the prime indexes i and j.

To calculate the gap between any two primes, merely look up their index, and then do..
prods[j-1]/prods[i]

That is the product of all primes between the J'th prime and the I'th prime

To get the product of all primes *under* i, you can simply look it up like so:

prods[i-1]

Incidentally, finding a number n that is equivalent to (prods[j+i]/prods[j-i]) for any *possible* value of j and i (regardless of whether you precomputed n from the list generator for prods, or simply iterated n=n+1 fashion), is equivalent to finding an algorithm for generating all prime numbers under n.

Hypothetically you could pick a number N out of a hat, thats a thousand digits long, and it happens to be the product of all primes underneath it.

You could then start generating primes by doing
i = 3
while i < N:
....if (N/k)%1 == 0:
........factors.append(N/k)
....i=i+1

The only caveat is that there should be more false solutions as real ones. In otherwords theres no telling if you found a solution N corresponding to some value of (prods[j+i]/prods[j-i]) without testing the primality of *all* values of k under N.

Pythons tkinter library has a module called "N". Just N. That's it.
So whenever you type "N" and want to autocomplete some local variable or class name, the IDE will instead import that module!
Who the fuck thought N would be a good name??? Some people have some serious issues...

n-

N A N I ? ? ? ? ?

my dad just upgraded our phone plan from like 100 miles away out of nowhere.

turns out with some weird discount it's only $20 more for unlimited than our old holdover-from-2012 plan of "8GB pool for all lines, but the last 4GB is 3G speeds"

shit

time to start theorycrafting a way to get around the "one device streaming at a time" limit

I have to create python parser (3.6) using code provided by client (2.7), that they used in their company, and it is full of crap like:

if a==1:
if not b:
c = [1,2,3]
if a==2:
if not b:
c = [1,2,3]
if b:
c = [1,2,4]

Or:

text = ""
for i in something:
text += "real text " + some_string + " \n"
text += "another line " + some_string + " \n"
text += "and another " + some_string + " \n"
text += "and so on " + some_string + " \n"
... (many lines instead of one appended text block)

Of course above variable names are just for shortening code, but there are variables like oo, ooo, var_ or var__... cause you know, PEP8 does not exist.

There is a mAtHeMaTicAl pRoOf 🤡 that a comparison-based sorting algorithm cannot get more efficient than O(n*log n). That's bullshit. Radix sort et al. — granted, they're not comparison-based.

But there is one comparison-based algorithm that can sort an array in O(n). It's called Stalin sort.

It traverses the array and deletes every item that doesn't appear in order. Boom, problem solved — the array is sorted in O(n), at the expense of losing (most of the) elements.

This is the perfect metaphor of Stalin's politics.

// Task: add one to the input number

// Sane people:
// print(int(input())+1)

// Me:

n = [*(reversed(bin(int(input()))[2:]))]

tmp = ""
for i in range(len(n)):
tmp = n[i]
tmp = "1" if tmp == "0" else "0"
n[i] = tmp
if tmp == "1":break

if tmp == "0":n+=["1"]
n = "".join(reversed(n))

n = int(n,2)
print(n)

Cleaning up after yourself if so damn important. Even your git repos:

# always be pruning
git fetch -p

# delete your merged branches
git branch --merged | grep -v master | xargs -n 1 git branch -d

# purge remote branches that are merged
git branch -r --merged | grep -v master | sed 's/origin\///' | xargs -n 1 git push --delete origin

Rooting. Y or N?

Just took Google up on their beta-testing offer for Android N.

Instant regret.

Best place to backup all of your old and new projects n codes?

When you figured out the algorithm, but it's O(n^n)

When asked for an estimate, "I'll take N days."

N-1 days later, when asked for a status update, "We encountered a few issues. It'll take N more days."

Had to write a simple shell program w/ job control for my Comp Sci class. I'd just like to say, on behalf of the ~300 students...
cout << "Screw\n"
<< "job\n"
<< "control\n";

Sorry but Strassen was a buttplug and his matrix equations are pain in the ass :/

Question - is this meaningful or is this retarded?

if

2*3 = 6
2*2 = 4
2*1 = 2
2*0 = 0
2*-1 = -2

then why doesnt this work?

6/3 = 2
6/2 = 3
6/1 = 6
6/0 = 0
6/-1 = -6

if n/0 is forbidden and 1/n returns the inverse of n, why shouldn't zero be its own inverse?

If we're talking "0" as in an infinitely precise definition of zero, then 1/n (where n is arbitrarily close to 0), then the result is an arbitrarily large answer, close to infinite, because any floating point number beneath zero (like an infinitely precise approximation of zero) when inverted, produces a number equal to or greater than 1.

If the multiplicative identity, 1, covers the entire set of integers, then why shouldn't division by zero be the inverse of the multiplicative identity, excluding the entire set? It ONLY returns 0, while anything n*1 ONLY returns n.
This puts even the multiplicative identity in the set covered by its inverse.

Ergo, division by zero produces either 0 or infinity. When theres an infinity in an formula, it sometimes indicates theres been
some misunderstanding or the system isn't fully understood. The simpler approach here would be to say therefore the answer is
not infinity, but zero. Now 'simpler' doesn't always mean "correct", only more elegant.

But if we represent the result of a division as BOTH an integer and mantissa
component, e.x

1.234567 or 0.1234567,

i.e. a float, we can say the integer component is the quotient, and the mantissa
is the remainder.

Logically it makes sense then that division by zero is equivalent to taking the numerator, and leaving it "undistributed".
I.e. shunting it to the remainder, and leaving the quotient as zero.

If we treat this as equivalent of an inversion, we can effectively represent the quotient from denominators of n/0 as 1/n

Meaning even 1/0 has a representation, it just happens to be 0.000...

Therefore

(n * (n/0)) = 1

the multiplicative identity

because

(n* (n/0)) == (n * ( 1/n ))

People who math. Is this a yea or nay in your book?

Do you all look for code complexity O(n) while coding? Or you make sure that your code runs and never look back what's happening ?

Because as per code review no one looks for code complexity and that's so sad

I love pipes in R. Really wish more mainstream languages would adopt that *looking at you python, nodejs-tc39, rust, cpp*

Just something about doing

data %>% group_by(age) %>% summarize ( count= n() ) %>% print

As oppose to

print(summarize (group_by(data, age), count=n()) )

WHY ARE SOME MFS ARE SO FU****N RUDE IN DEVRANT?

M!@@N friday nailed it

I N F I N I T E P O W E R

Wish the variable naming algorithm in my mind would run in less than O(n⁷⁹) time

If you want a really obtuse method for inverting numbers in python, here you go:

z0 = Decimal('78.56341431805592768684300246940000494686645802145994376216014333')

z1 = Decimal('1766612.615660056866253324637112675800498420645531491441947721134')

z2 = Decimal('1766891.018224248707391295083927186110075710886547799081463050088')

z3 = Decimal('15658548.51274600264911287951105338985790517559073271799766738859')

z4 = Decimal('1230189034.426242656418217548674280136397763003160663651728899428')

z5 = Decimal('1.000157591178577552497828947885508869785153918881552213564806501')

((((z0/(z1/(z2/(n)))))*(z3))/z4)/z5

From what I can see, it works for any value of n.

I have no clue why it works.

Also have a function to generate the z values for any n input.

Shitpost studios.

Bringing you QUALITY math posts since 2019!

"we shitpost because we care."

comment your favorite tv shows for em coders n hackers here!
ill start:
mr robot, it crowd and silicon valley

Somehow they felt like the first day of a month isn't always n°1 (and last day might be smaller than 10)

When the client wants to add the n feature to the app and the colour is green

Today is the last day I'll be n years old. Tomorrow I'll be n++ years old. Genuine thought I just had. #toomuchwork

Unity just mailed me:
H E Y U W A N T S U M U N I T E V I D E O S ?
I should really unsubscribe from the mailing list.

What kind of music do you listen to while coding? I like country.

(fn [n]
(loop [cnt 2 out [1 1]]
(if (>= cnt n)
out
(recur (inc cnt) (conj out (+ (first (reverse out)) (second (reverse out)))))
)
)
)

Clojure and Lisp have something of so beautiful... I don't know what it is, but is magical.

printf("Happy new year !\n");

When we subtract some number m from another number n, we are essentially creating a relationship between n and m such that whatever the difference is, can be treated as a 'local identity' (relative value of '1') for n, and the base then becomes '(base n/(n-m))%1' (the floating point component).

for example, take any number, say 512
697/(697-512)
3.7675675675675677

here, 697 is a partial multiple of our new value of '1' whose actual value is the difference (697-512) 185 in base 10. proper multiples on this example number line, based on natural numbers, would be
185*1,
185*2
185*3, etc

The translation factor between these number lines becomes

0.7675675675675677

multiplying any base 10 number by this, puts it on the 1:185 integer line.

Once on a number line other than 1:10, you must multiply by the multiplicative identity of the new number line (185 in the case of 1:185), to get integers on the 1:10 integer line back out.

185*0.7675675675675677 for example gives us

185*0.7675675675675677
142.000000000000

This value, pulled from our example, would be 'zero' on the line.

185 becomes the 'multiplicative' identity of the 1:185 line. And 142 becomes the additive identity.

Incidentally the proof of this is trivial to see just by example. if 185 is the multiplicative identity of 697-512, and and 142 is the additive identity of number line 1:185

then any number '1', or k=some integer, (185*(k+0.7675675675675677))%185
should equal 142.

because on the 1:10 number line, any number n%1 == 0

We can start to think of the difference of any two integers n, as the multiplicative identity of a new number line, and the floating point component of quotient of any number n to the difference of any number n-m, as the additive identity.

let n =697
let m = 185
n-m == '1' (for the 1:185 line)

(n-m) * ((n/(n-m))%1) == '0'

As we can see just like on the integer number line, n%1 == 0
or in the case of 1:185, it equals 142, our additive identity.

And now, the purpose of this long convoluted post: all so I could bait people into reading a rant on division by zero.

Every time I see the N+1 query problem in people's implementation, I feel like crying. Especially when it's dealing with large data sets of something like 1000 records.

Please support android N devices😭🙏.
App opened in seventh try after clearing cache.

I spent hours trying to support \n, \r and \r\n in my algorithms to convert between utf16 line/col and utf8 absolute indices to comply with the LSP, before realizing that

- Orchid itself doesn't support \r
- There is no established user base

so I'm in the best position to reject all files that contain \r and offer to convert them instead.

V a c a t i o n s should be next questions. Like where people are or went.

Somebody just hacked the system everybody...

if(num==NULL)
{
printf("Error 404!\n");
exit(1);
}

When a data scientist thinks that if his algorithm is o(n) then it's really o(n) and it doesn't matter that he placed synchronized everywhere , connected to the db multiple time with huge in memory ops inside the transaction , wrote a file and downloaded something with http client . After all it's o(n) right mister I'm a scientist genius ?!?!?

Maybe I'm severely misunderstanding set theory. Hear me out though.

Let f equal the set of all fibonacci numbers, and p equal the set of all primes.

If the density of primes is a function of the number of *multiples* of all primes under n,
then the *number of primes* or density should shrink as n increases, at an ever increasing rate
greater than the density of the number of fibonacci numbers below n.

That means as n grows, the relative density of f to p should grow as well.
At sufficiently large n, the density of p is zero (prime number theorem), not just absolutely, but relative to f as well. The density of f is therefore an upper limit of the density of p.

And the density of p given some sufficiently large n, is therefore also a lower limit on the density of f.

And that therefore the density of p must also be the upper limit on the density of the subset of primes that are Fibonacci numbers.

WHICH MEANS at sufficiently large values of n, there are either NO Fibonacci primes (the functions diverge), and therefore the set of Fibonacci primes is *finite*, OR the density of primes given n in the prime number theorem
*never* truly reaches zero, meaning the primes are in fact infinite.

Proving the Fibonacci primes are infinite, therefore would prove that the prime number line ends (fat chance). While proving the primes are infinite, proves the Fibonacci primes are finite in quantity.

And because the number of primes has been proven time and again to be infinite, as far back as 300BC,the Fibonacci primes MUST be finite.

QED.

If I've made a mistake, I'd like to know.

My friend sent me this as WYSIWYG

/* A simple quine (self-printing program), in standard C. */ /* Note: in designing this quine, we have tried to make the code clear * and readable, not concise and obscure as many quines are, so that * the general principle can be made clear at the expense of length. * In a nutshell: use the same data structure (called "progdata" * below) to output the program code (which it represents) and its own * textual representation. */ #include <stdio.h> void quote(const char *s) /* This function takes a character string s and prints the * textual representation of s as it might appear formatted * in C code. */ { int i; printf(" \""); for (i=0; s[i]; ++i) { /* Certain characters are quoted. */ if (s[i] == '\\') printf("\\\\"); else if (s[i] == '"') printf("\\\""); else if (s[i] == '\n') printf("\\n"); /* Others are just printed as such. */ else printf("%c", s[i]); /* Also insert occasional line breaks. */ if (i % 48 == 47) printf("\"\n \""); } printf("\""); } /* What follows is a string representation of the program code, * from beginning to end (formatted as per the quote() function * above), except that the string _itself_ is coded as two * consecutive '@' characters. */ const char progdata[] = "/* A simple quine (self-printing program), in st" "andard C. */\n\n/* Note: in designing this quine, " "we have tried to make the code clear\n * and read" "able, not concise and obscure as many quines are" ", so that\n * the general principle can be made c" "lear at the expense of length.\n * In a nutshell:" " use the same data structure (called \"progdata\"\n" " * below) to output the program code (which it r" "epresents) and its own\n * textual representation" ". */\n\n#include <stdio.h>\n\nvoid quote(const char " "*s)\n /* This function takes a character stri" "ng s and prints the\n * textual representati" "on of s as it might appear formatted\n * in " "C code. */\n{\n int i;\n\n printf(\" \\\"\");\n " " for (i=0; s[i]; ++i) {\n /* Certain cha" "racters are quoted. */\n if (s[i] == '\\\\')" "\n printf(\"\\\\\\\\\");\n else if (s[" "i] == '\"')\n printf(\"\\\\\\\"\");\n e" "lse if (s[i] == '\\n')\n printf(\"\\\\n\");" "\n /* Others are just printed as such. */\n" " else\n printf(\"%c\", s[i]);\n " " /* Also insert occasional line breaks. */\n " " if (i % 48 == 47)\n printf(\"\\\"\\" "n \\\"\");\n }\n printf(\"\\\"\");\n}\n\n/* What fo" "llows is a string representation of the program " "code,\n * from beginning to end (formatted as per" " the quote() function\n * above), except that the" " string _itself_ is coded as two\n * consecutive " "'@' characters. */\nconst char progdata[] =\n@@;\n\n" "int main(void)\n /* The program itself... */\n" "{\n int i;\n\n /* Print the program code, cha" "racter by character. */\n for (i=0; progdata[i" "]; ++i) {\n if (progdata[i] == '@' && prog" "data[i+1] == '@')\n /* We encounter tw" "o '@' signs, so we must print the quoted\n " " * form of the program code. */\n {\n " " quote(progdata); /* Quote all. */\n" " i++; /* Skip second '" "@'. */\n } else\n printf(\"%c\", p" "rogdata[i]); /* Print character. */\n }\n r" "eturn 0;\n}\n"; int main(void) /* The program itself... */ { int i; /* Print the program code, character by character. */ for (i=0; progdata[i]; ++i) { if (progdata[i] == '@' && progdata[i+1] == '@') /* We encounter two '@' signs, so we must print the quoted * form of the program code. */ { quote(progdata); /* Quote all. */ i++; /* Skip second '@'. */ } else printf("%c", progdata[i]); /* Print character. */ } return 0; }

This only makes sense in computer science ❤️:

val n = k / 4 * 4

Yeeah it's official, the N key in my HP keyboard just fucked up

What the solution?
Ok I'll use all the #Widgets that has no N in it's definition in my code

Just fuck that sit.

.. I.. need advice n help..
So, you see.. I want to change my life.. Where should I start?.

Fuck those clients that send you support request emails without a single fucking . or , or /n in it!

I run faster than all of you, nearly O(nlog n)

so now that ai and all that machine learning can differentiate between images n stuff, what could be the new captcha‽ 🤔

Do drugs n weeds help in becoming awesome at coding and especially hacker? ...

Asking for a friend.

I just submitted my professional goals this year.

As I was writing them a lot of them actually sound like things my manager should be doing to increase code quality n agility n reduce the # bugs that end up in prod...

The difficulty of learning the nth language is half the difficulty of the (n-1)th.

Who of you needs some non-disturbing background music while coding?

echo "g(i,x,t,o){return((3&x&(i*((3&i>>16?\"BY}6YB6%\":\"Qj}6jQ6%\")[t%8]+51)>>o))<<4);};main(i,n,s){for(i=0;;i++)putchar(g(i,1,n=i>>14,12)+g(i,s=i>>17,n^i>>13,10)+g(i,s/3,n+((i>>11)%3),10)+g(i,s/5,8+n-((i>>10)%3),9));}"|gcc -xc -&&./a.out|aplay

A while ago I found this in a Youtube-Video from computerphile.
I always listen to it or some variations if I need to stay focused.
Works for me.

Git branch, git commit * n, git merge. Not really that hard...

Just learned about the Linux watch command today. `watch -n 1 ls -l` OMG, where have you been all my life?

Number of people who talk about CP: O(n!)
Number of people who actually do CP: O(n)

Relationships in the 20th century: 1:N
Relationships in the 21th century: N:1

Android N update on galaxy devices is great...

Until 2min ago when my screen turned to fractals...

So I have a problem and I was hoping for some insight.

I figured out how to get
(surd(n, x)-surd(n, y))

without knowing x or y, (only n), through a convergent series of approximate identities.
n is the product of x and y, where x<y

My only issue is I don't know where to go from here. I've basically hit the limit of my insight into the problem.

surd() here is just a function that returns the results of two arguments, a, b, such that (a^2)-b.
Both are guaranteed to be positive integers, greater than 1.

But, having come this far, with a couple pages of intermediate identities, I'm at a loss.

Dev boy to Dev girl: "What's the time complexity on you loving me, baby?"

Dev girl: while(iExist){
Int n = Random.Next(1, 100);
for(int i =1; i < n^4; i++){
Console.Write("..."); } }

Dev boy: Assert.Fail();

I work with JS n php. Always confused with . n +

I don’t know if someone is following me. Well at least if you’re drunk and behave common you can expect the same treatment no matter what country you’re about to stop by. I hope if we start be polite the same way across the continent we can get the same understanding of our problems. Peace ✌🏽and love ❤️

My Friday Developer Jam:

Push it by Salt-N-Pepa

Need help. Explain why assembly code is wrong.
C code:
long f(long n) {return n + 1} ;

Assembly:
f:
movq rdi, rbp
addq $1, rbp
movq rbp, rax
ret

same_as_me = raw_input('Who else is new here on devRant?\n> ')

When adding line breaks to a string that get injected into a html view I always use \r\n instead of just \n. Cus I know one day some smart motherfucker will download one of my webpages with a console app and log out the html to the console to make sure it worked. And when that day comes.. I will have won.

I loved Lubutu...n like to use it until n unless it's brightness f*cked up my eyes 😐

Who all are working on Christmas n new year day??

For fuck"s sake I hope some devs will have offs

Xamarin
amarin
marin
arin
rin
in
n

Forget C# and learn XAML to use this shit.

When I said: "version numbers are cheap", I did not expect you to append new digits and identifiers to the existing versioning scheme.

Oh god, here comes another math post! I can feel it coming on, like werewolfism during the full moon.

I'm only passingly familiar with logarithms, so this, like everything I've stumbled on, has probably already been discovered, but

n/(1/((n^(1/n))-1))

Is a pretty good approximation (within a couple percentage points, or three or more digits) of the natural logarithm for all the numbers I've checked it on.

For example if

n = 690841693

ln(n) = 20.35342125707679

while our estimate using the above formula comes out to:

n/(1/((n**(1/n))-1)) = 20.353421612948146

Am I missing something obvious here, and if so, what?

Am I doing the idiot savant thing again, or am I just being an idiot again?