算法笔记(胡凡)------------ch3简单模拟

3.3图形输出

【PAT B1036 】 跟奥巴马一起编程

#include <iostream>
using namespace std;
int main()
{
	int n; char c;
	cin >> n >> c;
	for (int i = 0; i < n; i++) {
		cout << c;
	}
	cout << endl;
	int t = n % 2 == 0 ? n / 2 : (n + 1) / 2;
	for (int i = 0;i < t - 2; i++) {
		for (int j = 0; j < n; j++) {
			if (j == 0) {
				cout << c;
			} else if (j == n - 1) {
				cout << c << endl;
			} else cout << " ";
		}
	}
	for (int i = 0; i < n; i++) {
		cout << c;
	}
	cout << endl;
	return 0;
} 

3.4日期处理

【codeup 1928】日期的差值

#include <iostream>
#include <algorithm>
using namespace std;
int n;
int months[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

bool isLeap(int y) {
	return (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
}
int main()
{	
	int t1, t2;
	while (cin >> t1 >> t2) {
		if (t1 > t2) swap(t1, t2);
		int y1 = t1 / 10000, m1 = t1 % 10000 / 100, d1 = t1 % 100;
		int y2 = t2 / 10000, m2 = t2 % 10000 / 100, d2 = t2 % 100;		
		int res = 1;
		while (y1 != y2 || m1 != m2 || d1 != d2){
			res++;
			months[2] = 28;
			if (isLeap(y1)) months[2] = 29;	
			if (d1 < months[m1]) d1++;
			else{
				d1 = 1; m1++;
			}
			if (m1 == 13) {
				m1 = 1; y1++;
			}
			cout << res << endl;
		}
	}
	return 0;
}

3.4进制转换

【PAT B1022】D进制的A + B

/*
    D进制A+B
*/
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
    ll a,b,d,sum;
    cin >> a >> b >> d;
    sum = a + b;
    //res 存放D进制的每一位
    int res[31], i = 0;
    while (sum / d > 0) {
        res[i++] = sum % d;
        sum /= d;
    }
    res[i] = sum;
    while (i >= 0) {
        cout << res[i--];
    }
    return 0;
}

【codeup 5901】回文串

#include <iostream>
#include <string>
using namespace std;
int main()
{
    string s;
    cin >> s;
    int i, j ,len = s.size();
    for (i = 0, j = len - 1; i < len && j >= 0 && s[i] == s[j];i++,j--);
    if (i == len && j == -1)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}