K-skipPermutation

Output one line containing ${n}$ integers indicating a permutation ${P}$ of ${n}$ that maximizes ${f(P, k)}$ . If there are multiple valid answers you can output any of them.
Please, DO NOT output extra spaces at the end of the line, or your answer may be considered incorrect!

C++(g++ 7.5.0) 解法, 执行用时: 146ms, 内存消耗: 7168K, 提交时间: 2023-04-20 14:33:14

#include<iostream>
using namespace std;
int main(){
	int n,k;
	scanf("%d %d",&n,&k);
	for(int i=1;i<=k;i++){
		for(int j=i;j<=n;j+=k){
			cout<<j<<" ";
		}
	}
	return 0;
}

C++ 解法, 执行用时: 71ms, 内存消耗: 7124K, 提交时间: 2021-06-14 15:32:38

#include<iostream>
using namespace std;

int main()
{
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=k;i++) {
		for(int j=i;j<=n;j+=k){
			cout<<j<<' ';
		}
	}
 }

Python3 解法, 执行用时: 904ms, 内存消耗: 122504K, 提交时间: 2023-04-20 14:55:26

n,k=map(int,input().split())
a=[]
for i in range(1,k+1):
    while i<=n:
        a.append(i)
        i+=k
print(' '.join(map(str,a)))

pypy3 解法, 执行用时: 481ms, 内存消耗: 191856K, 提交时间: 2023-04-17 15:05:53

n,k=map(int,input().split())
a=[]
for i in range(1,k+1):
    while i<=n:
        a.append(i)
        i+=k
print(" ".join(map(str,a)))

详情