算法学习-day2

    //叠筐 
    //思路 把输出的图形划分为一个个方框，根据当前
    //方框到达中心的距离选择字符输出，注意边界数据处理(四角)
    char matrix[80][80];  //记录整个图形(带四角)
    int n;
    char center,outside; //方框大小，中心字符，外框字符
    while(cin >> n >> center >> outside){
        for(int i = 0;i <= n/2;++i){ //i是每个方框左上角的点
            int j = n - 1 - i;       //j是每个方框右下角的点
            int length = n - 2 *i;   //当前方框长度
            char current;
            if((n / 2 - i) % 2 == 0){
                current = center;
            }else{
                current = outside;
            }
            for(int k = 0;k < length;++k){  //赋值
                matrix[i][i + k] = current; //上边界
                matrix[i + k][i] = current; //左边界
                matrix[j][j - k] = current; //下边界
                matrix[j - k][j] = current; //右边界
            }
        }
        if(n != 1){                 //去四角
            matrix[0][0] = ' ';
            matrix[0][n - 1] =' ';
            matrix[n - 1][0] = ' ';
            matrix[n -1][n -1] = ' ';
        }
        for(int i = 0;i < n;++i){
            for(int j = 0;j < n;++j){
                cout << matrix[i][j];
            }
            cout << endl;     
        }
        
    }

第二种思路：

int n;
    char a, b;
    int mark[85][85]; //位置矩阵
    while (cin >> n >> a >> b)
    {
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                mark[i][j] = 2;
 
        bool flag = 1; //中心是字符a
 
        int mid = n / 2; //中心坐标：(mid,mid)
 
        //由中心向边缘交替绘字符，新字符覆盖老字符
        for (int i = 0; i <= mid; i++) //交替绘制mid + 1次
        {
            if (flag == 1) //填字符a
            {
                for (int j = 0; j < n; j++)
                {
                    mark[mid + i][j] = 1; //中心上行
                    mark[j][mid + i] = 1; //中心右列
                    mark[mid - i][j] = 1; //中心下行
                    mark[j][mid - i] = 1; //中心左列
                }
                flag = 0;
            }
            else //填字符b
            {
                for (int j = 0; j < n; j++)
                {
                    mark[mid + i][j] = 0;
                    mark[j][mid + i] = 0;
                    mark[mid - i][j] = 0;
                    mark[j][mid - i] = 0;
                }
                flag = 1;
            }
        }
        //四个角置为空格
        mark[0][0] = 2;
        mark[0][n - 1] = 2;
        mark[n - 1][0] = 2;
        mark[n - 1][n - 1] = 2;
        //打印图形
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (mark[i][j] == 1)
                    cout << a;
                else if (mark[i][j] == 0)
                    cout << b;
                else
                    cout << " ";
            }
            cout << endl;
        }
    }

    //今年的第几天？（清华大学复试上机题）
    int year,month,day;
    int a[2][13] = {
        {0,31,28,31,30,31,30,31,31,30,31,30,31},
        {0,31,29,31,30,31,30,31,31,30,31,30,31}
        
    };
    cin >> year >> month >> day;
    int num = 0;
    if(year%4 != 0 || year % 400 != 0){
        for(int i = 0;i < month;i++){
            num += a[0][i];            
        }
        num += day;
    }else{
        for(int j = 0;j < month;j++){
            num += a[1][j];
        }
        num += day;
    }
    cout << num;