커뮤니티
문의 드립니다.
2017-11-17 12:34:55
271
글번호 114271
첨부 이미지
그림1
Arrays : count[500](0);
Value1 = Max(count[0], count[1], count[2], count[3], count[4], count[5],
count[6], count[7], count[8], count[9], count[10], count[11], count[12],
count[13], count[14], count[15], count[16], count[17], count[18],
count[19], count[20], count[21], count[22], count[23], count[24],
count[25], count[26], count[27], count[28], count[29], count[30],
count[31], count[32], count[33], count[34], count[35], count[36],
count[37], count[38], count[39], count[40], count[41], count[42],
count[43], count[44], count[45], count[46], count[47], count[48],
count[49], count[50], count[51], count[52], count[53], count[54],
count[55], count[56], count[57], count[58], count[59], count[60],
count[61], count[62], count[63], count[64], count[65], count[66],
count[67], count[68], count[69], count[70], count[71], count[72],
count[73], count[74], count[75], count[76], count[77], count[78],
count[79], count[80], count[81], count[82], count[83], count[84],
count[85], count[86], count[87], count[88], count[89], count[90],
count[91], count[92], count[93], count[94], count[95], count[96],
count[97], count[98], count[99], count[100], count[101], count[102],
count[103], count[104], count[105], count[106], count[107], count[108],
count[109], count[110], count[111], count[112], count[113], count[114],
count[115], count[116], count[117], count[118], count[119], count[120],
count[121], count[122], count[123], count[124], count[125], count[126],
count[127], count[128], count[129], count[130], count[131], count[132],
count[133], count[134], count[135], count[136], count[137], count[138],
count[139], count[140], count[141], count[142], count[143], count[144],
count[145], count[146], count[147], count[148], count[149], count[150],
count[151], count[152], count[153], count[154], count[155], count[156],
count[157], count[158], count[159], count[160], count[161], count[162],
count[163], count[164], count[165], count[166], count[167], count[168],
count[169], count[170], count[171], count[172], count[173], count[174],
count[175], count[176], count[177], count[178], count[179], count[180],
count[181], count[182], count[183], count[184], count[185], count[186],
count[187], count[188], count[189], count[190], count[191], count[192],
count[193], count[194], count[195], count[196], count[197], count[198],
count[199], count[200], count[201], count[202], count[203], count[204],
count[205], count[206], count[207], count[208], count[209], count[210],
count[211], count[212], count[213], count[214], count[215], count[216],
count[217], count[218], count[219], count[220], count[221], count[222],
count[223], count[224], count[225], count[226], count[227], count[228],
count[229], count[230], count[231], count[232], count[233], count[234],
count[235], count[236], count[237], count[238], count[239], count[240],
count[241], count[242], count[243], count[244], count[245], count[246],
count[247], count[248], count[249], count[250], count[251], count[252],
count[253], count[254], count[255], count[256], count[257], count[258],
count[259], count[260], count[261], count[262], count[263], count[264],
count[265], count[266], count[267], count[268], count[269], count[270],
count[271], count[272], count[273], count[274], count[275], count[276],
count[277], count[278], count[279], count[280], count[281], count[282],
count[283], count[284], count[285], count[286], count[287], count[288],
count[289], count[290], count[291], count[292], count[293], count[294],
count[295], count[296], count[297], count[298], count[299]);
배열변수 count 를 방을 500개를 만들고
각 배열변수 값 중에서 제일 큰 값을
Value1 에 넣을려고 하는데,
배열변수를 count[0]부터 계속 추가해서 256개를 초과해서 만드니까
에러가 나면서 함수 파라미터를 256개 이상 만들수가 없다고 하네요.
그럼 위처럼 저렇게 일일히 count 변수를 입력하지 말고
count[X] 처럼 배열에 변수 X 값을 넣고
자동으로 0번방부터 500번방까지 검색해서 제일 높은 수를 찾아내야
하는 것인데...
뭐 좋은 방법이 없을까요?
For 문 같은것을 활용해야 하나요?
- 1. 114844_1.png (0.00 MB)
답변 1
예스스탁 예스스탁 답변
2017-11-17 15:26:58
안녕하세요
예스스탁입니다.
해당 변수는 256개 까지만 지정하게 되어 있습니다.
더 많으면 for문 이용하셔야 합니다.
최저가도 같이 작성해 드립니다.
참고하시기 바랍니다.
var : cnt(0),maxv(0),minv(0);
Arrays : count[500](0);
MaxV = count[0];
MinV = count[0];
for cnt = 1 to 499{
if count[cnt] > MaxV Then
MaxV = count[cnt];
if count[cnt] < MinV Then
MinV = count[cnt];
}
즐거운 하루되세요
> 무결점 님이 쓴 글입니다.
> 제목 : 문의 드립니다.
> Arrays : count[500](0);
Value1 = Max(count[0], count[1], count[2], count[3], count[4], count[5],
count[6], count[7], count[8], count[9], count[10], count[11], count[12],
count[13], count[14], count[15], count[16], count[17], count[18],
count[19], count[20], count[21], count[22], count[23], count[24],
count[25], count[26], count[27], count[28], count[29], count[30],
count[31], count[32], count[33], count[34], count[35], count[36],
count[37], count[38], count[39], count[40], count[41], count[42],
count[43], count[44], count[45], count[46], count[47], count[48],
count[49], count[50], count[51], count[52], count[53], count[54],
count[55], count[56], count[57], count[58], count[59], count[60],
count[61], count[62], count[63], count[64], count[65], count[66],
count[67], count[68], count[69], count[70], count[71], count[72],
count[73], count[74], count[75], count[76], count[77], count[78],
count[79], count[80], count[81], count[82], count[83], count[84],
count[85], count[86], count[87], count[88], count[89], count[90],
count[91], count[92], count[93], count[94], count[95], count[96],
count[97], count[98], count[99], count[100], count[101], count[102],
count[103], count[104], count[105], count[106], count[107], count[108],
count[109], count[110], count[111], count[112], count[113], count[114],
count[115], count[116], count[117], count[118], count[119], count[120],
count[121], count[122], count[123], count[124], count[125], count[126],
count[127], count[128], count[129], count[130], count[131], count[132],
count[133], count[134], count[135], count[136], count[137], count[138],
count[139], count[140], count[141], count[142], count[143], count[144],
count[145], count[146], count[147], count[148], count[149], count[150],
count[151], count[152], count[153], count[154], count[155], count[156],
count[157], count[158], count[159], count[160], count[161], count[162],
count[163], count[164], count[165], count[166], count[167], count[168],
count[169], count[170], count[171], count[172], count[173], count[174],
count[175], count[176], count[177], count[178], count[179], count[180],
count[181], count[182], count[183], count[184], count[185], count[186],
count[187], count[188], count[189], count[190], count[191], count[192],
count[193], count[194], count[195], count[196], count[197], count[198],
count[199], count[200], count[201], count[202], count[203], count[204],
count[205], count[206], count[207], count[208], count[209], count[210],
count[211], count[212], count[213], count[214], count[215], count[216],
count[217], count[218], count[219], count[220], count[221], count[222],
count[223], count[224], count[225], count[226], count[227], count[228],
count[229], count[230], count[231], count[232], count[233], count[234],
count[235], count[236], count[237], count[238], count[239], count[240],
count[241], count[242], count[243], count[244], count[245], count[246],
count[247], count[248], count[249], count[250], count[251], count[252],
count[253], count[254], count[255], count[256], count[257], count[258],
count[259], count[260], count[261], count[262], count[263], count[264],
count[265], count[266], count[267], count[268], count[269], count[270],
count[271], count[272], count[273], count[274], count[275], count[276],
count[277], count[278], count[279], count[280], count[281], count[282],
count[283], count[284], count[285], count[286], count[287], count[288],
count[289], count[290], count[291], count[292], count[293], count[294],
count[295], count[296], count[297], count[298], count[299]);
배열변수 count 를 방을 500개를 만들고
각 배열변수 값 중에서 제일 큰 값을
Value1 에 넣을려고 하는데,
배열변수를 count[0]부터 계속 추가해서 256개를 초과해서 만드니까
에러가 나면서 함수 파라미터를 256개 이상 만들수가 없다고 하네요.
그럼 위처럼 저렇게 일일히 count 변수를 입력하지 말고
count[X] 처럼 배열에 변수 X 값을 넣고
자동으로 0번방부터 500번방까지 검색해서 제일 높은 수를 찾아내야
하는 것인데...
뭐 좋은 방법이 없을까요?
For 문 같은것을 활용해야 하나요?