TKK 20-21(2)第4次线上赛

伞兵代码 ，不吝赐教

1559:于老师的三大爱好

代码

#include <iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<iomanip>
#include<cstring>
using namespace std;
typedef long long ll;
int main()
{
	int n;
	cin >> n;
	while (n--)
	{
		string a;
		cin >> a;
		ll cnt_c = 0, cnt_d = 0, cnt_h = 0;
		ll cnt = 0;
		int w = 0;
		bool flag = false;
		for (int i = a.length(); i >= 0; i--)
		{
			if (a[i] >= '0' && a[i] <= '9')
			{
				flag = true;
				cnt += (a[i] - '0') * pow(10, w);
				w++;
			}
			else if (a[i] == 'C')
			{
				if (flag)cnt_c += cnt;
				else
				{
					cnt_c += 1;
				}
				flag = false;
				cnt = 0;
				w = 0;
			}
			else if (a[i] == 'D')
			{
				if (flag)cnt_d += cnt;
				else
				{
					cnt_d += 1;
				}
				flag = false;
				cnt = 0;
				w = 0;
			}
			else if (a[i] == 'H')
			{
				if (flag)cnt_h += cnt;
				else
				{
					cnt_h += 1;
				}
				flag = false;
				cnt = 0;
				w = 0;
			}

		}
		cout << cnt_c << " " << cnt_d << " " << cnt_h << endl;
	}
}   

1560:纯净数

题解：
类似：https://www.acwing.com/problem/content/58/

代码：

        


#include <iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<iomanip>
#include<cstring>
using namespace std;
typedef long long ll;
bool isPrime(ll a)
{
	if (a < 2)return 0;
	else
	{
		int i = 2;
		while (i <= sqrt(a))
		{
			if (a % 2 == 0)return 0;
			i++;
		}
	}
	return 1;
}
int main()
{
	int n;
	cin >> n;
	while (n--)
	{
		ll x[2002], y[101],z[101];
		for (int i = 0; i < 100; i++)
		{
			z[i] = 1;
		}
		int a, b;
		cin >> a >> b;
		int cnt = 0, j = 1;
		while (j <= a)
		{
			if (isPrime(j) == 1) 
			{
				y[cnt] = j;
				++cnt;
			}
			++j;
		}
		x[1] = 1;
		for (int i = 2; i <= b; i++)
		{
			for (int j = 0; j < cnt - 1; j++)
			{
				ll minv;
				if (j == 0) { x[i] = min(x[z[j]] * y[j], x[z[j + 1]] * y[j + 1]); }
				else x[i] = min(x[i], x[z[j + 1]] * y[j + 1]);
			}
			for (int j = 0; j < cnt; j++)
			{
				if (x[z[j]] * y[j] == x[i])z[j]++;
			}
		}
		cout << x[b] << endl;
	}
}

    

1561:质数乘积

题解：

这种数因数只有四个，并且不是某个数的三次幂

代码：

#include <iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<iomanip>
#include<cstring>
using namespace std;
typedef long long ll;
int a[1000005];
bool b[1000005];
int main()
{
	for (int i = 1; i <= 1000000; i++)
	{
		for (int j = i; j <= 1000000; j += i)
		{
			a[j]++;
		}
	}
	for (int i = 1; i <= 100; i++)
	{
		b[i * i * i] = true;
	}
	int n;
	cin >> n;
	while (n--)
	{
		int x;
		cin >> x;
		if (a[x] == 4 && !b[x])cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}

1562 特殊的加法

代码：

#include <iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<bitset>
using namespace std;
typedef long long ll;
int main()
{
	int n;
	cin >> n;
	while (n--)
	{
		int a, b;
		cin >> a >> b;
		int la = log2(a) + 1;
		int lb = log2(b) + 1;
		if (a == 0)la = 1;
		if (b == 0)lb = 1;
		if(la==lb){}
		while (la > lb)
		{
			b <<= 1;
			lb++;
		}		
		while (la < lb)
		{
			a <<= 1;
			la++;
		}
		int c = a ^ b;
		cout << c << endl;
	}
}   

1563 家长会

代码又臭又长，太伞兵了就不放出来了

1564 等腰三角形

题解：

注意两边之和大于第三边

代码：

        
        



#include <iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<iomanip>
#include<cstring>
using namespace std;
typedef long long ll;
int main()
{
	int n;
	cin >> n;
	while (n--)
	{
		double a1, b1, a2, b2, a3, b3;
		cin >> a1 >> b1 >> a2 >> b2 >> a3 >> b3;
		double d_1 = sqrt((a1 - a2) * (a1 - a2) + (b1 - b2) * (b1 - b2));
		double d_2 = sqrt((a1 - a3) * (a1 - a3) + (b1 - b3) * (b1 - b3));
		double d_3 = sqrt((a3 - a2) * (a3 - a2) + (b3 - b2) * (b3 - b2));
		if ((d_1 == d_2 || d_1 == d_3 || d_2 == d_3) && d_1 + d_2 > d_3 && d_1 + d_3 > d_2 && d_2 + d_3 > d_1)
		{
			cout << "Yes" << endl;
		}
		else cout << "No" << endl;

	}
}