지환태 :: c++ bigint class완성...

c++ bigint class완성

from Programming/bigint 2009/12/20 17:49

적분형님따라 만든 bigint

#include <iostream>
#include <fstream>
#include <string>  
#include <stdlib.h>
#include <stdio.h>
#include <memory.h>
#include <time.h>

#pragma warning(disable:4996)

class bigint
{
private:
	char sign;		//+:0, -:1					
	unsigned *dats;	//가장 뒷자리가 dats[0]에 저장
	unsigned len;	//dats배열 길이

public:
	unsigned cona2u(char*);

bigint();
	~bigint();
	bigint(const int);
	bigint(const unsigned);
	bigint(const char*);
	bigint(const bigint &);

unsigned resize(unsigned);	//길이조절
	unsigned resize();			//앞의 0 지우기
	bigint abs();				//절대값
	bigint negative(unsigned);	//1의보수

int cmp(bigint &b);			//strcmp와 리턴값 같음

bigint _or(bigint &b);		//this에 저장
	bigint _and(bigint &b);		//this에 저장
	bigint _xor(bigint &b);		//this에 저장
	bigint shr(unsigned n);		//this에 (this>>n)을 저장
	bigint shl(unsigned n);		//this에 (this<<n)을 저장

bigint add(bigint &b);		//(this+b)를 리턴
	bigint sub(bigint &b);		//(this-b)를 리턴
	bigint mul(bigint &b);		//(this*b)를 리턴
	bigint div(bigint &b, int);	//(this/b)또는 (this%b)리턴

std::string conbcd();		//10진

bigint operator=(const int);
	bigint operator=(const bigint &);
	bigint operator=(const char*);

friend bigint operator-(bigint);

friend bigint operator|(bigint, bigint);
	friend bigint operator&(bigint, bigint);
	friend bigint operator^(bigint, bigint);
	friend bigint operator+(bigint, bigint);
	friend bigint operator-(bigint, bigint);
	friend bigint operator*(bigint, bigint);
	friend bigint operator/(bigint, bigint);
	friend bigint operator%(bigint, bigint);
	friend bigint operator<<(bigint, bigint);
	friend bigint operator>>(bigint, bigint);

friend bool operator<(bigint, bigint);
	friend bool operator<=(bigint, bigint);
	friend bool operator>(bigint, bigint);
	friend bool operator>=(bigint, bigint);
	friend bool operator==(bigint, bigint);
	friend bool operator!=(bigint, bigint);

bigint operator|=(bigint);
	bigint operator&=(bigint);
	bigint operator^=(bigint);
	bigint operator+=(bigint);
	bigint operator-=(bigint);
	bigint operator*=(bigint);
	bigint operator/=(bigint);
	bigint operator%=(bigint);
	bigint operator<<=(bigint);
	bigint operator>>=(bigint);

bigint operator++();
	bigint operator++(int dummy);
	bigint operator--();
	bigint operator--(int dummy);

friend std::ostream& operator <<( std::ostream& os, bigint& b );
	friend std::istream& operator >>( std::istream& is, bigint& b );
};

unsigned bigint::cona2u(char *src)
{
	unsigned ten, sum, eos=strlen(src)-1;

for(sum=0, ten=1; (int)eos>=0 && ten<=100000000; ten*=10, eos--)
	{
		sum+=ten*(src[eos]-'0');
		src[eos]=0;
	}
	return sum;
}

bigint::bigint()
{
	len=1;
	sign=0;
	dats=(unsigned*)calloc(1,sizeof(unsigned));
}

bigint::~bigint()
{
	free(dats);
}

bigint::bigint(const int src)
{
	len=1;
	sign=0;
	dats=(unsigned*)malloc(sizeof(unsigned)*len);
	dats[0]=src;
}

bigint::bigint(const char *src)
{
	char *str=(char*)malloc(sizeof(char)*(strlen(src)+1));

sign=0;
	strcpy(str, src);
	if(src[0]=='-')
		strcpy(str,src+1), sign=1;
	if(src[0]=='+')
		strcpy(str,src+1);

len=(strlen(src)-1)/9 + 1;
	dats=(unsigned*)malloc(sizeof(unsigned)*len);
	unsigned i;
	for(i=0; i<len; i++)
	{
		dats[i]=cona2u(str);
	}
	free(str);
	shl(len*32);

unsigned j, lmt=len/2;
	for(i=(len/2)*32; i; i--)
	{
		shr(1);
		for(j=len-1; j>=lmt; j--)
		{
			if(dats[j]>=2147483648)
				dats[j]-=1647483648;
		}
	}
}

bigint::bigint(const bigint &src)
{
	len=src.len;
	sign=src.sign;
	dats=(unsigned*)malloc(sizeof(unsigned)*len);
	memcpy(dats, src.dats, sizeof(unsigned)*len);
}

unsigned bigint::resize(unsigned len_new)
{
	if(len==len_new)
		return len;
	unsigned *new_p=(unsigned*)malloc(sizeof(unsigned)*len_new);		//
	memcpy(new_p, dats, sizeof(unsigned)*((len<len_new)?len:len_new));	//이부분에 realloc(dats, sizeof(unsigned)*len_new)쓰면 왜 값이 바뀌나요
	free(dats);															//
	dats=new_p;															//

if(len < len_new)
		memset(dats+len, 0, sizeof(unsigned)*(len_new-len));
	len=len_new;
	return len;
}

unsigned bigint::resize()
{
	unsigned i;
	for(i=len-1; dats[i]==0; i--);
	i++;
	if(i)
		resize(i);
	else
		resize(1);
	return len;
}

bigint bigint::abs()
{
	bigint toreturn(*this);
	toreturn.sign=0;
	return toreturn;
}

//1의 보수
bigint bigint::negative(unsigned len_new)
{
	bigint toreturn(*this);
	toreturn.resize(len_new);
	for(unsigned i=0; i<len_new; i++)
		toreturn.dats[i]=~toreturn.dats[i];
	return toreturn;
}

int bigint::cmp(bigint &b)
{
	if(len==1 && b.len==1 && dats[0]==0 && b.dats[0]==0)
		return 0;
	if(sign==1 && b.sign==0)
		return -1;
	if(sign==0 && b.sign==1)
		return 1;

int left=1, right=-1;	
	if(sign==1 && b.sign==1)
		left=-1, right=1;

if(len>b.len)
		return left;
	if(len<b.len)
		return right;

for(int i=len-1; i>=0; i--)
	{
		if(dats[i]>b.dats[i])
			return left;
		if(dats[i]<b.dats[i])
			return right;
	}
	return 0;
}

bigint bigint::_or(bigint &b)
{
	if(len<b.len)
		resize(b.len);
	unsigned i;
	for(i=0; i<b.len; i++)
		dats[i]|=b.dats[i];
	return *this;
}

bigint bigint::_and(bigint &b)
{
	if(len<b.len)
		resize(b.len);
	unsigned i;
	for(i=0; i<b.len; i++)
		dats[i]&=b.dats[i];
	return *this;
}

bigint bigint::_xor(bigint &b)
{
	if(len<b.len)
		resize(b.len);
	unsigned i;
	for(i=0; i<b.len; i++)
		dats[i]^=b.dats[i];
	return *this;
}

bigint bigint::shr(unsigned n)
{
	unsigned move=n>>5, cut=n&31, i, j, tmp;
	dats[0]=dats[move]>>cut;
	for(i=1; i<len-move; i++)
	{
		for(j=0, tmp=dats[i+move]; j<32-cut; j++)	//dats[i+1]=dats[i+1]|(dats[i+move]<<(32-cut));
			tmp<<=1;								//
		dats[i-1]|=tmp;
		dats[i]=dats[i+move]>>cut;  
	}

resize(len-move);//옮겨진 부분 삭제
	resize();
	return *this;
}

bigint bigint::shl(unsigned n)
{
	unsigned move=n>>5, cut=n&31, i, j, tmp;

resize(len+move+1);
	dats[len-1]=dats[len-move-1]<<cut;
	for(i=len-2; (int)i>=(int)move; i--)
	{
		for(j=0, tmp=dats[i-move]; j<32-cut; j++)	//dats[i+1]=dats[i+1]|(dats[i-move]>>(32-cut));
			tmp>>=1;								//
		dats[i+1]=dats[i+1]|tmp;					//
		dats[i]=dats[i-move]<<cut;
	}
	memset(dats, 0, sizeof(unsigned)*move);//뒤에 옮겨진 부분 0으로

resize();
	return *this;
}

bigint bigint::add(bigint &b)
{
	bigint toreturn=*this;
	long long carry=0;
	unsigned i;
	toreturn.resize( ((b.len>toreturn.len)?b.len:toreturn.len) + 1 );

for(i=0; i<b.len; i++)
	{
		carry = (long long)toreturn.dats[i] + (long long)b.dats[i] + carry;
		toreturn.dats[i]=carry&(((long long)1<<32)-1);
		carry>>=32;
	}

for(; carry; i++)
	{
		carry=(long long)toreturn.dats[i] + carry;
		toreturn.dats[i]=carry&(((long long)1<<32)-1);
		carry>>=32;
	}

toreturn.resize();

return toreturn;
}

//1의 보수 사용
bigint bigint::sub(bigint &b)
{
	bigint toreturn(*this);
	bigint subtrahend(b);	//감수

unsigned len_new=((toreturn.len>b.len)?toreturn.len:b.len);
	subtrahend=subtrahend.negative(len_new);

toreturn=toreturn.add(subtrahend);
	if(toreturn.len > len_new)//자리올림수있으면
	{
		toreturn.resize(len_new);
		toreturn=toreturn.add((bigint)1);
	}
	else//자리올림수 없으면
	{
		toreturn=toreturn.negative(len_new);
		toreturn.sign=1;
	}
	return toreturn;
}

bigint bigint::mul(bigint &b)
{
	bigint result, tmp;
	unsigned i, j;
	unsigned long long carry;
	for(i=0; i<b.len; i++)
	{
		tmp.resize(len+1+i);
		for(carry=j=0; j<len; j++)
		{
			carry=(long long)dats[j]*(long long)b.dats[i]+carry;
			tmp.dats[j+i]=(unsigned)carry&(((long long)1<<32)-1);
			carry>>=32;
		}
		tmp.dats[j+i]=(unsigned)carry;
		result=result.add(tmp);
		memset(tmp.dats, 0, sizeof(unsigned)*tmp.len);
	}
	result.resize();
	return result;	
}

bigint bigint::div(bigint &b, int ask_mod=0)
{
	bigint r=abs(), q=0, divisor=b.abs(), one=1;
	unsigned i;

for(i=0;divisor.cmp(r)<=0;divisor.shl(1),i++);
	i--;
	if((int)i>0)
	{
		one.shl(i);
		divisor.shr(1);

while(b.cmp(r)<=0)//b<=r
		{
			for(;divisor.cmp(r)>0;divisor.shr(1),one.shr(1));
			q._or(one);
			r=r.sub(divisor);
		}
	}

if(ask_mod)
		return r;
	return q;
}

std::string bigint::conbcd()
{
	unsigned *bcd, len_new, head, i, j;
	char  str_tmp[10];
	std::string result;

len_new=10704*len/10000+1+len;

bcd=(unsigned*)calloc(len_new, sizeof(unsigned));
	memcpy(bcd, dats, sizeof(unsigned)*len);

for(head=len, i=0; i<32*len; i++)
	{
		for(j=head; j>=len; j--)
		{
			if(bcd[j]>=500000000)
				bcd[j]+=1647483648;
		}
		if(bcd[head]>>31)
			head++;
		bcd[head]<<=1;
		for(j=head-1; (int)j>=0; j--)
		{
			bcd[j+1]|=(bcd[j]>>31);
			bcd[j]<<=1;
		}		
	}

for(i=len_new-1; bcd[i]==0; i--);

sprintf(str_tmp, "%u", bcd[i]);
	result.insert(result.size(), str_tmp);

for(--i; i>=len; i--)
	{
		sprintf(str_tmp, "%09u", bcd[i]);
		result.insert(result.size(), str_tmp);
	}

free(bcd);
	return result;
}

bigint bigint::operator=(const int src)
{
	resize(1);
	sign=0;	
	dats[0]=src;
	if(src<0)
		sign=1, dats[0]*=-1;
	return *this;
}

bigint bigint::operator=(const bigint &src)
{
	resize(src.len);
	sign=src.sign;
	memcpy(dats, src.dats, sizeof(unsigned)*len);
	return *this;
}

bigint bigint::operator=(const char *src)
{
	char *str=(char*)malloc(sizeof(char)*(strlen(src)+1));

sign=0;
	strcpy(str, src);
	if(src[0]=='-')
		strcpy(str,src+1), sign=1;
	if(src[0]=='+')
		strcpy(str,src+1);

resize((strlen(src)-1)/9 + 1);
	unsigned i;
	for(i=0; i<len; i++)
	{
		dats[i]=cona2u(str);
	}
	free(str);
	shl(len*32);

unsigned j, lmt=len/2;
	for(i=(len/2)*32; i; i--)
	{
		shr(1);
		for(j=len-1; j>=lmt; j--)
		{
			if(dats[j]>=2147483648)
				dats[j]-=1647483648;
		}
	}

return *this;
}

bigint operator-(bigint a)
{
	a.sign^=1;
	return a;
}

bigint operator|(bigint a, bigint b)
{
	return a._or(b);
}

bigint operator&(bigint a, bigint b)
{
	return a._and(b);
}

bigint operator^(bigint a, bigint b)
{
	return a._xor(b);
}

bigint operator+(bigint a, bigint b)
{
	if(a.sign==b.sign)
		return a.add(b);
	if(a.sign==0 && b.sign==1)
		return a.sub(b);
	//a.sign==1 && b.sign==0
	return b.sub(a);
}

bigint operator-(bigint a, bigint b)
{
	if(a.sign==1 && b.sign==1)
	{
		b.sign=0;
		if((a.abs()).cmp(b.abs())==1)
			b.sign=1;
		b=b.sub(a);
		return b;
	}
	if(a.sign==0 && b.sign==0)
		return a.sub(b);
	if(a.sign==0 && b.sign==1)
		return a.add(b);
	//a.sign==1 && b.sign==0
	a=a.add(b);
	a.sign=1;
	return a;
}

bigint operator*(bigint a, bigint b)
{
	bigint toreturn=a.mul(b);
	toreturn.sign=a.sign^b.sign;
	return toreturn;
}

bigint operator/(bigint a, bigint b)
{
	bigint toreturn=a.div(b);
	toreturn.sign=a.sign^b.sign;
	return toreturn;
}

bigint operator%(bigint a, bigint b)
{
	bigint toreturn=a.div(b,1);
	toreturn.sign=a.sign;
	return toreturn;
}

bigint operator<<(bigint a, bigint b)
{
	bigint tmp(2147483647);
	while(b.len>1)
	{
		a.shl(2147483647);
		b=b.sub(tmp);
	}
	a.shl(b.dats[0]);
	return a;
}

bigint operator>>(bigint a, bigint b)
{
	bigint tmp(2147483647);
	while(b.len>1)
	{
		a.shr(2147483647);
		b=b.sub(tmp);
	}
	a.shr(b.dats[0]);
	return a;
}

bool operator<(bigint a, bigint b)
{
	if(a.cmp(b)<0)
		return true;
	return false;
}

bool operator<=(bigint a, bigint b)
{
	if(a.cmp(b)<=0)
		return true;
	return false;
}

bool operator>(bigint a, bigint b)
{
	if(a.cmp(b)>0)
		return true;
	return false;
}

bool operator>=(bigint a, bigint b)
{
	if(a.cmp(b)>=0)
		return true;
	return false;
}

bool operator==(bigint a, bigint b)
{
	if(a.cmp(b)==0)
		return true;
	return false;
}

bool operator!=(bigint a, bigint b)
{
	if(a.cmp(b)==0)
		return false;
	return true;
}

bigint bigint::operator|=(bigint b)
{
	*this=*this|b;
	return *this;
}

bigint bigint::operator&=(bigint b)
{
	*this=*this&b;
	return *this;
}
bigint bigint::operator^=(bigint b)
{
	*this=*this^b;
	return *this;
}

bigint bigint::operator+=(bigint b)
{
	*this=*this+b;
	return *this;
}

bigint bigint::operator-=(bigint b)
{
	*this=*this-b;
	return *this;
}

bigint bigint::operator*=(bigint b)
{
	*this=*this*b;
	return *this;
}

bigint bigint::operator/=(bigint b)
{
	*this=*this/b;
	return *this;
}

bigint bigint::operator%=(bigint b)
{
	*this=*this%b;
	return *this;
}

bigint bigint::operator<<=(bigint b)
{
	*this=*this<<b;
	return *this;
}

bigint bigint::operator>>=(bigint b)
{
	*this=*this>>b;
	return *this;
}

bigint bigint::operator++()
{
	*this+=1;
	return *this;
}

bigint bigint::operator++(int dummy)
{
	bigint old(*this);
	*this+=1;
	return old;
}

bigint bigint::operator--()
{
	*this-=1;
	return *this;
}

bigint bigint::operator--(int dummy)
{
	bigint old(*this);
	*this-=1;
	return old;
}

std::ostream& operator<<(std::ostream& os, bigint& b)
{
	os<<((b.sign)?"-":"")<<b.conbcd();

return os;
}

std::istream& operator>>(std::istream& is, bigint& b)
{
	std::string numstr;
	is>>numstr;
	b=numstr.c_str();

return is;
}

bigint fac(bigint n)  
{  
	bigint result=1;
	for(; n>0; n--)
		result*=n;
	return result;
}

int main()
{
	std::ofstream fout;
	fout.open("result.txt");

bigint n=1;

std::cin>>n;
	while(n>0)
	{
		fout<<fac(n)<<'\n';
		std::cin>>n;
	}

return 0;
}

앜ㅋㅋㅋ 더럽다.

10진수 출력 고쳤어

이 글이 유익하다면 (굽신굽신) ->

Tag // bigint, C++, Class

Trackback(0) : Comment(49)

Trackback Address >> http://zfanta.com/trackback/459

　환타 2009/08/23 18:29 address modify / delete reply
논리적 오류가
　환타 2009/08/23 18:07 address modify / delete reply
많네
Dabin's 2009/08/29 11:13 address modify / delete reply
바보.
- address modify / delete 2009/08/29 19:48 　환타
  다고쳤어ㅋㅋ
학생 2010/05/01 13:16 address modify / delete reply
부탁이있습니다...

C++로 7*7 배열에 자동차크기는 3,3,4,4,5,5 인 여섯개의차를 무작위로 놓는 방법좀 올려주세요..
대신에 크기가 3인 차 하나는 항상 x=3 y=4인 위치에 고정되어있구요.......
만들어주세요ㅜㅜㅜ
학생 2010/05/01 13:18 address modify / delete reply
그리고 strut 를 꼭써야 한다는데요...ㅜㅜ

도와주세요..
- address modify / delete 2010/05/09 15:50 　환타
  숙제는 혼자서
호기심맨 2010/08/31 23:24 address modify / delete reply
환타님 근데 마지막 main()쪽에 std::cin>>n; 이게 에러가 나는데
에러메세지가 '>>' : class에 맞지 않습니다 라는데 어떻게 해야 하나요??
그위에 <<나 < ,> 도 class에 맞지 않는다고 뜨네요
도와주세여~~
호기심맨 2010/08/31 23:26 address modify / delete reply
새로운 CPP파일에 해보니
1>d:\users\빌 게이츠\documents\visual studio 2008\projects\main.cpp\main.cpp\main.cpp(749) : error C2371: 'n' : 재정의. 기본 형식이 다릅니다.
1> d:\users\빌 게이츠\documents\visual studio 2008\projects\main.cpp\main.cpp\main.cpp(748) : 'n' 선언을 참조하십시오.
1>d:\users\빌 게이츠\documents\visual studio 2008\projects\main.cpp\main.cpp\main.cpp(756) : error C2088: '>>' : class에 맞지 않습니다.
1>d:\users\빌 게이츠\documents\visual studio 2008\projects\main.cpp\main.cpp\main.cpp(760) : error C2088: '>>' : class에 맞지 않습니다.
라고 뜨네요 수정 부탁 드려요
- address modify / delete 2010/09/20 21:51 　환타
  컴파일러 어떤 걸 쓰시나요?
essay writing help 2011/08/30 05:02 address modify / delete reply
왜 이렇게 필명이 다른지 저도 잘 모르겠어요.
저는 아바네라가 좋은데 쁘띠마망은 어디서 갑툭튀인지.
term paper help 2011/08/30 05:03 address modify / delete reply
관리자의 승인을 기다리고 있는 댓글입니다
jogos da sue 2011/09/07 19:35 address modify / delete reply
그리고 strut 를 꼭써야 한다는데요...ㅜㅜ
online betting 2011/10/15 00:59 address modify / delete reply
불특정 다수와 즐기는 수다의 즐거움에 눈 떠 회식때 삼겹살 인증샷도 올리고, 힘든 야근 푸념도 하면서 일상의 비타민으로 삼고 지내던 어느날...
TALLEY30Bonita 2011/10/17 17:25 address modify / delete reply
I think that to receive the <a href="http://goodfinance-blog.com">loans</a> from creditors you ought to present a firm reason. Nevertheless, once I have received a college loan, just because I was willing to buy a bike.
custom essays services 2011/10/21 16:51 address modify / delete reply
Do you know that custom writing service rev can be good helper when you're in trouble because of writing. You will not find more fitting assistant in the internet. Thence, why look more? Make your decision now.
dissertation writing service 2011/10/23 20:59 address modify / delete reply
Even thesis writing services can not write such superb mba thesis close to this post and perchance, you do work for dissertation writing service. In such case we will buy your dissertation from your organization straightaway.
custom term paper 2011/10/23 21:48 address modify / delete reply
Not simply bad university students buy fast custom papers. Numbers of students do it because of heavy workloads. Moreover, you should not be scared to be claimed in cheating just because you are not one who do it.
science essay 2011/10/28 11:27 address modify / delete reply
We surely have to follow your smashing story in the essay and just tv essays performing. Thus, thank you very much for efforts.
essay writing 2011/10/29 16:50 address modify / delete reply
Very good article about this good topic ! Someone would see writing service to buy essay, also students select essay writing.
buy essays 2011/10/29 16:50 address modify / delete reply
Continue acting such way in such topic and people will buy a term paper or buy essays at the custom writing service just about this good post*.
thesis service 2011/10/29 20:12 address modify / delete reply
Thesis writing or dissertation can be acceptable for all people. And you write hot free dissertation just about this good post.
buy dissertation 2011/10/31 19:46 address modify / delete reply
All students are willing to have a PhD degree, but what is the right way to do that? I can propose to see for the thesis service to buy the doctoral thesis about this good post at. We used it and reseived really good grade.
Essay Writer 2011/11/01 00:08 address modify / delete reply
I don't regret that I Buy Essay. I generally get the best quality turning to the research papers writing services.
buy a essay online 2011/11/01 00:08 address modify / delete reply
Some free time suppose to be not simple to have! But, deciding to contact essays writers, you can definitely get free time.
Buy Generic Viagra 2011/11/03 15:22 address modify / delete reply
나는 귀하의 사이트에 곧 돌아올거야 다시 있도록 큰 조언을 공유하는 계속하십시오.
cover for the ipad 2011/11/13 21:52 address modify / delete reply
I am new in C++ programing, and every guide that I could see online is very helpful for me. Like this, this is something that will help me a lot.
resume writing 2011/11/16 06:25 address modify / delete reply
To my mind this article will be interesting for many people
Trust Deed 2011/12/03 01:25 address modify / delete reply
남의 떡이 더 커 보인다
박기동 2011/12/07 20:02 address modify / delete reply
당신은 전체에 서있다면 당신은 파고있어, 당신은 파고를 중지해야합니다
canlı radyo dinle 2011/12/18 14:54 address modify / delete reply
왜 이렇게 필명이 다른지 저도 잘 모르겠어요.
저는 아바네라가 좋은데 쁘띠마망은 어디서 갑툭튀인지.
leather jackets 2011/12/19 23:37 address modify / delete reply
You have completed a great research creating this article
my free dating sites 2011/12/23 00:29 address modify / delete reply
the apps are just great to use by anybody
datingsites 2011/12/23 00:29 address modify / delete reply
confidence really takes time and effort to get
free stuff online 2011/12/23 00:29 address modify / delete reply
jacket really takes care of anybody who can getthe thing
pay day loan 2011/12/23 00:30 address modify / delete reply
you look just beautiful
freedatingsitesforwomen.com 2011/12/23 00:30 address modify / delete reply
price is right if you are willing to pay
how to lose weight in a week 2011/12/23 00:31 address modify / delete reply
Sophia is the most beautiful city in the world
facebook likes 2011/12/23 00:32 address modify / delete reply
Simbian is the hard to learn code of the XXI century
개 2012/01/05 09:42 address modify / delete reply
티끌모아 태산
김보경 2012/01/07 03:49 address modify / delete reply
빈 수레가 요란하다
인형 2012/01/11 05:05 address modify / delete reply
과부 사정 홀아비가 안다
silver prices per ounce today 2012/01/11 20:23 address modify / delete reply
Great blog article about this topic,I have been lately in your blog once or twice now.I just wanted to say hi and show my thanks for the information provided.
고명진 2012/01/12 21:41 address modify / delete reply
원숭이도 나무에서 떨어진다.
dominos coupons 2012/01/24 23:24 address modify / delete reply
I've been browsing on-line greater than 3 hours nowadays, yet I never found any fascinating article like yours. It¡¦s pretty worth enough for me. Personally, if all webmasters and bloggers made just right content material as you probably did, the web will be much more helpful than ever before.

<a href="http://www.knelt.org/diapers-coupons-printable-november-2011">dominos coupons</a>
dominos coupons 2012/01/24 23:24 address modify / delete reply
I've been browsing on-line greater than 3 hours nowadays, yet I never found any fascinating article like yours. It¡¦s pretty worth enough for me. Personally, if all webmasters and bloggers made just right content material as you probably did, the web will be much more helpful than ever before.

<a href="http://www.knelt.org/diapers-coupons-printable-november-2011">dominos coupons</a>
lactose intolerance 2012/01/27 03:54 address modify / delete reply
hello!,I love your writing so much! proportion we be in contact more about your post on AOL? I need a specialist in this house to resolve my problem. Maybe that is you! Looking ahead to look you.

<a href="http://lactoseintolerance.co">lactose intolerance</a>
current gold prices per gram 2012/02/03 18:51 address modify / delete reply
I am following your article regularly and got great and informative information.I really like the tips you have given.thanks a lot:-)
atenolol side effects 2012/02/04 16:30 address modify / delete reply
I read your other post as well, all were good. I really appreciate the author. Thanks for the post, it was nice.I will share with my friends and I know they will like it.

지환태

c++ bigint class완성

Trackback Address >> http://zfanta.com/trackback/459

Category

Tags

Recent Post

Recent Comment

Link