Skip to content

패턴분석 파트 최적화 전 #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Qstion05 wants to merge 2 commits into
base: pattern_predict
Choose a base branch
from
Open

패턴분석 파트 최적화 전 #2

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9333d78
패턴분석 파트 최적화 전
Qstion05 Nov 14, 2020
5d235f1
arr추가
Qstion05 Nov 14, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions githubtest.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,31 @@ 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)

*/
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++)
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<<Ma_num<<"번이 나왔을때"<<endl;
for(int Sl_num = 1; Sl_num<= 45; Sl_num++)
cout<<Sl_num<<"이 나온 횟수 : "<< arr[Ma_num][Sl_num] <<endl;
}

//성우 파이팅
//사랑해
}
lottoData_t(string path = "./data.xlsx")
{
Expand Down