想看暑假作业的在最下面 study: 算法（索引） 01背包 https://world.xiaomawang.com/w/playground-python/647415

完全背包 https://world.xiaomawang.com/w/playground-python/703493

深搜 https://world.xiaomawang.com/w/playground-python/624437

广搜 https://world.xiaomawang.com/w/playground-python/604092

二分查找 https://world.xiaomawang.com/w/playground-python/534589

CSP初赛知识点(索引) 位运算： http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b74a4813accdb4daf9837e

二叉树性质: http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b2044713accdb4daf0276f

图的理论知识 https://world.xiaomawang.com/w/playground-python/739884 http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b131ff13accdb4daef625c

字符串: https://world.xiaomawang.com/w/playground-python/739093 http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b006a213accdb4daec307a

数据结构（索引） deque（双端队列） https://world.xiaomawang.com/w/playground-python/742853

vector(动态数组)常用函数 https://blog.csdn.net/csg999/article/details/103898870/

queue(队列) https://world.xiaomawang.com/w/playground-python/743850

stack(栈) deque（双端队列） https://world.xiaomawang.com/w/playground-python/742853

vector(动态数组)常用函数 https://blog.csdn.net/csg999/article/details/103898870/

queue(队列) https://world.xiaomawang.com/w/playground-python/743850

stack(栈) https://blog.csdn.net/weixin_44162361/article/details/115868909?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522168974739016782425113096%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=168974739016782425113096&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-115868909-null-null.142^v89^control_2,239^v2^insert_chatgpt&utm_term=栈&spm=1018.2226.3001.4449

每月天数

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	if(n%4==0&&n%100!=0||n%400==0){
		if(m==1||m==3||m==5||m==7||m==8||m==10||m==12){
			cout<<31;
			return 0;
		}
		if(m==4||m==6||m==9||m==11){
			cout<<30;
			return 0;
		}
		if(m==2){
			cout<<29;
			return 0;
		}
	}else{
		if(m==1||m==3||m==5||m==7||m==8||m==10||m==12){
			cout<<31;
			return 0;
		}
		if(m==4||m==6||m==9||m==11){
			cout<<30;
			return 0;
		}
		if(m==2){
			cout<<28;
			return 0;
		}
	}
	
		
	return 0;
}

长方形面积

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,s=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		if(n%i==0){
			s++;
			if(n/i==i){
				s++;
			}
		}
	}
		cout<<s/2;
	return 0;
}

时间规划

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,d;
	cin>>a>>b>>c>>d;		
	cout<<abs(a*60+b-c*60-d);
	return 0;
}

累计相加

#include<bits/stdc++.h>
using namespace std;
int main(){
	int s=0,n;
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=i;j++){
			s+=j;
		}
	}
	cout<<s;
	return 0;
}

买文具

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,d;
	cin>>a>>b>>c>>d;
	if(d>=a*2+b*5+c*3){
		cout<<"Yes"<<endl;
		cout<<d-(a*2+b*5+c*3);
	}else{
		cout<<"No"<<endl;
		cout<<abs(d-(a*2+b*5+c*3));
	}
	

	return 0;
}

小明的幸运数

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,s=0;
	cin>>a>>b>>c;
	for(int i=b;i<=c;i++){
		if(i%10==a||i%a==0){
			s+=i;
		}
	}
	cout<<s;

	return 0;
}

计算时间

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c;
	char d;
	cin>>a>>b>>c>>d;
	if(d=='A'){
		cout<<a*3600+b*60+c;
		return 0;
	}
	if(d=='P'){
		cout<<43200+a*3600+b*60+c;
		return 0;
	}
	return 0;
}

求闰年

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s=0;
	cin>>n>>m;
	for(int i=n;i<=m;i++){
		if(i%4==0&&i%100!=0||i%400==0){
			s++;
		}
	}
	cout<<s;
	return 0;
}

小杨的考试【GESP一级.2023.12】

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s=0;
	cin>>n>>m;
	if((n+m)%7==0){
		cout<<7;
		return 0;
	}
	cout<<(n+m)%7;
	return 0;
}

小杨报数【GESP一级.2023.12】

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		if(i%m!=0){
			cout<<i<<endl;
		}
		
	}
	return 0;
}

美丽数字【GESP一级-2024.9】

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,s=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		int t;
		cin>>t;
		
		if(t%9==0&&t%8!=0){
			s++;
		}
		
	}
	cout<<s;
	return 0;
}

小杨购物【GESP一级-2024.9】

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,l;
	cin>>n>>m>>l;
	cout<<n/(m+l);
	
	return 0;
}

休息时间【GESP一级-2024.6】

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m,l,k;
	cin>>n>>m>>l>>k;
	int i,s,o,p;
	s=n*3600+m*60+l;
	i=(s+k)/3600;
	o=(s+k)%3600/60;
	p=(s+k)%3600%60;
	cout<<i<<" "<<o<<" "<<p;
	return 0;
}

未完待续

============================