摘要:
上午那道被北航改编成了研究生上机题,现在这道被清华改编成了上机题。看来usaco是个好东西~另外,测试时在结尾多输出了一行字符,居然提交上去也过了,可见后台的JUDGE不是用的linux里的differ函数/* ID:linyvxi1 TASK:namenum LANG:C++*/#include <string.h>#include <stdio.h>#include <fstream>char num_map[]={'2','2','2','3','3','3' 阅读全文
posted @ 2011-10-27 16:59
linyvxiang
阅读(150)
评论(0)
推荐(0)
摘要:
北航复试题是此题的简化,如果不是文件操作这题早就过了/* ID:linyvxi1 LANG:C++ TASK:transform*///#include <stdio.h>//#include <iostream>#include <fstream>#include <string.h>using namespace std;int N;char mat1[11][11],mat2[11][11];char mat3[11][11];bool degree_90(){ int i,j; for(i=1;i<=N;i++){ for(j=1; 阅读全文
posted @ 2011-10-27 12:47
linyvxiang
阅读(166)
评论(0)
推荐(0)
摘要:
USACO的TEXT原文,感觉写的挺好的,外国人写的东西确实比较容易读懂The IdeaSolving a problem using complete search is based on the ``Keep It Simple, Stupid'' principle. The goal of solving contest problems is to write programs that work in the time allowed, whether or not there is a faster algorithm.Complete search exploi 阅读全文
posted @ 2011-10-27 09:41
linyvxiang
阅读(263)
评论(0)
推荐(0)
摘要:
花大力气写的模拟。。。等搜索练好了再回来做,另外把测试数据发一下。。/* ID:linyvxi1 PROG:beads LANG:C++*/#include <stdio.h>#include <string.h>int main(){ FILE* fin=fopen("beads.in","r"); FILE* fout=fopen("beads.out","w"); int n; char str[400]; fscanf(fin,"%d",&n); fsca 阅读全文
posted @ 2011-10-27 09:10
linyvxiang
阅读(226)
评论(0)
推荐(0)

浙公网安备 33010602011771号