#include<stdio.h> int find(int *arr,int low, int hight,int key) { int mid=(hight+low)/2 ; if(hight<low) return -1;//处理不在数组内之数 ，此处参考网上技术，感觉很巧妙 if(arr[mid]!=key) { if(arr[mid]>key) return find(arr,low,mid-1,key); else return find(arr,mid+1,hight,key); } e...

来自论坛 http://bbs.bccn.net/thread-404325-1-1.html #include<iostream> using namespace std; int main() { for(int i=12; i<=98; i++) for(int j=123;i*j>1234 &amp;&amp; i*j<9876 &amp;&amp;j<987;j++) if (i%10+ i/10+ j%10 + j/10%10 + j/100 + i*j%10 + j*i/10%10 + i*j/100%10 +i*j/...

http://bbs.bccn.net/thread-403058-1-1.html /*数矩形 #include<iostream> using namespace std; int f(int,int ); int f1(int ); int main() { cout<<f(4,4); return 0; } int f(int x,int y) { int min; min=x<y?x:y; if(min==1 ) return f1(x>y?...

/*求1，3/2，5/3，8/5 ，13/8....前N 项之和，以分母为基准*/ #include<iostream> using namespace std; float f(int n) { if(n==1) return 1; if(n==2) return 2; return f(n-1)+f(n-2); } float fsum(int n) { if(n==1) return 1; if(n==2) return (1+(float)3/2); return fsum( n-1...

public class Jishuan { public final static String[] pai = { "一", "二", "三", "四", "五", "六", "七", "八", "九", "十", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖", "拾" }; // 把相同的牌放在数组的一个下标，便于_del(int[] dealpai )处理。 public int[] toChangePai(String str) { int[] dealpai = new int[20]; St...

http://blog.csdn.net/tiankong1206/article/details/48199345 TVeXTcpA8YBlksLPhEq5qnWWJnDj1DMSd3mrlbhoGnd2nkCyw7bHsvuW_WQNZXaYRn1b0p3EnVAS4bmfMrTNfd02kPghlyhttp://blog.csdn.net/zhaohanyu1185/article/details/9397183//登录 http://blog.csdn.net/xyz_fly/article/details/21301303//安卓 ht...