递归
abc0x
这个作者很懒,什么都没留下…
展开
-
因式分解(递归)
添加链接描述 /**/ #include<stdio.h> int sum; void findx(int n) { int i; for(i=2;i<n;i++) { if(n%i==0) { sum++; findx(n/i); } } } int main() { int n; scanf("%d",&n); sum=1; findx(n); printf("%d\...原创 2019-02-25 22:31:45 · 953 阅读 · 0 评论 -
快排运用--第X大的数/第k小的数
添加链接描述 因为是找第x大的数,所以是从大到小排列的 /**/ #include&lt;stdio.h&gt; int a[100010]; int once(int l,int r) { int k=a[l];//以下称k为关键数(进行排序的数轴) while(l&lt;r)//(注意快排时是从右边界开始排序的) { while(l&lt;r&amp;&amp;k&gt;=原创 2019-03-05 19:42:36 · 368 阅读 · 0 评论 -
G - Fractal
添加链接描述 A fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all scales, but the sam...原创 2019-07-26 16:22:37 · 110 阅读 · 0 评论 -
M - Shuffle'm Up
添加链接描述 A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C ch...原创 2019-08-08 09:21:52 · 77 阅读 · 0 评论