C++学习记录NO.6

#数组

#include<iostream>
#include<iomanip>
#include<math.h>
using namespace std;
int main()
{
    long long n,t,s=0;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>t;
        s+=t;
    }
    cout<<s<<" "<<fixed<<setprecision(5)<<1.0*s/n<<endl;
    return 0;
}

 

#include <iostream>
using namespace std;

int main()
{
    long int F[100]={1,1};
    int n=0;
    cin>>n;
    for(int i=2;i<n;i++)
        {F[i]=F[i-1]+F[i-2];}
    for(int i=0;i<n;i++)
        {cout<<F[i]<<endl;}
    return 0;
}

 

 

 

#include<iostream>
#include<map>
#include<tuple>
#include<list>
#include<algorithm>
using namespace std;
int Count(list<map<char, list<tuple<int, int>>>> chess_games, map<char, list<tuple<int, int>>> m1);
int main()
{
    int n;
    cin >> n;
    char c;
    map<char, list<tuple<int, int>>> m1;
    list<map<char, list<tuple<int, int>>>> chess_games;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < 8; j++)
        {
            for (int k = 0; k < 8; k++)
            {
                cin >> c;
                if (c == '*')    continue;
                else m1[c].push_back(tuple<int,int>(j, k));
            }
        }
                chess_games.push_back(m1);
                cout << Count(chess_games, m1) << endl;
                m1.clear();
            }
         
         
        }
         
        int Count(list<map<char, list<tuple<int, int>>>> chess_games, map<char, list<tuple<int, int>>> m1)
{
            int count = 0;
            /*
             也可以用序号来表示
             依次去比对相对有点麻烦占空间
             遍历m1，找它的键值。
             */
            for (map<char, list<tuple<int, int>>> a : chess_games) {            //遍历所有棋局
                if (a.size() != m1.size()) continue;                            //棋子种类不对直接下局
                bool flag = true;
                for (pair<char, list<tuple<int, int>>> b : m1)
                {
                    for (tuple<int, int>c : b.second) {                            //遍历棋子所有存在的位置
                        if (find(a[b.first].begin(), a[b.first].end(), c) == a[b.first].end())
                        {
                            flag = false;
                            break;
                        }
                        
                    }
                    if (!flag)
                        break;
                }
                if (flag)
                    count++;
            }
            return count;
        }

 

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

 

#include <stdio.h>
#include <string.h>
 
int main()
{
    int n = 0;
    int arr[20][20] = { 0 };
    scanf("%d", &n);
    int i = 0;
    int j = 0;
    for (i = 0; i < n; i++){
        for (j = 0; j < n; j++){
            if (i == j){
                arr[i][j] = 1;}
            if (j == 0){
                arr[i][j] = 1;}
            if (i >= 2 && j >= 1){
                arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j];}
        }
    }
    //打印
    for (i = 0; i < n; i++){
        for (j = 0; j <=i; j++)//这里的就j<=i 是意味着是控制输出的
        {
            printf("%5d", arr[i][j]);
        }
        printf("\n");
    }
    return 0;}

 

#include <iostream>
using namespace std;
int main() {
    long int n=1, i = 0, j = 0, k = 1, size = 0, a[40][40] = { 0 };
    cin >> n;
    j = n - 1;
    size = (2 * n - 1) * (2 * n - 1);
    a[i][j] = k;//先将第一个数字放在中间
    k++;
    while (size > 1) {
        if (i==0&&j!= 2 * n - 2) {
            i=2*n-2;j = j + 1;a[i][j] = k;
            k++;}
        else if (i !=0 && j == 2 * n - 2) {
            i = i - 1;j = 0;a[i][j] = k;
            k++;}
        else if ((i == 0 && j == 2 * n - 2 )|| a[i - 1][j + 1] != 0) {
            i = i + 1;a[i][j] = k;
            k++;}
        else {i = i - 1;j = j + 1;a[i][j] = k;
            k++;}
        size--;}
                for (int x = 0; x < 2 * n - 1; x++) {
                    for (int y = 0; y < 2 * n - 1; y++) {
                        cout << a[x][y];
                        if (y !=2* n - 2) {
                              cout<<" ";}
                    }
                    cout << endl;
                        }
                        return 0;
                    }

 

 

#include <iostream>
using namespace std;
int main( )
{
    char a[17];
    int i,j=0;
    int sum;
    int b[13]={0};
    for(i=0;i<17;i++)
    {
        cin>>a[i];
        if(a[i]>='0'&&a[i]<='9')
        {b[j]=a[i]-'0';
            j++;}
    }
    sum=b[0];
    for(j=1;j<12;j++)
    {if(j%2!=0){b[j]=3*b[j];}
        sum=sum+b[j];
    }
    int mood,jy;
    mood=sum%10;
    jy=10-mood;
    if(jy==10)jy=0;
    if(jy==b[12])cout<<"Right";
    else
    {a[16]=jy+'0';
        for(i=0;i<17;i++)
        {cout<<a[i];}
    }
    return 0;}

 

#include <iostream>
#include <string>
using namespace std;
int main()
{
    int n=1;
    char *color[5]={"red","yellow","blue","white","black"};
    for(int i=0;i<=4;i++){
        for(int j=0;j<=4;j++){
            for(int k=0;k<=4;k++){
                if(!(i==j||k==i||k==j))
                {  cout<<n<<" "<<color[i]<<" "<<color[j]<<" "<<color[k]<<endl;
                    n++;}
            }
        }
    }
    return 0;
}

 

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int a[3];
    char x,y,z;
    cin>>a[0]>>a[1]>>a[2];
    sort(a,a+3);
    cin>>x>>y>>z;
    cout<<a[x-65]<<' '<<a[y-65]<<' '<<a[z-65]<<' '<<endl;
    return 0;
}

 

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