1044 火星数字 (20 分)(C++)

最新推荐文章于 2024-01-15 00:36:25 发布

编程小白2021

最新推荐文章于 2024-01-15 00:36:25 发布

阅读量138

点赞数

分类专栏： PAT基础题

本文链接：https://blog.csdn.net/weixin_58527373/article/details/117911940

版权

PAT基础题专栏收录该内容

22 篇文章 0 订阅

订阅专栏

本文介绍了一段C++代码，涉及输入日期解析、月份与数字字符串的映射，以及不同长度字符串处理。程序通过`getline`读取用户输入，实现将短日期（1-2字符）、两位数年份或三位数日期转换成对应的完整格式，并根据特定规则生成字符串。

摘要由CSDN通过智能技术生成

#include <iostream>
#include<string>
#include <vector>
using namespace std;
int main() {
	int N;
	cin >> N;
	string s1[13] = { "tret","jan","feb","mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec" };
	string s2[13] = { "*","tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou" };
	getchar();
	vector<string>list(N);
	for (int i = 0;i < N;i++) {
		string s;
		getline(cin, s);
		if (s.size()<=2&&stoi(s)<13) {
			list[i] = s1[stoi(s)];
		}
		if (s.size() == 2&&stoi(s)>=13) {
			int a = stoi(s);
			int y = a / 13;
			int z = a % 13;
			if (z != 0) {
			  list[i]=s2[y]+" "+s1[a-y*13];
			}
			 if (z == 0) { 
			 if(a<13){list[i]=s1[a];}
			 else{list[i] = s2[y]; }
			 }
		}
		if (s.size() == 3) {
			if (s[0] > '0' && s[0] < '9') {
				int a = stoi(s);
				int y = a / 13;
				int z = a % 13;
				if (z != 0) {
					list[i] = s2[y] + " " + s1[a - y * 13];
				}
				if (z == 0) { list[i] = s2[y]; }
			}
			else {
				for (int j = 0;j < 13;j++) {
					if (s == s1[j]) { list[i] = to_string(j); }
					if (s == s2[j]) { list[i] = to_string(j*13); }
				}
			}
		}
		if (s.size() == 4||s.size()==8) {
			list[i] = "0";
		}
		if (s.size() == 7) {
			string x, y;
			int l = 0, r = 0;
			for (int j = 0;j < 3;j++) { x += s[j]; }
			for (int k = 4;k < s.size();k++) { y += s[k]; }
			for (int q = 0;q < 13;q++) {
				if (x == s2[q]) { l = q * 13; }
				if (y == s1[q]) { r = q; }
			}
			list[i] = to_string(l + r);
		}
	}
	for (int i = 0;i < N;i++) {
		cout << list[i] << endl;
	}
	return 0;
}