第11关 - 课程G 冒泡、选择、插入排序、分解质因子_慧通教育c++进阶课程(第11关)所有答案-CSDN博客

本文链接：https://blog.csdn.net/dllglvzhenfeng/article/details/134842422

1015.筛选质数(课程G)

登录

1015.筛选质数(课程G) 难度：1

1015.筛选质数(课程G) 难度：1_dllglvzhenfeng的博客-CSDN博客

筛选素数进制转换

筛选素数进制转换-CSDN博客

/*
1015.筛选质数(课程G)
https://www.51goc.com/level/program/102/1015

1015.筛选质数(课程G) 难度：1
https://blog.csdn.net/dllglvzhenfeng/article/details/128721425

筛选素数 进制转换
https://blog.csdn.net/predoctor/article/details/38011287
*/
#include <bits/stdc++.h>
using namespace std;
int N, ANS;
int a[1000010];
int main()
{
    //freopen("1452.in","r",stdin);
    //freopen("1452.out","w",stdout);
    cin >> N;
    int ct=0;   //记录被删除的个数
    for (int i=2; i*i < N+1; i++)
	   	if (a[i]==0)  //"选"出质数i
	   	{		   
		   	for (int j=i+i; j < N+1; j+=i )
		   	{
			  if( a[j]==0 )   ct++;
			  a[j]=i;  //"筛"掉i的倍数
		   	}
	   	}
    
	ANS = N-ct-1;
    
    cout <<  ANS << endl;
    
    return 0;
}

1016.倍数(课程G)

登录

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

1017.冒泡排序(课程G)

登录

/*
1017.冒泡排序(课程G) 难度：1
https://www.51goc.com/question/viewProgram/1017
*/
#include<bits/stdc++.h>
using namespace std;
int N;
int a[100010];
int main(){
    int N;
    //freopen("1454.in","r",stdin);
    //freopen("1454.out","w",stdout);
     cin >> N;
     for (int i=0; i < N; i++)
		cin >> a[i];

     for (int i=N-1; i > 0; i--)
	 {
		for (int j=0; j < i; j++)
			if( a[j]>a[j+1] )
				swap(a[j],a[j+1]);
     }	 
    for (int i=0; i < N; i++)
      cout << a[i] << " ";

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int N;
int a[100010];
int main()
{
     cin >> N;
     for (int i=0; i < N; i++)
		cin >> a[i];

     for (int i=N ; i > 0; i--)
	 {
		for (int j=0; j < i; j++)
			if(a[j]>a[j+1])
				swap(a[j],a[j+1]);
     }	 
    for (int i=1; i <= N; i++)
      cout << a[i] << " ";

    return 0;
}

1018.选择排序(课程G)

登录

/*
1018.选择排序(课程G)
https://www.51goc.com/level/program/102/1018
*/
#include<bits/stdc++.h>
using namespace std;
int N;
int a[100010];
int main()
{
     cin >> N;
     for (int i=0; i < N; i++)
		cin >> a[i];

     for (int i=N-1; i > 0; i--)
	 {
		int maxx = 0;  //最大值开始假设在第0位
		for (int j=1; j <= i; j++)    //扫描找最大值
			if (a[j] >a[maxx]) maxx=j; //记录大值的位置

		swap(a[maxx],a[i]);    //把最大值交换到后面
     }	 
     for (int i=0; i < N; i++)
		cout << a[i] << " ";
     return 0;
}

1019.插入排序(课程G)

登录

/*
1019.插入排序(课程G)01
https://www.51goc.com/level/program/102/1019
*/
#include<bits/stdc++.h>
using namespace std;
int N;
int a[100010];
int main()
{
     cin >> N;
     for (int i=0; i < N; i++)
		cin >> a[i];
    sort(a,a+N);
    for (int i=0; i < N; i++)
      cout << a[i] << " ";

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int N;
int a[100010];
int main()
{
     cin >> N;
     for (int i=1; i <= N; i++) //输入数组
		cin >> a[i];
    a[0]= -10000001;      //添加一个“哨兵”
     for (int i=1; i <= N ; i++)  //新数位置
	 {
           int temp=a[i];      //取当前的新数---(A)
		int j;
		for (j=i-1; a[j] > temp; j--) //找到适当位置。---(B)
		   a[j+1]=a[j];//---(C)	
	  a[j+1]=temp;              
     }
	 
	 for (int i=1; i <= N; i++)
		cout << a[i] << " ";
    return 0;
}

1020.跳房子(课程G)

登录

c++跳房子(课程G)_喝闷酒的师傅的博客-CSDN博客

/*
1020.跳房子(课程G)
https://www.51goc.com/level/program/102/1020
https://blog.csdn.net/weixin_70441119/article/details/130189062
*/
#include<bits/stdc++.h>
using namespace std;
int n,a[1000002],p=0;
int main(){
    cin>>n;    
    for(int i=0; i<=n-1; i=i+4)
    {
        a[i]=1;
        a[i-1]=1;
    }
    for(int i=0; i<=n-1; i=i+4)
    {
        a[i-1]=1;
        a[i]=1;
        a[i+1]=1;
    }
    for(int i=0; i<=n-1; i++)
    {
        if(a[i]==1)
        {
            continue;
        }
        else p++;
    }
    cout<<p+1; 
    return 0;
}

/*
1020.跳房子(课程G) 优化 
https://www.51goc.com/level/program/102/1020
https://blog.csdn.net/weixin_70441119/article/details/130189062
*/
#include<bits/stdc++.h>
using namespace std;
int n,a[1000002],p=0;
int main(){
    cin>>n;    
    /*
	a[0]=1;
	for(int i=4; i<=n-1; i=i+4)
    {
        a[i]=1;
        a[i-1]=1;
    }
    */
    
	a[0]=1;
	for(int i=4; i<=n-1; i=i+4)
    {
        a[i-1]=1;
        a[i]=1;
        a[i+1]=1;
    }
    for(int i=0; i<=n-1; i++)
    {
        if(a[i]==1)
        {
            continue;
        }
        else p++;
    }
    cout<<p<<endl;
	//cout<<p+1; 
    return 0;
}

1247：河中跳房子

信息学奥赛一本通（C++版）在线评测系统

1417：【17NOIP普及组】跳房子

信息学奥赛一本通（C++版）在线评测系统

1021.分解质因子(课程G)

登录

1021.分解质因子(课程G)-CSDN博客

/*
1021.分解质因子(课程G)
https://www.51goc.com/level/program/102/1021
https://blog.csdn.net/weixin_70441119/article/details/130254128
*/
#include<bits/stdc++.h>
using namespace std;
int b[1000003],c,d,a[1000003],s=0,x[1000003],p=0;
int main(){
cin>>c>>d;   
for(int i=2; i<=1000000; i++)
{
    if(a[i]==0)
   for(int j=2; ; j++)
   {
   		if(i*j>1000000) break;
   		else a[i*j]=1;   		
   }
}
for(long long i=2; i<=1000000; i++)
{	
		if(a[i]!=1)
		{
			s++;
			b[s]=i;
		}
}
for(long long i=c; i<=d; i++)
{
	p=i;
    for(;;)
    {
        if(p==1)break;
        for(int j=1; j<=s; j++)
	    {
            if(p%b[j]==0)
            {
                cout<<b[j]<<" ";
                p=p/b[j];
                break;
            }
 
	    }
    }	
	p=0;
	cout<<endl;	
}
    return 0;
}

1022.交换次数(课程G)

登录

1022.交换次数(课程G)-CSDN博客

/*
1022.交换次数(课程G)
https://www.51goc.com/level/program/102/1022
https://blog.csdn.net/weixin_70441119/article/details/130254214
*/
#include<bits/stdc++.h>
using namespace std;
int n,a[1002],t=0,h=0; 
int main(){
cin>>n;
for(int i=1; i<=n; i++)cin>>a[i];
for(int i=1; i<n; i++) 
{
    for(int j=n; j>1; j--)
    {
        if(a[j]<a[j-1])
        {
            h++;
           swap(a[j],a[j-1]);
        }
    }
}
cout<<h;
    return 0;
}

1023.兔子(课程G)

登录

/*
1023.兔子(课程G)
https://www.51goc.com/level/program/102/1023
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
	int a[100000],n,ans=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1,greater<int>());
	for(int i=1;i<=n;i++){
		ans+=a[i]*i;
	}
	cout<<ans;
	return 0;
}