USACO
文章平均质量分 76
fjiajun
这个作者很懒,什么都没留下…
展开
-
Greedy Gift Givers
/*ID: mrster.1LANG: CTASK: gift1*/#include #include #include int main(){ FILE *fin = fopen("gift1.in","r"); FILE *fout = fopen("gift1.out","w"); int counts = 0; int i = 0,j原创 2014-06-05 15:47:26 · 343 阅读 · 0 评论 -
Broken Necklace
/*ID: mrster.1LANG: CTASK: friday*/#include #include int main(){ int n = 0; int countDays = 0; int week[7]; int i = 0,j; FILE *fin = fopen("friday.in","r"); FILE *fou原创 2014-06-05 15:52:23 · 297 阅读 · 0 评论 -
Milking Cows
/*ID: mrster.1LANG: CTASK: milk2*/#include #include int main(){ FILE *fin = fopen("milk2.in","r"); FILE *fout = fopen("milk2.out","w"); FILE *fouts = fopen("1.txt","w"); int c原创 2014-06-05 15:54:38 · 343 阅读 · 0 评论 -
Name That Number
idea:1.找出给出数字所有组合字符串;2.每一个字符串与给定字典中到单词进行比较,若匹配则输出;实现代码:原创 2014-06-05 16:00:08 · 410 阅读 · 0 评论 -
Friday the Thirteenth
/*ID: mrster.1LANG: CTASK: friday*/#include #include int main(){ int n = 0; int countDays = 0; int week[7]; int i = 0,j; FILE *fin = fopen("friday.in","r"); FILE *fou原创 2014-06-05 15:50:17 · 270 阅读 · 0 评论 -
Transformations
1、idea:1.顺时针90度旋转到处理:b[i][j] = a[n-j][i];2.180度、270度分别看成2次、3次90度旋转;3.水平翻转到处理:看成列变换,b[i][j] = a[i][n-j];4.分别做1-7处理,找出符合的代码输出。原创 2014-06-05 15:57:31 · 304 阅读 · 0 评论