bzoj1583 [Usaco2009 Mar]Moon Mooing 哞哞叫

#include<bits/stdc++.h>
#define N 5000000
using namespace std;
int n,a1,b1,c1,a2,b2,c2,C;
int cnt,p1,p2;
unsigned long long f[N+5],nxt1,nxt2;
int main()
{
freopen("in.txt","r",stdin);
cin>>C>>n;
cin>>a1>>b1>>c1;
cin>>a2>>b2>>c2;
f[1]=C;
p1=p2=1;
nxt1=f[1]*a1/c1+b1;
nxt2=f[1]*a2/c2+b2;
for(int i=2;i<=n;) {
if (nxt1<nxt2) {
if (nxt1!=f[i-1])f[i++]=nxt1;
nxt1=f[++p1]*a1/c1+b1;
}
else{
if(nxt2!=f[i-1])f[i++]=nxt2;
nxt2=f[++p2]*a2/c2+b2;
}
}
cout<<f
;
return 0;
}