亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

public

  • The OReilly Struts book (title not set yet) will be available sometime in the 3rd quarter of 2002.

    The OReilly Struts book (title not set yet) will be available sometime in the 3rd quarter of 2002. Published by OReilly, this book covers both Struts 1.0 and 1.1. The beta or draft chapters are being made available for download to facilitate an early public review process for the material.

    標簽: available sometime OReilly quarter

    上傳時間: 2014-01-22

    上傳用戶:familiarsmile

  • SQLite is a software library that implements a self-contained, serverless, zero-configuration, trans

    SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine. SQLite is the most widely deployed SQL database engine in the world. It is used in countless desktop computer applications as well as consumer electronic devices including cellphones, PDAs, and MP3 players. The source code for SQLite is in the public domain.

    標簽: zero-configuration self-contained implements serverless

    上傳時間: 2013-12-09

    上傳用戶:manlian

  • a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded s

    a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate public/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.

    標簽: FPGA-based generator embedded hardware

    上傳時間: 2014-01-09

    上傳用戶:一諾88

  • RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digit

    RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key

    標簽: crypthograph information Adleman Rivest

    上傳時間: 2017-09-01

    上傳用戶:chfanjiang

  • 文件Java排課系統的報告

    My JSP 'TeacherMain.jsp' starting page var $=function(id) { return document.getElementById(id); } function show_menu(num){ for(i=0;i

    標簽: C++

    上傳時間: 2015-07-03

    上傳用戶:xiyuzhu

  • 多線程游戲

    /**  * 用于在邏輯和界面間傳輸數據的bean  * @version 1.0  */ public class DataBean {     private int first = -1;     private int second = -1;     public int getFirst() {         return first;     }     public int getSecond() {         return second;     }     public void setFirst(int firt) {         this.first = firt;     }     public void setSecond(int second) {         this.second = second;     }     /**      * 將1,2次均置為初始狀態

    標簽: 多線程小游戲 翻牌小游戲

    上傳時間: 2015-11-07

    上傳用戶:dddhhhwww

  • c語言程序源

    #include <iostream> using namespace std; class Student { public: Student(int, int); int num; int grade; }; Student::Student(int n, int g) { num = n; grade = g; } int maxGradeIndex(Student* s) { int maxGrade, index = 0, i = 0; maxGrade = s[0].grade; for (i = 0; i<5; i++) { if (s[i].grade > maxGrade) { maxGrade = s[i].grade; index = i; } } return  index; } int main() { Student a[5] = { Student(1, 86), Student(2, 60), Student(3, 72), Student(4, 95), Student(5, 66) }; int maxGradeStNum = maxGradeIndex(a); cout << "成績最好學生的學號是:" << a[maxGradeStNum].num << endl; cout << "成績最好學生的成績是:" << a[maxGradeStNum].grade << endl; getchar(); return 0; }

    標簽: c語言 程序

    上傳時間: 2016-04-23

    上傳用戶:burt1025

  • java學生數據庫

    /*import java.util.Scanner; //主類 public class student122 {   //主方法   public static void main(String[] args){     //定義7個元素的字符數組     String[] st = new String[7];     inputSt(st);       //調用輸入方法     calculateSt(st);   //調用計算方法     outputSt(st);      //調用輸出方法   }   //其他方法   //輸入方法 private static void inputSt(String st[]){     System.out.println("輸入學生的信息:");   System.out.println("學號 姓名 成績1,2,3");   //創建鍵盤輸入類   Scanner ss = new Scanner(System.in);   for(int i=0; i<5; i++){     st[i] = ss.next(); //鍵盤輸入1個字符串   } }   //計算方法 private static void calculateSt(String[] st){   int sum = 0;         //總分賦初值 int ave = 0;         //平均分賦初值 for(int i=2;i<5;i++) {   /計總分,字符變換成整數后進行計算   sum += Integer.parseInt(st[i]); } ave = sum/3;         //計算平均分 //整數變換成字符后保存到數組里 st[5] = String.valueOf(sum); st[6] = String.valueOf(ave); }   //輸出方法 private static void outputSt(String[] st){     System.out.print("學號 姓名 ");   //不換行   System.out.print("成績1 成績2 成績3 ");   System.out.println("總分 平均分");//換行   //輸出學生信息   for(int i=0; i<7; i++){     //按格式輸出,小于6個字符,補充空格     System.out.printf("%6s", st[i]);   }   System.out.println();            //輸出換行 } }*/   import java.util.Scanner;   public class student122 {   public static void main(String[] args) { // TODO 自動生成的方法存根 String[][] st = new String[3][8]; inputSt(st); calculateSt(st); outputSt(st); }   //輸入方法 private static void inputSt(String st[][]) { System.out.println("輸入學生信息:"); System.out.println("班級 學號 姓名 成績:數學 物理 化學"); //創建鍵盤輸入類 Scanner ss = new Scanner(System.in); for(int j = 0; j < 3; j++) { for(int i = 0; i < 6; i++) { st[j][i] = ss.next(); } } } //輸出方法 private static void outputSt(String st[][]) { System.out.println("序號 班級 學號 姓名 成績:數學 物理 化學 總分 平均分"); //輸出學生信息 for(int j = 0; j < 3; j++) { System.out.print(j+1 + ":"); for(int i = 0; i < 8; i++) { System.out.printf("%6s", st[j][i]); } System.out.println(); } }     //計算方法     private static void calculateSt(String[][] st)     {      int sum1 = 0;      int sum2 = 0; int sum3 = 0;      int ave1 = 0;      int ave2 = 0;      int ave3 = 0;      for(int i = 3; i < 6; i++)      {      sum1 += Integer.parseInt(st[0][i]);      }      ave1 = sum1/3;           for(int i = 3; i < 6; i++)      {      sum2 += Integer.parseInt(st[1][i]);      }      ave2 = sum2/3;           for(int i = 3; i < 6; i++)      {      sum3 += Integer.parseInt(st[2][i]);      }      ave3 = sum3/3;           st[0][6] = String.valueOf(sum1);      st[1][6] = String.valueOf(sum2);      st[2][6] = String.valueOf(sum3);      st[0][7] = String.valueOf(ave1);      st[1][7] = String.valueOf(ave2);      st[2][7] = String.valueOf(ave3);     } }

    標簽: java 數據庫

    上傳時間: 2017-03-17

    上傳用戶:simple

  • CCS樣式選擇符設計

    CCS樣式選擇符,初學者,設計,DW,網頁制作,大一作業 部分預覽: <!DOCTYPE html public "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>CSS樣式選擇符</title> <style type="text/css">  body  { background-image:url(images/%E8%83%8C%E6%99%AF%E5%9B%BE%E7%89%87.jpg); background-repeat:repeat;  }    .class1  { text-align:center; font-weight:bolder;  }  .class2  { font-family:"仿宋"; text-indent:8em;  }    .class3  { font-size:18px; font-family:"宋體"; text-indent:4em;  }    #id1  { font-family:Zombie, Verdana, "Comic Sans MS"; font-style:oblique; font-size:64px;  }    #id2  { font-family:"黑體"; font-size:36px;  }  #id3  { color:#F69; font-weight:bolder; text-shadow:#FCC;  } </style> </head> <body>  <table width="780" height="1555" border="0" cellspacing="0" align="center" bgcolor="#FFFFFF">   <tr height="30">    <td align="center"><img src="images/頂部圖片.jpg" /></td>   </tr>

    標簽: CCS 網頁設計

    上傳時間: 2017-12-07

    上傳用戶:圈圈Ace

  • java入門編程合集

    題目:古典問題:有一對兔子,從出生后第3個月起每個月都生一對兔子,小兔子長到第三個月后每個月又生一對兔子,假如兔子都不死,問每個月的兔子總數為多少?    //這是一個菲波拉契數列問題 public class lianxi01 { public static void main(String[] args) { System.out.println("第1個月的兔子對數:    1"); System.out.println("第2個月的兔子對數:    1"); int f1 = 1, f2 = 1, f, M=24;      for(int i=3; i<=M; i++) {       f = f2;       f2 = f1 + f2;       f1 = f;       System.out.println("第" + i +"個月的兔子對數: "+f2);          } } } 【程序2】    題目:判斷101-200之間有多少個素數,并輸出所有素數。 程序分析:判斷素數的方法:用一個數分別去除2到sqrt(這個數),如果能被整除, 則表明此數不是素數,反之是素數。    public class lianxi02 { public static void main(String[] args) {     int count = 0;     for(int i=101; i<200; i+=2) {      boolean b = false;      for(int j=2; j<=Math.sqrt(i); j++)      {         if(i % j == 0) { b = false; break; }          else           { b = true; }      }         if(b == true) {count ++;System.out.println(i );}                                   }     System.out.println( "素數個數是: " + count); } } 【程序3】    題目:打印出所有的 "水仙花數 ",所謂 "水仙花數 "是指一個三位數,其各位數字立方和等于該數本身。例如:153是一個 "水仙花數 ",因為153=1的三次方+5的三次方+3的三次方。 public class lianxi03 { public static void main(String[] args) {      int b1, b2, b3; 

    標簽: java 編程

    上傳時間: 2017-12-24

    上傳用戶:Ariza

主站蜘蛛池模板: 成武县| 南宁市| 营口市| 积石山| 武隆县| 安塞县| 新沂市| 宜黄县| 津市市| 泰安市| 十堰市| 措勤县| 元阳县| 清丰县| 奉新县| 江北区| 丹棱县| 奎屯市| 和静县| 西昌市| 三穗县| 望江县| 五寨县| 平谷区| 桦甸市| 三穗县| 高邑县| 玛沁县| 巴塘县| 荔波县| 桂阳县| 江口县| 龙州县| 南陵县| 玉屏| 裕民县| 屏东市| 钟山县| 靖西县| 潜山县| 孝义市|