H.Shifting

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 286B

Description

John Doe has found the beautiful permutation formula.

Let's take permutation p = p₁, p₂, ..., p_n. Let's define transformation f of this permutation:

where k(k > 1) is an integer, the transformation parameter, r is such maximum integer that rk ≤ n. If rk = n, then elements p_rk + 1, p_rk + 2 and so on are omitted. In other words, the described transformation of permutation p cyclically shifts to the left each consecutive block of length k and the last block with the length equal to the remainder after dividing n by k.

John Doe thinks that permutation f(f( ... f(p = [1, 2, ..., n], 2) ... , n - 1), n) is beautiful. Unfortunately, he cannot quickly find the beautiful permutation he's interested in. That's why he asked you to help him.

Your task is to find a beautiful permutation for the given n. For clarifications, see the notes to the third sample.

Input

A single line contains integer n (2 ≤ n ≤ 10⁶).

Output

Print n distinct space-separated integers from 1 to n — a beautiful permutation of size n.

Sample Input

Input

Output

2 1

Input

Output

1 3 2

Input

Output

4 2 3 1

Hint

A note to the third test sample:

f([1, 2, 3, 4], 2) = [2, 1, 4, 3]
f([2, 1, 4, 3], 3) = [1, 4, 2, 3]
f([1, 4, 2, 3], 4) = [4, 2, 3, 1]

/***************************************************************************************/

模拟水过，STL一直都很好用，这次正好deque派上用场，具体上代码

#pragma comment (linker,"/stack:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<math.h>
#include<set>
#include<map>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<iostream>
#include<string>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;
const double PI=acos(-1.0);
#define eps 1e-8
#define inf 1000000000
#define fib 112233
#define ll __int64
#define able puts("0000000000000000000000")
template<class T_T> T_T f_max(T_T a,T_T b) { return a>b?a:b; }
template<class T_T> T_T f_min(T_T a,T_T b) { return a<b?a:b; }
template<class T_T> T_T f_abs(T_T a) { return a>0?a:-a; }
template<class T_T> T_T gcd(T_T a,T_T b){ return b?gcd(b,a%b):a; }
template<class T_T> void swap(T_T *a,T_T *b){T_T c;c=a;a=b;b=c;}
int main()
{int i,n,m;deque<int> d;scanf("%d",&n);for(i=1;i<=n;i++)d.push_back(i);for(i=2;i<=n;i++){m=(n-1)/i*i;d.push_back(d[m]);for(;m-i>=0;m-=i)d[m]=d[m-i];d.pop_front();}for(i=0;i<n;i++)printf("%d ",d[i]);printf("\n");return 0;
}

H.Shifting相关推荐

H - Shifting Sort
思路: 开两个数组,其中一个没有排序的,另一个是未排序的, 首先把第一个最小值元素放到最前面,然后只关注怎么把剩下元素的最小值移动到前面,不关注其他元素发生了什么变化. 选择排序依次把最小值放到前面, ...
Codeforces Round #703 (Div. 2)A. Shifting Stacks
A. Shifting Stacks time limit per test1 second memory limit per test256 megabytes inputstandard inpu ...
Shifting Stacks【题解】
Codeforces Round #703 (Div. 2)A. Shifting Stacks## 问题描述: A. Shifting Stacks time limit per test1 sec ...
相位测量轮廓术Phase Measurement Profilometry（PMP）+相移方法Phase Shifting Method
之前写了傅里叶变换轮廓术FTP三维重建的方法,那接下来就简单写一下相位测量轮廓术PMP,下面也都直接简称为PMP. 因为PMP用的是相移方法(phase shifting method),所以有很多文 ...
Linux df -h 显示磁盘空间满，但实际未占用满——问题分析
问题现象工作中遇到一个问题,在 TX2 系统上,告警提示磁盘空间不够,如图所示 wohu@wohu:/$ df -h Filesystem Size Used Avail Use% Mounted ...
Linux实现ffmpeg H.265视频编码
Linux实现ffmpeg H.265视频编码几乎所有观看的视频,数字地面电视,电缆,卫星或互联网上的压缩.原始的,未压缩的视频太大,会浪费太多的带宽.在DVD和Blu-ray之前,有视频CD(VC ...
H.264 Video Codec速度和质量
H.264 Video Codec速度和质量从Kepler开始的所有 NVIDIA GPUs 都支持完全加速的硬件视频编码: GPUs 从费米开始支持完全加速的硬件视频解码.最近发布的图灵硬件提供了 ...
H.265 HD 和H.265 4K Video Encoder IP Core
H.265 HD 和H.265 4K Video Encoder IP Core H.265 HD Video Encoder IP Core(H.265 HD Video/Audio Encoder ...
H.265视频编码与技术全析（下）
H.265视频编码与技术全析(下) 四．帧内预测模式共35个(h264有9个),包括Planar,DC,33个方向模式: 除了Intra_Angular预测外,HEVC还和H.264/MPEG-4 ...

H.Shifting

H.Shifting相关推荐

最新文章

热门文章