forked from gawwee/gawwee.github.io
-
Notifications
You must be signed in to change notification settings - Fork 4
/
contact.html
69 lines (65 loc) · 3.19 KB
/
contact.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
---
title: "Contact"
layout: default
---
<div class="row">
<div class="box">
<div class="col-lg-12">
<hr>
<h2 class="intro-text text-center"><strong><!--a href="https://docs.google.com/a/dhs.sg/forms/d/e/1FAIpQLSc7BSYhFpKr1iMU5L766NVg1xJ0vp1vkSQuabr4LgHxMv1phw/viewform?c=0&w=1" target="_blank"-->Registration is closed. Thanks for your strong support! :)</strong>
</h2>
<hr>
<p>Registration starts on 14 March 2017 (Pi Day!) and ends on 19 May 2017. BuildingBloCS conference is open to O-level Computing students and teachers only. If you are not the intended target audience but have a reason to attend, please email <a mailto="buildingblocs@computing.sg">buildingblocs@computing.sg</a>.</p>
<p><!--a href="https://docs.google.com/a/dhs.sg/forms/d/e/1FAIpQLSc7BSYhFpKr1iMU5L766NVg1xJ0vp1vkSQuabr4LgHxMv1phw/viewform?c=0&w=1" target="_blank"-->Next lucky give-away: Register by 14 April 2017 to stand a chance to win <del>a BBC micro:bit</del> an Amazon Kindle!</a>. # early and earn bonus lucky draw chances for tech swags. Lucky draw results will be announced during the conference on 1 and 2 June 2017.</p>
<p><strong>Python fun task (adds to lucky bonus chance)</strong>: A year is a leap year if it is divisible by 4 but not 100, or is divisible by 400. Write a Python program that prompts the user to enter a year and prints "Yes!" if the input year is a leap year, and "Leap year + <i>" (0 < i < 4) otherwise. Loop until -1 is entered.</p>
<pre>
Sample Run:
Enter year: 2016
Yes!
Enter year: 2017
Leap year + 1
Enter year: -1
Bye.
</pre>
<p>Email your Python program to buildingblocs@computing.sg. Happy coding!</p>
<p>29 students and teachers registered within 3 days from Pi Day inclusive for a chance to win a Raspberry Pi 3!</p>
<p><strong>Pi Day puzzle (adds to lucky bonus chance)</strong>: What is the 10-digit integer whose digits are all distinct and the number formed by the first i of them is divisible by i for each i from 1 to 10?<br />How to solve it? See <a href="https://github.com/buildingblocs/buildingblocs.github.io/blob/master/piday.ipynb" target="_blank">https://github.com/buildingblocs/buildingblocs.github.io/blob/master/piday.ipynb</a></p>
</div>
</div>
</div>
<div class="row">
<div class="box">
<div class="col-lg-12">
<hr>
<h2 class="intro-text text-center"><strong>Contact us</strong>
</h2>
<hr>
</div>
<div class="col-md-6">
<img class="img-responsive img-border-left" src="img/NYP.jpg" alt="">
</div>
<div class="col-md-6">
<p>Email:
<strong><a href="mailto:buildingblocs@computing.sg">buildingblocs@computing.sg</a></strong>
</p>
<p>Address:
<strong>Theatre for the Arts (Block A Level 2)
<br />Nanyang Polytechnic
<br />172 Ang Mo Kio Avenue 8. Singapore 567739</strong>
</p>
<p>Nearest Bus stops:
<br>
<strong>Nanyang Polytechnic (55329)</strong>
<br>
Buses: 72, 72A, 72B
<br>
<strong>Yio Chu Kang Interchange (55509)</strong>
<br>
Buses: 13, 70, 70A, 70M, 72, 72A, 72B, 76, 162, 162M, 825
<br>
<img class="img-responsive img-border-left" src="img/nypmap.PNG" alt="map">
</p>
</div>
<div class="clearfix"></div>
</div>
</div>