using namespace std;
int main()
{
for (int i=10000; i<100000;i++)
{
int j=0;
int t=i;
while (t!=0)
{
j=j*10 + t%10;
t /=10;
}
if ((i << 2) ==j)
{
cout << i;
break;
}
}
}
如:struct student{int a;char b[20];double ccc;} 則:FIND(student,a)//等於0
f(m,n) = {n (m=1)m (n=1)f(m-1,n)+f(m,n-1) (上面一行和左邊一行之和) } 遞歸方法: #include <
#include <iostream> #include <string> using namespace std; void ResetTheTi
#include <iostream> #include <cmath> using namespace std; int main() {int
#include <iostream> using namespace std; void matching(int a[],int b[],int
#include <string.h> #include <stdlib.h> #include <stdio.h> #include <fcntl