80% of Jow Forums cant even count even and odd numbers from 1 to 100

Truth be told I found it on /v/ a few weeks ago, in one of the "why aren't you working on your game yet, /v/?" threads, and since then I was fascinated by it

cheers user

Question 6 is easy tho
#include

using namespace std;

int main()
{
for (int i(0); i

for the "no modulus" challenge you just add 2 to i after every step and just have it output everything, you'll get all the even(or odd) numbers

>If you reach lower than 200 on the last subtraction then you just stop
Where did you read that?

>I thought this place was an exclusive high tech club for experienced-ish people or something?
How could you get that idea given that you yourself are here?

Attached: op-16.jpg (355x397, 28K)

Just because the loop is implicit rather than explicit doesn't make it less of a loop.

>But I mean, 80% of g and 99.5% of applicants fail, so it must be relevant
These statistics aren't based on any data.

Attached: wrongkiddoorigin~2.jpg (800x411, 29K)

thats not the part about the question that youre supposed to bash your head against, if you print 206 or 200 at the end who cares

can somebody pls post that screenshot full of questions some dude made for interviews that includef all kind of retarded answers?

Here

Attached: 1533532775153.png (2752x4342, 742K)

fucking hell mate this is really interesting, i'll start learning that shit today after lunch... can it be done casually just as a hobby?

sure, I have like ABC's worth, at most, of coding knowledge and it feels great to apply them here

most things can be done as a casual hobby, programming is great because you can reach a professional level of experience using only legally free resources

Fucking glorious

I'm op and I made this, am I in the bottom or top percentile?

pastebin.com/bBSJYVpH

;

Yeah I know I know, I dropped the ; almost tens of times, I'm sorry.

Also I mixed up the = and == in question 10, once, very bad mistake.

int sum;
{for (int i = 0; i < 1001; i = i + 1)
sum = sum + i};
cout

programming threads on /v/ are better than anything posted on Jow Forums

thanks bro call me whenever you need a man ass to fill up ok?

You're right. I even took this before in maybe high school ish and ignored it entirely

Attached: aid340407-v4-728px-Sum-the-Integers-from-1-to-N-Step-8.jpg (728x546, 58K)

But can you demonstrate it?

2 minutes in GNU Nano:
#include
void main()
{
int odd[101];
int even[101];
for(int num=0; num

Attached: smugcat.png (470x548, 247K)

int N = 1000;
N = (N + (N*N))/2;

{if (sum == N)
cout

Can somebody tell me how to do the Ultra Easy #2? In C or C++ preferably. I can also read python
Thanks.

x = 700
while (x >= 200):
print(x)
x -= 13

Well, you want to repeatedly subtract 13 from 700, output the result, then do it again, right? So you set up a loop that starts at 700, outputs the number, then removes 13 and does it again, until it's less than 200.

So:

for (int i = 700; i > 200; i = i -13)
cout

this will never print 200.
or does it not need to?
I guess that's the part I'm stuck on

You don't need to. If your counting goes under it, then it doesn't count

* Let P_n be the following equality:

0+1+2+3+...+n = n(n+1)/2

* P_0:
0 = 0
0(0+1)=0
P_n is true for n=0.

* If P_n is true for any n >= 0:

P_{n+1}:
0+1+2+3+...+n+(n+1) = (n+1)(n+2)/2

0+1+2+3+...+n+(n+1) = (n^2 + 1n +1)/2 (n+1)
0+1+2+3+...+n = n(n+1)/2

Thus P_n is true for any n >= 0.

Just for the record, you are using braces wrong.
{if(a)
b();
c();}

is not only in theory but in actual practice different from
if(a) {
b();
c();
}

In the first case, only b() is conditioned on a, and c() runs regardless of whether a is true; whereas in the second case, both b() and c() are conditioned on a.

Ah I see, you have to put braces around the results of if, and not just around the whole thing, if you want it to do multiple results for one condition

Oh come on, you don't have to it recursively

Attached: Sans titre 1.png (396x374, 17K)

Formally, an if or for (&c.) guard exactly one statement, and a block of several sub-statements enclosed by braces is one statement.

Im working on the v. easy questions now, pretty fun

aaaand there!

pastebin.com/W1Rrn8qZ

import is-od.

>I'm from /v/
Normally I use Jow Forums.
>and I thought ...
I could write those, maybe not all the bonus exercises but the rest I'm sure I could write. I learned python in january for my statistics class. I haven't done anything like that since then and I don't really like it, it's ok but not my thing.

>question difficulty going from "ultra easy" -> "very easy" -> "easy"

Yupp, it's the selfloathing hatemachine at work alright

But these description are right, if you find that difficult you don't know how to program

No, this is more like karamja lobster fishing, only in mems world.

I probably won't do the easy questions without a bunch of reading or ingenuity, especially since I don't know how to enumerate the amount of letters in a word or any of the gimmicky things like the mouse maze, but I can definitely solve 3, 4, 5, and 6.

Pretty fun overall though.

Attached: 1537033580933.jpg (1024x576, 32K)

what the fuck
I refuse to believe that's true, I'm only 18 and learned programming on my time yet I could solve 98% of those without searching anything online

Look at this It's almost shamefully bad how inept coders can be

We owe a great debt to The Falcon

all numbers: sum from 1 to n = n(n+1)/2
so all numbers sum up to 5050.
sum of even numbers: sum (2i) from i=1 to 50 = 2 (1+2+...+50) = 50 51 = 2550
sum of odd numbers = difference = 2500

Most statistics are made up on the spot

These are not questions but tasks, idiot...

Attached: seriously.gif (300x290, 1.74M)

>I'm from /v/, and

Attached: please fuck off back to reddit.jpg (392x380, 33K)

>using loops or vectorization instead of recursion
ISHYGDDT

In hardware, recursion is iteration.

this is dumb as fuck

Questions in the later categories have some easier questions. There is no consistency in difficulty.

Make a deck of cards is somehow easier than comparing two strings?????

>Ignoring whitespace, check if two strings are anagrams
>"comparing two strings"
I mean, I'm not saying it's not a very easy question, but I see no way that it isn't easier yet to make a deck of cards.

But all you have to do is
Str == "anagrams"

YES HIRED

nigga u dumb

I looked it as splitting>array>reverse compare

would be easier than having 3 arrays>Loops>storing>shuffling>(normalizing it depending on language)>drawing.

Confusing Sarah Palin getting droned with Anal grams.

jesus christ that's bad, thanks user I feel a tiny bit better about myself

I mean, think about it, if this type of shit can get hired, anyone who can solve the ultra easy or easy questions reasonably is becoming manager tomorrow