`
200830740306
  • 浏览: 105946 次
  • 性别: Icon_minigender_1
  • 来自: 广州
社区版块
存档分类
最新评论
文章列表

poj2533

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj2533 * 注意是递增序列,不是非递减 * @author NC */ public class Poj2533 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (s ...

poj2487

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj2487 * @author NC */ public class Poj2487 { private static int partition(int[] array, int low, int high) { int key = array[low]; //用子表的第一个记录作为枢轴记录 while (low < high) {// ...

poj2413

package easy; import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * poj2413 * @author NC */ public class Poj2413 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); ...

Poj2390

package easy; import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * Poj2390 * @author NC */ public class Poj2390 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); ...

poj2389

package easy; import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * poj2389 * @author NC */ public class Poj2389 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); ...

poj2388

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** *poj2388 * 排一次序后输出中位数,但效率太低了。 * 用计数排序可能好一点,当找到中位数就可以停止排序了。 * @author NC */ public class Poj2388 {     public static void ...

poj2350

package easy; import java.util.Scanner; /** * poj2350 easy * @author NC */ public class Poj2350 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); if (scan.hasNext()) { int n = scan.nextInt(); for (int i ...

poj2328

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** * *poj2328 * 刚开始没有想清楚,猜数时,可能出现一些痴的情况 * @author NC */ public class Poj2328 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); ...

poj2305

package easy; import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; /** * * poj2305 * 进制转换 * @author NC */ public class Poj2305 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(Syste ...

Poj2301

package easy; import java.util.Scanner; /** * POJ2301 easy * 或许英语能力太差了,刚开始看时,居然不懂。。。。。。 * @author NC */ public class Poj2301{ public static void main(String[] args) { Scanner scan = new Scanner(System.in); if (scan.hasNext()) { int n = scan.nextI ...

poj2105

package easy; import java.util.Scanner; /** *poj2105 easy * 这道题是ip地址的转换。以后能也得用到,就封装起来。其中两个方法是在网上找的,懒得写 * 现在才知道,原来parse这个函数可以指定被解析的字符串的基数。 * 比如“101110”,指定2时,就当成二进制来处理,不指定或者是10的话,就当成十进制数 * @author NC */ public class Poj2105 { public static void main(String[] args) { ...

POJ2027

package easy; import java.util.Scanner; /** * POJ2027 easy * @author NC */ public class Poj2027 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); if (scan.hasNext()) { int n = scan.nextInt(); for (int i ...

poj2017

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** *poj2017 * @author NC */ public class Poj2017 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { ...

Poj2000

package easy; import java.io.BufferedInputStream; import java.util.Scanner; /** *poj2000 * @author NC */ public class Poj2000{ public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { ...

poj1978

package easy; import java.io.BufferedInputStream; import java.util.LinkedList; import java.util.Scanner; /** * *poj1978 *简单模拟 * @author NC */ public class Poj1978 { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in ...
Global site tag (gtag.js) - Google Analytics