梁家硕 @ 2025-12-8 15:52:33

#include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是 #include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是

梁家硕 @ 2025-12-8 15:52:29

#include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是 #include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是

梁家硕 @ 2025-12-8 15:52:25

#include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是 #include<bits/stdc++.h> using namespace std; int n; vector a[100]; int u=1,x=1,y=1; void f(int g,int x,int y){ if(a[x][y+1]!=0&&a[x][y-1]!=0&&a[x+1][y]!=0&&a[x-1][y]!=0) return ; if(xn+1||a[x+1][y]!=0) u=2; else if(yn+1||a[x][y+1]!=0) u=3; else if(x<=0||a[x-1][y]!=0) u=4; else if(y<=0||a[x][y-1]!=0) u=1; if(u1){ a[x][y]=g; cout<<" "<<g; x++; f(g+1,x,y); } else if(u2){ a[x][y]=g; cout<<" "<<g; y++; f(g+1,x,y); } else if(u3){ a[x][y]=g; cout<<" "<<g; x--; f(g+1,x,y); } else if(u4){ a[x][y]=g; cout<<" "<<g; y--; f(g+1,x,y); } } int main(){ cin>>n; f(1,1,1); return 0; }

啥也不是

renqicheng @ 2025-6-4 16:05:14

#include<bits/stdc++.h>
using namespace std;
int a[110][13];
int n,s1,s2,s3;
double p[13],sum;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		for(int j=0;j<3;j++){
			cin>>a[i][j];
		}
		s1+=a[i][0];
		s2+=a[i][1];
		s3+=a[i][2];
	} 
	printf("%.1f",s1*1.0/n);
	cout<<" ";
	printf("%.1f",s2*1.0/n);
	cout<<" ";
	printf("%.1f",s3*1.0/n);
	return 0;
}

renqicheng @ 2025-5-7 16:27:14

#include<bits/stdc++.h>
using namespace std;
int main(){
	int f;
	string s;
	char c;
	cin>>c>>s;
	f=s.find(c);
	while(f!=-1){
		s.erase(f,1);
		f=s.find(c);
	}
	cout<<s;
	return 0;
}

renqicheng @ 2025-5-7 16:26:41

#include<bits/stdc++.h>
using namespace std;
string s;
int a,b;
int main(){
	getline(cin,s);
	for(int i=0;i<s.size();i++){
		if(s[i]!='*'){
			a=i;
			break;
		}
	}
	for(int i=0;i<s.size();i++){
		if(s[i]!='*'){
			b=i;
		}
	}
	for(int i=a;i<b;i++){
		if(s[i]=='*'){
			s[i]=' ';
		}
	}
	for(int i=0;i<s.size();i++){
		if(s[i]!=' '){
			cout<<s[i];
		}
	}
	return 0;
}

eric2012 @ 2025-5-7 16:24:13

E

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	cin>>a;
	cout<<a;
	reverse(a.begin(),a.end());
	cout<<a;
	return 0;
}

eric2012 @ 2025-5-7 16:23:35

C

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

eric2012 @ 2025-4-18 13:40:53

#include <bits/stdc++.h>
using namespace std;
int m,n,a[10010],ans=0;
int main()
{
	cin>>m>>n;
	for(int i=0,j=1;i<=m && j<=n;)
	{
		
		a[i*3+j*5]++;
		//cout<<i<<" "<<j<<' '<<i*3+j*5<<endl;
		j++;
		if(j == n+1)
		{
			j=0;
			i++;
		}
	}
	for(int i=1;i<=10000;i++)
	{
		if(a[i])
		{
			cout<<i<<' ';
			ans++; 
		}
	}
	cout<<endl<<ans<<endl;
	return 0;
}

renqicheng @ 2025-4-18 13:38:14

#include<bits/stdc++.h>
using namespace std;
bool f=1;
int n,m,a[10100];
int main(){
	cin>>n>>m;
	for(int i=2;i<=m;i++){
		for(int j=1;j<=n;j++){
			if(j%i==0){
				a[j]++;
			} 
		} 
	}
	for(int i=1;i<=n;i++){
		if(a[i]%2==0){
			if(f){
				cout<<i;
				f=0;
			}
			else{
				cout<<","<<i;
			}
		}
	}
	return 0;
}

renqicheng @ 2025-3-24 16:12:21

C

renqicheng @ 2025-3-24 16:11:57

#include<bits/stdc++.h>
using namespace std;
int a[110];
int n,mi=INT_MAX;
int main(){
	int i,p;
	cin>>n;
	for(i=1;i<=n;i++){
		cin>>a[i];
		if(mi>a[i]){
			mi=a[i];
			p=i; 
		}
	}
	for(i=p;i<=n-1;i++){
		a[i]=a[i+1];
	}
	n--;
	for(i=1;i<=n;i++){
		cout<<a[i]<<" ";
	}
	return 0;
}

renqicheng @ 2025-3-24 16:10:26

#include<bits/stdc++.h>
using namespace std;
int a[110];
int n,y,p,ma=INT_MIN;
int main(){
	int i;
	cin>>n;
	for(i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]>ma){
			ma=a[i];
			p=i;
		}
	} 
	cin>>y;
	for(i=n;i>=p+1;i--){
		a[i+1]=a[i];
	}
	a[p+1]=y;
	n++;
	for(i=1;i<=n;i++){
		cout<<a[i]<<" ";
	}
	return 0;
}

eric2012 @ 2025-3-13 16:43:07

#include <iostream>
using namespace std;
int arr[100];
int m;
int main()
{
    cin>>m;
    for (int i=0;i<m;i++) cin >> arr[i];
    for (int i = 2; i <= m - 3; i++) 
	{
        if (arr[i] < arr[i-2] && arr[i] < arr[i-1] && arr[i] < arr[i+1] && arr[i] < arr[i+2]) {
            cout<<arr[i]<<endl;
        }
    }
    return 0;
}

eric2012 @ 2025-3-13 16:35:55

#include <iostream>
#include <iomanip>
using namespace std;
int main() 
{
    double n;
    cin>>n;
    int h[11];
    double sum=0;
    for (int i = 0; i < n; ++i)
	{
        cin>>h[i];
        sum+=h[i];
    }
    double ave=(sum) / n;
	printf("AVE=%.1lf\n",ave);
    bool first=true;
    for (int i=0;i<n;++i)
	{
        if (h[i] > ave)
		{
            if (!first) cout << " ";
            cout<<i+1<<":"<<h[i];
            first=false;
        }
    }
    cout<<endl;
    return 0;
}

eric2012 @ 2025-3-13 16:32:35

#include<bits/stdc++.h>
using namespace std; 
double n,a[110],pj=0,b=0,s=0,t=0;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		t+=a[i];
	}
	t/=n;
	printf("%.1lf ",t);
	for(int i=1;i<=n;i++)
	{
		if(a[i] >= t) b++;
		else s++;
	}
	cout<<b<<" "<<s<<endl;
	return 0;
}

😄 1

eric2012 @ 2025-3-13 16:28:19

#include<bits/stdc++.h>
using namespace std; 
int n,minn=100001,k=0;
int a[101];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		if(a[i] < minn)
		{
			minn=a[i];
			k=i;
		}
	}
	cout<<minn<<" "<<k<<endl;
	return 0;
}

qinzihan @ 2024-12-25 16:30:41

d:

#include<bits/stdc++.h>
using namespace std;
int n,m,a[100005],l,r,mid;
bool check(int x){
	int cnt=1,sum=a[1];
	for(int i=2;i<=n;i++){		
		if(sum+a[i]>x){
			cnt++;
			sum=a[i];
		}else{
			sum+=a[i];
		}
	}
	return cnt>m; 
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		l=max(l,a[i]);
		r+=a[i]; 
	}
	while(l<=r){
		mid=(l+r)>>1;
		if(check(mid)){
			l=mid+1;
		}else{
			r=mid-1;
		}
	} 
	cout<<l;
	return 0;
}

qinzihan @ 2024-12-25 16:30:07

C:

#include<bits/stdc++.h>
using namespace std;
int n,k,a[10005],l,r,mid;
double q[10005];
bool check(int x){
	int cnt=0;
	for(int i=1;i<=n;i++){
		cnt+=a[i]/x;
	}
	return cnt>=k;
}
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>q[i];
		a[i]=q[i]*100;
	}
	l=1,r=1e8;
	while(l<=r){
		mid=l+r>>1;
		if(check(mid)){
			l=mid+1;
		}else{
			r=mid-1;
		}
	}
	cout<<fixed<<setprecision(2)<<(l-1)*1.0/100;
	return 0;
}

qinzihan @ 2024-12-25 16:29:32

A:



#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,k,a[N],l,r,mid;
bool check(int x){
	int cnt=0;
	for(int i=1;i<=n;i++){
		cnt+=a[i]/x;
	}
	return cnt>=k;
}

int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	l=1,r=1e8;
	while(l<=r){
		mid=l+r>>1;
		if(check(mid)){
			l=mid+1;
		}else{
			r=mid-1;
		}
	}
	cout<<l-1;
	return 0;
}

qinzihan @ 2024-12-12 16:24:51

F:

#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,k,a[N],b[N];
long long ans;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	for(int i=1;i<=m;i++){
		int l=1,r=n+1;
		while(l<r){
			int mid=(l+r)/2;
			if(a[mid]<=b[i]){
				l=mid+1;
			}else{
				r=mid;
			}
		}
		if(l==1){
			ans+=abs(a[1]-b[i]);
		}else{
			ans+=min(abs(a[l]-b[i]),abs(a[l-1]-b[i]));
		}
	}
	cout<<ans;
	return 0;
}
```
`

qinzihan @ 2024-12-12 16:18:28

小x:

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+5;
int n,a[N],a1[N];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a1[i]=a[i];
	}
	sort(a+1,a+n+1,greater<int>());
	for(int i=1;i<=n;i++){
		int l=1,r=n;
		while(l<=r){
			int mid=(l+r)>>1;
			if(a[mid]<=a1[i]){
				r=mid-1;
			}else{
				l=mid+1;
			}
		}
		cout<<l<<endl;
	}
	return 0;
}

eric2012 @ 2024-12-12 16:17:57

A

#include <bits/stdc++.h>
using namespace std;
int n;
int a[101][101],c[101];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int m,k;
		cin>>m>>k;
		for(int j=1;j<=k;j++)
		{
			int t;
			cin>>t;
			a[t][m]=1;
			c[t]++;
		}
	}
	int maxv=c[1],num=1;
	for(int i=2;i<=100;i++)
	{
		if(maxv < c[i])
		{
			maxv=c[i];
			num=i;
		}
	}
	cout<<num<<endl;
	for(int i=0;i<=100;i++) if(a[num][i]) cout<<i<<' ';
	return 0;
}

岳燚 @ 2024-11-21 15:58:24

D:

#include <bits/stdc++.h>
using namespace std;
int n;
double a,b;
bool op(int a,int b)
{
	a=min(a,b);
	b=max(a,b);
	for(int i=a;i>=2;i--)
	{
		if(a%i==0&&b%i==0) return 0;
	}
	return 1;
}
int t,y;
double pup=-1;
int main()
{
	cin>>n>>a>>b;
	double h=double(a);
	double g=double(b);
	double f=h/g;
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			double q=double(i);
			double w=double(j);
			double e=q/w;
			if(e<f&&op(i,j))
			{
				if(e>pup)
				{
					pup=e;
					t=i;
					y=j;
				}
				
			}
		}
	}
	cout<<t<<" "<<y<<endl;
	return 0;
}

岳燚 @ 2024-11-21 15:57:55

C:

#include <iostream>
using namespace std;
int he(int a)
{
	int s=a*(a+1)/2;
	return s;
}
int main()
{
	int n;
	cin>>n;
	int a=0,b=0,s=0,o=0;
	int i=0;
	while(o==0)
	{
		i++;
		for(int j=1;j<=i;j++)
		{
			if(he(i)-j*2==n)
			{
				cout<<j<<" "<<i<<endl;
				return 0;
			}
		}
	}
	
	
	
	
	
	
	
	
	
	
	return 0;
}

eric2012 @ 2024-11-20 16:03:09

A:

#include <bits/stdc++.h>
using namespace std;
int a,n,m,x,ans;
int f[20],sum[20];
int main()
{
	cin>>a>>n>>m>>x;
	ans=a;
	if(x>=3) ans+=a;
	if(x>=4)
	{
		f[1]=f[2]=1;	
		for(int i=3;i<=n-4;i++)
			f[i]=f[i-1]+f[i-2];
		for(int i=1;i<=n-4;i++)
			sum[i]=sum[i-1]+f[i];
		int y=(m-sum[n-5]*a-ans)/sum[n-4];
		ans+=sum[x-4]*a+sum[x-3]*y;
	}
	cout<<ans<<endl;
	return 0;
}

岳燚 @ 2024-11-18 16:29:29

B:地图探险

#include <bits/stdc++.h>
using namespace std;
int t;
int n,m,k;
int x,y,d;
int s=0;
char a[2000][2000];
int main()
{
	cin>>t;
	while(t--)
	{
		cin>>n>>m>>k;
		cin>>x>>y>>d;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++) cin>>a[i][j];
		}
		a[x][y]='#';
		for(int i=1;i<=k;i++)
		{
			if(d==0)
			{
				y++;
				if(x>=1&&x<=n&&y>=1&&y<=m&&a[x][y]!='x') a[x][y]='#';
				else
				{
					d=(d+1)%4;
					y--;
				}
			}
			else if(d==1)
			{
				x++;
				if(x>=1&&x<=n&&y>=1&&y<=m&&a[x][y]!='x') a[x][y]='#';
				else
				{
					d=(d+1)%4;
					x--;
				} 
			}
			else if(d==2)
			{
				y--;
				if(x>=1&&x<=n&&y>=1&&y<=m&&a[x][y]!='x') a[x][y]='#';
				else
				{
					d=(d+1)%4;
					y++;
				}
			}
			else if(d==3)
			{
				x--;
				if(x>=1&&x<=n&&y>=1&&y<=m&&a[x][y]!='x') a[x][y]='#';
				else
				{
					d=(d+1)%4;
					x++;
				} 
			}
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				if(a[i][j]=='#') s++;
			}
		}
		cout<<s<<endl;
		s=0;
	}
	return 0;
}

岳燚 @ 2024-11-18 16:28:44

A:扑克牌

#include <bits/stdc++.h>
using namespace std;
int n;
int yuuu=52;
string str[101];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>str[i];
		int o=0;
		for(int j=i-1;j>=1;j--)
		{
			if(str[i]==str[j])
			{
				o=1;
				break;
			}
		}
		if(o==0) yuuu--;
	}
	cout<<yuuu<<endl;
	return 0;
}

eric2012 @ 2024-10-23 16:52:27

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int x,ans=0;
		cin>>x;
		for(int j=1;j<x;j++)
		{
			if(j % 3 == 0 || j % 5 == 0)
			{
				ans+=j;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}

🤡 1

👍 1

renqicheng @ 2024-10-24 16:25:26

你这是几月几号的

eric2012 @ 2024-10-23 16:51:59

G题

岳燚 @ 2024-10-23 16:18:20

C:

#include <bits/stdc++.h>
using namespace std;
int n,s=0;
int a[100001];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			for(int k=j+1;k<=n;k++)
			{
				if(a[i]>abs(a[j]-a[k])&&a[j]>abs(a[i]-a[k])&&a[k]>abs(a[i]-a[j])) s++;
			}
		}
	}
	cout<<s<<endl;
	return 0;
 }

岳燚 @ 2024-10-23 16:17:57

B:

#include <iostream>
using namespace std;
int s[1000001];
int a[1000001];
int main()
{
	int n,m,k,ans=0;
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			for(int o=1;o<=k;o++)
			{
				s[ans]=i+j+o;
				ans++;
			}
		}
	}
	for(int i=0;i<ans;i++) a[s[i]]++;
	int maxn=-10,maxnn=0;
	for(int i=3;i<=n+m+k;i++)
	{
		if(a[i]>maxn)
		{
			maxn=a[i];
			maxnn=i;
		}
	}
	cout<<maxnn<<endl;
	return 0;
}

岳燚 @ 2024-10-23 16:17:35

A:

#include <iostream>
using namespace std;
int main()
{
	int relax=0,goal,bank=0,num;
	for(int i=1;i<=12;i++)
	{
		relax+=300;
		cin>>goal;
		if(goal>relax)
		{
			cout<<-i;
			return 0;
		}
		relax-=goal;
		num=relax/100*100;
		bank+=num;
		relax-=num;
	}
	cout<<relax+bank*1.2;	
	return 0;
}

岳燚 @ 2024-10-16 20:09:52

以下是2024/10/9的作业题解

岳燚 @ 2024-10-16 20:09:18

E:

#include <bits/stdc++.h>
using namespace std;
string s;
int a[26],len=26,sum;
bool cmp(int q,int w)
{
	return q>w;
}
int main()
{
	cin>>s;
	for(int i=0;i<s.size();i++)
	{
		if(s[i]>='A'&&s[i]<='Z') s[i]+=32;
		a[s[i]-'a']++;
	}
	sort(a,a+26,cmp);
	for(int i=0;i<26;i++)
	{
		sum+=a[i]*len;
		len--;
	}
	cout<<sum<<endl;
	return 0;
}

岳燚 @ 2024-10-16 20:08:54

D:

#include <iostream>
using namespace std;
int n,b[10000001],e[10000001],ans;
void qsort(int x,int y)
{
	int i=x,j=y,mid=e[(x+y)/2];
	while(i<=j)
	{
		while(e[i]<mid) i++;
		while(e[j]>mid) j--;
		if(i<=j)
		{
			swap(e[i],e[j]);
			swap(b[i],b[j]);
			i++;
			j--;
		}
	}
	if(x<j) qsort(x,j);
	if(i<y) qsort(i,y);
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>b[i]>>e[i];
	qsort(1,n);
	for(int i=1,t=-1;i<=n;i++)
	{
		if(b[i]>=t)
		{
			ans++;
			t=e[i];
		}
	}
	cout<<ans<<endl;
	return 0;
}

岳燚 @ 2024-10-16 20:08:25

C:

#include <bits/stdc++.h>
using namespace std;
bool cmp(string q,string w)
{
	return q+w<w+q;
}
int n;
string s[1000001]; 
int main()
{
	cin>>n;
	for(int i=0;i<n;i++) cin>>s[i];
	sort(s,s+n,cmp);
	for(int i=0;i<n;i++) cout<<s[i];
	return 0;
}

岳燚 @ 2024-10-16 20:07:47

B:

#include <bits/stdc++.h>
using namespace std;
int n,x,len;
vector <int> a[100005];
bool f;
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>x;
		f=0;
		for(int j=1;j<=len;j++)
		{
			if(x<a[j].back())
			{
				a[j].push_back(x);
				f=1;
				break;
			}
		}
		if(f==0)
		{
			a[++len].push_back(x);
		}
	}
	cout<<len<<endl;
	return 0;
 }

岳燚 @ 2024-10-16 20:07:15

A:

#include <bits/stdc++.h>
using namespace std;
int n,c,d,s,t,cnt;
int a[1000001];
int main()
{
	cin>>n>>c>>d;
	for(int i=0;i<n;i++) cin>>a[i];
	sort(a,a+n);
	c+=d;
	for(int i=0;i<n;i++)
	{
		if(c-a[i]>=0) cnt++;
		c-=a[i];
	}
	cout<<cnt<<endl;
	return 0;
 }

岳燚 @ 2024-10-16 20:06:42

以下是2024/10/16的作业题解

岳燚 @ 2024-10-16 20:01:59

F:

#include <bits/stdc++.h>
using namespace std;
int n,k,sum;
string s;
struct _5people{
	string name;
	int dai;
	int hao;
}a[1000001];
int main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name;
		cin>>a[i].dai;
		a[i].hao=0;
		if(a[i].dai==1) a[i].dai=2000;
		else if(a[i].dai==2) a[i].dai=1000;
		else if(a[i].dai==3) a[i].dai=200;
		else if(a[i].dai==4) a[i].dai=36;
		else if(a[i].dai==5) a[i].dai=6;
	}
	while(k--)
	{
		cin>>s;
		for(int j=1;j<=n;j++)
		{
			if(s==a[j].name)
			{
				if(a[j].hao==0)
				{
					a[j].hao=1;
					break;
				}
				sum+=a[j].dai;
				break;
			}
		}
	}
	cout<<sum<<endl;
	return 0;
}

岳燚 @ 2024-10-16 20:01:18

E:

#include <iostream>
using namespace std;
int a[1000001];
int main()
{
	int n,s=0,v1,v3,v7,v30,v120,v365,ans=0;
	cin>>n;
	cin>>v1>>v3>>v7>>v30>>v120>>v365;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		if(a[i]==1)
		{
			s++;
			if(s>=1&&s<3) ans+=v1;
			else if(s>=3&&s<7) ans+=v3;
			else if(s>=7&&s<30) ans+=v7;
			else if(s>=30&&s<120) ans+=v30;
			else if(s>=120&&s<365) ans+=v120;
			else if(s>=365) ans+=v365;
		}
		else s=0;
	}
	cout<<ans<<endl;
	return 0;
}

岳燚 @ 2024-10-16 20:00:37

D:

#include <bits/stdc++.h>
using namespace std;
string zd;
int t;
string a,b;
string g="green";
string r="red";
int main()
{
	cin>>zd;
	cin>>t;
	while(t--)
	{
		cin>>a>>b;
		int lena=a.size();
		int lenb=b.size();
		for(int i=0;i<lena;i++)
		{
			for(int j=0;j<26;j++)
			{
				if(a[i]==zd[j])
				{
					a[i]=j+'0';
					break;
				}
			}
		}
		for(int i=0;i<lenb;i++)
		{
			for(int j=0;j<26;j++)
			{
				if(b[i]==zd[j])
				{
					b[i]=j+'0';
					break;
				}
			}
		}
		int o=0;
		int le=max(lenb,lena);
		for(int i=0;i<le;i++)
		{
			if(a[i]<b[i])
			{
				o=1;
				break;
			}
			else if(a[i]>b[i])
			{
				o=0;
				break;
			}
		}
		if(o) cout<<g<<endl;
		else cout<<r<<endl;
	}
	return 0;
}

岳燚 @ 2024-10-16 20:00:00

C:

#include <bits/stdc++.h>
using namespace std;
int q;
string s;
int n,a,b;
string str;
int main()
{
	cin>>q;
	cin>>s;
	while(q--)
	{
		cin>>n;
		if(n==1)
		{
			cin>>str;
			s+=str;
			cout<<s<<endl;
		}
		else if(n==2)
		{
			cin>>a>>b;
			string e=s.substr(a,b);
			s=e;
			cout<<s<<endl;
		}
		else if(n==3)
		{
			cin>>a;
			cin>>str;
			s.insert(a,str);
			cout<<s<<endl;
		}
		else if(n==4)
		{
			cin>>str;
			int t=s.find(str);
			cout<<t<<endl;
		}
	}
	return 0;
}

岳燚 @ 2024-10-16 19:59:13

B:

#include <iostream>
using namespace std;
string n;
int l=0,o=0,r=0,s=0;
int main()
{
	while(getline(cin,n))
	{
		if(n[0]=='+') r++;
		else if(n[0]=='-') r--;
		else if(n[0]!='+'||n[0]!='-')
		{
			for(int i=0;i<=n.size();i++)
			{
				if(n[i]==':') o=1;
				else if(n[i]!=':'&&o==1&&n[i]!='\0') l++;
			}
			s+=l*r;
			l=0;
		}
		o=0;
	}
	cout<<s<<endl;
	return 0;
}

岳燚 @ 2024-10-16 19:58:41

A:

#include <bits/stdc++.h>
using namespace std;
int n,k;
int v;
int main()
{
	cin>>n>>k;
	cin>>v;
	v+=k;
	v--;
	cout<<v%n<<endl;
	return 0;
 }

eric2012 @ 2024-10-16 16:28:38

给我一下B E 题解吧，谢谢

sunzhaohang @ 2024-6-12 19:48:57

为啥会[记录详情 - Turing (qdturing.cn)](https://)

🍋 3

😕 2

王致志 @ 2024-6-6 16:01:54

连续自然数和

🤡 3

song @ 2024-5-21 16:54:08

... _ ...

🤡 5

有问必答群答主：（sunzhanghang，yueyi,qinzihan,dushize,songpeiqian）

51 条评论

连续自然数和

状态

开发

支持

有问必答群 答主：（sunzhanghang，yueyi,qinzihan,dushize,songpeiqian）

51 条评论

连续自然数和

状态

开发

支持

登录

有问必答群答主：（sunzhanghang，yueyi,qinzihan,dushize,songpeiqian）