jianupc

摘要： 字符串分析研究进展 梅宏 阅读全文

摘要： 1.编写servlet，在tomcat\webapps目录下新建文件Test，Test目录如下Test|classes web.xml|test01|Servletfirst.javaServletfirst.java文件内容如下 1 package test01; 2 3 import java... 阅读全文

摘要： 1.if语句（python中没有switch语句，可用if……elif……else代替）格式： if 表达式： #语句 else： #语句eg：number = 23guess = int(raw_input('Enter an integer:'))if guess == numb... 阅读全文

摘要： 非降序排列 1 #include 2 #include 3 using namespace std; 4 const int N = 10; 5 int a[N]; 6 int main() { 7 //freopen("in.txt", "r", stdin); 8 int n; 9 scanf("%d",&n);10 for (int i = 0; i 0; j--) {16 if (key >= a[j - 1])break;17 a[j] = a[j - 1];18 }19 ... 阅读全文

摘要： OulipoTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17795Accepted: 7160DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pair normal, mais tout s’a 阅读全文

摘要： Park VisitTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1826Accepted Submission(s): 798Problem DescriptionClaire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in t 阅读全文

摘要： Cow MarathonTime Limit:2000MSMemory Limit:30000KTotal Submissions:3195Accepted:1596Case Time Limit:1000MSDescriptionAfter hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The marath 阅读全文

摘要： Hie with the PieTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3160Accepted: 1613DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wai 阅读全文

摘要： Bomb GameTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2951Accepted Submission(s): 984Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each 阅读全文

摘要： Katu PuzzleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6714Accepted: 2472DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolean operator op (one of AND, OR, XOR) and an integer c (0 ≤ c ≤ 1). One Katu is solvable if one can find each 阅读全文