cos 桶相册，终于！！终于来了！！，idea 来自 [兰州小红鸡 - 给 hexo 静态博客添加动态相册功能]， 功能虽好，但是还是先友情提示！ 开放 API 是一个很危险的操作，意味着你的 cos 桶里面的所有资源包括目录结构都暴露的整个世界中，所以建议不要放一些比较私密的照片，保护自己的隐私，提防不良用心之人。下面就开始吧！
fatal: Unable to create '/xxx/xx/.git/index.lock': File exists.\n\nIf no other git process is currently running, this probably means a\ngit process crashed in this repository earlier. Make sure no other git\nprocess is running and remove the file manually to continue.
Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.
What is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?
Input\n
The single line contains two space separated integers n, m (0 < n ≤ 10000, 1 < m ≤ 10).
大意： 要从城市 1 到城市 N 运送货物，有 M 条道路，每条道路都有它的最大载重量，问从城市 1 到城市 N 运送最多的重量是多少。 其实题意很简单，就是找一条 1–>N 的路径，在不超过每条路径的最大载重量的情况下，使得运送的货物最多。一条路径上的最大载重量为这个路径上权值最小的边；\n更新\">
#include<stdio.h>\n#include<string.h>\n#include<algorithm>\nusingnamespacestd;\n\nconstintINF=99999999;//设为无穷大\nintmaps[1005][1005],v[1005],d[1005];//v 表示是否已经过遍历 d 表示从源到点当前最短路\nintn;\n\nvoidDijkstra(ints,intt)\n{\ninti,j,k,mini;\nfor(i=1;i<=n;i++)\nd[i]=INF;//除源点设为 0 距离外 其他先设为无穷大\nd[s]=0;\nfor(i=1;i<=n;i++)//n 点循环 n 次 , 找出 n 个 k, 找 n 个点\n{\nmini=INF;\nk=-1;\nfor(j=1;j<=n;j++)//在所有未标记点中 选 d 值最小的点\nif(!v[j]&&d[j]<mini)\nmini=d[k=j];\n\nv[k]=1;//标记节点\nif(k==t)\n{\nprintf("%d\\n",d[t]);\nreturn;\n}\nfor(j=1;j<=n;j++)\nif(!v[j]&&(d[k]+maps[k][j])<d[j])//表示从 k 出发的点，对于所有边，更新相连点\nd[j]=d[k]+maps[k][j];\n}\n}\n\nintmain()\n{\nintT,i,j,x,y,D;\nwhile(scanf("%d %d",&T,&n)!=EOF)\n{\nmemset(v,0,sizeof(v));//清除标记\nfor(i=1;i<=n;i++)\nfor(j=1;j<=n;j++)\nmaps[i][j]=INF;\n\nfor(i=1;i<=T;i++){\nscanf("%d%d%d",&x,&y,&D);\nif(maps[x][y]>D)//可能有多条路，只记录最短的\nmaps[x][y]=D,maps[y][x]=D;\n}\nDijkstra(1,n);\n}\nreturn0;\n}
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.
Walking: FJ can move from any point X to the points X\",“1 or X + 1 in a single minute
Teleporting: FJ can move from any point X to the point 2 × X in a single minute.
If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40713 Accepted: 17088 Special Judge
Description\n
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
翻译 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41406 Accepted Submission(s): 23977
Problem Description\n
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.
假设有一个能装入总体积为 T 的背包和 n 件体积分别为 W1，W2，···，Wn 的物品，能否从 n 件物品中挑选若干件恰好装满背包，即使 W1+W2+···+Wn=T，要求找出所有满足上述条件的解。例如：当 T=10，共 6 件物品，物品的体积为{1，2，3，4，5，8}，那么可找到下列 4 组解：（1，2，3，4）、（1，4，5）、（2，3，5）、（2、8）。
The h-index of an author is the largest h where he has at least h papers with citations not less than h. Bobo has no papers and he is going to publish some subsequently. If he works on a paper for x hours, the paper will get (a·x) citations, where a is a known constant. It’s clear that x should be a positive integer. There is also a trick – one can cite his own papers published earlier.
Given Bobo has n working hours, find the maximum h-index of him.
The h-index of an author is the largest h where he has at least h papers with citations not less than h. Bobo has published many papers. Given a0,a1,a2,…,an which means Bobo has published ai papers with itations exactly i, find the h-index of Bobo.
Commit messages are short descriptions of changes to a repository. We should follow certain standards to effectively describe changes, such as the Conventional Commits specification based on the Angular convention that is most used on GitHub, or each development team can simplify and formulate their own commit specification. This is not only conducive to the automatic generation of Changelog in the later stage, but more importantly, when a bug occurs, the entire warehouse can be quickly checked, the problem point can be accurately located, and the version can be reverted.
Getting Things Done (GTD) is a personal productivity system developed by David Allen and published in a book of the same name. GTD is described as a time management system. Allen states “there is an inverse relationship between things on your mind and those things getting done”.
<CodeDiff\n:old-string="form.oldString"\n:new-string="form.newString"\n:language="form.language"\n:diff-style="form.diffStyle"\n>\n<template#stat="{ stat }">\n<spanclass="diff-stat-added">+{{stat.additionsNum}}增</span>\n<spanclass="diff-stat-deleted">-{{stat.deletionsNum}}减</span>\n</template>\n</CodeDiff>
The h-index of an author is the largest h where he has at least h papers with citations not less than h. Bobo has published many papers. Given a0,a1,a2,…,an which means Bobo has published ai papers with itations exactly i, find the h-index of Bobo.
1.1 Input\n
The input consists of several test cases and is terminated by end-of-file. The first line of each test case contains an integer n. The second line contains (n+1) integers a0,a1,…,an.
1.2 Output\n
For each test case, print an integer which denotes the result.
1.3 Constraint\n
• 1≤ n ≤2·105\n• 0≤ ai ≤109\n• The sum of n does not exceed 250,000.
1.4 Sample Input\n
1\n1 2\n2\n1 2 3\n3\n0 0 0 0\n
1.5 Sample Output\n
1\n2\n0\n
题意：给定被引用次数为 0n 的论文分别有几张，找到最大的 h，满足被引用次数大于等于 h 的论文至少有 h 张 思路：在区间 [0,n] 内二分答案；或直接从 n0 遍历找到第一个满足条件的 h
"
},
{
"path": "posts/a-easy/index.md",
"content": "# A.Easy H-Index\n\n\n## A. Easy h-index\n\nThe h-index of an author is the largest h where he has at least h papers with citations not less than h. \nBobo has published many papers. Given a0,a1,a2,...,an which means Bobo has published ai papers with \nitations exactly i, find the h-index of Bobo.\n\n\n\n### Input\n\nThe input consists of several test cases and is terminated by end-of-file. \nThe first line of each test case contains an integer n. The second line contains (n+1) integers a0,a1,...,an.\n\n### Output\n\nFor each test case, print an integer which denotes the result.\n\n### Constraint\n\n• 1≤ n ≤2·105\n• 0≤ ai ≤109\n• The sum of n does not exceed 250,000.\n\n### Sample Input\n\n 1\n 1 2\n 2\n 1 2 3\n 3\n 0 0 0 0\n\n### Sample Output\n\n 1\n 2\n 0\n\n题意：给定被引用次数为 0~n 的论文分别有几张，找到最大的 h，满足被引用次数大于等于 h 的论文至少有 h 张 \n思路：在区间 [0,n] 内二分答案；或直接从 n~0 遍历找到第一个满足条件的 h\n\n后 AC 代码\n\n```c\n#include \"bits/stdc++.h\"\nusing namespace std;\nint main(){\n int a[200005];\n int n;\n int i;\n while(cin>>n){\n for(i=0;i<=n;i++)\n cin>>a[i];\n int sum=a[n];\n for(i=n;i>=0;){\n if(sum>=i){\n cout< 作者: [Lruihao](https://github.com/Lruihao) \n> URL: https://lruihao.cn/posts/a-easy/ \n\n"
},
{
"path": "posts/adb-for-mac/index.html",
"content": "Mac 配置 ADB | 菠菜眾長
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
Lruihao
