n!!=n*(n-2)*(n-4)*...........
計算20!!=?
herrDeng網內搜尋
自訂搜尋
Ads
2016年6月14日 星期二
訂閱:
張貼留言 (Atom)
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序,可得線性解 [Py3解請進]
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code,一次完成解Leetcode難題 [C++一行解請進]
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
C++ Py3 Euclidean Algorithm解Leetcode 2169 Count Operations to Obtain Zero [Py3一行解請進]
7 則留言:
public class S03 {
public static void main(String[] args) {
long sum=1;
for(int i=20;i>=1;i-=2)sum*=i;
System.out.println(sum);
}
}
3715891200
public class A3 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
public class A3 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
public class A3 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
public class zzz111 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
public class A3 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
public class A3 {
public static void main(String[] args) { int t; long sum=1; for(t=20;t>1;t-=2){ sum=sum*t; } System.out.print("20!!"+sum); }
}
張貼留言