总结:用时1小时出头,感冒,状态不佳;
题目详情 - 1019 数字黑洞 (pintia.cn)
思路:输入整数,写两个函数,一个从整数变到数组(sort排序),一个从数组变为整数输出,即可;
#include<iostream>
#include<string.h>
#include<limits.h>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
bool cmp(int a, int b) {
return a > b;
}
int arr_to_int(int arr[],int n) {
int res = 0;
for (int i = 0; i < n; i++) {
res = res * 10 + arr[i];
}
return res;
}
void int_to_arr(int arr[], int n, int res) {
for (int i = n - 1; i >= 0; i--) {
arr[i] = res % 10;
res /= 10;
}
}
int main() {
int n;
int arr[5];
int id = 4;
cin >> n;
int res=n;
while (1) {
int_to_arr(arr, id, res);
sort(arr, arr + id);
int temp1 = arr_to_int(arr, id);
sort(arr, arr + id, cmp);
int temp2 = arr_to_int(arr, id);
res = temp2 - temp1;
printf("%04d - %04d = %04d\n", temp2,temp1, res);
if (res == 6174||res==0) {
break;
}
}
return 0;
}
思路:找P前A个数,PT之间A个数,T后A个数之间的关系;
值得一提的是,这份代码可以简化不少,使用答案的方法更好;
#include<iostream>
#include<string.h>
#include<limits.h>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int main() {
int n;
cin >> n;
string arr[100];
string str;
while (n--) {
cin >> str;
int x = 0, y = 0, z = 0;
int flag1 = 1, flag2 = 1, flag = 1;
for (int i = 0; i < str.size(); i++) {
if (str[i] != 'P' && str[i] != 'A' && str[i] != 'T') {
cout << "NO" << endl;
flag = 0;
break;
}
else if (str[i] == 'P') {//注意出现了2次P和T
if (flag1) {
flag1 = 0;
x = i - 0;
y -= i;
}
else
{
cout << "NO" << endl;
flag = 0;
break;
}
}
else if (str[i] == 'T') {
if (flag2) {
flag2 = 0;
z = str.size() - i - 1;
y += i - 1;
}
else
{
cout << "NO" << endl;
flag = 0;
break;
}
}
}
if (x == (z - x * (y - 1))&&flag) {
cout << "YES\n";
}
else if(flag)
{
cout << "NO\n";
}
}
return 0;
}
题目详情 - 1049 数列的片段和 (pintia.cn)
思路:这次马上就想到了用个数乘值求和;但是测试点2和3出错,因为int*int,10^5*10^5会上溢,所以注意先用double乘int即可通过测试点3;对于测试点二,是因为double储存是离散值,连续叠加会出错引起的,附上柳神的帖子
(152条消息) 1049. 数列的片段和(20)-浙大PAT乙级真题_柳婼的博客-CSDN博客
值得一提的是,对计算机基础了解太少也影响刷题;
#include<iostream>
#include<string.h>
#include<limits.h>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int main() {
int n;
cin >> n;
double temp;
long long res = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
res += (long long)(temp*1000) * (n - i) * (i + 1);
}
printf("%.2f", res/1000.0);
return 0;
}
题目详情 - 1008 Elevator (pintia.cn)
思路:简单数学和模拟题;
#include<iostream>
#include<string.h>
#include<limits.h>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int main() {
int n;
cin >> n;
int temp;
int sec = 0;
int floor = 0;
while (n--) {
cin >> temp;
if (temp > floor) {
sec += 6*(temp-floor);
}
else {
sec += 4 * (floor - temp);
}
sec += 5;
floor=temp;
}
cout << sec;
return 0;
}