SYLAS_LINUX-CSDN博客

原创串口重定向

#include <stdio.h>#include <string.h>#include <sys/types.h>#include <errno.h>#include <sys/stat.h>#include <fcntl.h>#include <unistd.h>#include <termios.h>#include <stdlib.h>#include <signal.h

2015-10-30 10:38:26 1907

原创田忌

#include <stdio.h>#include <limits.h>int N;int a[101];int b[101];int Answer;void sort(){ int i,j,tmp; for(i = 1; i <= N; i++) { for(j = i+1; j <= N; j++) {

2015-10-25 11:36:07 521

转载 tarjan

#include <stdio.h>#include <string.h>int map[10][10];int stack[10];int top;int instack[10];int dfn[10], low[10];int index;int M,N;void tarjan(int v){ int j; dfn[v] = low[v] = ++index;

2015-10-25 11:34:13 398

原创 suffix array

#include <stdio.h>#include <string.h>char num[4001];int suffix[4001];int mark[4001];int comparel(char* a, char*b){ int i; for(i = 0; a[i] !=0 && b[i] != 0; i++) { if(a[i] != b[

2015-10-25 11:31:51 707

原创递归

#include <stdio.h>int N;int data[26][26];int look(int vpos, int hpos){ int sum = 0; if(data[vpos][hpos] == 1) { sum++; data[vpos][hpos] = 0; if(hpos<N)

2015-10-25 11:26:13 357

原创 password

#include <stdio.h>#include <string.h>char pass[1002];int main(void){ int tc, T; int i, j, dep, maxdep; int tmpi,tmpj, flag; setbuf(stdout, NULL); scanf("%d", &T); for(tc = 0;

2015-10-25 11:22:57 469

原创括号匹配

#include <stdio.h>#include <string.h>char a[31],name[31];int b[31],num,top;void getname(){ int i,popnum; char tmp; popnum = 0; for(i = 0; name[i] != 0; i++) { if(name[i]

2015-10-25 11:19:03 388

原创图着色

#include<stdio.h>int color[100];int c[100][100];//存储n个顶点的无向图的数组int colok(int k )//判断顶点k的着色是否发生冲突{ int i,j; for(i=1;i<k;i++) if(c[k][i]==1&&color[i]==color[k]) return 0;

2015-10-25 11:13:21 647

原创硬币兑换

#include <stdio.h>#include <string.h>int Answer;int main(void){ int T, test_case; int types,coin[11],changes; int i,j; int m[64002]; // freopen("input.txt", "r", stdin); setb

2015-10-25 11:11:59 681

原创匈牙利算法示例

#include <stdio.h>#include <string.h>int N,M;int map[201][201];int pair[201],visit[201];int num;int dfs(int v){ int i; if(visit[v] == 0) { visit[v] = 1; for(i = 1; i <

2015-10-25 11:08:37 471

原创 dfs穷举

#include <stdio.h>#include <string.h>int Answer, N, sum;int map[13][13];int visited[13];void dfs(int v, int k){ int i; if(k == N && map[v][1] > 0) { if(sum + map[v][1] < Answer

2015-10-25 11:05:18 502

原创 settimer示例

settimer

2015-10-22 17:47:18 864

原创 prim

#include <stdio.h>#include <string.h>#define MaxInt 0x3f3f3f3fint Answer;int map[102][102];int visited[102],low[102];int n;int prim(){ int i,j,pos,min,result=0; memset(visited,0,sizeof(visi

2015-10-22 17:28:51 763 2

原创宽度优先示例

宽度优先

2015-10-22 17:19:24 473

原创大小端示例

#include typedef unsigned char uint8;int isBigEndian(){ int i = 1; if( *(uint8*)(&i) == 1) return 0; else return 1;}int main(){ if(isBigEndian()) {

2015-10-22 17:07:21 354

原创使用mmap读写开发板寄存器地址

准备数据：需要访问的寄存器的物理地址，访问的内存大小。#include #include #include #include #include #define I2C_BASE 0x1E78A000#define MAP_SIZE 0x1000#if 0#define MAP_SIZE 4096UL#define MAP_MASK (MAP_SIZE-1

2015-10-22 17:00:53 1478

SYLAS_LINUX的博客