📄 1006.txt
字号:
Memory: 264K Time: 110MS
Language: C++ Result: Accepted
Source Code
#include<iostream>
using namespace std;
int main()
{
int b[3],n[3],y[3],d,i,M,days,times=1;
int m[3]={23,28,33};
M=m[0]*m[1]*m[2];
cin >>b[0]>>b[1]>>b[2]>>d;
while(b[0]!=-1)
{
days=0;
for(i=0;i<3;i++)
b[i]=b[i]%m[i];
for(i=0;i<3;i++)
{
int j=1;
n[i]=M/m[i];
while((n[i]*j)%m[i]!=1)
j++;
y[i]=j;
}
for(i=0;i<3;i++)
days=days+b[i]*y[i]*n[i];
days=(days+M)%M;
days=days-d;
if(days<=0)days+=M;
cout <<"Case "<<times<<": the next triple peak occurs in "<<days<<" days."<<endl;
times++;
cin >>b[0]>>b[1]>>b[2]>>d;
} return 0;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -