08 2021 档案
摘要：find -name gmm-copy ./kaldi/src/gmmbin/gmm-copy ./kaldi/src/gmmbin/gmm-copy --binary=false ~/kaldi/egs/yesno/s5/exp/mono0a/final.mdl final.mdl.txt
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; const int maxn = 1005; const int N = 1000005; int data[maxn][maxn]; int nex
阅读全文
摘要：#include<iostream> #include<cstring> #include<bitset> #include<cstdio> using namespace std; const int maxn = 1005; bitset<maxn>data[maxn]; int n,m; vo
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; const int maxn = 100005; int data[maxn]; int n,m; bool test(int min){ int i,sum=0,group=1; fo
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; struct Node{ int v,b; }node[25]; bool cmp(Node n1,Node n2){ return n1.v<n
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<queue> #define ll long long #define N 50005 #define INF (1LL<<60) using namespace std;
阅读全文
摘要：#include<cstdio> int main(){ int a,b,c,t; scanf("%d",&t); while(t--){ scanf("%d%d%d",&a,&b,&c); if((b==9&&c==30)||(b==11&&c==30)||!((b+c)&1))printf("Y
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; struct Node{ char c; char d[5]; }node[30]; int main(){ char data[30][5] = {
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; char data[10005][20],t[20],ans[10005][20]; int cnt_ans,count; void cmp(){ i
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<queue> using namespace std; int ans; int data[10][10],visit[10][10]; struct Node{ int x
阅读全文
摘要：#include<iostream> #include<cstring> #include<cmath> #include<cstdio> using namespace std; struct Node{ int p,l,x; int di[105]; int d[105]; }node[105]
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int i,j,k,t,n,data[50],sum = 0; scanf("%d",&n); for(i=2;;i++){ sum += i; data[i]
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int t,ansa,ansb,data[5],target[5]; char a[5],b[5]; scanf("%d",&t); while(t--){ an
阅读全文
摘要：#include<iostream> #include<cstdio> //#include<cmath> using namespace std; const int maxn = 50005; int log(int n){ int count = 0; while(n){ count++; n
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int data[110]; int main(){ int k,n,i,j,p,pos,count; scanf("%d",&k); while(k
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ int len,i,j; double sum; char data[80]; while(s
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int l,n,i,j,len; bool flag1,flag2,flag3; char a[5] = {'a','e','
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int cow[1005],edge[1005][1005],k,n,m,visit_sum[1005]; bool visit[1005]; voi
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int yh[15][15]; void init(){ int i,j; for(i=1;i<=10;i++){ yh[i][1] = 1; y
阅读全文
摘要：#include<iostream> #include<ctime> #include<algorithm> #include<cstdio> using namespace std; long long data[10005],d[10005]; void init(int n){ int j;
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int prime[20005]; void init(){ int i,j; memset(prime,0,sizeof prime); prime
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cmath> #include<cstdio> using namespace std; struct Node{ int x,y; }*node; bool cmp(Node n1,Node n2){
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; int data[26] = {2,5,4,4,1,6,5,5,1,7,6,3,5,2,3,5,7,2,1,2
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; void init(int*data,bool*visit){ int t = 0; data[0] = 0; for(int i=1;i<=5000
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int ancestor[900]; struct Node{ int x,y,value; }node[900]; bool cmp(Node
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; char c[45][15]; int data[45][15],count,M; int edge[405][405],link[405],visi
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int i,j,k,n,h,h_t,f[30],d[30],sheng[30],t[30],ans_t[30][30],sum
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> #include<cstring> using namespace std; int n; double data[205][205],x[205],y[205]; void floyd(){ i
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int data[205][205],link[205],visit[205],count,n,m; bool dfs(int x){ for(int
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ char s[260],t[20],*p,old; while(scanf("%s",s)==1){ while(scanf(
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int data[105][105],count,m,n; bool dfs(int direction,int i,int j){ //defini
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int n,visit[505],edge[505][505],link[505]; bool hungery(int m){ for(int i=1
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int i,j,k,f,v,t,a[100][100],dp[100][100]; scanf("%d%d",&f,&v);
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int i,j,col,data[30],ans[30][305],pos[305]; char a[4][100]; mem
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int p,node_cnt,n,m; int a[200005],b[200005],rt[6000005],lc[6000005],rc[60
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int n,ans[4],t,i,j; char a[35]; scanf("%d",&n); while(n--){ sca
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int n,flag,edge[30][30],indegree[30],indgr_tmp[30],ans[30]; void topo(){ in
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<cmath> #include<queue> using namespace std; queue<int>q; int prime[9999],k,pre[9999]; i
阅读全文
摘要：#include<iostream> #include<queue> #include<cstring> #include<cstdio> using namespace std; int n,k,ans; int data[100005]; void bfs(){ memset(data,-1,s
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; int main(){ char a[105][105]; int i,j,k,n,m; while(scan
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define ll long long #include<cmath> void gcd(ll a,ll b,ll&d,ll&x,ll&y){ if(!b){ d = a;x = 1;
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<queue> using namespace std; struct Node{ int x,y; Node(){ x = 0; y = 0; } Node(int a,in
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d); printf("5*(5-(1/5))\n"); return 0; }
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; struct Node{ int data[1005]; int n; Node(){ n = 1; memset(data,0,sizeof dat
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int i,j,len; char data[1005],ans[1005]; while(gets(data)){ len
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int gcd(int a,int b){ int t; if(a==0)return b; while(b){ t = a%b; a = b; b
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> using namespace std; #define ll long long
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; #define ll long long const ll maxn = 20005; typedef pai
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ int t,i,kase; long long n; double ans; scanf("%d",&t); kase = 1;
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int t,i,kase; long long n,data[50]; data[1] = 2; data[2] = 3; for(i=3;i<=45;i++){
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int data[30][30]; void yanghui(){ int i,j; for(i=0;i<=26;i++){ for(j=0;j<=i
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int i,t,w,a[25],data[25],ans[25],dd,len,count; bool flag; scanf
阅读全文
摘要：readlink -f /usr/bin/vi 找出链接文件的最后一环 普通模式：h(左移一个字符)，j(下移一行)，k(上移一行)，l(右移一个字符)，G(移到缓冲区的最后一行)，num G(移动到缓冲区的第num行)，gg(移到缓冲区的第一行) 命令行模式：w filename(将文件保存到另一
阅读全文
摘要：cat /etc/passwd /usr/sbin/useradd -D 查看所用linux系统中的默认值 useradd -m test ls -al /home/test useradd -D -s /bin.tsch usermod -L（usermod -U）锁定（解锁）账户 passwd
阅读全文
摘要：printenv 或者 env 打印全局变量 printenv HOME 或者 echo $HOME 打印个别环境变量 set 显示所有变量 my_variable = "Hello World" 设置局部用户变量 export my_variable 将变量导出到全局 unset my_varia
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define ll long long ll m,a,b,k[10005]; ll get_ans(ll n){ ll i,tmp = 0; for(i=1;i<n;i++) tmp
阅读全文
摘要：#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int main(){ int i,t,n,data[1005],ans,x,y; scanf("%d",&t); while(t--){ sca
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int maxn = 250005; char data[maxn][2][15]; int number = 0; int degree
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; int main(){ char data[205]; scanf("%s",data); int len =
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int k,t,w,h,sx,sy,sum,ex,ey; int idx[45][45],data[45][45],ans[3]; char c[45
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int row,col,n,k; int idx[26][26],ansx[900],ansy[900]; void print(){ printf(
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int main(){ long long n,i,data[20005],p,q,sum; scanf("%lld",&n); for(i=0;
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int row,col,start,i,j,data[15][15],step,s1,s2; char c[15][15];
阅读全文
摘要：CLI command line interface的缩写 echo $BASH_SUBSHELL 0表示没有子shell，大于0表示存在子shell jobs 显示后台作业信息 coproc My_job { sleep 10; } 协程 type -a ps 显示命令的格式 which ps 只
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> #include<cstring> using namespace std; #define ld long double int main(){ double n,p; while(scanf(
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; char c[10][20]; int data[10][20],idx[10][20],k,score; struct Node{ int x,y,
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; const int maxn = 105; int a[maxn][maxn][2]; int n,data[
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; int d[11],n,s,visit[50]; bool dfs(int num){ int i,j,wid
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; const int maxn = 105; int main(){ int h,w; double sum=0; bool count; char c[maxn]; scanf("%d%
阅读全文
摘要：sort -n file2 按数值排序file2 sort -t ':’ -k 3 -n /etc/passwd du -sh * | sort -nr按输出占用空间大小降序排列 grep three file1 搜索数据 grep -v t file1 输出不匹配的行 grep -e t -e f
阅读全文
摘要：ps 显示当前控制台属于当前用户的进程及ps命令本身 ps -e 显示系统上运行的所有进程 ps -f 显示完整格式的输出 ps -l 显示长列表 S列：进程状态（O正在运行；S休眠；R可运行，正等待运行；Z僵化，进程已结束但父进程已不存在；T停止） ps –forest 显示进程的层级信息 nvi
阅读全文
摘要：20210802 ls -F显示，目录带/文件不带 ls -FR 递归显示目录和文件 ls -d 只显示当前文件夹 ls -l 显示长列表，详细信息 第一个变量：目录(d)、文件(-)、字符型文件(c),块设备(b) ls -l my_script 显示my_script的详细信息 touch te
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int s,len,p,i,j,k; char n[10],d[25][100]; while(scanf("%d%s",&s
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int i,j,k,len[10],p,kase=1; char a[15],d[10][15]; bool flag,fla
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; const int maxn = 65; int d[10],p[10]; char a[maxn]; int t[maxn]; bool flag;
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int m,t,u,f,d,n,l[3],tmp,i,ans,sum; char a; scanf("%d%d%d%d%d",&m,&t,&u,&f,&d); l
阅读全文
摘要：#include<iostream> #include<algorithm> using namespace std; struct Node{ int id,a1,a2; }vote[50005]; bool cmp(struct Node v1,struct Node v2){ return v
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int main(){ int n,s,ans,data[20005]; scanf("%d%d",&n,&s); for(int i=0;i<n
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; bool cmp(int a,int b){ return a>b; } int main(){ int t,n,a[20005]; scanf(
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ double n,k,s,t,r,s1,sum,turn,ans; scanf("%lf%lf",&n,&k); while(k-
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cmath> using namespace std; const double PI = 3.141592653589; int main(){ double w,h,v1,v2,v3,v4,x; while
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; const int maxn = 505; int n; int a[maxn][maxn],b[maxn][maxn],c[maxn][maxn
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstring> #include<cstdio> #include<algorithm> #include<ctime> #define ll long long using namespace std; co
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int c,l,m,len[10005],p1,p2,s1,s2; char lr[10005][10]; scanf("%d
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,seed,d[20][20]; scanf("%d%d",&n,&seed); for(int j=0;j<n;j++){ for(int i=0;i
阅读全文
