#include<bits/stdc++.h>usingnamespace std;intsort1(int a ,int b ){
return a>b;}intsort2(int a ,int b ){
return a<b;}intmain(){
int num;
cin>>num;int x=num;
vector<int>data(num,0);int i =0;while(x>0){
cin>>data[i];
i++;
x--;}int ans;
cin>>ans;if(ans ==0){
sort(data.begin(),data.end(),sort2);for(i =0;i<num;i++){
cout<<data[i]<<" ";}}elseif(ans ==1){
sort(data.begin(),data.end(),sort1);for(i =0;i<num;i++){
cout<<data[i]<<" ";}}return0;}
HJ100等差数列
#include<iostream>usingnamespace std;intmain(){
int num;
cin>>num;int x=2;int d=3;int res =0;for(int i =0;i<num;i++){
res += x;
x += d;}
cout<<res<<endl;return0;}
HJ99自守数
#include<iostream>usingnamespace std;intmain(){
int n;while(cin >>