From 9333d78a81db1f63a8cfdb89b2ec99d85a94d0f0 Mon Sep 17 00:00:00 2001 From: Qstion Date: Sat, 14 Nov 2020 22:16:14 +0900 Subject: [PATCH 1/2] =?UTF-8?q?=ED=8C=A8=ED=84=B4=EB=B6=84=EC=84=9D=20?= =?UTF-8?q?=ED=8C=8C=ED=8A=B8=20=EC=B5=9C=EC=A0=81=ED=99=94=20=EC=A0=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- githubtest.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/githubtest.cpp b/githubtest.cpp index 763e147..b91083c 100644 --- a/githubtest.cpp +++ b/githubtest.cpp @@ -30,7 +30,30 @@ class lottoData_t } auto pattern_predict(int startRange, int endRange)//패턴인식 예상 { + /* + 당첨번호에 n번이 있을때, 가장 많이 나온 번호 출력 + 출력형식: n번 -> a번, k% (n = 1~45) + 만약 동일한 확률이 있을 경우엔 같이 출력. + 출력형식: n번 -> a,b,c번 k% (n = 1~45) + + */ + for(int Range = startRange; Range <= endRange; Range++){ + for(int Cp_num = 1; Cp_num <= 45; Cp_num++) + for(int Co_num = 0; Co_num <= 6; Co_num++) + if (rawData[RangeR][Co_num] == Cp_num) + for(int Wr_num = 0; Wr_num <= 6; Wr_num++) + if (rawData[RangeR][Wr_num] != i) + arr[Cp_num][rawData[RangeR][Wr_num] - 1] += 1; + } + + for(int Ma_num = 1; Ma_num<= 45; Ma_num++){ + cout< Date: Sat, 14 Nov 2020 22:21:43 +0900 Subject: [PATCH 2/2] =?UTF-8?q?arr=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- githubtest.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/githubtest.cpp b/githubtest.cpp index b91083c..20125b9 100644 --- a/githubtest.cpp +++ b/githubtest.cpp @@ -37,6 +37,7 @@ class lottoData_t 출력형식: n번 -> a,b,c번 k% (n = 1~45) */ + int arr[46][46]; for(int Range = startRange; Range <= endRange; Range++){ for(int Cp_num = 1; Cp_num <= 45; Cp_num++) for(int Co_num = 0; Co_num <= 6; Co_num++) @@ -53,7 +54,7 @@ class lottoData_t } //성우 파이팅 - //사랑해 지형아... + //사랑해 } lottoData_t(string path = "./data.xlsx") {