混了个铜牌= =今年的比赛很多队伍都卡在了C和D,所以AC三道题目就能拿铜了… 比赛计分板 (学军中学和杭二中占了前十名大部分,中学生真厉害 Problem 继续阅读

概要 mybatis是一个持久层框架 输入映射:preparedStatement中的输入参数自动进行输入映射 输出映射:查询结果集灵活映射成java对象 和 继续阅读

前几天手机升级到 Android 7.0,发现获取闪讯密码客户端闪退了,我怀疑是运行时权限的问题,因为是必备的软件,所以想自己重新写一个。 网上搜了一下,直接发短信是用 继续阅读

速查表 Git 常用命令速查表 图片来自网络 Git从零开始 配置身份 配置你的Git身份,包括用户名和密码,用户名最好是和GitHub用户名保持一致。--globa 继续阅读

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C – C Programming Language, M – Mathematics (Calculus or Linear Algebra), and E – English. At the mean time, we encourage students by emphasizing on their best ranks — that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student. For example, 继续阅读

This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 继续阅读

The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop. For a given request list, you are to compute the total time spent 继续阅读

题目给出K个整数。一个连续的片段是指 N[i], N[i+1], …, N[j](1≤i≤j≤K),最大片段是指拥有最大片段和的片段。比如给出数据{ -2, 11, -4, 13, -5, -2 },它的最大片段是 继续阅读

基于Intent的通信 intent对象是component用来和操作系统通信的媒介工具,intent可以告诉ActivityManager该启动哪个 a 继续阅读

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly 继续阅读

并查集,即不相交集合,用森林表示。主要操作有初始化、查询、合并。 初始化 每个元素都建立一个只含自己的集合,每个元素都是自己所在集合的代表,把每个元素的父 继续阅读

平衡树(自平衡二叉排序树)前提是一棵二叉排序树。 如果把结点 1、2、3、4、5 依次插入到二叉排序树,得到的结果: 很明显这棵树已经退化为链表,效率降低,需 继续阅读

This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 继续阅读

C++中的字符串切割函数substr() substr(int index , int length) 第一个参数 index 是起始位置,第二个参数是 length,即截取的长度。 如果未指定 length,截取到字符串 继续阅读

在n×n的方阵里填入1,2,3,…,n×n,要求填成蛇形。例如,n=4时,方阵为 10 11 12 1 9 16 13 2 8 15 14 3 7 6 5 4 方阵中空格只为便于判断规律,不必严格输 继续阅读

PAGE 2 / 3