- 博客(70)
- 收藏
- 关注
RSS订阅原创 read file
package ef;import java.io.BufferedReader;import java.io.File;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.IOException;public class Readmyfile {public
2017-04-22 10:34:39
260
原创 ewrtert
!!!!!!!!!!!!!!!!!!################coding=gb18030import sysimport osimport json%%%%%%%%%%%%%%%%%%%%reload(sys)#sys.setdefaultencoding("utf-8")sys.setdefaultencoding("gb18030")
2017-04-12 22:10:11
261
转载 Java 实现发邮件
import java.util.Date; import java.util.Properties; import javax.mail.Address; import javax.mail.Authenticator; import javax.mail.Message; import javax.mail.PasswordAuthentication; import
2016-12-30 22:25:23
1932
转载 poj2531
#include #include /*1.等价剪枝：根据对称性剪枝2.无法达最优：提前剪枝 3.换个角度，更高效搜索算法 ：如本题逆向思维求最小内部代价 */int M[20][20],n,ans,arr1[20],arr2[20];void dfs(int Sum,int p1,int p2,int cur) //0 1 0 1{if(Sum
2016-12-28 21:11:50
231
原创 树的层数
#include #include #include #include #include using namespace std;struct ss{ int son1;int son2;}T[10010];int ans=1,Max=0;void dfs(int n){ if(T[n].son1) { ans++; dfs(T[n
2016-12-26 20:49:14
450
原创 poj3278
import java.util.Scanner;class Data{public int posi;public int step;public Data(int posi, int step) {this.posi = posi;this.step = step;}public int getPosi() {return posi;}public
2016-12-26 09:46:31
169
原创 poj1006
import java.util.Scanner;public class Main{ public static void main(String[] args){ Scanner sc=new Scanner(System.in); int count=1; while(sc.hasNext()){ int p=sc.nextInt();
2016-12-25 19:40:46
186
原创 jianzhi减枝
import java.util.Scanner;public class ZhenTi2 {public static int[] data;public static int kong;public static int door0peo;public static int door1peo;public static int door2peo;
2016-12-24 16:19:22
179
原创 test_one
import java.util.Scanner;public class ZhenTi1 {public static int data[];public static int spot;public static int min=0x7fffffff;public static int distance(int door,int doorPeo,int direction)
2016-12-24 15:02:53
231
原创 快速排序
#define SIZE 20int partition(int l, int r, int data[SIZE]){ int v = data[r]; int i = l - 1; int j = r; while(1){ while(data[++i] while(v if(j int t = data[i]; data[i] =
2016-12-09 16:05:24
167
原创 选择排序
void sort(int data[], int N){ for(int i = 1; i int max = 0; int maxIndex = 0; for(int j = i; j if(max max = data[j]; maxIndex = j; } } int tmp = data[i]; d
2016-12-09 16:04:34
171
原创 rheh
package bfspac;class Queue{ public final int SIZE = 10000; public int[] queArrayx; public int[] queArrayy; public int[] label; public int[] pre_x=new int[SIZE];
2016-12-09 15:56:40
559
原创 rge
package ziwang;import java.util.Scanner;public class ZiWangMax { public static int[] ASbu=new int[20]; public static int[] BSbu=new int[20]; public static int ASbu_pc=0; public static int
2016-12-09 15:56:11
367
原创 sgs
package yui;public class W{ public static void sort(int data[], int N){ for(int i = 0;i int max = 0; int maxIndex = 0; for(int j = i; j if(max max = data[j];
2016-12-09 15:55:35
299
原创 reheh
package YesNo;import java.util.Scanner;public class Sangr { public static int[][] thing; public static int[] a; public static int geshu; public static int max; publi
2016-12-09 15:55:08
229
原创 sdgsbgds
package xuanZe;public class XuanZeSort { public static void xuanZeSort(int[] b){ int n=b.length; int min=b[0]; int minIndex=0; int temp; for(int i=0;i for(int j=i;j if(
2016-12-09 15:54:45
174
原创 dshe
package Virus_Virus;public class Virus_BFS { public static int[][] map={{1,1,0,0},{1,0,0,0},{0,1,1,0},{0,1,1,0}}; public static int[] direx={-1,0,1,0}; public static int[] direy={0,1,0
2016-12-09 15:54:08
290
原创 fhhr
package twotwotwo;public class TwoTwo { int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51}; public void quickSort(){
2016-12-09 15:53:46
474
原创 grhe
package TuiLie_pac;class Queue{ public static final int SIZE=100; public int[] data; public int data_fornt; public int data_rear; public Queue(){ data=new int[SIZE]; data_fornt=d
2016-12-09 15:53:24
403
原创 toj2470
package Toj2470;import java.util.Scanner;class Robot { public int x; public int y; public int step; public int faceDire; public Robot(int x, int y, int step, int faceDire){ this.x
2016-12-09 15:52:58
336
原创 fdbs
package threeThreethree;import java.io.FileInputStream;import java.util.Scanner;public class ThreeThreessssss { public static int getInt(int[] b,int n){ int sum=0; for(int i
2016-12-09 15:52:29
632
原创 sdsgw
package Sixsixsix;import java.io.FileInputStream;import java.util.Scanner;public class Six_Six { public static char[] input={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P'
2016-12-09 15:51:53
224
原创 sfs
package sfs;public class AllPaiLie { public static char[] a={'A','B','C','D','E','F'}; public static char[] b={'h','h','h','h','h','h'}; public static int num=0; public static bo
2016-12-09 15:51:28
616
原创 package san_jiao_xing;
import java.io.FileInputStream;import java.io.FileNotFoundException;import java.util.Scanner;public class sanjiao { public static int[][] myMap=new int[50][50]; public static i
2016-12-09 15:50:30
327
原创 kjf
package rggdg;public class Rgg { public static final int SIZE=20; public static int partition(int l, int r, int data[]) { int v = data[r]; int i = l - 1; int j = r; while
2016-12-09 15:49:21
176
原创 package poj2718;
import java.util.Scanner;public class Differ { public static int[] data=new int[10]; public static int data_length; public static int[] quanPai; public static int[] quanPaif
2016-12-09 15:48:06
129
原创 package poj2718;
import java.util.Scanner;public class Differ { public static int[] data=new int[10]; public static int data_length; public static int[] quanPai; public static int[] quanPaiflag; publ
2016-12-09 15:47:31
145
原创 package poj1979;
import java.util.Scanner;class NodeData{ int x; int y; public NodeData(int x,int y){ this.x=x; this.y=y; }}class Queue{ public NodeData[] myNodeData=new NodeData[400]; pu
2016-12-09 15:46:58
195
原创 package poj1664;
import java.util.Scanner;public class Sttt { public static int[] res=new int[20]; public static int respc=0; public static int[][] temp=new int[11][11]; public static int f(int m
2016-12-09 15:46:31
173
原创 package poj1088;
package poj1088;import java.util.Scanner;public class Skining { public static int[][] data; public static int[][] visit; public static int R; public static int C; publ
2016-12-09 15:45:55
178
原创 package OneOneOn;
import java.io.FileInputStream;import java.io.FileNotFoundException;import java.util.Scanner;public class XuanZhePaiXun { public static void xuanZePaiXun(int[] b,int n){ for(int
2016-12-09 15:45:16
184
原创 package ocmatch;
public class Oxpattern { public static final int SIZE=2000; public static int a[]=new int[SIZE]; public static int b[]={'X','O'}; //public static int arrayLength=a.length; p
2016-12-09 15:44:43
173
原创 package new1979;
import java.util.Scanner;public class Woer { public static int[] ceyue; public static int guannum; public static int rennum[]; public static int minfree=0x7fffffff; public static
2016-12-09 15:44:07
145
原创 wgreh
package migong_zuiduanlujin;import java.util.Scanner;public class Migo_zui { //public static int[][] maze={{0,0,1,1,0,0,1,1},{0,0,0,0,1,1,1,1},{0,1,0,1,0,1,1,1},{0,0,0,0,0,0,0,0},{1,0,0,1,0
2016-12-09 15:43:33
176
原创 migo
package migong;public class MiGong { public static int[][] maze={{0,0,1,1,0,0,1,1},{0,0,0,0,1,1,1,1},{0,1,0,1,0,1,1,1},{0,0,0,0,0,0,0,0},{1,0,0,1,0,1,1,1},{0,0,1,0,0,1,1,0},{0,1,0,0,0,0,0,0,},
2016-12-09 15:43:10
204
原创 reh
package lian_xu;public class LianXuMax { public static int[] data=new int[100000]; public static void produceData(){ for(int i=0;i if((int)(Math.random()*1000)>500){
2016-12-09 15:42:44
235
原创 kuaipai
package KuaiSuPaiXu;public class KuaiPai_0 { public static void kuaiSort(int a[],int n ){ for(int i=0;i int min=a[i]; int minIndex=i; for(int j=i;j if(min>a[j]){
2016-12-09 15:42:10
273
原创 rdheed
package kaoshiyi;import java.util.Scanner;public class Kaoshiyi { public static int s[][]; public static int bhang[]; public static int[] hang_min; public static int zongmin; public
2016-12-09 15:41:35
140
原创 char
package javashuru;import java.util.Scanner;public class InPut { public static void main(String[] args){ Scanner sc=new Scanner(System.in); char a[]=new char[3]
2016-12-09 15:40:45
125
原创 dfbdhd
package fsf;public class Sfsdf { static char[] data={0,'A','B','C','D','E','F','G'}; static int SIZE=data.length; public static void preOrder(int N){ if(N>=SIZE/2){ Syst
2016-12-09 15:39:12
187
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人