Ones/송지원 - Revision history

Maintenance script: Repair batch-0003 pages from live compare

2026-03-27T00:29:03Z

Repair batch-0003 pages from live compare

← Older revision		Revision as of 00:29, 27 March 2026
Line 16:		Line 16:

	== Status ==		== Status ==
	{\| class="wikitable"		{\| class="wikitable" style="width:100%;"
	\|-		\|-
	\| Run ID		\| Run ID
Line 54:		Line 54:
	typedef struct longint {		typedef struct longint {
	int length;		int length;
	int digits[ARRBOUND]; // 0000~9999		int digits[ARRBOUND]; // 0000~9999
	} longint;		} longint;

Line 63:		Line 63:
	pns->length = len;		pns->length = len;
	for( i = 0; i < ARRBOUND; i++ )		for( i = 0; i < ARRBOUND; i++ )
	pns->digits[i] = 0;		pns->digits[i] = 0;
	j = ARRBOUND - 1;		j = ARRBOUND - 1;
	while( len >= 4 ) {		while( len >= 4 ) {
	pns->digits[j] = 1111;		pns->digits[j] = 1111;
	len -= 4;		len -= 4;
	j--;		j--;
Line 73:		Line 73:
	switch(len) {		switch(len) {
	case 1:		case 1:
	pns->digits[j] = 1;		pns->digits[j] = 1;
	break;		break;
	case 2:		case 2:
	pns->digits[j] = 11;		pns->digits[j] = 11;
	break;		break;
	case 3:		case 3:
	pns->digits[j] = 111;		pns->digits[j] = 111;
	break;		break;
	}		}
Line 88:		Line 88:
	int rem = 0;		int rem = 0;
	for( ; i < ARRBOUND; i++ ) {		for( ; i < ARRBOUND; i++ ) {
	pns->digits[i] += (rem * 10000);		pns->digits[i] += (rem * 10000);
	rem = pns->digits[i] % divisor;		rem = pns->digits[i] % divisor;
	}		}
	return rem;		return rem;
Line 106:		Line 106:
	}		}
	}		}

imported>enochbible at 09:35, 30 August 2011

2011-08-30T09:35:51Z

← Older revision	Revision as of 09:35, 30 August 2011
(No difference)

imported>enochbible at 09:35, 30 August 2011

2011-08-30T09:35:47Z

← Older revision	Revision as of 09:35, 30 August 2011
(No difference)

imported>enochbible at 09:35, 30 August 2011

2011-08-30T09:35:29Z

New page

== 문제 설명 ==
{| class="wikitable"
|-
| 링크
| [http://poj.org/problem?id=2551]
|-
| 개요
|
|-
| 입력
|
|-
| 출력
|
|}

== Status ==
{| class="wikitable"
|-
| Run ID
| User
| Problem
| Result
| Memory
| Time
| Language
| Code Length
|-
| 9255717
| enochbible
| 2551
| Time Limit Exceeded
|
|
| C
| 1263B
|-
| 9255761
| enochbible
| 2551
| Accepted
| 184K
| 641MS
| C
| 1024B
|}

== Source Code ==
#include <stdio.h>
#define LENBOUND 10000
#define ARRBOUND 2500 // LENBOUND/4

typedef struct longint {
int length;
int digits[ARRBOUND]; // 0000~9999
} longint;

void ones( longint *pns, int len )
{
int i;
int j;
pns->length = len;
for( i = 0; i < ARRBOUND; i++ )
pns->digits[i] = 0;
j = ARRBOUND - 1;
while( len >= 4 ) {
pns->digits[j] = 1111;
len -= 4;
j--;
}

switch(len) {
case 1:
pns->digits[j] = 1;
break;
case 2:
pns->digits[j] = 11;
break;
case 3:
pns->digits[j] = 111;
break;
}
}

int division( longint *pns, int divisor ) {
int i = ARRBOUND - (pns->length + 3) / 4;
int rem = 0;
for( ; i < ARRBOUND; i++ ) {
pns->digits[i] += (rem * 10000);
rem = pns->digits[i] % divisor;
}
return rem;
}

void main() {
longint ns;
int n;
while( scanf("%d", &n) != EOF ) {
int i;
for( i = 1; i <= LENBOUND; i++ ) {
ones(&ns, i);
if( division(&ns, n) == 0 ) break;
}
if( i <= LENBOUND ) printf("%d\n", i);
}
}