原创 map 一面牆磚
# include<stdio.h> # include<iostream> # include<algorithm> # include<string.h> # include<map> # include<set> using n
2019-03-23 06:00:32
原创 快速排序
#include <stdio.h> int a[101],n;//定義全局變量，這兩個變量需要在子函數中使用 void quicksort(int left, int right) { int i, j, t, temp; if(
2019-03-07 18:06:54
原创 時鐘表
<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> <title>時鐘</title> </head> <style> div{ width: 500px
2019-01-02 18:13:52
原创 時鐘表2（繁瑣）
<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> <title>時鐘</title> </head> <style> div{ width: 500px
2019-01-02 18:13:52
原创 不重複數字
# include<stdio.h> # include<algorithm> # include<iostream> # include<set> using namespace std; int main(){ int t,n
2018-12-28 18:52:31
原创 {A} + {B}
# include<stdio.h> # include<algorithm> # include<set> using namespace std; int main(){ int n,m,num; set<int>s; w
2018-12-28 18:52:31
原创 Let the Balloon Rise
# include<stdio.h> # include<map> # include<string> # include<iostream> using namespace std; int main(){ map<string
2018-12-12 17:30:27
原创 打印沙漏
# include<stdio.h> # include<string.h> # include<algorithm> using namespace std; int a[120]; int main(){ int T; sca
2018-11-04 03:03:15
原创 [藍橋杯][2013年第四屆真題]買不到的數目
方法： a*b-(a+b) # include<stdio.h> int main(){ int a,b; scanf("%d %d",&a,&b); printf("%d\n",a*b-a-b); return 0; }
2018-11-04 03:03:15
原创 數據結構實驗---棧和隊列
#include<stdio.h> #include<stdlib.h> #define N 105 int a[N]; struct node { int data; node *next; }*h; void LinkStac
2018-11-04 03:03:15
原创 數據結構實驗---二叉排序樹的創建
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; typedef struct node { int key; st
2018-11-04 03:03:15
原创 選項卡
<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> <title>選項卡</title> <style type="text/css"> #div1 .act
2018-10-20 02:56:18
原创 鏈表的建立、查找、插入、刪除
#include<iostream> #include<algorithm> #include<stdio.h> #include<malloc.h> #include<stack> using namespace std; typed
2018-10-20 02:56:18
原创 HDU--1686 Oulipo
# include<bits/stdc++.h> using namespace std; const int maxn=1e6+30; char s[maxn]; char t[maxn]; int nxt[maxn]; int
2018-10-20 02:56:18
原创 HDU--2087 剪花布條
# include<stdio.h> # include<string.h> # include<algorithm> using namespace std; # define maxn 1200 char s[maxn];
2018-10-20 02:56:18
2