算法笔记刷题(100000578-100000580)
100000578
A
数组13 为了取数据更方便
#include<cstdio>
#include <algorithm>
using namespace std;
bool isLeap(int year) {
return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}
int main() {
int month[13][2] = { {0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31} };
int time1, y1, m1, d1;
int time2, y2, m2, d2;
while (~scanf("%d%d", &time1, &time2)) {
if (time1 > time2) {
swap(time1, time2);
}
y1 = time1 / 10000, m1 = time1 % 10000 / 100, d1 = time1 % 100;
y2 = time2 / 10000, m2 = time2 % 10000 / 100, d2 = time2 % 100;
int ans = 1;
while (y1 < y2 || m1 < m2 || d1 < d2) {
d1++;
if (d1 == month[m1][isLeap(y1)]+1) {
m1++;
d1 = 1;
}
if (m1 == 13) {
y1++;
m1 = 1;
}
ans++;
}
printf("%d\n", ans);
}
return 0;
}
B
根据蔡勒公式
编程中的求余运算可能是负数,当下标小于0时要加7
此公式只适用于格里高利历
方法二:可以用当天的日期和星期数和A一样一天一天地算
#include<cstdio>
#include <cstring>
char weekname[8][15] = { "","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday" };
char monthname[13][15] = { "","January","February","March","April","May","June","July","August","September","October","November","December" };
int monthtonum(char month[15]) {
int i;
for (i = 1; i < 13; i++) {
if (strcmp(month, monthname[i]) == 0) {
return i;
}
}
return NULL;
}
char* computeweek(int d,int m,int y) {
int c, y1;
if (m == 1 || m == 2)
{
c = (y - 1) / 100;
y1 = (y - 1) % 100;
m = m + 12;
}
else {
c = y / 100;
y1 = y % 100;
}
int W = c / 4 - 2 * c + y1 + y1 / 4 + 13 * (1 + m) / 5 + d - 1;
W = W >= 0 ? (W % 7) : (W % 7 + 7);
if (W == 0)
{
W = 7;
}
return weekname[W];
}
int main() {
int d, y;
char M[15];
while (~scanf("%d%s%d", &d, M,&y)) {
int m = monthtonum(M);
printf("%s\n", computeweek(d, m, y));
}
return 0;
}
C
格式化-0填满
#include<cstdio>
int month[13][2] = { {0,0},{31,31},{28,29},{31,31},{30,30},{31,31},
{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31} };
int main() {
int y, d;
while (~scanf("%d%d",&y,&d))
{
int isLeap = (y % 4 == 0 && y % 100 != 0) || (y % 400 == 0);
int i=1;
while (d - month[i][isLeaf] > 0) {
d -= month[i][isLeaf];
++i;
}
int m = i;
printf("%04d-%02d-%02d\n", y,m,d);
}
return 0;
}
D
#include<cstdio>
int month[13][2] = { {0,0},{31,31},{28,29},{31,31},{30,30},{31,31},
{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31} };
int main() {
int m1;
scanf("%d", &m1);
while (m1--) {
int y, m, d;
scanf("%d%d%d",&y, &m,&d);
if (m == 12 && d == 31) {
y++;
m = 1;
d = 1;
}
else if (d == month[m][1]) {
m++;
d = 1;
}
else {
d++;
}
printf("%04d-%02d-%02d\n", y, m, d);
}
return 0;
}
E
一直报错原因:年份更新后没有算isLeap
还是写个函数比较保险
#include<cstdio>
int month[13][2] = { {0,0},{31,31},{28,29},{31,31},{30,30},{31,31},
{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31} };
int main() {
int m1;
while (~scanf("%d", &m1)) {
while (m1--) {
int y, m, d, add;
scanf("%d%d%d%d", &y, &m, &d, &add);
int isLeap = ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0));
if (add+d > month[m][isLeap]) {
add -= month[m][isLeap] - d;
y = m == 12 ? y + 1 : y;
m = m == 12 ? 1 : m + 1;
isLeap = ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0));
while (add > month[m][isLeap]) {
add -= month[m][isLeap];
y = m == 12 ? y + 1 : y;
m = m == 12 ? 1 : m + 1;
isLeap = ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0));
}
d = add;
}
else {
d = d + add;
}
printf("%04d-%02d-%02d\n", y, m, d);
}
}
return 0;
}
100000579
A
#include<cstdio>
int main() {
int D;
long long A, B;
int a[40];
while (~scanf("%d",&D)) {
if (D == 0) break;
scanf("%lld%lld", &A, &B);
long long sum = A + B;
int i = 0;
do {
a[i++] = sum % D;
sum = sum / D;
} while (sum != 0);
for (int j = i-1; j >= 0; j--) {
printf("%d", a[j]);
}
printf("\n");
}
return 0;
}
B
memset(n, '\0', sizeof(n));
清除数组
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-IaPNS7dk-1631292613717)(C:\Users\联想\AppData\Roaming\Typora\typora-user-images\image-20210830003532684.png)]
#include<cstdio>
#include <cstring>
int main() {
int a, b;
char res[40], n[70];
while (~scanf("%d%s%d", &a, n ,&b)) {
int i = 0, j, n10 = 0;
long long product = 1;
for (j = strlen(n) - 1; j >= 0; j--) {
if (n[j] >= '0' && n[j] <= '9') {
n10 += (n[j] - '0') * product;
}
else if (n[j] >= 'a' && n[j] <= 'f') {
n10 += (n[j] - 'a' + 10) * product;
}
else if (n[j] >= 'A' && n[j] <= 'F') {
n10 += (n[j] - 'A' + 10) * product;
}
product *= a;
}
i = 0;
do {
if (n10 % b < 10) {
res[i++] = n10 % b + '0';
}
else {
res[i++] = n10 % b-10+'A';
}
n10 /= b;
} while (n10 != 0);
res[i] = '\0';
for (int j = i - 1; j >= 0; j--) {
printf("%c", res[j]);
}
printf("\n");
memset(n, '\0', sizeof(n));
memset(res, '\0', sizeof(res));
}
return 0;
}
C
难度:中
用数组存储数字,循环模拟除法过程
num数组
存储商
注意:1.数/2的余数由尾数决定。
2.如何模拟除法
3.什么条件终止
#include<cstdio>
#include <cstring>
int main() {
char a[30];
int a2[200];
while (~scanf("%s", a)) {
int i,num[30];
//字符串转化为数字串
for (i = 0; i < strlen(a); i++) {
num[i] = a[i] - '0';
}
int b = 0,count=0,len=strlen(a);
//这里的len表示商的长度
while (len>0)
{
a2[count++] = (num[strlen(a) - 1]) % 2;//尾数/2的余数=num/2的余数
int b = 0;
//重要步骤 模拟除法 商存于num数组中 这里i的初始值可为strlen(a) - len
//当一位%2==0时 直接下一位/2 当==0时 需要这一位*10+后一位 整体/2
for (i = 0; i < strlen(a); i++) {
int s = (num[i] + 10 * b) / 2;
b = num[i] % 2;
num[i] = s;
}
while (num[strlen(a) - len] == 0) {
len--;
}
}
for (i = count-1; i >=0; i--) {
printf("%d", a2[i]);
}
printf("\n");
}
return 0;
}
D
#include<cstdio>
int main() {
int a,b[100];
while (~scanf("%d", &a)) {
int i = 0;
if (a < 8) {
printf("%d\n", a);
}
else {
do {
b[i++] = a % 8;
a = a / 8;
} while (a != 0);
for (int j = i - 1; j >= 0; j--) {
printf("%d", b[j]);
}
printf("\n");
}
}
return 0;
}
100000580
A
#include<cstdio>
int main() {
char a[110], b[110];
while (~scanf("%s%s", a, b)) {
int len = 0;
while (a[len] != '\0') {
len++;
}
int i = len, k = 0;
while (b[k] != '\0') {
a[i++] = b[k++];
}
a[i] = '\0';
printf("%s\n", a);
}
return 0;
}
B
#include<cstdio>
#include <cstring>
#include<iostream>
using namespace std;
int main() {
char a[110];
while (cin.getline(a,110)) {
int i = 0;
while (a[i] != '\0') {
if (a[i] >= 'a' && a[i] <= 'z') {
if (i == 0 || a[i - 1] == ' ' || a[i - 1] == '\t' || a[i - 1] == '\r' || a[i - 1] == '\n') {
a[i] += 'A' - 'a';
}
}
++i;
}
printf("%s\n", a);
}
return 0;
}
C
难度:中
字符串匹配:使用字符串的简单模式匹配,也可以kmp
将短字符串和几个字符串全转为小写,方便删除
#include <cstdio>
#include <cstring>
#include <cctype>
#include<iostream>
using namespace std;
char del[1000], str[1001][1001], ans[1001][1001];
int main() {
int index = 0;
cin.getline(del, 1000);
int len1 = strlen(del);
for (int i = 0; i < len1; i++) {
del[i] = tolower(del[i]);
}
while (cin.getline(str[index++], 1001));
for (int i = 0; i < index; i++) {
for (int j = 0; j < strlen(str[i]); j++) {
ans[i][j] = str[i][j];//保存原字符串组
str[i][j] = tolower(str[i][j]);
}
//简单模式匹配
for (int j = 0, k = 0; j < strlen(str[i]); ) {
if (str[i][j + k] == del[k]) {
k++;
if (k == len1) {
j = j + k;
k = 0;
}
}
else {
if (str[i][j] != ' ')
printf("%c", ans[i][j]);
j++;
k = 0;
}
}
printf("\n");
}
return 0;
}
D
自己通不过,运行结果正确
E
好像结果得一次性打印出来 不能单个打印
字符串maybe有空格
#include <cstdio>
#include <cstring>
int max=400;
int main()
{
char s[max],b[max],c;
while(cin.getline(s,max))
{
scanf("%c",&c);
int len=0;
for(int i=0;a[i]!='\0';i++)
{
if(s[i]!=c)
b[len++]=s[i];
}
b[len]='\0';
printf("%s\n",b);
memset(b,'\0',sizeof(b));
getchar();
}
return 0;
}
F
数组大小要大于200 cin.getline
输入字符串
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main()
{
char str[210];
while (cin.getline(str, 210)) {
for (int i = 0,j=strlen(str)-1; i < j; i++,j--) {
char temp;
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
printf("%s\n", str);
}
return 0;
}
G
#include <cstdio>
#include <cstring>
int main()
{
int m;
char a[55], b[55];
while (~scanf("%d", &m)) {
while (m--) {
scanf("%s", a);
scanf("%s", b);
int lenA = strlen(a), lenB = strlen(b);
if (lenA == lenB) {
printf("%s is equal long to %s\n", a, b);
}
else if (lenA <lenB) {
printf("%s is shorter than %s\n", a, b);
}
else {
printf("%s is longer than %s\n", a, b);
}
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
}
}
return 0;
}
H
利用顺序表存储队列方式
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main()
{
int m;
char a[4][25];
while (~scanf("%d", &m)) {
int i = 0;
while (m--) {
scanf("%s", a[i%4]);
if (i >= 3) {
int k = 1;
for (int j = i % 4; j >=0; j--, k++) {
printf("%d=%s", k, a[j]);
printf(" ");
}
for (int j = 3; j >= i % 4 + 1; j--, k++) {
printf("%d=%s", k, a[j]);
if (j != i % 4 + 1) printf(" ");
}
}
else {
int k = 1;
for (int j = i % 4; j >= 0; j--, k++) {
printf("%d=%s", k, a[j]);
if (j != 0) printf(" ");
}
}
printf("\n");
++i;
}
}
return 0;
}
I
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[256];
int flag = 1;
while (~scanf("%s", a)) {
for (int i = 0, j = strlen(a) - 1; i < j; i++, j--) {
if (a[i] != a[j]) {
flag =0;
break;
}
}
if (flag) {
printf("YES\n");
}
else {
printf("NO\n");
}
}
return 0;
}