More actions
imported>Unknown No edit summary |
(Repair batch-0002 pages from live compare) |
||
| Line 12: | Line 12: | ||
{ | { | ||
int nCase; | int nCase; | ||
int Save_Result | int Save_Result[MAX_CASE]; | ||
int n = 0; | int n = 0; | ||
int i, j; | int i, j; | ||
| Line 26: | Line 26: | ||
cin >> nDays; | cin >> nDays; | ||
cin >> nPoliticalparty; | cin >> nPoliticalparty; | ||
Days = new bool | Days = new bool[nDays]; | ||
HartalParameter = new int | HartalParameter = new int[nPoliticalparty]; | ||
for (i=0 ; i<nPoliticalparty ; i++) | for (i=0 ; i<nPoliticalparty ; i++) | ||
cin >> HartalParameter | cin >> HartalParameter[i]; | ||
// 계산 | // 계산 | ||
for (i=0 ; i<nPoliticalparty ; i++) | for (i=0 ; i<nPoliticalparty ; i++) | ||
{ | { | ||
j=HartalParameter | j=HartalParameter[i]; | ||
while (j <= nDays) | while (j <= nDays) | ||
{ | { | ||
if ((j-1)%7 == 5 || (j-1)%7 == 6 || Days | if ((j-1)%7 == 5 || (j-1)%7 == 6 || Days[j-1] == true) | ||
count--; | count--; | ||
Days | Days[j-1] = true; | ||
j += HartalParameter | j += HartalParameter[i]; | ||
count++; | count++; | ||
} | } | ||
} | } | ||
Save_Result | Save_Result[n++]=count; | ||
count = 0; | count = 0; | ||
} | } | ||
for (i=0 ; i<n ; i++) | for (i=0 ; i<n ; i++) | ||
cout << Save_Result | cout << Save_Result[i] << endl; | ||
delete | delete [] HartalParameter; | ||
delete | delete [] Days; | ||
return 0; | return 0; | ||
} | } | ||
==== 나한테 할 말 ==== | ==== 나한테 할 말 ==== | ||
Latest revision as of 00:16, 27 March 2026
소감
2005/04/04 Accepted 0:00.002 64 nCase라는 변수없이 while(1)로만 묶어서 로봇에 돌리니까 '시간 초과'라는 결과가 나왔었다.흠;;
코드
// no10050 - Hartals
#include <iostream.h>
#define MAX_CASE 100
int main()
{
int nCase;
int Save_Result[MAX_CASE];
int n = 0;
int i, j;
int count = 0;
int nDays;
int nPoliticalparty;
bool *Days;
int *HartalParameter;
cin >> nCase;
// 입력
while (n < nCase)
{
cin >> nDays;
cin >> nPoliticalparty;
Days = new bool[nDays];
HartalParameter = new int[nPoliticalparty];
for (i=0 ; i<nPoliticalparty ; i++)
cin >> HartalParameter[i];
// 계산
for (i=0 ; i<nPoliticalparty ; i++)
{
j=HartalParameter[i];
while (j <= nDays)
{
if ((j-1)%7 == 5 || (j-1)%7 == 6 || Days[j-1] == true)
count--;
Days[j-1] = true;
j += HartalParameter[i];
count++;
}
}
Save_Result[n++]=count;
count = 0;
}
for (i=0 ; i<n ; i++)
cout << Save_Result[i] << endl;
delete [] HartalParameter;
delete [] Days;
return 0;
}