I hereby claim:
- I am blueset on github.
- I am blueset (https://keybase.io/blueset) on keybase.
- I have a public key ASDlmdWfmOfm5sOK2jEMR2S8dCjDaVdgBbiIxQovia_apwo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
<!-- | |
这是一个可以打印的2016年年历,为A4横版黑白打印设计。 | |
使用字体:(系统自带黑体),Herme Geometric Sans 1,STSongti Black | |
制作:蓝色之风 <https://1a23.com> | |
日历数据来源:http://wannianli.tianqi.com/ | |
数据替换方法: | |
使用网页上的下拉菜单切换月份,并从 Chrome 的「审查元素」中将当月的 `<table>` 元素复制出来,替换网页里面的Table。 | |
将节日文字替换黑白节日: | |
`:%s/" style="color: #[0-9A-F]{6}/ specialDay/g` | |
备注: |
# -*- coding: utf-8 -*- | |
import encodings.utf_8 | |
import math | |
import urllib, urllib2 | |
import random | |
import re | |
from xml.dom import minidom | |
from LevenshteinDistance import LevenshteinDistance | |
from grabber import LyricProviderBase |
# -*- coding: utf-8 -*- | |
# Code from LyricZilla - Linux 下的滚动歌词 | |
from encodings import gb18030, utf_8 | |
import urllib | |
from xml.dom import minidom | |
from LevenshteinDistance import LevenshteinDistance | |
from grabber import LyricProviderBase | |
__all__ = 'Lyricist' |
This is the place for me to share my solutions to the Grok Learning Worksheets for the COMP10001
Foundation of Computing course in the University of Melbourne in Semester 2, 2016.
Take note that all code released here are EXPIRED, i.e. they are no longer available to be submitted as examinable works. And all codes below is licensed under MIT license.
Note that some codes used below may include advanced contents that may not be taught before the deadline. Also, some “dirty tricks”, like joining code into one long line, is strongly not recommended to be used in your projects.
In the meanwhile, you might be interested in my solution to the Practice Projects.
- -------------------------------- !ALERT! --------------------------------- -
Here I'm posting my solutions to the Practice Project for the COMP10001
Foundation of Computing course in the University of Melbourne in Semester 2, 2016.
The solution below is just my solution. IT IS NOT:
I advice you to try on your own first before you read this solution.
This is the place for me to share my solutions to Project 1 for the COMP10001 Foundation of Computing course in the University of Melbourne in Semester 2, 2016.
Take note that all code released here are EXPIRED, i.e. they are no longer available to be submitted as examinable works. And all codes below is licensed under MIT license.
Copyright (c) 2016 Eana Hufwe
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
// Travelling Salesman problem | |
// Sample code @ UMCPC | |
// Time complexity: O(n + 2^n) | |
// memo: cached value | |
int tsp(int curr, int visited) { // visited = binary visited list | |
if (memo[curr][visited] != -1) { | |
// return cached value | |
return memo[curr][visited]; |
# compile | |
clear | |
if [ -z "$1" ] | |
then | |
echo "$0 Usage:" | |
echo " $0 sourceCode.cpp [inputFile.in]" | |
echo "" | |
echo "Example:" | |
echo " $0 test.cpp" | |
echo " $0 test.cpp test.1.in" |