随笔分类 -  算法

• 北邮oj 题
  摘要：Every year,prince prepares a birthday gift for princess.The gift is a box,which is decorated with jewel.As princess grows older,the level of the jewel 阅读全文
  posted @ 2016-03-23 19:17 wpzy 阅读(1406) 评论(0) 推荐(0)
• 插入排序
  摘要：1 package insertSort; 2 3 import java.util.Scanner; 4 5 public class insertSort { 6 static int n; 7 public static void main(String args[]){... 阅读全文
  posted @ 2015-12-09 23:40 wpzy 阅读(195) 评论(0) 推荐(0)
• dg
  摘要：1 package excel; 2 3 import java.util.Scanner; 4 5 public class doExcel { 6 public static void main(String args[]){ 7 8 9 ... 阅读全文
  posted @ 2015-12-06 21:03 wpzy 阅读(172) 评论(0) 推荐(0)
• 算法笔记 冒泡排序
  摘要：package excel;import java.util.Scanner;public class doExcel { public static void main(String args[]){ Scanner input=new Scanner(Syst... 阅读全文
  posted @ 2015-12-05 14:10 wpzy 阅读(149) 评论(0) 推荐(0)
• 算法笔记 选择排序
  摘要：1 package excel; 2 3 import java.util.Scanner; 4 5 public class doExcel { 6 public static void main(String args[]){ 7 8 Scanne... 阅读全文
  posted @ 2015-12-05 11:12 wpzy 阅读(157) 评论(0) 推荐(0)
• 算法笔记
  摘要：package excel;import java.util.Scanner;public class doExcel { public static void main(String args[]){ Scanner input=new Scanner(Syst... 阅读全文
  posted @ 2015-12-05 10:54 wpzy 阅读(204) 评论(0) 推荐(0)
• 算法笔记5 迷宫
  摘要：1 #include 2 #include 3 using namespace std; 4 const int INF=100000000; 5 typedef pair P; 6 /* run this program using the console pauser or add you... 阅读全文
  posted @ 2015-11-24 15:36 wpzy 阅读(456) 评论(1) 推荐(0)
• 算法笔记4
  摘要：1 #include 2 #include 3 4 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ 5 void graph(int nu... 阅读全文
  posted @ 2015-11-20 15:02 wpzy 阅读(155) 评论(0) 推荐(0)
• 算法笔记3
  摘要：1 #include 2 #include 3 4 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ 5 6 int main(int a... 阅读全文
  posted @ 2015-11-20 14:41 wpzy 阅读(174) 评论(0) 推荐(0)
• 算法笔记2
  摘要：#include "stdio.h"#include "stdlib.h"#include "malloc.h"//从n根棍子中，找出能组成三角形的周长最大的三根棍子int main(){ int n; scanf_s("%d",&n); int *a = (int*)malloc(sizeof(i... 阅读全文
  posted @ 2015-11-15 21:08 wpzy 阅读(157) 评论(0) 推荐(0)
• 算法笔记
  摘要：给定n个数，以及数k，判断是否能够从n个数中找出任意个数，使其和等于k 1 #include 2 #include 3 using namespace std; 4 int sum_out; 5 int *a; 6 int max; 7 bool dfs(int i,int sum){ 8 ... 阅读全文
  posted @ 2015-11-14 22:11 wpzy 阅读(195) 评论(0) 推荐(0)