[NOJ]算法设计
子澍
这个作者很懒,什么都没留下…
展开
-
[NOJ]算法1205.活动安排
贪心算法#include<stdio.h>int n, begin[1000], end[1000], num, endtime;void Sort();int main (){ int i, j; scanf ("%d", &n); for (i = 0; i < n; i++) { scanf ("%d%d", &begin[i]...原创 2019-11-14 20:16:00 · 470 阅读 · 0 评论 -
[NOJ][算法实验二]1006.堡垒问题
#include <stdio.h>char Castle[4][4];int max = 0, num = 0, t;int check (int row, int col);void dfs(int n, int row, int col);int main (){ int i, j, n, k[100], f; while (1) { scanf ("...原创 2019-11-14 19:47:40 · 509 阅读 · 0 评论 -
[NOJ][算法实验二]1009.迷宫问题
#include <stdio.h>int sign = 0, IN_m, IN_n, OUT_m, OUT_n; char MAZE[20][20];void SearchMaze (int x, int y);int main (){ int i, j, k, ans[100]; int times; scanf ("%d", ×); f...原创 2019-11-14 18:28:36 · 460 阅读 · 0 评论 -
[NOJ][算法实验二]1008.素数环问题
#include <stdio.h>int circle[20], already[20], sign;int IsPrime (int n);int check (int n);void Output ();void dfs (int n);int main (){ dfs(0); return 0;}int IsPrime (int n){ int...原创 2019-11-14 18:15:43 · 600 阅读 · 0 评论 -
[NOJ][算法实验二]1005.装载问题
0/1背包问题的变体#include <stdio.h>int sign = 0, n, c1, c2, weigh[100];void FoundPath(int c1_w, int c2_w, int times);int main (){ int i, j = 0, c1_w = 0, c2_w = 0, times = 0, ans[100]; while ...原创 2019-11-14 18:06:37 · 293 阅读 · 0 评论 -
[NOJ][算法实验二]1004.0-1背包问题
非常经典的回溯法题目#include <stdio.h>int vmax = 0, n, c, weigh[100], value[100];void FoundPath(int w_a, int v_a, int times);int main (){ int i, j = 0, w_a = 0, v_a = 0, times = 0, ans[100]; whi...原创 2019-11-14 18:00:19 · 518 阅读 · 0 评论 -
[NOJ][算法实验一]1574.求第k小数
本题是一个类似于快排但又略有不同的题#include <stdio.h>int QuickSortK (int A[], int low, int high, int k);int main (){ int i, n, A[10000], k; scanf ("%d", &n); for (i = 0; i < n; i++) scanf ("%d", ...原创 2019-11-14 17:32:57 · 365 阅读 · 0 评论 -
[NOJ][算法实验一]1243.循环赛日程表
#include <stdio.h>#include <math.h>int table[128][128];void Tournament (int r, int c, int n){ if(n == 1) return ; int half = n / 2; table [r + half][c + half] = table [r][c]; ta...原创 2019-11-14 17:27:50 · 385 阅读 · 0 评论 -
[NOJ][算法实验一]1324.穷举所有排列
#include <stdio.h>int n, result[100];void change(int k);void output();int main (){ int i; scanf ("%d", &n); for (i = 0; i < n; i++) result[i] = i; change(0); return 0;}...原创 2019-11-14 17:23:58 · 379 阅读 · 0 评论 -
[NOJ][算法实验一]1323.穷举n位二进制数
#include <stdio.h>int n, A[20];void Change (int m);void Display ();int main (){ int i; scanf ("%d", &n); for (i = 0; i < n; i++) A[i] = 0; Change (0); return 0; }void Chan...原创 2019-11-14 17:02:23 · 289 阅读 · 0 评论 -
[NOJ][算法实验一]1141.走迷宫
#include <stdio.h>int sign = 0, MAZE[20][20], m, n, IN_m, IN_n, OUT_m, OUT_n;void SearchMaze (int x, int y);int main (){ int i, j; scanf ("%d%d", &m, &n); scanf ("%d%d", &IN...原创 2019-11-14 16:46:19 · 392 阅读 · 0 评论 -
[NOJ][算法实验一]1003.快速排序
#include <stdio.h>void QuickSort(int n, int A[], int low, int high);int main () { int i, n, A[100]; scanf ("%d", &n); for (i = 0; i < n; i++) scanf ("%d", &A[i]); QuickSort (n,...原创 2019-11-14 16:36:59 · 487 阅读 · 0 评论 -
[NOJ][算法实验一]1002.归并排序
#include <stdio.h>#include <malloc.h>void Sort(int List[], int low, int mid, int high);void MergePass(int List[], int length, int L_length);void MergeSort (int List[], int L_length);...原创 2019-11-14 16:35:28 · 366 阅读 · 0 评论 -
[NOJ][算法实验三]1042.电子老鼠闯迷宫
这道题是用分支限界法的一道题目,与之前用回溯法的走迷宫问题稍有不同。#include <stdio.h>#include <queue>using namespace std;int map[12][12];int xin, yin, xout, yout, steps = 0;int walk[4][2]= //走一格后的横纵坐标变化{ 0, -1...原创 2019-11-13 19:47:51 · 609 阅读 · 0 评论 -
[NOJ][算法实验一]1001.二分查找
非常基础的一道题#include <stdio.h>void Search (int List[], int Target, int low, int high); int main (){ int i, List[1000], Target[5000], L_amount, T_amount; scanf ("%d", &L_amount); for (i ...原创 2019-11-14 16:30:35 · 388 阅读 · 0 评论