#include using namespace std; int jiecheng(int n){ int jiecheng=1; for(int i=1;i<=n;i++){ jiecheng*=i; } return jc; } int he(int n){ int sum1=0; for(int i=1;i<=n;i++){ sum1+=jiecheng(i); } return sum1; } int main() { int n; cin>>n; cout<<he(n); return 0; }

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string str;
	getline(cin,str);
	for(int i=0;i<str.size();i++){
		if(str[i]>='a'&&str[i]<='y'||str[i]>='A'&&str[i]<='Y'){
			str[i]++;
		}else if(str [i]=='z'){
			str[i]='a';
		}else if(str [i]=='Z'){
			str[i]='A';
	}
	cout<<str;
	return 0;
}








#include <iostream>
using namespace std;
void jiaohuan(int& n,int& m){
	int t=n;
	n=m;
	m=t;
	cout<<n<<"   "<<m<<endl;
}
int main(){
	int a=1,b=2;
	cout<<a<<"   "<<b<<endl;
	jiaohuan(a,b);
	cout<<a<<"   "<<b<<endl;
	return 0;
}


最小公倍数

#include <bits/stdc++.h>
using namespace std;
int gbs(int a,int b){
	if(a<b){
		swap(a,b);
	}
	for(int i=1;;i++){
		int bei=a*i;
		if(bei%b==0){
			return bei;
		}
	}
}
int main()
{
	int a,b;
	cin>>a>>b;
	cout<<gbs(a,b);
	return 0;
}


最大公约数
#include <bits/stdc++.h>
using namespace std;
int gys(int a,int b){
	if(a<b){
		swap(a,b); 
	}
	for(int i=a;i>0;i++){
		if(a%i==0&&b%i==0){
			return i;
		}
	}
	return 1;
}
int main()
{
	int a,b;
	cin>>a>>b;
	cout<<gys(a,b);
	return 0;
}


https://pcn51kd6blxr.feishu.cn/docx/RwykdlDAuo8WtzxVQydcqeZ7nIg



#include <bits/stdc++.h>
using namespace std;
bool chou(int n){
	while(n%2==0){
		n/=2;
	}
	while(n%3==0){
		n/=3;
	}
	while(n%5==0){
		n/=5;
	}
	return n==1;
}
int main()
{
	int js=0;
	for(int i=1;i<=100;i++){
		bool jg=chou(i);
		if(jg==true){
			cout<<i<<"  ";
			js++;
		}
	}
	cout<<js;
	return 0;
}




#include  <bits/stdc++.h>
using  namespace std;
bool huiwen(int n){
	int ni=0,t=n;
	while(n!=0){
		ni=ni*10+n%10;
		n/=10;	
	}
	return (ni==t);
}
int main(){
	for(int i=1;i<=100000000;i++){
		bool jg=huiwen(i);
		if(jg){
			cout<<i<<" ";
		}
	}
	return 0; 
}




https://pcn51kd6blxr.feishu.cn/docx/IG2SdJTzYoRCpGx3NqgcCUtEnWz





#include <iostream>
using namespace std;
int main()
{
	int a[20]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
	for(int i=0;i<20;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
	int * p=a; 
	for(int i=0;i<20;i++){
		cout<<p[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<20;i++){
		cout<<p+i<<" ";
	}
	cout<<endl;
	for(int i=0;i<20;i++){
		cout<<a+i<<" ";
	}
	cout<<endl;
	for(int i=0;i<20;i++){
		cout<<*(a+i)<<" ";
	}
	cout<<endl;
	for(int i=0;i<20;i++){
		cout<<*(p+i)<<" ";
	}




	cout<<endl;
	return 0;
} 




#include <bits/stdc++.h>
using namespace std;
int main()
{
	
	return 0;
}




#include <iostream>
using namespace std;
int a[101];
int b[101];
int main()
{
	int n;
	cin>>n;
	int * p=a;
	for(int i=0;i<n;i++){
		scanf("%d ",p+a);
	}
	for(int i=0;i<n;i++){
		b[i]=b[i-1]+a[i];
	}
	p=b;
	for(int i=0;i<n;i++){
		printf("%d ",*(p+i));
	}
	return 0;
}



#include <bits/stdc++.h>
using namespace std;
int main()
{
	/*int arr[100];
	int n;
	cin>>n;
	for(int i=1;i<n;i++){
		cin>>i;
	}
	*/
	int arr1[5]={5,4,3,2,1};
	int n;
	n=5;
	for(int i=1;i<n;i++){
		for(int j=1;j<n-i;j++){
			if(arr[j]>arr[j+1]){
				swap(arr[j],arr[j+1]);
			}
		}
	}
	//打印
	for(int i=1;i<n;i++){
		cout<<arr[i]<<" ";
	} 
	return 0;
}





#include <bits/stdc++.h>
using namespace std;
struct dog{
	string name;
	int age;
	double tz;
} d1;
int main()
{
	
	return 0;
}





https://pcn51kd6blxr.feishu.cn/docx/BrQddnWG8oxdswxuq9kcYS1Unrb



#include <bits/stdc++.h>
using namespace std;
struct dog{
	string name;
	int age;
	double tz;
} d1;
int main()
{
	struct dog s1;
	s1.name="苞米";
	s1.age=40;
	s1.tz=666.666;
	cout<<s1.name<<" "<<s1.age<<" "<<s1.tz<<endl;
	return 0;
}



https://pcn51kd6blxr.feishu.cn/docx/Fbg0dkJkqoi22QxcGUdcOlJunvd





https://pcn51kd6blxr.feishu.cn/docx/FlcGdbJYloFQI6xFyZVcZOHanze

https://pcn51kd6blxr.feishu.cn/docx/J3ZidHGNkoQ4TExiY0xc7nePnYd





https://pcn51kd6blxr.feishu.cn/docx/AUJqdKqgXoUBiEx9HapcukUTn6g






#include <bits/stdc++.h>
using namespace std;
struct node{
	int data;
	node* next;
};
node* createlist(){
	node* h=new node;
	node* r=h;
	node* p;
	int a;
	while(1){
		cin>>a;
		if(a==-1){
			break;
		}
		p=new node;
		p->data=a;
		p->next=NULL;
		r->next=p;
		r=p;
	}
	return h;
}
void printlist(node* h){
	node* t=h->next;
	while(t!=NULL){
		cout<<t->data<<"->";
		t=t->next;
	}
}
bool insert(node* h,int n,int index){
	node* p=h;
	for(int i=1;i<index;i++){
		p=p->next;
	}
	node* t=new node;
	t->data=n;
	t->next=p->next;
	p->next=t;
	return true;
}
void del(node* h,int k){
	node* t=h;
	for(int i=1;i<k;i++){
		t=t->next;
	}
	node* p1=t->next;
	t->next=t->next->next;
	p1->next=NULL;
}
int main(){
	node* h=createlist();
	printlist(h);
	int k;
	cin>>k;
	del(h,k);
//	int n,index;
//	cin>>n>>index;
//	insert(h,n,index);
	printlist(h);
	return 0; 
}




#include <bits/stdc++.h>
using namespace std;
struct node{
	int data;
	node* next;
};
node* createlist(){
	node* h=new node;
	node* r=h;
	node* p;
	int a;
	while(1){
		cin>>a;
		if(a==-1){
			break;
		}
		p=new node;
		p->data=a;
		p->next=NULL;
		r->next=p;
		r=p;
	}
	return h;
}
void printlist(node* h){
	node* t=h->next;
	while(t!=NULL){
		cout<<t->data<<"->";
		t=t->next;
	}
}
bool insert(node* h,int n,int index){
	node* p=h;
	for(int i=1;i<index;i++){
		p=p->next;
	}
	node* t=new node;
	t->data=n;
	t->next=p->next;
	p->next=t;
}
int main(){
	node* h=createlist();
	printlist(h);
	int n,index;
	cin>>n>>index;
	insert(h,n,index);
	printlist(h);
	return 0; 
}