2967.cpp

非常好的C++学习源码,里面包括各种算法的实现,二叉的的前中后序遍历等

#include<iostream>
using namespace std;
int main()
{
	int k,i,j,m,h,n,p,min,s,d,mon,y,second1,second2,day,q,my,mmon,md,mh,mmin,ms,month[12]={0,31,59,90,120,151,181,212,243,273,304,334};
	char a[15],b[50];
	cin>>k;
	for (i=1;i<=k;i++)
	{
		q=0;
		h=0;
		min=0;
		s=0;
		d=0;
		mon=0;
		y=0;
		cin>>a>>b;
		for (j=0;j<10;j++)
			if (a[j]==':')
			{
				m=j-1;
				break;
			}
		for (j=0;j<=m;j++)
			h=h*10+a[j]-'0';
		for (j=m+2;j<10;j++)
			if (a[j]==':')
			{
				n=j-1;
				break;
			}
		for (j=m+2;j<=n;j++)
			min=min*10+a[j]-'0';
		for (j=n+2;j<10;j++)
			if (a[j]=='\0')
			{
				p=j-1;
				break;
			}
		for (j=n+2;j<=p;j++)
			s=s*10+a[j]-'0';
		for (j=0;j<30;j++)
			if (b[j]=='.')
			{
				m=j-1;
				break;
			}
		for (j=0;j<=m;j++)
			d=d*10+b[j]-'0';
		for (j=m+2;j<30;j++)
			if (b[j]=='.')
			{
				n=j-1;
				break;
			}
		for (j=m+2;j<=n;j++)
			mon=mon*10+b[j]-'0';
		for (j=n+2;j<30;j++)
			if (b[j]=='\0')
			{
				p=j-1;
				break;
			}
		for (j=n+2;j<=p;j++)
			y=y*10+b[j]-'0';
		if (y!=2000)
			q=(y-2000-1)/4-(y-2000-1)/100+(y-2000-1)/400+1;
		if ((y%4==0)&&(y%100!=0)&&(mon>2))
			q++;
		if (((y%100)==0)&&(y%400==0)&&(mon>2))
			q++;
		day=(y-2000)*365+month[mon-1]+d+q;
		my=(day-1)/1000;
		mmon=(day-1000*my-1)/100+1;
		md=(day-1000*my-100*(mmon-1));
		second1=h*3600+min*60+s;
		second2=(second1*125)/108;
		mh=second2/10000;
		mmin=(second2-mh*10000)/100;
		ms=second2-mh*10000-mmin*100;
		cout<<mh<<":"<<mmin<<":"<<ms<<" "<<md<<"."<<mmon<<"."<<my<<endl;
	}
	return 0;
}