【蓝桥杯基础练习】BASIC汇总

1. 闰年判断

简单的条件判断

#include <iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    if((n%4==0&&n%100!=0)||n%400==0){
        cout<<"yes"<<endl;
    }else{
        cout<<"no"<<endl;
    }
    return 0;
}

2. 01字串 🔆

和取余差不多

#include <iostream>
using namespace std;

int main()
{
	for(int i=0;i<32;i++)
		cout<<i%32/16<<i%16/8<<i%8/4<<i%4/2<<i%2<<endl;
    return 0;
} 

3. 字母图型 🔆

把一行字母分为两部分

利用字母可以组成一些美丽的图形，下面给出了一个例子：
ABCDEFG
BABCDEF
CBABCDE
DCBABCD
EDCBABC
这是一个5行7列的图形，请找出这个图形的规律，并输出一个n行m列的图形。

#include <iostream>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    string str1 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    for(int i=0;i<n;i++){
        string res = "";
        //第一部分
        for(int j=i;j>i-m;j--){
            if(j<0) break;
            res+=str1[j];
        }
        //第二部分
        for(int k=1;k<m-i;k++){
            res+=str1[k];
        }
        cout<<res<<endl;
    }
    return 0;
}

4. 数列特征

简单的输出最大值，最小值，和

/* 注意这里数组的长度和n的范围 */
#include <iostream>
using namespace std;
int main(){
    int n,a[1000],sum=0,temp;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for (int i = 0; i < n-1; i++)
    {
        for (int j = i+1; j < n; j++)
        {
            if (a[j] < a[i])
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
    for(int i=0;i<n;i++){
        sum+=a[i];
    }
    cout<<a[n-1]<<endl;
    cout<<a[0]<<endl;
    cout<<sum<<endl;
    return 0;
}

5. 查找整数

分清楚没查到的情况

#include <iostream>
using namespace std;
int main()
{
    int n, a[1000], m,temp;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    cin >> m;
    for (int i = 0; i < n; i++)
    {
        if (a[i] == m)
        {
            temp=i+1;
            break;
        }
        else{
            temp=0;
        }
    }
    if(temp){
        cout<<temp<<endl;
    }
    else{
        cout<<-1<<endl;
    }
    return 0;
}

6. 杨辉三角 🔆

找规律

#include <stdio.h>
int main()
{
    int a[100][100], i, j, num;
    scanf("%d", &num);
    for (i = 0; i < 100; i++) //初始化数组
    {
        for (j = 0; j < 100; j++)
            a[i][j] = 0;
    }
    for (i = 0; i < num; i++) //使数组的第一列都为1
        a[i][0] = 1;
    for (i = 1; i < num; i++) //第i行j列元素等于第i-1行j列和第i-1行j-1列元素的和
        for (j = 1; j <= i; j++)
            a[i][j] = a[i - 1][j] + a[i - 1][j - 1];
    for (i = 0; i < num; i++) //输出杨辉三角形
    {
        for (j = 0; j <= i; j++)
            printf("%d ", a[i][j]);
        printf("\n");
    }
    return 0;
}

7. 特殊的数字（水仙花数

取余方式

#include <iostream>
#include <cmath>
using namespace std;
int main(){
    int a,b,c;
    for(int i=100;i<1000;i++){
        a=i/100%10;
        b=i/10%10;
        c=i/1%10;
        if(i==(pow(a,3)+pow(b,3)+pow(c,3))){
            cout<<i<<endl;
        }
    }
    return 0;
}

8. 回文数

取余方式

#include <iostream>
#include <cmath>
using namespace std;
int main(){
    int a,b,c;
    for(int i=100;i<1000;i++){
        a=i/100%10;
        b=i/10%10;
        c=i/1%10;
        if(i==(pow(a,3)+pow(b,3)+pow(c,3))){
            cout<<i<<endl;
        }
    }
    return 0;
}

9. 特殊回文数

见上

#include <iostream>
using namespace std;
int main()
{
    int n, a, b, c, d, e, f;
    cin >> n;
    for (int i = 10000; i < 1000000; i++)
    {
        if (i < 100000)
        {
            a = i / 10000 % 10;
            b = i / 1000 % 10;
            c = i / 100 % 10;
            d = i / 10 % 10;
            e = i / 1 % 10;
            if (a == e && b == d && a + b + c + d + e == n)
            {
                cout << i << endl;
            }
        }
        else
        {
            a = i / 100000 % 10;
            b = i / 10000 % 10;
            c = i / 1000 % 10;
            d = i / 100 % 10;
            e = i / 10 % 10;
            f = i / 1 % 10;
            if (a == f && b == e && c == d && a + b + c + d + e + f == n)
            {
                cout << i << endl;
            }
        }
    }
}

10. 10-16 🔆🔆

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n, i = 0, j = 0, m;
    char a[10000], c;
    cin >> n;
    if (n == 0)
    {
        cout << 0 << endl;
        return 0;
    }
    else
    {
        while (n != 0)
        {
            m = n / 16;
            if (n % 16 == 0)
            {
                a[i++] = '0';
            }
            else
            {
                if (n % 16 >= 10)
                {
                    c = n % 16 - 10 + 'A';
                    a[i++] = c;
                }
                else
                {
                    c = n % 16 + '0';
                    a[i++] = c;
                }
            }
            n = m;
        }
    }
    for (j = i - 1; j >= 0; j--)
    {
        cout << a[j];
    }
    return 0;
}

11. 16-10 🔆🔆

#include <iostream>
#include <math.h>
#include <string>
using namespace std;

int main()
{
    int n = 1, i = 0, j = 0, temp = 0;
    long long nNum = 0;
    char ch;
    string strHex[10]; //16
    string strBin[10]; //2

    for (i = 0; i < n; i++)
    {
        cin >> strHex[i];
    }

    //十六进制转二进制
    for (i = 0; i < n; ++i)
    {
        j = 0;
        while (strHex[i][j])
        {
            switch (strHex[i][j])
            {
            case '0':
                strBin[i] += "0000";
                break;
            case '1':
                strBin[i] += "0001";
                break;
            case '2':
                strBin[i] += "0010";
                break;
            case '3':
                strBin[i] += "0011";
                break;
            case '4':
                strBin[i] += "0100";
                break;
            case '5':
                strBin[i] += "0101";
                break;
            case '6':
                strBin[i] += "0110";
                break;
            case '7':
                strBin[i] += "0111";
                break;
            case '8':
                strBin[i] += "1000";
                break;
            case '9':
                strBin[i] += "1001";
                break;
            case 'A':
                strBin[i] += "1010";
                break;
            case 'B':
                strBin[i] += "1011";
                break;
            case 'C':
                strBin[i] += "1100";
                break;
            case 'D':
                strBin[i] += "1101";
                break;
            case 'E':
                strBin[i] += "1110";
                break;
            case 'F':
                strBin[i] += "1111";
                break;
            default:
                break;
            }
            ++j;
        }
    }

    //二进制转化为十进制
    for (i = 0; i < n; ++i)
    {
        j = strBin[i].size() - 1; //获得长度
        int con = 0;
        while (strBin[i][j] && j >= 0)
        {
            if (strBin[i][j] == '1')
            {
                nNum += pow(2, con); //2的con次方
            }
            else
            {
            }
            --j;
            con++;
        }
        cout << nNum << endl;
    }
    return 0;
}

12. 16-8 🔆🔆

#include <iostream>
using namespace std;

int main()
{
	int n;
	cin>>n;
	for(int i=0; i<n; i++)
	{	
		string tow;
		string sixteen;
		string eight;
		cin>>sixteen;
		for(int j=0; j<sixteen.length(); j++)
		{
			switch(sixteen[j])
			{
				case '0':tow+="0000";break;
				case '1':tow+="0001";break;
				case '2':tow+="0010";break;
				case '3':tow+="0011";break;
				case '4':tow+="0100";break;
				case '5':tow+="0101";break;
				case '6':tow+="0110";break;
				case '7':tow+="0111";break;
				case '8':tow+="1000";break;
				case '9':tow+="1001";break;
				case 'A':
				case 'a':tow+="1010";break;
				case 'B':
				case 'b':tow+="1011";break;
				case 'C':
				case 'c':tow+="1100";break;
				case 'D':
				case 'd':tow+="1101";break;
				case 'E':
				case 'e':tow+="1110";break;
				case 'F':
				case 'f':tow+="1111";break;
			}
		}
		if(tow.length()%3==1)
			tow="00"+tow;
		if(tow.length()%3==2)
			tow="0"+tow;
		if(!(tow[0]=='0'&&tow[1]=='0'&&tow[2]=='0'))
		{
			char temp;
			temp = (tow[0]-'0')*4+(tow[1]-'0')*2+tow[2];
			eight += temp;
		}
		for(int j=3; j<tow.length(); j+=3)
		{
			eight+=(tow[j]-'0')*4+(tow[j+1]-'0')*2+tow[j+2];
		}
		cout<<eight<<endl;
	}
	return 0;
}

13. 数列排序

#include <iostream>
using namespace std;
int main()
{
    int n, temp;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (int i = 0; i < n-1; i++)
    {
        for (int j = i+1; j < n; j++)
        {
            if (a[j] < a[i])
            {
                temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << a[i]<<" ";
    };
    return 0;
}