U E D R , A S I H C RSS

PP Project/20041001FM

PPProject 첫 번째 ė§Œė‚Øģ˜ 결과물


1. 문제

컬럼 2. B번 문제
nź°œģ˜ ģ›ģ†Œė„¼ ź°€ģ§€ėŠ” 1차원 범터넼 i만큼 ģ™¼ģŖ½ģœ¼ė”œ ķšŒģ „ģ‹œģ¼œė¼.

1.1. Leonardong


~cpp 
#include <iostream>
#include <string>
using namespace std;

void roll( string str, int i );

void main()
{
	string str = "abcde";
	int i = 3;
	roll(str, i);
}

void roll( string str, int i )
{
	cout << str << endl;
	
	int n = str.length();
	char temp;
	
	for ( int tag = 0 ; tag < n ; tag++ ){
		temp = str[tag];
		str[tag] = str[i-1];
		str[i-1] = temp;
		i = i < n ? i+1 : i;
	}
	cout << str << endl;
}

1.2. ģž¬ģ„  회영


~cpp 
#include<iostream.h>
#include<cstring>

void roll(int i);

char * string="ABCDEFGHIJKLMNOPQRSTUV";
const int SIZE = strlen(string);


void main()
{	
	roll(4);
}

void roll(int i)
{
	char* buffer1 = new char[i];
	strncpy(buffer1, string, i);
	buffer1[i] = 0;
	char *buffer2 = new char[SIZE-i];
	strcpy(buffer2,string+i);
	cout<<strcat(buffer2,buffer1)<<endl;	
}

 

2. 후기

ģž¬ģ„  :
첫 ėŖØģž„ģ“ė¼ ģŠ¤ķ„°ė”” ė°©ģ‹ģ„ ģ •ķ•˜ėŠ”ė° ģ‹œź°„ģģ˜¤ėž˜ 걸렸다. 회영ģģ™€ PairProgramming ģ„ ķ•˜ėŠ”ė° ė„ˆė¬“ ģ—¬ģœ ź°€ ģ—†ģ—ˆė‹¤.
Leonardong:
ģ•Œź³ ė¦¬ģ¦˜ģ„ ģ•Œģ•„ė„ ģ½”ė“œė”œ ė°”ė”œ 풀얓쓰기가 ģ•ˆ ėœė‹¤. 그럓 ė•ŒėŠ” ź°€ģ§œ ģ½”ė“œ(psuedo code)넼 ģ ģ–“ė³“ėŠ” ź²ƒģ“ ė„ģ›€ģ“ ėœė‹¤.


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:23:59
Processing time 0.0091 sec