第3章.doc

Size: px

Start display at page:

Download "第3章.doc"

觊龚
5 years ago
Views:

1 IT Trend C++ Java SAP Advantech ERPCRM C++ C++ Synopsys C++ NEC C C++PHP C++Java C++Java VIA C++ 3COM C++ SPSS C++

2 Sybase C++LinuxUNIX Motorola C++ IBM C++Java Oracle Java HP C++ C++ Yahoo C++Java C# C++ C++Java SQL C++ Siemens C++ Grapecity C++C# IT 1 IT CC++ Java Delphi VB VBVF C 2 3 3% 14

3 % IT 4 VIA IT C++ IT 5 C strcmpstrcpyatoi C++ C++ 3.2

4 16 Thoughtworks SybaseSAP C++ C IT SPSS

5 malloc atoi UML

6 18 Offer 1 care HR

7 [ H ] for (i1=0;i1<=10;i1++) for (i2=0;i2<=10;i2++) for (i3=0;i3<=10;i3++)... for (i10=0;i10<=10;i10++) if(i1+i2+i3+...+i10=90) Print();

8 90 if(score < 0 score > (num+1)*10 ) // num 09 return; 2 10 if(num == 0) store2[num] = score; Output( store2); return; 3 for(int i = 0; i <= 10; ++i) // store2[9] 1 //store2[8] 2 store2[0] 10 store2[num] = i; Cumput(score - i, num - 1,store2); 4 public static void Output(int[] store2) for(int i = 9; i>=0; --i) Console.Write(" 0",store2[i]); Console.WriteLine(); sum++; C# using System ; public class M //public static int[] store; // // sum M public static int sum; public M() int sum =0; 82

9 8 // int[] store = 1,2,3,4,5,6,7,8,9,0; // // public static void Output(int[] store2) for(int i = 9; i>=0; --i) Console.Write(" 0",store2[i]); Console.WriteLine(); sum++; // sum public static int sum2() return sum; public static void Cumput(int score, int num, int[] store2 ) // 90 score<0 // // if(score < 0 score > (num+1)*10 ) // num 09 return; // if(num == 0) store2[num] = score; Output( store2); return; for(int i = 0; i <= 10; ++i) store2[num] = i; Cumput(score - i, num - 1,store2); //Console.Write(" 0",store2[5]); public class myapp public static void Main( ) 83

10 int[] store; store = new int[10]; int sum = 0; //int a=90; //int b=9; //Output(); M.Cumput(90,9,store); sum = M.sum2(); //M.Cumput2(a,b,store); //Console.Write(" 0",store[3]); //cout<<" :"<<sum<<endl; Console.Write(" : 0",sum); C++ #include <iostream> using namespace std; int sum; int store[10]; void Output() for(int i = 9; i>=0; --i) cout<<store[i]<<" "; cout<<endl; ++sum; void Cumput(int score, int num) if(score < 0 score > (num+1)*10 ) // num 09 return; if(num == 0) store[num] = score; Output(); return; for(int i = 0; i <= 10; ++i) store[num] = i; Cumput(score - i, num - 1); int main(int argc, char* argv[]) Cumput(90, 9); cout<<" :"<<sum<<endl; 84

11 8 return 0; [ ] n abc a a[0]~a[7] b b[i-j+7] b[0]~b[14] 1 0 c c[i+j] c[0]~c[14] 1 0 #include <stdio.h> static char Queen[8][8]; static int a[8]; static int b[15]; static int c[15]; static int iqueennum=0; // void qu(int i); int main() int iline,icolumn; // i // for(iline=0;iline<8;iline++) a[iline]=0; // for(icolumn=0;icolumn<8;icolumn++) Queen[iLine][iColumn]='*'; // for(iline=0;iline<15;iline++) b[iline]=c[iline]=0; qu(0); return 0; 85

12 void qu(int i) int icolumn; for(icolumn=0;icolumn<8;icolumn++) if(a[icolumn]==0&&b[i-icolumn+7]==0&&c[i+icolumn]==0) // // a[icolumn]=1; // b[i-icolumn+7]=1; // c[i+icolumn]=1; // if(i<7) qu(i+1); // else // // int iline,icolumn; printf("%d \n",++iqueennum); for(iline=0;iline<8;iline++) for(icolumn=0;icolumn<8;icolumn++) printf("%c ",Queen[iLine][iColumn]); printf("\n"); printf("\n\n"); // Queen[i][iColumn]='*'; a[icolumn]=0; b[i-icolumn+7]=0; c[i+icolumn]=0; 86

Microsoft Word - 把时间当作朋友（2011第3版）3.0.b.06.doc

Microsoft Word - 把时间当作朋友（2011第3版）3.0.b.06.doc 2 5 8 11 0 13 1. 13 2. 15 3. 18 1 23 1. 23 2. 26 3. 28 2 36 1. 36 2. 39 3. 42 4. 44 5. 49 6. 51 3 57 1. 57 2. 60 3. 64 4. 66 5. 70 6. 75 7. 83 8. 85 9. 88 10. 98 11. 103 12. 108 13. 112 4 115 1. 115 2.