March Newsletter


Howdy SCE!

Do you feel that? There’s luck in the air! You know what that means? Midterm season! Get pumped because we are open five days a week, come to our room and study up on those midterms! Without further to do let’s get on with this month’s events!

Officer of the Month: Ijaaz Omer

Hi, I’m Ijaaz Omer and I’m a senior computer engineer with an interest in Robotics, InfoSec, AI and Biomedical Applications of technology. I decided to become an engineer late at night during my senior year of high school when I came to the sad realization that I wasn’t good enough to take over the world. After performing a prayer ritual meant to give focus and allow major life decisions to be made, I had a fever dream of me being Iron Man. It was after this that I decided to become an engineer. Ironic now that I think about it, as I have since become an atheist. There’s a moral lesson to be learned in there somewhere, but for the life of me, I can’t figure out what it is.

 

 

 We’ve reached 1000 Likes on Facebook!! Image result for facebook thumbs up

We want to thank all of you for being a big part of S.C.E.! We appreciate every single one of you guys for making this club an amazing place to study and grow. Continue to inspire, everyone!!

Thots Begone

Interview Question of the Month: Leonardo and Cookies

Inline imageLeonardo ♥ LOVES ♥ cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Leonardo repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with:

sweetness = (1x Least sweet cookie + 2x 2nd least sweet cookie).

He repeats this procedure until all the cookies in his collection has a sweetness K.
You are given Leonardo’s cookies. Print the number of operations required to give the cookies a sweetness K. Print -1 if this isn’t possible.

Input Format:
The first line consists of integers N, the number of cookies and K, the minimum required sweetness, separated by a space.
The next line contains N, integers describing the array A where Ais the sweetness of the ith cookie in Jesse’s collection.

Constraints:
1 ≤ N ≤ 106
0 ≤ K ≤ 109
0 ≤ Ai ≤ 106

Output Format:
Output the number of operations that are needed to increase the cookie’s sweetness ≥ K.
Output -1 if this isn’t possible.

Upcoming Events:

We are pumped to announce we’ll be hosting both hardware and software workshops this semester!
Check out our events!

DC Motor Workshop Part 1 – Thursday, 3/8 – 6PM
DC Motor Workshop Part 2 – Thursday, 3/15 – 6PMWeed Floor
NVIDIA GPU Technology Conference – Mon-Thurs, 3/26 – 3-29
Spends Money

Follow us on Facebook for live updates and events!

Facebook

Hit that like and follow button to keep up with all things SCE!

https://www.facebook.com/sjsusce/