整數劃分問題: 對于正整數n,輸出其和等于n且滿足以下限制條件的所有正整數的形式,既組成和式的數字子左到右構成一個非遞增的序列。例n=4,程序輸出為 4=4 4=3+1 4=2+2 4=2+1+1 4=1+1+1+1
上傳時間: 2016-08-10
上傳用戶:koulian
z-trenning z-tickets. mipt lucky tickets. Count of numbers with 2*n digits in base k such that sum of first n digits is same as second n digits.
標簽: z-trenning z-tickets tickets numbers
上傳時間: 2014-01-05
上傳用戶:luopoguixiong
//建立按鈕上標簽的字符串 label = XmStringCreateSimple["Hello World!"] n = 0 XtSetArg[args[n], XmNlabelString, label] n++ button = XmCreatePushButton[toplevel, "pushbutton", args, n] XtManageChild[button] XmStringFree[label] //設置回調函數 XtAddCallback[button, XmNactivateCallback, callback, NULL]
標簽: XmStringCreateSimple XtSetArg XmNlab label
上傳時間: 2017-03-21
上傳用戶:fredguo
//建立頂級窗口 toplevel = XtVaAppInitialize[&app, "Form", NULL, 0, &argc, argv, NULL, NULL] n = 0 XtSetArg[args[n], XmNwidth, 500] n++ XtSetArg[args[n], XmNheight, 500] n++ XtSetValues[toplevel, args, n] //建立主窗口 form = XmCreateForm[toplevel, "form", NULL, 0] XtManageChild[form] //建立菜單條 n = 0 XtSetArg[args[n], XmNtopAttachment, XmATTACH_FORM] n++ XtSetArg[args[n], XmNleftAttachment, XmATTACH_FORM] n++ XtSetArg[args[n], XmNrightAttachment, XmATTACH_FORM] n++ menubar = XmCreateMenuBar[form, "menubar", args, n] XtManageChild[menubar] create_menu[menubar]
標簽: NULL XtVaAppInitialize toplevel Form
上傳時間: 2013-12-19
上傳用戶:亞亞娟娟123
n = 0 XtSetArg[args[n], XmNlabelString, label] n++ button = XmCreatePushButton[toplevel, "pushbutton", args, n] XtManageChild[button]
標簽: XmCreatePushButton XmNlabelString XtSetArg toplevel
上傳時間: 2013-12-09
上傳用戶:671145514
一個對于一個給定的 數( N ), 求不大于 N 的最大 Fibonacci 數
標簽:
上傳時間: 2014-01-07
上傳用戶:王楚楚
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
標簽: OTSU segmentation Gray-level segmented
上傳時間: 2017-04-24
上傳用戶:yuzsu
使用遞歸實現N重循環,這里的N是不確定的。此代碼實現的功能描述如下: 1. 有一個字符串的矩陣,用vector< vector< CStirng > > 表示 2. 行與行之間進行排列組合 3. 輸出所有組合的字符串
上傳時間: 2014-01-02
上傳用戶:coeus
N-皇后問題線性時間算法 O(n)復雜度,非O(n^2)的,使用的是構造法。
上傳時間: 2013-12-21
上傳用戶:jqy_china
這是一個簡單的排序。給你一個有N個值的數組,每個數都小于10000000。然后就將這個數組按從小到大的順序排序。在輸入時,第一行輸入一個整數T,T代表一個有多少個數組要排序。然后就有T組數,每組數的第一行就是數組的大小N。緊跟著就有N行數,第N行就是數組的第N個數。每個數組的輸出就有N行。
上傳時間: 2013-11-25
上傳用戶:sammi