₦airaland Forum

webapi:
There are wordpress developers and they are also called web developers. Creating a wordpress platform from scratch is more difficult than create a web app with laravel (i use both though) but my point is, not everyone that uses wordpress are non-developers... Facebook uses wordpress, does that mean the facebook team are non-developers? What matters is use the platform that suits your need.

orimion:
Let the permutations and combinations begin

TonyeBarcanista:
If Nigeria can beat Iceland by 3 goals

Argentina beat Croatia by 3 or 2 goals

Croatia Play draw with Iceland and

Nigeria draw Argentina in the last match, we will qualify for the next round.

ghettowriter:
no ish, we fit nock Argentina and Iceland #Believe.

Because of what you did, the Windows
will disappoint you and eat up all your Resources; and you will
have to use lousy programs;

CodeTemplar:
Java will be a well built, light skinned woman who can
multitask - do many things.
secure the home - security.
make good decisions - control
logic.
socialize well - web services
work any where - multiplatform

DanielTheGeek:
Can you run a benchmark test against both in Haskell?

DanielTheGeek:
(a+b-1)*gcd(x,y) to get the total count of cells in any condition...

DanielTheGeek:
Minus GCD of what and what? I appreciate your effort but please don't just google and implement straight away..

Although I really commend your effort and at this stage you have gotten to I'd really like to know you more.... (That's for another day though, let's not derail) because you're getting a tad bit close to the actual efficient solution..but your answer is just not correct as it lacks mathematical logic..

DanielTheGeek:
Really nice shot, but this is not correct....it's not also efficient, it seems you didn't get the question correctly... We are trying to calculate or come up with a formula that calculates the amount of cells a line passes through from the origin to it's destination.. In the figure I shared you can denote that based on the line the cells are moving either to the right or upwards, for x,y being positive integers (not equal)...the cells will move either to the left or downwards given that x,y are negative integers (not equal).. We aren't looking for the slope here but the amount of cells the line passed through..

4kings:
x and y in the diagram are not equal.

But assuming x is 5 and y is 5.
n = (x+y)-1 = 9 is wrong.

If you trace the diagram to y and x at 5 max.
The number of cells are 6 not 9.

orimion:
my deduction

if n is the number of cells

1. if x = y, then n = x = y
2. if x is odd or y is odd n = (x + y) - 1
3. if they are both even n = (x + y) - (level of reduction * 2)
where level of reduction = the number of times we can divide by 2 until one of them is odd

is this right?

DanielTheGeek:
But before then, I have a simple question.. I don't need to see code; just logical reasoning..
(Taken from an interview of a company I worked for)

In a co-ordinate plane, a line segment is drawn from the origin to a point A(x,y). With great efficiency, find the number of cells the line passes through Assuming X and Y are ints...

Google may not be of too much help, this is largely theoretical.

Mod: let's have more of this kind of questions as the ones involving code can easily be Googled or outsourced.. This tests the fundamental knowledge of computer science.. Programming is more of thinking than coding

Laredojohn:
Order arrived Nigeria

appcypher:
But they were not flexible enough so I decided to write another parser from scratch in Python, then Typescript and now Javascript. .

deedat205:
orimion and Haskell are 5 and 6

def dirReduc(l):
	cor = ['NORTH','SOUTH','WEST','EAST']
	i = 0
	while i < len(l)-1:
		if l[i] == cor[0] and l[i+1] == cor[1] or l[i] == cor[1] and l[i+1] == cor[0]:
			del(l[i])
			del(l[i])
			i = 0
		elif l[i] == cor[2] and l[i+1] == cor[3] or l[i] == cor[3] and l[i+1] == cor[2]:
			del(l[i])
			del(l[i])
			i = 0
		else:
			i += 1
	return l

frankg1:
i dont understand this haskell one bit... but it works though

dirReduce :: [Direction] -> [Direction]
dirReduce xs =
  case reduce 0 [] xs of
    (0, ds) -> reverse ds
    (_, ds) -> dirReduce $ reverse ds

reduce :: Int -> [Direction] -> [Direction] -> (Int, [Direction])
reduce t acc [] = (t, acc)
reduce t acc (North:South:ds) = reduce (t + 1) acc ds
reduce t acc (South:North:ds) = reduce (t + 1) acc ds
reduce t acc (West:East:ds) = reduce (t + 1) acc ds
reduce t acc (East:West:ds) = reduce (t + 1) acc ds
reduce t acc (d:ds) = reduce t (d : acc) ds

Laredojohn:
cost of purchase 469.57 * 330 =154958.1
shipping to Lagos =12950
Total = 154958.1 + 12950 = 167,908.1

iamgenius:
I'm a muslim, even many worst comments in the Islam For Muslims threads. I know someone will call me a terrorist now. Cheers!

iamgenius:
I was born believing those rubbish up there. How I wish I could forget all of those things. It saddens my heart whenever I see people doing those idol worshipping. How I wish you could understand.

omotolsy:
unfortunately pes 17 is demanding