dreamzuora的博客

Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming t

//计算n的k次方一种更节省时间的算法 #include int power(int n,int k) { int x; if(k==1) return n; x=power(n,k/2); if(k%2==0) return x*x; else return  x*x*n; } int main() { int s,n,k; while(~scanf("%

//用来查找元素，例：输入1 2 3 4查找3出现的位置，则返回下标2 #include int a[100]; bool find(int key,int st,int end) { int i=0; while(st { int mid = (st+end)/2; if(a[mid]==key) { printf("%d",mid); break; } els