有意思的代码

#include<stdio.h>
#include<string.h>
#define maxn 1010
int a[maxn];
int main(){
	int n, k, first = 1;
	memset(a, 0, sizeof(a));
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= k; i++)
		for(int j = 1; j <= n; j++)
			if(j % i == 0) a[j] = !a[j];
	for(int i = 1; i <= n; i++)
		if(a[i]) { 
			if(first) 
				first = 0; 
			else printf(" "); 
			printf("%d", i); 
		}
	printf("\n");
	return 0;
}

vector的sort使用

#include<bits/stdc++.h>
using namespace std;
int main(){
	vector<int> a;
	int n=5;
	while(n--){
		int score;
		cin>>score;
		a.push_back(score);
	}
	sort(a.begin(),a.end());
	for(int i=0,n=a.end()-a.begin();i<n;i++){
		cout<<a[i]<<endl;
	}
	return 0;
}