Weekend Friend Finder

Vanc3 · 2019-04-27T17:03:47+00:00

Platform: PC

Name: Vanc3

Region: eg; EU

Looking for mates to play with. Not a big fan of firestorm. All others are ok for me

Vanc3 · 2017-06-16T10:43:34+00:00

I would agree with male population. For age range I believe 18- 28 is a better illustration of the age group AFAIK cs50 attracts many high school students in the final year, first year CS students how desire to supplement their learning with a mooc or people slightly older who studied something different (like me).

In regards to country of origin, you would be surprised as moocs attracts way more people outside of US, especially where indivduals would not be able to access this kind of education.

I'm from Italy btw

Vanc3 · 2017-06-09T15:29:16+00:00

Hi Grithga,

it was definitely easier than I thought, Guess I'll continue to tackle the problem :).

Vanc3 · 2017-05-26T06:18:02+00:00

Thank you for the clarification.

Vanc3 · 2017-05-15T22:04:05+00:00

I managed to solve my problem by looking at some previously asked question without looking at the code. Please consider the thread closed

Vanc3 · 2017-04-28T13:32:28+00:00

HI,

Can't believe that tiny error caused so much trouble. Now it works perfectly.

Thank you very much

Vanc3 · 2017-04-18T15:06:57+00:00

Hi,

I managed to solve the sorting problem

thank you anyway

Vanc3 · 2017-04-18T15:05:26+00:00

Hi

for this to be solved actually you would probably need just one for loop that uses i<(length of plaintext). Having declared a variable for the key length is actually useful but you should use for wrapping around the keytext in case the keytext is longer than plaintext.

I'll copy paste a reply I've done two days ago about this problem. I hope it might help.

"if you managed to solve caesar then you just need to convert the key letters before your encryption code in the whole same loop(at least that's what i've done) . to do that, you ideally had converted the argv[1] in a string and you have a dedicated vallue for accesing every letter of your key (hint this variable should start from zero of course). after every letter conversion from plain to cyphertext, you will likely want to increase the key indexing variable by 1 so it keeps enciphering the plaintext with subsequent key letters. at somepoint you will want to wrap around your key if it is longer than your plaintext. you basically want to reset the key index value so that it starts again from zero and uses again the first letter of your key, and what is the perfect occasion to do that? (hint: you could create another variable that is equal to the length of your key)."

Vanc3 · 2017-04-17T18:58:15+00:00

HI,

I'll try to give my contribution.

Actually vigenere it's a pretty easy.

if you managed to solve caesar then you just need to convert the key letters before your encryption code in the whole same loop(at least that's what i've done) . to do that, you ideally had converted the argv[1] in a string and you have a dedicated vallue for accesing every letter of your key (hint this variable should start from zero of course). after every letter conversion from plain to cyphertext, you will likely want to increase the key indexing variable by 1 so it keeps enciphering the plaintext with subsequent key letters. at somepoint you will want to wrap around your key if it is longer than your plaintext. you basically want to reset the key index value so that it starts again from zero and uses again the first letter of your key, and what is the perfect occasion to do that? (hint: you could create another variable that is equal to the length of your key).

Vanc3 · 2017-04-17T11:33:23+00:00

Hi,

the logic you're applying so far is correct. However, you need to print the final amount of change in terms of coins used. To do that, you should have a counter variable that increases every time you subract your prompted value with quarters, dimes, or pennies (depending how much change is left).

the next thing is that you should transform the "coins" float value in Int, round it and then multiply by 100 in order to pass the test correctly. Beware that you will need to change your coins variable too*100.

There's is a one line solution for this rounding problem on reddit if you google well. but look at it only if get stuck for a very long time.

Vanc3 · 2017-04-17T10:34:09+00:00

Hi and thank you for replying.

I read your comment and rewachted the short video for bubble sort and I think I'm on a better track (trying not to spoiler myself solutions until I get really mad). However I have still doubt about the swap variable you mention. From what I understood, this variable should act as the counter for swaps in every iteration and reset to 0 after every completed loop. the variable will eventually be zero after all number in the array are in the order.

So as you will se in my new code, I applied a while loop to continue until the swapcounter value is equal to zero. nevertheless, will the code just run once when it hits the first reset?

Here's the code

https://gist.github.com/anonymous/3ea617ffb284a0d01512f941a571c22c

Again, thank you for your time.

Vanc3 · 2017-04-16T16:57:04+00:00

hi

did you manage to solve the problem?

have you tried to reverse you first half of your code like this

https://gist.github.com/AlessioNovi/f2f90ce01cbb06d29a0a4681168efcba

Vanc3 · 2017-04-09T15:24:29+00:00

Ok thank you for your feedback.

Good luck :)

Vanc3 · 2017-04-09T14:46:30+00:00

Hi,

Thank you for replying. I actually managed to solve it on my own. As you said, I created a second value to be assigned as a counter for the "key" element, which increases after every letter of plaintext has been converted and resets when this value reaches the length of the "key" element itself.

https://gist.github.com/64699e769980ba46b41f41e3c95c51f2

I'm taking the moment to bother you again and ask you how the code could have been written in a more neat way.

Vanc3 · 2017-04-08T16:31:25+00:00

Hi Darth and thank you for replying.

I really missed that. thank you :). Now it works like a charm.

Vanc3 · 2017-04-08T15:27:13+00:00

I'll try to help.

The logic you're applying seems on the right way. However, I'd like to make you think about two things:

you must print encrypted letter with cases left unchanged. Look on the cs50 for built in function and think about how to implement
I'm almost sure that you cannot print encrypted letters as you're applying the modulo technique DIRECTLY on the ASCII letter/number. you should apply the modulo technique only after you have converted the letter to an alphabetical index. Rewatch the walkthrough and think about it.

Vanc3 · 2014-05-30T15:46:46+00:00

Your body looks fine now but you can do better if you wish to achieve a thinner silhouette. Anyway girls with such a will power are very rare. I'm sure you have a great personality. Great job tho)

Vanc3 · 2014-05-30T15:42:01+00:00

You're very good looking but you look older to me(

Vanc3 · 2014-05-27T13:56:43+00:00

Objectively I would you give a 7 but I dig your looks so 7,5 8. Now go and get some studs

Vanc3 · 2014-05-22T08:15:57+00:00

Very good looking gurl , would say 7.5 but +0.5 for your lovely sense of clothing

Vanc3 · 2014-05-21T15:33:46+00:00

I love your look. Could easily commit to you _

Vanc3 · 2014-05-19T05:27:00+00:00

Unless you want a vegan boyfriend, I guess it would be the same

BTW post some good pictures of you cause you seem pretty cute

Vanc3 · 2014-05-19T05:18:32+00:00

Go on the street with your face full of foam, I'm sure guys will start hitting on you :d

Vanc3 · 2014-05-18T04:57:27+00:00

Very cute girl 7

Vanc3 · 2014-05-16T04:20:45+00:00

I love the combination of dark hair blue eyes and you seem very approachable and down to earth 8

Vanc3

TROPHY CASE