<\/p>\n
2 seconds<\/p><\/div>\n
256 megabytes<\/p><\/div>\n
standard input<\/p><\/div>\n
standard output<\/p><\/div>\n<\/div>\n
Permutation\u00a0p<\/i>\u00a0is an ordered set of integers\u00a0p<\/i>1<\/sub>,\u2009\u2009p<\/i>2<\/sub>,\u2009\u2009…,\u2009\u2009p<\/i>n<\/i><\/sub>, consisting of\u00a0n<\/i>\u00a0distinct positive integers, each of them doesn’t exceed\u00a0n<\/i>. We’ll denote the\u00a0i<\/i>-th element of permutation\u00a0p<\/i>\u00a0as\u00a0p<\/i>i<\/i><\/sub>. We’ll call number\u00a0n<\/i>\u00a0the size or the length of permutation\u00a0p<\/i>1<\/sub>,\u2009\u2009p<\/i>2<\/sub>,\u2009\u2009…,\u2009\u2009p<\/i>n<\/i><\/sub>.<\/p>\n The decreasing coefficient of permutation\u00a0p<\/i>1<\/sub>,\u2009p<\/i>2<\/sub>,\u2009…,\u2009p<\/i>n<\/i><\/sub>\u00a0is the number of such\u00a0i<\/i>\u00a0(1\u2009\u2264\u2009i<\/i>\u2009<\u2009n<\/i>), that\u00a0p<\/i>i<\/i><\/sub>\u2009>\u2009p<\/i>i<\/i>\u2009+\u20091<\/sub>.<\/p>\n You have numbers\u00a0n<\/i>\u00a0and\u00a0k<\/i>. Your task is to print the permutation of length\u00a0n<\/i>\u00a0with decreasing coefficient\u00a0k<\/i>.<\/p>\n<\/div>\n The single line contains two space-separated integers:\u00a0n<\/i>,\u2009k<\/i>\u00a0(1\u2009\u2264\u2009n<\/i>\u2009\u2264\u2009105<\/sup>,\u20090\u2009\u2264\u2009k<\/i>\u2009<\u2009n<\/i>)\u00a0\u2014 the permutation length and the decreasing coefficient.<\/p>\n<\/div>\n In a single line print\u00a0n<\/i>\u00a0space-separated integers:\u00a0p<\/i>1<\/sub>,\u2009p<\/i>2<\/sub>,\u2009…,\u2009p<\/i>n<\/i><\/sub>\u00a0\u2014 the permutation of length\u00a0n<\/i>\u00a0with decreasing coefficient\u00a0k<\/i>.<\/p>\n If there are several permutations that meet this condition, print any of them. It is guaranteed that the permutation with the sought parameters exists.<\/p>\n<\/div>\n <\/p>\n A. Slightly Decreasing Permutations time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Permutation\u00a0p\u00a0is an ordered set of integers\u00a0p1,\u2009\u2009p2,\u2009\u2009…,\u2009\u2009pn, consisting of\u00a0n\u00a0distinct positive integers, each of them doesn’t exceed\u00a0n. We’ll denote … Continue reading 5 2<\/pre>\n<\/div>\n
1 5 2 4 3<\/pre>\n<\/div>\n
3 0<\/pre>\n<\/div>\n
1 2 3<\/pre>\n<\/div>\n
3 2<\/pre>\n<\/div>\n
3 2 1<\/pre>\n<\/div>\n<\/div>\n<\/div>\n
\r\n#include <iostream>\r\n#include <cstdio>\r\n#include <cstring>\r\n\r\nusing namespace std;\r\n\r\n\r\nint main()\r\n{\r\n int n,k;\r\n cin>>n>>k;\r\n cout<<(k+1);\r\n for(int i=k;i>0;i--)\r\n cout<<" "<<i;\r\n for(int i=k+2;i<=n;i++)\r\n cout<<" "<<i;\r\n cout<<endl;\r\n return 0;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"