Swageroo - Latest Comments

Re: SPOJ Problem 6256: Inversion Count – INVCNT

kau — Mon, 17 Mar 2014 11:46:03 -0000

hi why does insertion sort give me wa. can't we implement insertion sort?

Re: Little-Known Awesome Algorithms: Fenwick Trees – Rapidly Find Cumulative Frequency Sums

Ramachandran — Tue, 18 Feb 2014 13:05:52 -0000

This is the best article on BIT . Well done

Re: How to program a Gaussian Blur without using 3rd party libraries

Moh'd Auwal — Mon, 10 Feb 2014 00:21:33 -0000

Many Thanks for sharing this technical information, I can now appreciate what is Gaussian filter.

Re: How to program a Gaussian Blur without using 3rd party libraries

tempname0815 — Mon, 03 Feb 2014 12:51:14 -0000

Really helpful for an amateur like me, thank you!

Re: How to program a Gaussian Blur without using 3rd party libraries

Wahaj — Wed, 15 Jan 2014 08:56:14 -0000

Thank you so much ... simplified ...

Re: SPOJ Problem 2: Prime Generator – PRIME1

marlon! — Tue, 07 Jan 2014 06:49:45 -0000

programming challenges by steven skienna

Re: SPOJ Problem 2: Prime Generator – PRIME1

guest007 — Sun, 05 Jan 2014 15:09:56 -0000

What is the name of the book you are mentioning? I'm really interested to know how have you prepared yourself for coding.Since you are a Facebook employee, you must be no less. I want to ask that do we really need to be somebody as good as Petr Mitrichev(hope you have heard his name) to get into companies like Google, Facebook, etc. Please reply at my mail .

Re: SPOJ Problem 2: Prime Generator – PRIME1

Saurabh_P — Tue, 31 Dec 2013 11:45:41 -0000

Because suppose n = 1 and m = 20.
Now for p = 4 your less = 0 so first j = 0 < 1 so no problem but when j = 0 + 4 = 4 is > 1 so it will mark 4 as prime if you dont put the condition that j != p. So basically it prevents you from marking p itself as prime.

Hope you got it.

Re: SPOJ Problem 2: Prime Generator – PRIME1

so_what — Mon, 30 Dec 2013 16:39:23 -0000

and accepted in code chef with execution time 11.02 sec ,why so

Re: SPOJ Problem 2: Prime Generator – PRIME1

so_what — Mon, 30 Dec 2013 16:26:47 -0000

#YOUR SOLUTION IS WORKING IN SPOJ BUT THIS IS MY SOLUTION BASED ON YOUR ALGORITHM BUT #NOT ACCEPTED AND GIVES TLE PLEASE LET ME KNOW WHY SO??
import time,math,sys,random

def seive(n,m):

primes=dict()

for i in xrange(0,m-n+1):

primes[i]=False

p=2

while p*p<=m:

less=n/p

less=less*p

for j in xrange(less,m+1,p):

if j!=p and j>=n:

primes[j-n]=True

p=p+1

#print primes

s=''

for i in primes:

if primes[i]==False and n+i!=1:

s=s+str(i+n)+'\n'

print s

def cal():

t=int(sys.stdin.readline())

while t>0:

t=t-1

n,m=sys.stdin.readline().split(' ')

seive(int(n),int(m))

cal()

Re: How to program a Gaussian Blur without using 3rd party libraries

Andres — Mon, 30 Dec 2013 05:01:16 -0000

Great, thank you!

Re: SPOJ Problem 3442: The Last Digit – LASTDIG

niran — Fri, 13 Dec 2013 04:44:34 -0000

First reason is before doing modulo the result may overflow. Second thing, the purpose of these kinds of problems is to think and find a smart solution.

Re: Solving problems on SPOJ: Life, the Universe, and Everything

harry — Sat, 26 Oct 2013 10:51:02 -0000

ur code is not working on spoj

Re: Solving problems on SPOJ: Life, the Universe, and Everything

pamaquant — Sat, 05 Oct 2013 03:39:46 -0000

how set in php for inputs (atleast for 2 input) and output

Re: How to program a Gaussian Blur without using 3rd party libraries

Ancurio — Tue, 01 Oct 2013 14:21:34 -0000

Thanks, your article was very helpful to me.

Re: Zeckendorf’s Theorem & Simple Code Implementation

Vincent — Tue, 03 Sep 2013 02:03:45 -0000

great! I am now understand the Zeckendorf (even though i still confuse with the mathematical thingy in Zeckendorf theorem :p)

Re: AdBlock is trying to spread aggressively with a super-bowl ad

smithzv — Tue, 27 Aug 2013 03:42:59 -0000

Well, I definitely think that an Internet where everybody realizes that they are the people doing the rendering, and thus they are the ones that have the power to decide how things are rendered would be a laudable goal. However, I definitely agree with you on this one. Marketing Ad Block as a way to strip away all ads is detrimental to us all. It needs to be marketed as a way to turn off ads if you happen to choose to.

I also don't want to deal with the interim time when the Internet ad supported pages is desperately trying hold on to ad revenue. Can you imagine Youtube splicing ads into the video stream itself, or instead of banner ads a web page becomes a single, opaque object rendered server side or inside some proprietary browser extension so that the ads are not so easily extractable. We are talking about a potentially huge step back in terms of an open web.

Even worse, what if the Internet went the way of television did when people started to ignore or skip commercials? What if we had heavy product placement on the Internet? Imagine blog posts whose topic always seem to revolve around GoDaddy...

Re: Difficult Amazon interview question — Find all phrases you can build, given a set of letters.

rodrodsalazar — Mon, 22 Jul 2013 22:25:32 -0000

I got a better offer from facebook

Re: Difficult Amazon interview question — Find all phrases you can build, given a set of letters.

Saurabh — Sun, 21 Jul 2013 12:43:22 -0000

And why on earth would you do that? I'm dying to know the reason.

Re: Difficult Amazon interview question — Find all phrases you can build, given a set of letters.

rodrodsalazar — Sat, 20 Jul 2013 17:04:13 -0000

no, I did not take the job offer

Re: HipHop VM on EC2 – “could not allocate 1210089471 bytes for translation cache”

runphpdph — Sat, 20 Jul 2013 14:30:54 -0000

Looks like compiling on current micro EC2 Ubuntu 64-bit configuration is stopped by limited memory.(?).

Building CXX object hphp/CMakeFiles/hphp_runtime_static.dir/runtime/vm/bytecode.cpp.o

c++: internal compiler error: Killed (program cc1plus)

Although current version of hhvm seems to already have changes outlined in above post or can change related sizes by config...

Re: Difficult Amazon interview question — Find all phrases you can build, given a set of letters.

Saurabh — Sat, 20 Jul 2013 14:10:23 -0000

You mean you work at amazon now?

Re: Little-Known Awesome Algorithms: Fenwick Trees – Rapidly Find Cumulative Frequency Sums

Joan Gerard — Sat, 29 Jun 2013 10:19:32 -0000

Thanks Rodeo, What Is the correct form to manipulating bits?? I don't know about that, I tried 'value & -value' but that didn't work for c++. Is there any command for do that, efficiently?

Re: Little-Known Awesome Algorithms: Fenwick Trees – Rapidly Find Cumulative Frequency Sums

rodrodsalazar — Fri, 28 Jun 2013 22:08:58 -0000

Google for 'C++ __builtin_ctz', though the built in ctz function is much slower than just manipulating bits yourself.

Re: Little-Known Awesome Algorithms: Fenwick Trees – Rapidly Find Cumulative Frequency Sums

Joan Gerard — Fri, 28 Jun 2013 21:31:48 -0000

I have a cuestion man. What's the library for ctz command? how do you do that in c++??