immkavin-ranks

n = 100
primes = [i for i in range(2, n)]
for i, j in enumerate(primes):
    for k in range(i + 1, len(primes)):
        if primes[k] != None and j != None:
            if primes[k] % j == 0:
                primes[k] = None
primes = [x for x in primes if x is not None]
print(primes)
print(len(primes))

immkavin-ranks

Keybase proof

I hereby claim:

• I am immkavin-ranks on github.
• I am kavinsde (https://keybase.io/kavinsde) on keybase.
• I have a public key ASAmHT8xP22iC72cW1yvfT0ws-8Kxu-bTsi9iUvgW1QHYQo

To claim this, I am signing this object:

immkavin-ranks

var output = []
var count = 1;

function fizzBuzz() {
    while (count <= 100) {
    
        if (count % 3 === 0) {
            if (count % 5 === 0) {
                output.push("FizzBuzz")
            } else {

immkavin-ranks

var output = []
var count = 1;

function fizzBuzz() {
    if (count % 3 === 0) {
        if (count % 5 === 0) {
            output.push("FizzBuzz")
        } else {
            output.push("Fizz");
        }

immkavin-ranks

for (let i = 1; i <= 100; i++) {
    if (i % 3 === 0) {
        if (i % 5 === 0) {
            console.log("FizzBuzz")
        }
        else {
            console.log("Fizz");
        }
    } else if (i % 5 === 0) {
        console.log("Buzz");

immkavin-ranks

# sample list
a_list = [1, 65, 4, 2, 3, 9, 4, 8, 4, 20, 34, 6, 15, 17, 0, 23, 3]

print('Prints alternate items from first item:') 
for item in a_list:
    if a_list.index(item) % 2 == 0: # (a_list.index(item) + 1) % 2 != 0:
        print(item)
        
print('Prints alternate items from second item:') 
for item in a_list: