有一道题目是原题emmm
朝鲜友人出的题目
可能英文题面会有些小问题
反正这场 我的贡献率≈0
题解链接: https://pan.baidu.com/s/1KRpqHaOdq2EL2-Kgbm2EXA 提取码: f1a1 复制这段内容后打开百度网盘手机App，操作更方便哦
01 AND Minimum Spanning Tree
HDU 6614 逻辑思维签到题
从右往左找第一个为0 的位置 然后判断
具体思路可以看这位同学的：https://www.cnblogs.com/Esquecer/p/11280920.html
大白同学做的
代码如下
#include <bits/stdc++.h>
using namespace std;
long long a[200005];
long long f(long long x)
{
long long t=x;
int cnt=0;
int flag=1;
while(t)
{
int y=t%2;
cnt++;
if(y==0)
{
flag=0;
break;
}
t/=2;
}
if(flag)
return x+1;
else
return 1<<(cnt-1);
}
bool ff(long long x)
{
while(x)
{
int t=x%2;
if(t==0)
return false;
x/=2;
}
return true;
}
int main()
{
for(int i=2;i<200001;i++)
{
if(i%2==0)
a[i]=1;
else
a[i]=f(i);
}
int t;
scanf("%d",&t);
long long n;
while(t--)
{
scanf("%lld",&n);
if(ff(n))
printf("1\n");
else
printf("0\n");
for(int i=2;i<n;i++)
{
printf("%lld ",a[i]);
}
if(ff(n))
printf("1\n");
else
printf("%lld\n",a[n]);
}
return 0;
}
07 Just an Old Puzzle
HDU 6620 规律题
原题来自SGU139
原理参考：https://www.guokr.com/article/54088/?page=2&replypage=2
数字华容道有解的条件 来自简书
首先，有解的前提在于：当前空格回到初始空格所在行数时，逆序数一定得是偶数！为什么，我不清楚。
要想把空格移动到初始空格所在行，必须进行若干次上下移动和若干次左右移动。
左右移动，不会改变逆序数；
上下移动，若格子列数为奇数，则每次增减偶数个逆序数，
若格子列数为偶数，则每次增减奇数个逆序数。
也就是说：
- 格子列数为奇数，怎么移动，都不会改变原始的逆序数。因为奇数加减偶数还是奇数，偶数加减偶数还是偶数。所以，只要保证逆序数是偶数即可，不必关心空格的位置。
- 格子列数为偶数，那么进行奇数次上下移动，会改变其逆序数的奇偶性。所以，如果当前逆序数是偶数，要想有解，就要保证实际上下移动会进行偶数次，也就是说空格所在行与初始空格所在行的差为偶数。
- 同理，若当前逆序数是奇数，要想有解，要进行奇数次的移动，才能保证最终逆序数是偶数。
作者：火石
链接：https://www.jianshu.com/p/1c1849d876b2
来源：简书
简书著作权归作者所有，任何形式的转载都请联系作者获得授权并注明出处。
也是大白同学做的
#include <stdio.h>
using namespace std;
int a[16], res;
int main()
{
// freopen("in.txt","r",stdin);
long long t;
scanf("%lld",&t);
while(t--)
{
for (int i = 0; i < 16; ++i)
{
scanf("%d", &a[i]);
if (!a[i]) res = 6 - (i % 4) - i / 4;
}
for (int i = 0; i < 15; ++i)
for (int j = i + 1; j < 16; ++j)
if (a[i] > a[j]) res++;
if (res & 1)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}赛后 玩了一下数字华容道
顺便检验结论正确性
我补题AC的代码：
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main()
{
int t, aa;
scanf("%d", &t);
while (t--) {
int ans = 0;
for (int i = 0; i < 16; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) {
ans = i / 4 +1;//记录初始空格位置的行号
}
}
// printf("??%d\n",ans);
for (int i = 0; i < 15; i++)
for (int j = i + 1; j < 16; j++) {
if (a[i] == 0 || a[j]==0) {
continue;
}
if (a[i] > a[j]) {//加上逆序对的个数
ans++;
}
}
if (ans % 2 == 0 ) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
}
10 Minimal Power of Prime
HDU 6623 米勒罗宾× 暴力判断 √
一开始我们就看了这道题
然后开始敲板子
结果一直TLE
结果说是暴力之后分类讨论？？？
题目大意：给T组数据 求每一个数的素因子的最小指数
bin巨的板子可以算出所有的素因子
用数组存起来
但是在判断单个素因子个数时会超时TAT
注意：用板子去找素数因子的时候，很容易超时，所以就直接把素数表给打出来……
因为打板子找素数超时 TLE8次以上 orz
#include <stdio.h>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000;
int a[maxn + 5], tot;
ll prime[1229] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67,
71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149,
151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313,
317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,
503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691,
701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907,
911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013,
1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093,
1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193,
1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289,
1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399,
1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483,
1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571,
1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663,
1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759,
1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873,
1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987,
1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081,
2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161,
2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281,
2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377,
2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467,
2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593,
2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689,
2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777,
2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879,
2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999,
3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109,
3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221,
3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329,
3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449,
3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539,
3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631,
3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733,
3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851,
3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943,
3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057,
4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159,
4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271,
4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397,
4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513,
4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637,
4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729,
4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861,
4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967,
4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059,
5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179,
5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303,
5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419,
5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519,
5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647,
5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741,
5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849,
5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953,
5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089,
6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203,
6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301,
6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389,
6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551,
6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661,
6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779,
6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871,
6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983,
6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109,
7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229,
7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351,
7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499,
7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583,
7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691,
7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823,
7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933,
7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081,
8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191,
8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293,
8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429,
8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563,
8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677,
8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761,
8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867,
8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007,
9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133,
9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239,
9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349,
9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461,
9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587,
9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697,
9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811,
9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923,
9929, 9931, 9941, 9949, 9967, 9973
};
//void getprime()
//{
// tot = 0;
// for (int i = 2; i <= maxn; i++) {
// if (!prime[i]) {
// prime[++prime[0]] = i;
// }
// for (int j = 1; j <= prime[0] && prime[j] <= maxn / i; j++) {
// prime[prime[j]*i] = 1;
// if (i % prime[j] == 0) {
// break;
// }
// }
// }
//}
ll run(ll x)
{
ll l = 1000, r = (ll)pow(1.0 * x, 1.0 / 3.0) + 5;
while (l <= r) {
ll mid = (l + r) / 2;
if (mid * mid * mid == x) {
return mid;
} else if (mid * mid * mid < x) {
l = mid + 1;
} else {
r = mid - 1;
}
}
return 1;
}
int main()
{
int t;
ll a;
scanf("%d", &t);
// getprime();
// for (int i=0;i<100;i++)
// printf("%d ",prime[i]);
while (t--) {
int ans = 200;
scanf("%lld", &a);
for (int i = 0; i <= 1004; i++) {
if (a % prime[i] == 0) {
int m = 0;
while (a % prime[i] == 0) {
a = a / prime[i];
m++;
}
//printf("%d&&\n", prime[i]);
ans = min(ans, m);
}
}
// printf("%d ** %d\n", a, ans);
if (a == 1) {
printf("%d\n", ans);
} else if (ans == 1) {
printf("1\n");
} else {
ll y = run(a);
ll x = sqrt(a * 1.0);
if (x * x == a) {
ll xx = sqrt(x * 1.0);
if (xx * xx == x) {
ans = min(ans, 4);
} else {
ans = min(ans, 2);
}
} else if (y * y * y == a) {
ans = min(ans, 3);
} else {
ans = 1;
}
printf("%d\n", ans);
}
}
return 0;
}
上面的代码中 getprime（）会使代码超时
所以 直接用素数表就不会超时了
更新一波代码
这是换了一种打表方式
同时将代码中所有的 min（ans,x） 换成了 ans:x?ans : x
所有的 /2 换成了 >> 1
加快运行速度
#include <stdio.h>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 10000;
int a[maxn + 5], tot;
ll prime[maxn + 5];
void getprime()
{
tot = 0;
a[0] = a[1] = 1;
for (int i = 2; i <= 4000; i++) {
if (a[i] == 0) {
prime[tot++] = (ll)i;
for (int j = i * 2 ; j <= 4000; j += i) {
a[j] = 1;
}
}
}
}
ll run(ll x)
{
ll l = 4000, r = (ll)pow(1.0 * x, 1.0 / 3.0) + 3, mid, h;
while (l <= r) {
mid = (l + r) >> 1;
h = mid * mid * mid;
if (h == x) {
return mid;
} else if (h < x) {
l = mid + 1;
} else {
r = mid - 1;
}
}
return 1;
}
int main()
{
int t;
ll a;
scanf("%d", &t);
getprime();
while (t--) {
int ans = 200;
scanf("%lld", &a);
if (a == 1) {
ans = 1;
}
for (register int i = 0; i <= 4000 && prime[i] > 0; i++) {
if (a < prime[i] || prime[i] == 0) {
break;
}
int m = 0;
if (a % prime[i] == 0) {
while (a % prime[i] == 0) {
a = a / prime[i];
m++;
}
// printf("%d&&\n", prime[i]);
ans = (ans < m ? ans : m);
}
}
if (a == 1) {
printf("%d\n", ans);
} else if (ans == 1) {
printf("1\n");
} else if (a > 1) {
ll y = run(a);
ll x = sqrt(a * 1.0);
if (x * x == a) {
ll xx = sqrt(x * 1.0);
if (xx * xx == x) {
ans = (ans < 4 ? ans : 4);
} else {
ans = (ans < 2 ? ans : 2);
}
} else if (y * y * y == a) {
ans = (ans < 3 ? ans : 3);
} else {
ans = 1;
}
printf("%d\n", ans);
}
}
return 0;
}
08 K-th Closest Distance
HDU 6621 主席树+二分
题目大意：给出T组样例，每组样例给n个数字，m个查询
每组查询给L，R，p，K四个数字
求 [L,R]区间与p相比相差最小的第K个数字
（XOR用在哪里emmm 我没注意到 这个好像是重点！）
这题我想到用主席树做
然后二分找到第K大的数
但是隔壁队一直被卡常
没敢下手打……
扫一扫
278
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
