Maintenance script: Repair batch-0006 pages from live compare

2026-03-27T01:08:38Z

Repair batch-0006 pages from live compare

← Older revision		Revision as of 01:08, 27 March 2026
Line 7:		Line 7:

	int main(){		int main(){
	char zip[80];		char zip[80];
	int i=1;		int i=1;
	int num, count=1;		int num, count=1;
Line 15:		Line 15:
	cin >> zip;		cin >> zip;
	num = strlen(zip);		num = strlen(zip);
	temp = zip[0];		temp = zip[0];
	while (i != num){		while (i != num){
	if (temp == zip[i]) count++;		if (temp == zip[i]) count++;
	else {		else {
	cout << count << temp;		cout << count << temp;
	temp = zip[i];		temp = zip[i];
	count = 1;		count = 1;
	}		}
Line 35:		Line 35:

	int main(){		int main(){
	char zip[80];		char zip[80];
	int i = 0, j = 0;		int i = 0, j = 0;
	char temp;		char temp;
	char dig[30];		char dig[30];

	cout << "해제할 코드를 입력하세요 :";		cout << "해제할 코드를 입력하세요 :";
	cin >> zip;		cin >> zip;
	int num = strlen(zip);		int num = strlen(zip);
	temp = zip[0];		temp = zip[0];
	while (i != num){		while (i != num){
	if (int(temp) >= 48 && int(temp) <= 57) dig[j++] = temp;		if (int(temp) >= 48 && int(temp) <= 57) dig[j++] = temp;
	else {		else {
	dig[j] = '\0';		dig[j] = '\0';
	for (int k = 0; k < atoi(dig); k++){		for (int k = 0; k < atoi(dig); k++){
	cout << temp;		cout << temp;
Line 54:		Line 54:
	}		}
	i++;		i++;
	temp = zip[i];		temp = zip[i];
	}		}
	cout << endl;		cout << endl;
Line 67:		Line 67:

	int main(){		int main(){
	char zip[80];		char zip[80];
	int i = 1, j = 0;		int i = 1, j = 0;
	int temp;		int temp;
Line 75:		Line 75:
	cin >> zip;		cin >> zip;
	int num = strlen(zip);		int num = strlen(zip);
	temp = int(zip[0]);		temp = int(zip[0]);
	while (i != num){		while (i != num){
	if (zip[i] == '-') {		if (zip[i] == '-') {
	i++;		i++;
	ch = char(temp - (int(zip[i]) - 48));		ch = char(temp - (int(zip[i]) - 48));
	}		}
	else ch = char(temp + (int(zip[i]) - 48));		else ch = char(temp + (int(zip[i]) - 48));
	cout << ch;		cout << ch;
	i++;		i++;
Line 94:		Line 94:

	int main(){		int main(){
	char zip[80];		char zip[80];
	int i = 0, j = 0;		int i = 0, j = 0;
	int temp;		int temp;
Line 102:		Line 102:
	cin >> zip;		cin >> zip;

	cout << zip[0];		cout << zip[0];
	int num = strlen(zip);		int num = strlen(zip);
	temp = int(zip[0]);		temp = int(zip[0]);
	while (i != num){		while (i != num){
	dig = int(zip[i]) - temp;		dig = int(zip[i]) - temp;
	cout << dig;		cout << dig;
	i++;		i++;
Line 119:		Line 119:

	int main(){		int main(){
	char zip[80];		char zip[80];
	int i = 0, j = 0;		int i = 0, j = 0;
	int temp;		int temp;
Line 127:		Line 127:
	cin >> zip;		cin >> zip;

	cout << zip[0];		cout << zip[0];
	int num = strlen(zip);		int num = strlen(zip);
	temp = int(zip[0]);		temp = int(zip[0]);
	while (i != num){		while (i != num){
	dig = int(zip[i]) - temp;		dig = int(zip[i]) - temp;
	if (dig > 9) {		if (dig > 9) {
	temp = zip[i];		temp = zip[i];
	dig = int(zip[i]) - temp;		dig = int(zip[i]) - temp;
	cout << zip[i];		cout << zip[i];
	}		}
	if (dig < -9) {		if (dig < -9) {
	temp = zip[i];		temp = zip[i];
	dig = int(zip[i]) - temp;		dig = int(zip[i]) - temp;
	cout << zip[i];		cout << zip[i];
	}		}

Line 152:		Line 152:
	=== 해제 업그레이드 ===		=== 해제 업그레이드 ===

	[[압축알고리즘]]		압축알고리즘

imported>Unknown at 05:30, 7 February 2021

2021-02-07T05:30:23Z

New page

== 압축알고리즘/정욱&자겸 ==

=== 압축알고리즘/자겸&정욱 ===

#include <iostream>
using namespace std;

int main(){
char zip[80];
int i=1;
int num, count=1;
char temp;

cout << "압축할 영문자열을 입력하세요 :";
cin >> zip;
num = strlen(zip);
temp = zip[0];
while (i != num){
if (temp == zip[i]) count++;
else {
cout << count << temp;
temp = zip[i];
count = 1;
}
i++;
}
cout << count << temp << endl;
return 0;
}

=== 해제알고리즘/자겸&정욱 ===
#include <iostream>
#include <cstdlib>
using namespace std;

int main(){
char zip[80];
int i = 0, j = 0;
char temp;
char dig[30];

cout << "해제할 코드를 입력하세요 :";
cin >> zip;
int num = strlen(zip);
temp = zip[0];
while (i != num){
if (int(temp) >= 48 && int(temp) <= 57) dig[j++] = temp;
else {
dig[j] = '\0';
for (int k = 0; k < atoi(dig); k++){
cout << temp;
}
j = 0;
}
i++;
temp = zip[i];
}
cout << endl;
return 0;
}

== DPCM ==

=== 해제 알고리즘 ===
#include <iostream>
using namespace std;

int main(){
char zip[80];
int i = 1, j = 0;
int temp;
char ch;

cout << "해제할 코드(Ver.2)를 입력하세요 :";
cin >> zip;
int num = strlen(zip);
temp = int(zip[0]);
while (i != num){
if (zip[i] == '-') {
i++;
ch = char(temp - (int(zip[i]) - 48));
}
else ch = char(temp + (int(zip[i]) - 48));
cout << ch;
i++;
}
cout << endl;
return 0;
}

=== 압축 알고리즘 ===
#include <iostream>
using namespace std;

int main(){
char zip[80];
int i = 0, j = 0;
int temp;
int dig;

cout << "압축할 코드(Ver.2)를 입력하세요 :";
cin >> zip;

cout << zip[0];
int num = strlen(zip);
temp = int(zip[0]);
while (i != num){
dig = int(zip[i]) - temp;
cout << dig;
i++;
}
cout << endl;
return 0;
}

=== 압축 업그레이드 ===
#include <iostream>
using namespace std;

int main(){
char zip[80];
int i = 0, j = 0;
int temp;
int dig;

cout << "압축할 코드(Ver.3)를 입력하세요 :";
cin >> zip;

cout << zip[0];
int num = strlen(zip);
temp = int(zip[0]);
while (i != num){
dig = int(zip[i]) - temp;
if (dig > 9) {
temp = zip[i];
dig = int(zip[i]) - temp;
cout << zip[i];
}
if (dig < -9) {
temp = zip[i];
dig = int(zip[i]) - temp;
cout << zip[i];
}

cout << dig;
i++;
}
cout << endl;
return 0;
}

=== 해제 업그레이드 ===

[[압축알고리즘]]

압축알고리즘/정욱&자겸 - Revision history

Maintenance script: Repair batch-0006 pages from live compare

imported>Unknown at 05:30, 7 February 2021