超越0%的用户，遥遥领先

#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,count=0;
cin >>n;
queue<int>nums;
nums.push(n);
while (!nums.empty()){
a = nums.front();
nums.pop();
if (a == 0) {
count ++;
continue;
}
if (a-3>=0)nums.push(a-3);
if(a-2 >= 0) nums.push(a-2);
if(a-1>=0) nums.push(a-1);
}
cout<<count;
}