AcWing 1205. 买不到的数目
原题链接
简单
作者:
Nazarena
,
2021-01-12 11:32:57
,
所有人可见
,
阅读 391
C++ 代码
#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector <int> arr;
int n,m,step;
int sum = 0,t = 1;
cin >> n >> m;
step = n < m ? n : m;
arr.push_back(1);//0
//cout << step << endl;
//cout << arr.size() << endl;
while(sum < step)
{
if(t >= n && arr[t-n] == 1)
{
arr.push_back(1);
sum++;
}
else if(t >= m && arr[t-m] == 1)
{
arr.push_back(1);
sum++;
}
else
{
arr.push_back(0);
sum = 0;
}
t++;
}
cout << arr.size() - step - 1 << "";
return 0;
}