herrDeng網內搜尋
自訂搜尋
Ads
訂閱:
張貼留言 (Atom)
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力,本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動,請在活動期間內踴躍上網檢測資訊安全素養認知程度,並有機會參與抽獎,詳情請參閱活動網站(網址: https://isafe.moe.edu.tw/event
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
XOR prefixsum CPP python解Leetcode 1829 Maximum XOR for Each Query 其實這裡考慮的是元素個數為2^maximumBit的交換群,運算子為XOR。 [Python code請進]
-
Python C++使用字串find迴圈速解Leetcode 2490 Circular Sentence C++ & Python都有字串的find,用法都類似 split=s.find(' ', split+1)能找到s從index=split+1開...
-
你會用C的算子sizeof?
-
先說明一下這是後知後覺的解答,所謂後知就是股票價格已知存在陣列(清單),當然就要用迴圈練習,雙迴圈暴力解需時O(n**2),當然不用,採python單一迴圈解答「最佳股票的買賣時機#LeetCode 121 Best Time to Buy and Sell Stock」,解...
-
Colab上安裝中文字型修改股市爬蟲pyplot顯圖 使用python套件: numpy, requests. pyplot, matplotlib.font_manager, matplotlib.mpl
-
2 pointer Python C++解Leetcode 3163 String Compression III [codes on Leetcode] https://leetcode.com/problems/string-compression-iii/solution...
10 則留言:
import java.util.*;
public class S02 {
public static void main(String[] args) {
int[][] x=new int[2][3];
Random rdm=new Random();
int sum=0;
for(int n=0;n <=2;n++){
for(int i=0;i<=1;i++){
x[i][n]=rdm.nextInt(6)+1;
sum+=x[i][n];
System.out.print("["+x[i][n]+"]");
}
}
System.out.print(sum);
}
}
[1][2][4][2][4][4]17
import java.util.Random;
public class EX2 {
public static void main(String[] args) { int [] data =new int[10] ; int i; Random ran = new Random (); for(i=0;i<10;i++) { data[i]= ran.nextInt(100)+1; System.out.print(data[i] +" "); } } }
import java.util.Random;
public class A2 {
public static void main(String[] args) { int[] data=new int[6]; int i; int sum=0; Random ran= new Random(); for(i=0;i<6;i++) { data [i]=ran.nextInt(6)+1; System.out.print(data[i]+" "); sum=sum+data[i]; } System.out.print(sum); } }
import java.util.*;
public class S02 {
public static void main(String[] args) {
int[][] x=new int[3][2];
Random rdm=new Random();
int sum=0;
for(int n=0;n <=1;n++){
for(int i=0;i<=2;i++){
x[i][n]=rdm.nextInt(6)+1;
sum+=x[i][n];
System.out.print("["+x[i][n]+"],"+"["+x[i][n]+"]\n");
}
}System.out.print("總和:"+ sum);
}
}
[4],[4]
[1],[1]
[4],[4]
[6],[6]
[2],[2]
[2],[2]
總和:19
import java.util.Random;
public class fcvcv {
public static void main(String[] args) { Random rnd=new Random(); int X[][]=new int[3][2]; int Sum=0; for(int i=0;i<3;i++){ X[i][0]=rnd.nextInt(6)+1; X[i][1]=rnd.nextInt(6)+1; System.out.println(X[i][0]+","+X[i][1]); Sum=Sum+X[i][0]+X[i][1]; } System.out.println("sum"+Sum); } }
import java.util.Random;
public class xzcaq {
public static void main(String[] args) { Random rnd=new Random(); int X[][]=new int[3][2]; int sum=0; for(int i=0;i<3;i++){ X[i][0]=rnd.nextInt(6)+1; X[i][1]=rnd.nextInt(6)+1; System.out.println(X[i][0]+","+X[i][1]); sum=sum+X[i][0]+X[i][1]; } System.out.println("sum="+sum); } }
import java.util.*;
public class S02 {
public static void main(String[] args) {
int[][] x=new int[3][2];
Random rdm=new Random();
int sum=0;
for(int n=0;n <=1;n++){
for(int i=0;i<=2;i++){
x[i][n]=rdm.nextInt(6)+1;
sum+=x[i][n];
System.out.print("["+x[i][n]+"],"+"["+x[i][n]+"]\n");
}
}System.out.print("總和:"+ sum);
}
}
[4],[4]
[1],[1]
[4],[4]
[6],[6]
[2],[2]
[2],[2]
總和:19
import java.util.Random;
public class fcvcv {
public static void main(String[] args) { Random rnd=new Random(); int X[][]=new int[3][2]; int Sum=0; for(int i=0;i<3;i++){ X[i][0]=rnd.nextInt(6)+1; X[i][1]=rnd.nextInt(6)+1; System.out.println(X[i][0]+","+X[i][1]); Sum=Sum+X[i][0]+X[i][1]; } System.out.println("sum"+Sum); } }
import java.util.Random;
public class abc123 {
public static void main(String[] args) { Random rnd=new Random(); int X[][]=new int[3][2]; int Sum=0; for(int i=0;i<3;i++){ X[i][0]=rnd.nextInt(6)+1; X[i][1]=rnd.nextInt(6)+1; System.out.println(X[i][0]+","+X[i][1]); Sum=Sum+X[i][0]+X[i][1]; } System.out.println("sum"+Sum); } }
import java.util.Random;
public class abc123 {
public static void main(String[] args) { Random rnd=new Random(); int X[][]=new int[3][2]; int Sum=0; for(int i=0;i<3;i++){ X[i][0]=rnd.nextInt(6)+1; X[i][1]=rnd.nextInt(6)+1; System.out.println(X[i][0]+","+X[i][1]); Sum=Sum+X[i][0]+X[i][1]; } System.out.println("sum"+Sum); } }
張貼留言