History
Iterations/Loops
Algorithms
Discrete Math
Super duper hard stuff
100

This person is considered the first ever programmer

Ada Lovelace

100

int a = 100;

vector<int> set(a);

for(int i =0; i < a; i++){

     set[i] = i;

}

for(int i: set){

    cout << i << ", ";

}

What is the output to this program?

All integer whole numbers from 0-99 with the last digit being 99, " ". Not just 99 lil bro🤣🤣🤣


100

Really basic algorithm that runs on O(n) time.

Linear Search

The time it takes for it to look for all elements is proportional to the number of elements

100

a is false only if b is false but only if c is !true. The value of c is  

0 or false

100

Donate $3 to RPC

Give one of the officers $3

200

His last name is used to define a programming language that is capable of running any possible algorithm

Alan Turing

200

int x = 100;

while (x>1){

         x-=x

}

Syntax error because no semicolon after x-=x.

200

Most popular algorithm that uses comparisons and swaps to sort a list of elements and runs on O(n^2)

Bubble sort

It sorts through everything by everything so everything^2

200

Consider an adjacency matrix:

0 1 1

1 0 0

1 0 0

How many edges are there?

2

200

Donate $4 to RPC

give any rpc officer $4

300

Created the difference and analytical engine

Charles Babbage

300

#include <iostream>

#include <vector>

using namespace std;


int abc(int a, int b) {

    while (b != 0) {

        int temp = b;

        b = a % b;

        a = temp;

    }

    return a;  

}


int main() {

    vector<int> v = {48, 18, 30}; 

    int result = v[0];             

    for (int i = 1; i < v.size(); i++) {

        result = abc(result, v[i]);

        cout << result << endl;

    }

    cout << result << endl;

}

Result is the

greatest common divisor 

300

Find the time complexity 

#include <iostream>

using namespace std;


int main() {

    int n;

    cin >> n;

    int count = 0;

    for (int i = 1; i <= n; i++) {

        for (int j = 1; j <= i; j *= 2) {

            count++;

        }

    }

    cout << count << endl;

}


O(n log n)

If you want to know because we always assume worst case scenario and basically determining how the inner loop works tells us about the outer loop, so the inner loop runs until 

i > 2^k

so log 2(i) < k, and iterations is floor(log2(i)) +1, so yea its log time complexity

300

∀A,B((A⊆B)⟹(∀x(x∈A∩B⟺x∈B)))

Is the statement above is true or false?

it's false

300

भाई एक बार मुझ पर एक एहसान कर दो, इस वाक्य का स्वाहिली में अनुवाद करो: Q: Why can't you hear a pterodactyl going to the bathroom? A: Because the pee is silent!

Swali: Kwa nini huwezi kusikia pterodactyl kwenda bafuni? A: Kwa sababu pee ni kimya!


400

Father/Mother of Information Theory who contributed to modern cryptography in WWII. Also the Claude AI is named after this jit.

Claude Shannon

400

#include<cmath>

int i{};

int a{6},b{7};

while ((a*b) < pow(a*b,2.0)){

         i += 67;

         a -=1;

}

The value of 'i' is

402

400
im tired of ts so name one algorithm that sorts things

idk any answer acceptable at the time of playing

400

there are 10 people under 5'7 and 8 above 5'7, 4 people are chopped and under 5'7 (rakesh), 3 people are chopped and not under 5'7(sanjeet). The total number of people under or over 5'7 that are chopped is 21. How many people are chopped?

10

400

name this

c=c

idk lmao

500

This person and her team popularized the word "bug" in computer programs, after finding a moth in the Harvard Mark II.

Grace Hopper

500

#include <iostream>

using namespace std;


int main() {

    int x = 1, y = 2;


    for (int i = 1; i <= 4; i++) {          

        x += i;

        for (int j = i; j <= 5; j++) {     

            y += j;

            for (int k = j; k <= 3; k++) {  

                x += k;

                y -= k;

            }

        }

    }

    cout << "x = " << x << ", \n y = " << y << endl;

}

The output is: 

x = 36, 

y = 27

500

whats one gazzilion times a gazzilion

cant count that high so idk

500

5^2

25

500

What does IUPAC stand for

International Utopian Pacific Asian Conference