- Jun 07 Thu 2007 12:14
-
C++取質數高效率版(輸入N，印出第N個質數)
- May 24 Thu 2007 03:12
-
C++列出所有小於N的完美數
- May 24 Thu 2007 03:10
-
VB畫國旗原始碼
Private Sub Form_Load()
Me.AutoRedraw = True
Line (0, 0)-(Me.ScaleWidth, Me.ScaleHeight), RGB(255, 0, 0), BF
Line (0, 0)-(Me.ScaleWidth / 2, Me.ScaleHeight / 2), RGB(0, 0, 255), BF
Me.FillStyle = 0: Me.FillColor = &HFFFFFF
- May 24 Thu 2007 03:08
-
JAVA求最大公因數及最小公倍數
public class work4{//求最大公因數、最小公倍數
public static void main (String[] argv){
int[] a=new int[argv.length];
int sum=1;
for(int k=0;k<argv.length;k++){
public static void main (String[] argv){
int[] a=new int[argv.length];
int sum=1;
for(int k=0;k<argv.length;k++){
- May 24 Thu 2007 03:08
-
JAVA印出所有根目錄及子資料夾的所有檔案
import java.io.File;
public class work2{
public static void main(String[] argv) {
File f=new File(argv[0]);
if(!f.exists())
public class work2{
public static void main(String[] argv) {
File f=new File(argv[0]);
if(!f.exists())
- May 24 Thu 2007 03:06
-
JAVA身分證字號檢查原始碼
package drgo;
public class work5{
public void PID(String id){
int[] num=new int[10];
int[] rdd={10,11,12,13,14,15,16,17,34,18,19,20,21,22,35,23,24,25,26,27,28,29,32,30,31,33};
public class work5{
public void PID(String id){
int[] num=new int[10];
int[] rdd={10,11,12,13,14,15,16,17,34,18,19,20,21,22,35,23,24,25,26,27,28,29,32,30,31,33};
- May 24 Thu 2007 03:02
-
C++猜數字原始碼
- May 24 Thu 2007 02:55
-
C++取質數的原始碼範例
//輸入N值，並印出第N個質數，比如第一個質數=2，第二個=3
//本範例執行效率很高
#include <iostream>
#include <math.h>
using namespace std;
1
