Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
![](/static/devrant/img/pipeless-devrant-banner-white.png)
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
Search - "n"
-
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 :P17 -
How my C programs may as well be written:
#include<stdio.h>
int main() {
printf("Segmentation fault\n");
return 0;
}6 -
Was going through some old gadgets n found this fossil.
Give me the fucken code Blackberry and I'll catch it for you.4 -
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 E13 -
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.2 -
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.3 -
I18n is short for internationalization because there is 18 letters between I and the last n. I love the laziness of developers.7
-
in python script; a for loop inside a recursive function to slow down stdout. i don't know time.sleep(n) back then4
-
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 luck12 -
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>8 -
Why is it formatted like this? Cant they just do a \n on a capital Letter? This looks so terrible😢9
-
"Do you want to terminate the batch task? (Y/N)"
"N"
*it terminates*
@angular/cli are you maybe a girl?7 -
Getting the nth character of a string.
Every other language:
string[n]
Swift:
string[index(string.startIndex, offsetBy: n)]8 -
Woke up 2hours before wife n daughter usually awake so I can code!.....daughter wakes up 10mins later 😑7
-
$ sudo apt-get remove UK
...
After this operation, 1 GB will be lost.
Do you want to continue? [Y/n]6 -
Always remember: Every time you write a for loop like that: for (int i = 1; i <= n; i++) a cat dies!5
-
I-I totally did n-not spend half an hour on this...
(here's a gist for you: https://gist.github.com/moriczgergo...)5 -
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)12 -
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 elements16 -
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");
}19 -
*** 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?50 -
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.4 -
$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...19 -
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.2 -
$ crontab -r monthly.irl
The following extra packages will be installed:
pregnancy lib-life lib-fuckyou
Do you wanna continue? [y/n]7 -
Kids upset about their phones not getting android N. Back in our days we where upset about losing our crayons.1
-
Found this gem yesterday...
function justNumber(BigDecimal n) {
string negative_sign = "-";
BigDecimal response = BigDecimal.valueOf(n.toString().replace(negative_sign, ""));
return response;
}11 -
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.2 -
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.11 -
*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.1 -
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)7 -
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.13 -
@echo off
color a
echo Hacking...
ping localhost -n 5 >nul
color c
echo Failed, aborting...
ping localhost -n 3 >nul
pause4 -
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 :D12 -
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.11 -
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?6 -
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 -
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 language2 -
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.o1 -
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 them1 -
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...3 -
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!6 -
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 ...9 -
\n and \n\r
What a fuckton of issues those two characters brought me today while attempting to verify a signed file.10 -
Le Mail: bla bla \n \n Sent from ...
Le me: I DONT DUCKING CARE!
WHO fucking thought that anyone‘d care ?rant sent from heaven sent from fucking bad weather sent from huawaifuckingfuck sent from windows 10 device sent from germany sent from iphone15 -
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 :)1
-
Boss: Why are you trying to build the old program?
Me: Because I need to determine behavior of why old program works with data that new program does not.
Boss: Does it affect the output?
Me: No, but...
Boss: STOP! Just filter it.
Me: Okay.
Boss: Go write new fun code, not work on old shit.
Me: Thank you for saving me from myself.
In reference to:
https://devrant.com/rants/4666401/...2 -
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 up6
-
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!3 -
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);4 -
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.21 -
@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?2
-
n@2.1.8:
wanted {"os":"!win32","arch":"any"}
(current: {"os":"win32","arch":"x64"})
Fuck me and windows I guess....3 -
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)
#End3 -
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.13 -
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.13 -
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...9 -
Hexdump oneliner
php -r 'for(;$r=fread(STDIN,16);)printf("%08x %s $r\n",$i++*16,join(unpack("h*",$r)));'7 -
Time required to fix a simple CSS issue:
- Under normal cirumstance: 2 minutes
- When webpack goes all awry: n + 2 minutes!2 -
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.4 -
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.7 -
// 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)7 -
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" limit2 -
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?25 -
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"; -
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." -
Today is the last day I'll be n years old. Tomorrow I'll be n++ years old. Genuine thought I just had. #toomuchwork2
-
comment your favorite tv shows for em coders n hackers here!
ill start:
mr robot, it crowd and silicon valley7 -
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 sad11 -
Somehow they felt like the first day of a month isn't always n°1 (and last day might be smaller than 10)8
-
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."21 -
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()) )18 -
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 -
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.11 -
(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.1 -
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.10 -
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.5 -
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; }6 -
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.30 -
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 ?!?!?1
-
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.2
-
I've been away a while, mostly working 60-70 hour weeks.
Found a managers job and the illusion of low-level stability.
Also been exploring elliptic curve cryptography and other fun stuff, like this fun equation...
i = log(n, 2**0.5)
base = (((int((n/(n*(1-(n/((((abs(int(n+(n/(1/((n/(n-i))+(i+1)))))+i)-(i*2))/1))/1/i)))))*i)-i)+i))
...as it relates to A143975 a(n) = floor(n*(n+3)/3)
Most semiprimes n=pq, where p<q, appear to have values k in the sequence, where k is such that n+m mod k equals either p||q or a multiple thereof.
Tested successfully up to 49 bits and counting. Mostly haven't gone further because of work.
Theres a little more math involved, and I've (probably incorrectly) explained the last bit but the gist is the factorization doesn't turn up anything, *however* trial lookups on the sequence and then finding a related mod yields k instead, which can be used to trivially find p and q.
It has some relations to calculating on an elliptic curve but thats mostly over my head, and would probably bore people to sleep.2 -
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.2 -
Fuck those clients that send you support request emails without a single fucking . or , or /n in it!2
-
Do drugs n weeds help in becoming awesome at coding and especially hacker? ...
Asking for a friend.17 -
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.7 -
Just learned about the Linux watch command today. `watch -n 1 ls -l` OMG, where have you been all my life?3
-
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... -
After a lot of work, the new factorization algorithm has a search space thats the factorial of (log(log(n))**2) from what it looks like.
But thats outerloop type stuff. Subgraph search (inner loop) doesn't appear to need to do any factor testing above about 97, so its all trivial factors for sequence analysis, but I haven't explored the parameter space for improvements.
It converts finding the factors of a semiprime into a sequence search on a modulus related to
OIS sequence A143975 a(n) = floor(n*(n+3)/3)
and returns a number m such that n=pq, m%p == 0||(p*i), but m%q != 0||(q*k)
where i and k are respective multiples of p and q.
This is similar in principal to earlier work where I discovered that if i = p/2, where n=p*q then
r = (abs(((((n)-(9**i)-9)+1))-((((9**i)-(n)-9)-2)))-n+1+1)
yielding a new number r that shared p as a factor with n, but is coprime with n for q, meaning you now had a third number that you could use, sharing only one non-trivial factor with n, that you could use to triangulate or suss out the factors of n.
The problem with that variation on modular exponentiation, as @hitko discovered,
was that if q was greater than about 3^p, the abs in the formula messes the whole thing up. He wrote an improvement but I didn't undertsand his code enough to use it at the time. The other thing was that you had to know p/2 beforehand to find r and I never did find a way to get at r without p/2
This doesn't have that problem, though I won't play stupid and pretend not to know that a search space of (log(log(n))**2)! isn't an enormous improvement over state of the art,
unless I'm misunderstanding.
I haven't posted the full details here, or sequence generation code, but when I'm more confident in what my eyes are seeing, and I've tested thoroughly to understand what I'm looking at, I'll post some code.
hitko's post I mentioned earlier is in this thread here:
https://devrant.com/rants/5632235/...2 -
so now that ai and all that machine learning can differentiate between images n stuff, what could be the new captcha‽ 🤔5
-
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
ret6 -
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 ❤️1
-
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(); -
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.4 -
Android N update on galaxy devices is great...
Until 2min ago when my screen turned to fractals...4 -
I recently learnt Photoshop n Illustrator, so I thought I could make some engaging content for kids(given my CS background, basically coding books), I mailed my professor n asked If he could help me to design coding curriculum for kids so that I could publish books and we both would earn out of it :D2
-
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.1
-
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?10 -
mess around inside bootstrap.css project at work, make a push, sit back with my popcorn n watch the world burn2
-
"f(n) is O(g(n)) if c and n0 f(n) <= cg(n) for all n > n0".
I have a couple of questions related to this equation.
1: why we use this equation?
2: which thing cg(n) is represented for?
3: what is the real-life example of this?10 -
When you have a task in javascript and it should use quadratic space and its use only linear space...
... easy workaround for double arrays that rise
so when n goes up
n×n array rise with 'false' within the fields? So i use quadratic space -
When I said: "version numbers are cheap", I did not expect you to append new digits and identifiers to the existing versioning scheme.
-
(a=>a.bind(0,a))((f,n,s,a)=>a?a[0]?s:f.bind(0,f,0,(s?s:"")+String.fromCharCode(n)):f.bind(0,f,n+1,s))()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()```'`7
-
I love JS. And then this things happen... I want to learn TypeScript so much (not really related as I don't know if it avoids this).
Btw, I ended up finding ++n works too, so in the end it was 'Question '+ ++n;7 -
I am a pentester.
'I am a pentester.
'Iam a pentester/n/r"
'"Iamapentester\/n\/r-- '"''
'"'/>alert(1):</script>
%68%65%6c%6c%6f1 -
Devrant help me out.
(n/x)*(y/x)
You know x, and you know n, and you know z where ((y/x)*x)*((x/y)*x) = z
Solve for y.
If you do it, I'll consider giving you a billion dollars (of course the payment schedule will be an asymptote).31 -
To the experienced coders here on devrant: Any valuable tip(s) for newbie programmers (independent of language)?
My suggestion: Enable 'format on save' in your IDE. Seriously, how did I survive without this?!5 -
Reverse number(logic)
------
First Approach :=
void reverseMethod(int n)
{
String str="";
int temp=0;
while(n>0)
{
temp=n%10;
n=n/10;
str=str+""+temp;
}
System.out.println(str);
}
-----
Second Approach :=
void reverseMethod(int n)
{
int temp=0;
int rev=0;
while(n>0)
{
temp=n%10;
n=n/10;
rev=rev*10+temp;
}
System.out.println(rev);
}
-----
why the fuck second one is recommended??
In first, at least we do not required to remember that formula.9 -
I think I'm overthinking this sigh
But its bothering me a lot so pls help, the two paragraphs I've marked, are they both saying the same thing in different ways?
I don't understand them saying there will be a f(n), when runtime is O(n²), upper bounding the runtime and on the other hand saying for runtime Ω(g(n)), g(n) directly lower bounds the runtime.
(The book is CLRS btw)7 -
(!rant || git)
Non-techy friend (n): you know what cherry pick is?
Me: cherries?
N: you dont know that?
Me: well, i love cherries...
N: i am disappointed of you.
Me: what the f...ing hell is that?
N: you know the git thingy you are always doing...
Me: i have never heard of that...
N: well use it every time before and after you commit.
Me : (not believing, but kinda believing) ok.
A few days later...
Me: nnooooooooooooo.!
Messed up 3 hrs of work
-------------------
What really is cherry pick guys?10 -
Me every time I get an email from recruiters:
void GetQuestionsToAsk(string taboo)
{
return "* Do I have to work with " + taboo + "?\n" +
"* Does anyone in the team write any " + taboo + "?\n" +
"* Is the word " + taboo + " even in the job specs?\n";
}
Call this function with "VBA", "SQL" and "Excel" and I'm good to go (matter of perspective if you want to proceed if the answer is positive ;) ).4 -
Why the hell doesn't Go have generics?? You have to teach Go how to access elements of a list n times if you have n things that need to be sorted!1
-
System
n.
What devs call what they are working on, when they don't really know what they are working on. -
What an evening..watched the Game of Thrones season finale..n then watched Italy defeat Spain in the Euros!!!
-
My regex foo has gotten really weak. It took me unholy number of attempts to get ^\n{1,}$ right 😞.1
-
the problem with product based company is the business/sales people, when they are not clear about their own product, the amount of re-work comes to n^n!
-
Ok so I got namespace N.
And namespaces N\a and N\b.
I would like N\a\foo() to call N\b\bar().
But no matter what I do it says \N\b\bar() does not exist. What am I doing wrong??
I've tried including, using, requiring but nothing.8 -
public class praise() {
System.out.println("I'm new here and I love it now" + "/n" + "This is a really Good idea for Devs" + "/n" +
"Sorry for my broke Englisch") ;
thumbs +=1;
}1 -
just went through 2 recruitment process n realised no matter how good u are…freshers are just treated as equal abstract trash1
-
1. O(n)
2. Container queries
3. Supercomputer with a bunch of GPUs/TPUs running for free (solar, wind power)
Genuinely thanks! -
After whitehat jr.
Indian parents be like :
“Sharmaji ka beta O(n) me solve kiyah , tuh O(n2) mai kyun?“12 -
I love Github copilot, he saves so much time, speeds up the code writing. N understands me at times too.4
-
#include <stdio.h>
/*
* Windows Update Algorithm
*/
int main()
{
int percent = 1;
while (percent <= 100) {
printf("Working on updates\n");
printf("%i %% complete\n", percent);
printf("Don't turn off your computer\n\n");
if (percent == 30) {
printf("Restarting\n");
break;
}
percent++;
}
return 0;
} -
Mark my name well. Laban oyusu. You're kids n family will read about me when im done with school.😏4
-
is this what they call an identity?
log(n, n**(1/n)) == n
first argument in log is the value
second argument is the base10 -
I was all hyped up coz I WHINED AND BITCHED FOR MONTHS against a 5-6y old B2B company offering, that it's shit n needs to be remade
And they agreed, n only 2 people assigned to it yet, the last chief architect and me
But last guy is old n is the one who made it shit in the first place (we use Windows Tasks in a Windows Server, triggering once every minute to pretend background tasks)
n he doesnt even want 2 branches (: And is still making the same mistakes that made the last implementation shit n it's hard to stop him coz he senior and old
And now I kinda dont care, but have to coz job market's shit
Ffs4 -
Behold, the code submitted by user Hecker:
(Quote) > writing html like a pro:
from typing import List
class MissmatchedRowsAndCols(Exception):
pass
class HtmlTableBuilder:
classes: List[str] = []
identifier: str = ""
rows: List[str] = []
cols: List[list] = []
def add_row(self, name: str):
self.rows.append(name)
return self
def add_col(self, fields: list):
if len(self.rows) != len(fields):
raise MissmatchedRowsAndCols(
"The given fields are not matched 1:1 with the rows.")
self.cols.append(fields)
return self
def build(self, indent: int = 4) -> str:
html = "<table border=\"2px\""
if len(self.identifier) > 0:
html += ' id="' + self.identifier + '"'
if len(self.classes) > 0:
html += ' class"' + (" ".join(self.classes)) + '"'
html += ">\n"
html += (" "*indent) + "<thead>\n"
for row in self.rows:
html += (" "*(indent*2)) + "<th>" + row + "</th>\n"
html += (" "*indent) + "</thead>\n"
html += (" "*indent) + "<tbody>\n"
for col in self.cols:
html += (" "*(indent*2)) + "<tr>\n"
for field in col:
html += (" "*(indent*3)) + "<td>\n"
html += (" "*(indent*4)) + str(field) + "\n"
html += (" "*(indent*3)) + "</td>\n"
html += (" "*(indent*2)) + "</tr>\n"
html += (" "*indent) + "</tbody>\n"
html += "</table>"
return html
builder = HtmlTableBuilder()
builder.add_row("index").add_row("language")
builder.add_col([0, "Python"]).add_col([1, "Kotlin"])
print(builder.build())6 -
function normalize() {
console.log(this.coords.map(n => n / this.length));
}
normalize.call({coords: [0, 2, 3], length: 5});
Why? Why, javascript? Why do you invert the function and the 'this' keyword? It just confuses me and (at this time) I cannot think of a place where this would be really necessary.3 -
F this code, definitely going to rewrite it.....cba, copy n paste from the last homepage n re-jigging again :-/
-
American clients spent good 4-5 hrs in night to deploy n start application. Late at night in US n UK morning then called us for help after 5 minutes looking at logs I said: "it would help if you have DB servers on as logs were saying clearly". What a knobs !!!
-
!rant
Question: I am working on learning MVC/MVP/MVVM/MVPVM and I have read a bunch of articles and done some tutorials but I need some help relating it to n-tier (I think that's what they're called) systems.
I have worked on and I am used to the Presentation (ui) layer > BAL > DAL > DB pattern. How does MVC (and others) relate to the different tiers in a tiered system? I have read that model == DAL, controller == BAL, and view == presentation layer, but I have also read that MVC is meant to extract the presentation layer and that business logic and data logic should be used elsewhere. Can I get some clarity?2 -
Mood:
echo do I care? >> seeifIcare.txt | echo currentResponse : no >> seeifIcare.txt | grep-n currentResponse seeifIcare.txt
Output:
2:currentResponse : no -
ARCHIVED
PANTSEMM - Rust-based json parser geared towards sorting/matching tags on shapes with n sides -
Time complexity doubt
How can you say T(n) ≤ 3T(floor(n/4)) + cn²
Given that T(n) =3T(floor(n/4)) +Θ(n²)
Won't it imply Θ(n²) ≤ cn², which seems incorrect (or am i wrong to think its incorrect?)4 -
Too much coding;
Can't punctuate like a human anymore;
Keep trying to end everything with ";\n";
At least I don't use ASI1 -
Agree or disagree?
In algo terms ELK is like going from O(n^3) to O(ln(n))
I actually just said that to my boss.... after finishing running my version of analyzing the issue...5 -
New Android N Beta build just dropped. Runs great so far and they fixed the VPN problem I was having with the VPN solution we use at work.
-
And one more.
When my senior ask me to rebase the PR, which I submitted f*n one month ago.
Where it was f*n important that time.
And your pull rebase ask you to fix the conflicts.
And you realize you need to reapply the changes again on top of the master.
And you have to run the FTs again.
Damn.... -
#!/usr/bin/environment perl
use strict;
use warnings;
for my $day (qw/Mon Tue Wed Thu Fri/)
{
print "$day coding\n";
} -
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int arr[n];
int count=0;
for(int i=0;i<n;i++){
cin>>arr[i];
count^=arr[i];
}
cout<<count<<endl;
}
return 0;
}
In the above program,
how does this code snippet work?
count^=arr[i];8 -
Did 2 leetcode today (technically 1)
https://leetcode.com/problems/...
idea:
* Palindrome means cut it half, rearrange the other half, will equal each other.
* Using javascript new map() to build a hash map
* Loop the hash, add up quotient*2, add up remainder.
* if remainder > 1, then return_sum+1
https://leetcode.com/problems/...
seen a few times in interview.
* do the big one first, i.e. if(n % (3*5) === 0)
* then n%3 === 0
* then n%5 === 01 -
Can anyone help me in my task
(Solve n queens problem by stack using linked list) Data structure c++🙏9 -
>>> a = ["print('a = ', a, '\\n', ''.join(a))"]
>>> print('a = ', a, '\n', ''.join(a))
a = ["print('a = ', a, '\\n', ''.join(a))"]
print('a = ', a, '\n', ''.join(a))
>>>
from qpython's mobile website -
String displayTextEatDay = cheatDay == day ? "Your cheating has begun! Enjoy your day and make sure you're getting back soon!" : Values.isCheatMode ? Constants.CHEATDAY_PREFIX + "\n\n" + Constants.EATDAY_TEXT : Constants.EATDAY_TEXT;
-
How would I use \n in Python as a string?
Use Examples:
If you are making a string calculator, and using \n to separate the numbers/text from each other and put them individually into a list, which the conclusion for example:
24\n10\nhi
This should get a list like this:
[ '24', '10', 'hi']
What is the solution?
We can simply use one of the following solutions:
r"\n"
OR
"\\n"
Code example:1 -
echo -e "\ntext\n" >> spaghetti.js
Also cross platform (you set flags in win via a / but whatever)1 -
n=input( )
k=list(n)
for j in range(len(k)):
if k[j]=="a":
k.pop(j)
print(k)
''' i want to print the list by removing a letter "a" but it is showing index error why ? help me out'''7 -
I know it a strange thing to ask but I need help with English grammar ( I am not a English native)
I am doing an assignment on context free grammar program.
What the program need to do it "Produce a grammar tree based on the rule"
For example a sentence "Jame sat.", It will need to produce a grammar tree like this.
S
_____|___
NP VP
| |
N V
| |
holmes sat
The only thing I need to do it give a grammar rule to the program like this
S -> NP VP
NP -> N | Det N
VP -> V | NP
What the above rule said is that the sentence is composed of Noun Phrase and Verb Phrase and Noun Phrase is either is a Noun or a determiner and Noun.
Now here is the meat of the question.
I am having trouble parsing a grammar tree for this sentence "She never said a word until we were at the door here"
I have provided my grammar rule below. I think I forget to add some grammar rule or some of my grammar rule are incorrect. I am not a native English speaker so I am having trouble on it.
The search engine have fail me (I have look up various grammar tree) so I am asking for help on devrant. Grammar nazi are warmly welcome :)
S -> NP VP | S Conj VP | S Conj S
NP -> N | Det NP | N PP | Adj N | Det Adj N | Det N
PP | Det NOM | Det N PP
VP -> V | V NP | V NP PP | V PP | V NP PP Adv
VP -> Adv V NP | VP PP | VP AVP | V PP PP | V
ADJP
PP -> P NP
AVP -> Adv | Adv Adj | Adv AVP
NOM -> Adj Adj N | Adj N | Adj NP
ADJP -> Adj | Adj PP
**I am not sure about these two clause below**
VP -> V | Adv
NP -> Adj Adj N22 -
Global effort 1 rand(n 1) rand(n 1)
Global collab_skill 1.5 rand(n 1) rand(n 1)
CD "university/groupprojects/educ"
Do "function"
Set obs 1
Gen project_ambition = 1
Define label project_ambition 1 "high", add
Gen hype = project_ambition
Define label hype 1 "high, add
Egen output=function[min(`collab_skill');llmean(`effort')]
Egen success = 1 if output>=hype; else success =0
Su success
0 0 0 -
Hello there. Best tips n tricks or hack of Xcode for iOS developers then please share that would be great help.1