#include<cstdio>//noj第1097题
#include<queue>
using namespace std;
int main()
{
queue<int>q;
int n;
int i,j,t;
scanf("%d",&n);
for (i=1;i<=n;i++)
q.push(i);
while(!q.empty())
{
if (q.front()==1)//输出格式控制~~
printf("%d",q.front());
else
printf(" %d",q.front());
q.pop();
if (!q.empty())//为什么要判断,思考一下(因为有可能此时栈已经为空了,再出栈就会报错)~~
{
q.push(q.front());
q.pop();
}
}
printf("\n");
return 0;
}
#include<queue>
using namespace std;
int main()
{
queue<int>q;
int n;
int i,j,t;
scanf("%d",&n);
for (i=1;i<=n;i++)
q.push(i);
while(!q.empty())
{
if (q.front()==1)//输出格式控制~~
printf("%d",q.front());
else
printf(" %d",q.front());
q.pop();
if (!q.empty())//为什么要判断,思考一下(因为有可能此时栈已经为空了,再出栈就会报错)~~
{
q.push(q.front());
q.pop();
}
}
printf("\n");
return 0;
}