herrDeng網內搜尋
自訂搜尋
Ads
訂閱:
張貼留言 (Atom)
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力,本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動,請在活動期間內踴躍上網檢測資訊安全素養認知程度,並有機會參與抽獎,詳情請參閱活動網站(網址: https://isafe.moe.edu.tw/event
-
你會用C的算子sizeof?
-
C 的continue & break [影片]介紹C++程式for迴圈中加上continue與break的差異之簡例 Java迴圈中的的continue & break
-
C++ DP動態規劃解Leetcode 937 Maximum Number of Points with Cost 有些標示medium要比標示hard的問題還要難,Leetcode 1937. Maximum Number of Points with Cost,DP動態規...
-
EULER特徵數定理與UnionFind解Leetcode959 Regions Cut By Slashes EULER特徵數定理:平面連通圖有V-E+F --------------
-
C++ stringstream解分數加減Leetcode 592 Fraction Addition and Subtraction 程式設計分數加減很難嗎?計算容易,但處理字串費事,用stringstream就簡單了
-
C++Floyd Warshall解Leetcode 1334 Find the City With the Smallest Number of Neighbors at a Threshold 由於每對 (i, j) 都有許多最短路徑需要計算,採用 Floyd-Warsh...
-
RSA 演算 Euler 定理搞定#LeetCode 372 Super Pow--C,C++,Python實作。玩過數論、RSA演算的,解這個問題剛好,C++解答打敗94%,還沒有特別優化。
15 則留言:
import java.security.SecureRandom;
import java.util.Random;
public class aa {
public static void main(String[] args) {
Random rnd= new SecureRandom();
int[]x=new int[7];
outer: for(int i=0; i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0; j<i; j++){
if(x[j]==x[j]){
i--;
continue outer;
}
}
System.out.print("x["+i+"]="+x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Random;
public class aa {
public static void main(String[] args) {
Random rnd= new SecureRandom();
int[]x=new int[7];
outer: for(int i=0; i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0; j<i; j++){
if(x[j]==x[j]){
i--;
continue outer;
}
}
System.out.print("x["+i+"]="+x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Random;
public class aa {
public static void main(String[] args) {
Random rnd= new SecureRandom();
int[]x=new int[7];
outer: for(int i=0; i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0; j<i; j++){
if(x[j]==x[j]){
i--;
continue outer;
}
}
System.out.print("x["+i+"]="+x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class ex1 {
public static void main(String[] args) {
System.out.println("產生亂數");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
for(int i=0;i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
outer: for(int j=0; j<i; j++){
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class gvfdgfrgfdrgthgbfgf {
public static void main(String[] args) {
System.out.println("亂數產生");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
package aaa;
import java.security.SecureRandom;
import java.util.Arrays;
public class bbbbb {
public static void main(String[] args) {
System.out.println("產生亂數");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]) {
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class ex2 {
public static void main(String[] args) {
System.out.println("產生亂數");
SecureRandom rnd= new SecureRandom();
int[] x=new int[7];
outer: for(int i=0; i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0; j<i; j++){
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class ex3 {
public static void main(String[] args) {
SecureRandom rnd=new SecureRandom();
System.out.println("產生亂數");
int x[]=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0;j<i;j++){
if(x[i]==x[j]){
i--;
continue outer;
}
}
}
System.out.println();
Arrays.sort(x);
for(int i=0;i<x.length;i++)
System.out.print(x[i]+"\t");
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class ex4 {
public static void main(String[] args) {
SecureRandom rnd=new SecureRandom();
System.out.println("產生亂數");
int[] x=new int[7];
outer: for(int i=0;i<x.length; i++){
x[i]=rnd.nextInt(49)+1;
for(int j=0; j<i;j++){
if(x[i]==x[j]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0;i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class ex3 {
public static void main(String[] args) {
System.out.println("產生亂數");
SecureRandom r = new SecureRandom();
int x[] = new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=r.nextInt(49)+1;
for(int j=0;j<i;j++){
if(x[i]==x[j]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0;i<x.length;i++)
System.out.print(x[i]+"\t");
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class a4 {//大樂透
public static void main(String[] args) {
SecureRandom rnd=new SecureRandom(); //產生安全亂數
int[] x=new int[7];//7個位子 0123456
outer: for(int i=0;i<x.length;i++){//
x[i]=rnd.nextInt(49)+1;
for(int j=0;j<i;j++){
if(x[j]==x[i]){
i--;
continue outer;
}
}
System.out.print("["+i+"]="+x[i]+"\t");
}
System.out.println();
Arrays.sort(x);
for(int i=0;i<x.length;i++){
System.out.print("["+i+"]="+x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
public class yjhg {
public static void main(String[] args) {
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]){
i--;
continue outer;
}
}
System.out.println("x[" + i + "]=" + x[i] + "\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class bv2 {
public static void main(String[] args) {
System.out.println("亂數產生");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class bv2 {
public static void main(String[] args) {
System.out.println("亂數產生");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
import java.security.SecureRandom;
import java.util.Arrays;
public class bv2 {
public static void main(String[] args) {
System.out.println("亂數產生");
SecureRandom rnd=new SecureRandom();
int [] x=new int[7];
outer: for(int i=0;i<x.length;i++){
x[i]=rnd.nextInt(49)+1;
for (int j = 0; j < i;j++) {
if(x[j]==x[i]){
i--;
continue outer;
}
}
}
Arrays.sort(x);
for(int i=0; i<x.length; i++){
System.out.print(x[i]+"\t");
}
System.out.println();
}
}
張貼留言