Check out our latest promo video for the ICPC training phase starting this term.
ACM thanks the McMaster ACM Chapter team for giving back to the community by participating in the hour of code global event.
McMaster this year had 3 teams to compete at the most well-known elite undergrad programming competition, the ACM ICPC( International Collegiate Programming Competition).
McMaster ranked 3rd in Canada and 7th in Central North America!
The Blue Team got the fourth place at the University of Windsor site too!
Standings for the 200+ teams that competed in the Central North American Regional are here.
Team Members for 2016 ( all years here )
McMaster Blue Team ( Campus Champion ) [16th ECNA] :
Ori Almog [3rd Sfwr Eng], Mikhail Andrenkov [3rd Sfwr Eng], Ian Prins [3rd Sfwr Eng]
McMaster Red Team ( Campus 2nd Place ) [34th ECNA] :
Ezzeldin Tahoun [3rd Comp Eng], Brandon Roberts [2nd Sfwr Eng], Daniel Wolff [2nd Sfwr Eng]
McMaster Green Team ( Campus 3rd Place ) [68th ECNA] :
Pavithran Pathmarajah [3rd Sfwr Eng] Wyatt Wismer [1st Eng], Kelvin Lin [3rd Sfwr Eng]
Pavithran Pathmarajah [3rd Sfwr Eng] Wyatt Wismer [1st Eng], Kelvin Lin [3rd Sfwr Eng]
McMaster @ ICPC
The 9 student programmers with the Site Directors and ICPC Judge
McMaster Champions
McMaster Blue Team and Chair
Qualifiers and Training Photos here.
More ICPC Photos here.
News below:
http://bit.ly/2eNrpE6 (Engineering) http://bit.ly/2kHEorB (dailynews)
http://bit.ly/2kLpDY6 (CAS news)
http://bit.ly/1QjPyKA (ECE news)
http://bit.ly/2k9Ynj8 (COOP office)
http://bit.ly/2jM4TOs (ECE dept.)
http://bit.ly/2kp2WbB (CAS newsletter)
http://bit.ly/2kklVnC (Software Hamilton)
McMaster's Campus-Wide qualifying competition is happening on Tuesday Oct 25th in ITB-134 @ 5:20pm.
Bring your laptops!
No registration required.
________________________________________________
Will you be writing the most important line of your undergrad resume this October?
What do you have better to do on Friday Oct 28 ,2016 & Saturday Oct 29, 2016 than go kick some code ass and make McMaster proud!
Lets up the McMaster Engineering Game up a bit this October! We will be competing with at least another 150 teams this year! At least 60 Universities going all in to win one title. What school has the best engineers in North America?
An annual competition for ONLY UNDERGRADS, yep you can only compete 4-5 times max, is happening in a month. Are you prepared to compare your skills to the the best in the game? You got what it takes to call yourself one of the best 450 engineers in North America?
McMaster's Campus-Wide qualifying competition is happening on Tuesday Oct 25th in ITB-134 @ 5:20pm.
Bring your laptops!
No registration required.
Will you be writing the most important line of your undergrad resume this October?
-Yo, chill, what is ICPC anyway? http://blog.macacm.org/p/competitions.html & http://blog.macacm.org/p/icpc.html;
-More info on this year's ECNA? http://acm-ecna.ysu.edu/
-ECNA Rules? http://acm-ecna.ysu.edu/rules.html
- Which site we hitting then, Schedule, More Details?? Windsor it is! All here -> http://kobti.myweb.cs.uwindsor.ca/icpc/
- Past stuff ? http://acm-ecna.ysu.edu/past.html
- Uhm, who did this before? McMaster Red & Blue teams did this last year! More here; results here; Problems and solutions here.
- Training PLSSS! http://blog.macacm.org/2016/07/training-schedule.html
- More essential training pls! http://blog.macacm.org/search/label/icpc
- Communication Channel? https://macacm.slack.com the ICPC_ECNA channel
18 July
Week 1 ( Introduction, Mathematics & Common Mistakes)
- http://macacm.org/training/1.pdf
- http://macacm.org/training/2.pdf
- http://macacm.org/training/common%20mistakes
25 July
Week 2 ( Data Structures & Dynamic Programming )
- http://macacm.org/training/3.pdf
- http://macacm.org/training/4.pdf
- Solve 10 Questions on Codeforces.com (30 per team)
- Mock ICPC Contest
Week 3 ( Combinatorial Games & Basic Graph Algorithms )
- http://macacm.org/training/5.pdf
- http://macacm.org/training/6.pdf
- Solve 15 Questions on Codeforces.com (45 per team)
8 August
Week 4 ( Shortest Path Algorithms & Network Flow Problem s)
- http://macacm.org/training/7.pdf
- http://macacm.org/training/8.pdf
- Solve 20 Questions on Codeforces.com (60 per team)
15 August
Week 5 ( Computational Geometry, String Algorithms & Suffix Arrays )
- http://macacm.org/training/10.pdf
- http://macacm.org/training/11.pdf
- Mock ICPC Contest
[Previous Training Modules Will Be Deleted 22 Aug 11:59pm]
[No further support/questions will be given/answered 22 Aug 11:59pm]
Week 6 ( Practice )
- Solve 30 Questions on Codeforces.com (90 per team)
29 August
Week 7 ( Practice )
- Solve 30 Questions on Codeforces.com (90 per team)
5 September
Week 8 ( Practice )
- Solve 30 Questions on Codeforces.com (90 per team)
12 September
- Mock ICPC Contest
Week 7 ( Practice )
- Solve 30 Questions on Codeforces.com (90 per team)
- Training Session
19 September
Week 10 ( Practice )
- Solve 30 Questions on Codeforces.com (90 per team)
26 September
Week 11 ( Get Ready! )
- Solve 30 Questions on Codeforces.com (90 per team)
- Mock ICPC Contest
- Training Session
McMaster takes on ACM ICPC East Central North American Regionals
By the end of this each of the participating teams will have:
- gained Experience with all programming concepts
-finished Stanford's Competitive Programming Course
- solved 645 questions solved on Codeforces Online Judge
- survived 5 Realistic Mock ICPC Contests
- attended 3 specially crafted training sessions covering past questions most likely to be on the regionals
Dijkstra's Algorithm [ Code & Explanation ]
Saturday, July 9, 2016
Posted by Ezzeldin Adel
Tag :
icpc
Running the algorithm against an 8 nodes directed, weighted graph on a white board (using a cost matrix ):
Running the algorithm against an 8 nodes directed, weighted graph using JAVA code (1/2):
Running the algorithm against an 8 nodes directed, weighted graph using JAVA code (2/2):
CLICK HERE for the animation ( to better understand the algo )!
Code: macacm.org/dj.java
Graph (8 nodes, directed, weighted):
A B C D E F G H
A 0 25 0 85 0 0 105 0
B 0 0 0 0 0 15 0 0
C 0 00 0 55 0 60 0 20
D 0 00 55 0 0 0 35 0
E 0 30 00 00 0 0 50 0
F 0 0 15 40 0 0 0 0
G 25 0 0 0 0 0 0 0
H 0 0 0 0 0 0 0 0
Play with Code Running: https://ideone.com/5g4tG1
CODEFORCES 686A [SOLVED} | CODE AND VIDEO EXPLANATION
Monday, June 27, 2016
Posted by Ezzeldin Adel
Tag :
icpc
Codeforces 686A| Free Ice Cream
Question:
Solution: #include
#includeusing namespace std; int main() { long long x, n ; cin >> n >> x; int dis =0 ; for ( int i = 0 ; i< n ; i++) // handle n operations { char c; int xx; cin >> c >> xx; if ( c == '+') x+=xx; // add more ice cream to ours YAY else { // - give icecream :( if ( xx<=x) x-=xx; // if we have enough to give em lets just do it else // turn em down dis++; } } cout << x << " " << dis; return 0; } // ez@macacm.org -- 12:05PM 27-06-2016 // Ezzeldin Adel Tahoun || McMaster University
Video Explanation:
If you want us to solve any certain question please leave it down in the comments or send it to us on facebook.
CODEFORCES 478C [SOLVED} | CODE AND VIDEO EXPLANATION
Sunday, June 26, 2016
Posted by Ezzeldin Adel
Tag :
icpc
Codeforces 478C | Table Decorations
Question:
Solution:
#include#include #include using namespace std; int main(){ vector<long long> array(3); scanf("%lld %lld %lld\n", &array[0], &array[1], &array[2]); // grab nput sort(array.begin(), array.end());//sort ascending (ex 1 2 30) long long result = (array[0] + array[1] + array[2]) / 3; // uniform sol if(array[0] + array[1] < result){result = array[0] + array[1];} // if one number is bigger than the sum of others then obviously we can only hv the sum of others diff decorations ( for example r = 100 g = 3 b =2 .. uniform sol = 35 but we can only hv 5 diff sols wich are rrg rrg rrg rrb rrb ) cout << result; // print return 0; } // ez@macacm.org -- 01:03AM 23-06-2016 // Ezzeldin Adel Tahoun || McMaster University
Video Explanation:
If you want us to solve any certain question please leave it down in the comments or send it to us on facebook.
Codeforces 478B [SOLVED} | Code and Video Explanation
Saturday, June 25, 2016
Posted by MCMASTER ACM
Codeforces 478B | Random Teams
Question:
Solution:
#include <iostream> using namespace std; int main(){ long long n , m; // inputs cin >> n >> m;// grab em // maximum long long kmx = n- m +1; // get the max number of people in one team so forexample if 6 ppl and 3 teams the max is 4 since the other 2 teams will hv only one person kmx= kmx*(kmx-1)/2; // now match every one with his friends using thefamous formula n*(n-1)/2 which accounts for each person as n and (n-1)/2
are the relationships he/she might make with others (n-1) since relationships are
undirected which means a loves b == b loves a we should divide by 2 //minimum ( real bad ) long long kmn = ((n / m) * ((n / m) - 1)) / 2; // get possible pairings PER TEAM inuniform teams example 6 ppl 3 teams 6/3 is uniform number which is 2 per team if(n % m == 0){ kmn *= m; // special case }else{ kmn *= m - (n % m); // without leftovers ppl who got no uniform team( n%m is the number of teams who hv no uniform number of ppl) since this is the
remainder of a unifrom division right ? // now kmn accounts for pairings in uniform teams only long long lft =(((n / m) + 1 ) * (n / m)) / 2; // now leftovers ! // lft has possible pairings kmn += lft * (n % m); // multiply possible pairings per person bythe number of lftovers and add them to kmn } cout << kmn << " " << kmx << endl; // print them ! // we done boyzz } // ez@macacm.org -- 01:03AM 23-06-2016 // Ezzeldin Adel Tahoun || McMaster University
Video Explanation:
If you want us to solve any certain question please leave it down in the comments or send it to us on facebook.