1006.txt

一个有用的数学公式

/*#include<iostream>
using namespace std;
int main()
{
	int p,e,i,d;
	int j=644,k=0,total=0,pCicle=23,eCicle=28,iCicle=33;
	while(1)
	{
		cin>>p>>e>>i>>d;
		if(p==-1&&e==-1&&i==-1&&d==-1)
			break;
		else 
			k++;
		for(j=0;j<=(21252+d-i)/iCicle;j++)
		{
			total=j*iCicle+i;
			if((total-p)%pCicle==0&&(total-e)%eCicle==0)
			{
				cout<<"Case "<<k<<": "<<"the next triple peak occurs in "<<total-d<<" days."<<endl;
				break;
			}
		}
	
	}
	return 0;
}*/
/*#include <stdio.h>  //// 中国剩余定理
int main()
{	int p,e,i,d,a,t=0;
	while(1)
	{
		scanf("%d%d%d%d",&p,&e,&i,&d);
		if(p==-1 && e==-1 && i==-1 && d==-1)
			break;
		a=(5544*p+14421*e+1288*i-d+21252)%21252;
		if(!a)
			a=21252;
		printf("Case %d: the next triple peak occurs in %d days.\n",++t,a);
	}
	return 0;
}*/
#include<iostream>
using namespace std;
int count(int x,int y,int z);
int main()
{
	int t;
	t=count(28,23,33);
	cout<<t<<endl;
	return 0;
}
int count(int x,int y,int z)
{
	int temp=y*z;
	while((temp%x)!=1)
	{
		temp+=temp;
	}
	return temp;
}