突破口:
设i秒高能粒子,低能粒子的数量分别为h[i],l[i],
h[0]=1,l[0]=0;
h[i]=3×h[i-1]+2×l[i-1], l[i]=h[i-1]+l[i-1].
代码如下:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define pi 3.1415926
using namespace std;
typedef long long ll;
ll h[35],l[35];
int main()
{
int n,i,j;
h[0]=1;h[1]=3;h[2]=11;
l[0]=0;l[1]=1;l[2]=4;
for(i=3;i<=33;i++)
{
h[i]=3*h[i-1]+2*l[i-1];
l[i]=h[i-1]+l[i-1];
}
while(cin>>n)
{
if(n==-1) break;
cout<<h[n]<<", "<<l[n]<<endl;
}
return 0;
}