摘要：
int read(int arr[]){ int i=0,n,flag=0; FILE *fp; if((fp=fopen("shuru.txt","r"))==NULL){ printf("cantfind the file"); } while(!feof(fp)){ if(flag==0){ 阅读全文
摘要：
利用二维数组储存，每一维储存一个单词；利用while(~scanf("%s",&a[i]))输入用i记录输入的单词总数，然后反向遍历就行 #include<stdio.h>int main(){int i=0;char a[101][101];while (~scanf("%s",&a[i])){i 阅读全文
摘要：
原理及python实现 graph：保存图，类似邻接表 costs：保存从起点到某点的最小花费 parents：保存节点的父节点 processed：用于保存已经处理过的点 graph={} graph["start"]={} graph["start"]["a"]=6 graph["start"] 阅读全文
摘要：
Hurdles of 110m Time Limit: 2000 msMemory Limit: 65536 KB In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the pros 阅读全文
摘要：
B. Petr and a Combination Lock time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petr has j 阅读全文
摘要：
Tokens on the Segments Time Limit: 1000 msMemory Limit: 65536 KB Consider segments on a two-dimensional plane, where the endpoints of the -th segment 阅读全文
摘要：
Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15904 Accepted Submission( 阅读全文
摘要：
Largest Submatrix of All 1’s Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 9943 Accepted: 3538 Case Time Limit: 2000MS Description Given 阅读全文
摘要：
Largest Rectangle in a Histogram Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 34844 Accepted: 11339 Description A histogram is a polygon 阅读全文
摘要：
A Bug's Life Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 52438 Accepted: 16876 Description BackgroundProfessor Hopper is researching t 阅读全文