Primal Sport ( 质数+思维 )

最新推荐文章于 2021-03-18 20:41:35 发布
最新推荐文章于 2021-03-18 20:41:35 发布
阅读量347 收藏
点赞数
分类专栏： ACM-日常训练 文章标签： s
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/luyehao1/article/details/79623470
版权
A. Primal Sport
time limit per test
1.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.

Alice goes first and then they take alternating turns. In the i-th turn, the player whose turn it is selects a prime number smaller than the current number, and announces the smallest multiple of this prime number that is not smaller than the current number.

Formally, he or she selects a prime p < Xi - 1 and then finds the minimum Xi ≥ Xi - 1 such that p divides Xi. Note that if the selected prime palready divides Xi - 1, then the number does not change.

Eve has witnessed the state of the game after two turns. Given X2, help her determine what is the smallest possible starting number X0. Note that the players don't necessarily play optimally. You should consider all possible game evolutions.

Input

The input contains a single integer X2 (4 ≤ X2 ≤ 106). It is guaranteed that the integer X2 is composite, that is, is not prime.

Output

Output a single integer — the minimum possible X0.

Examples
input
Copy 
14
output 
6
input
Copy 
20
output 
15
input
Copy 
8192
output 
8191
Note

In the first test, the smallest possible starting number is X0 = 6. One possible course of the game is as follows:

  • Alice picks prime 5 and announces X1 = 10
  • Bob picks prime 7 and announces X2 = 14.

In the second case, let X0 = 15.

  • Alice picks prime 2 and announces X1 = 16
  • Bob picks prime 5 and announces X2 = 20.


思路:

设prime[i]为i的最大质数因子，那么x1的范围为[ x2-prime[x2]+1 , x2 ]，x0 = x1 - prime[x1] +1;


#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX = 1e6 + 10;
const int INF = 1e9 + 7;

int prime[MAX];

int main()
{
	int x2;
	scanf("%d", &x2);
	for (int i = 2; i <= x2; i++)
	{
		if (!prime[i])
		{
			for (int j = i * 2; j <= x2; j += i)
				prime[j] = i;
		}
	}
	int ans = INF;
	for (int i = x2 - prime[x2] + 1; i <= x2; i++)
	{
		//x1不能为质数
		if (prime[i] == 0)
			continue;
		ans = min(ans, i - prime[i] + 1);
	}
	printf("%d\n", ans);
	return 0;
}

样例：

→Judgement Protocol
Test: #1, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
14
Output
6
Answer
6
Checker Log
ok 1 number(s): "6"
Test: #2, time: 0 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
20
Output
15
Answer
15
Checker Log
ok 1 number(s): "15"
Test: #3, time: 0 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
8192
Output
8191
Answer
8191
Checker Log
ok 1 number(s): "8191"
Test: #4, time: 30 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
1000000
Output
998677
Answer
998677
Checker Log
ok 1 number(s): "998677"
Test: #5, time: 15 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
959806
Output
239958
Answer
239958
Checker Log
ok 1 number(s): "239958"
Test: #6, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
1452
Output
1206
Answer
1206
Checker Log
ok 1 number(s): "1206"
Test: #7, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
4
Output
3
Answer
3
Checker Log
ok 1 number(s): "3"
Test: #8, time: 15 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
6
Output
3
Answer
3
Checker Log
ok 1 number(s): "3"
Test: #9, time: 15 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
8
Output
7
Answer
7
Checker Log
ok 1 number(s): "7"
Test: #10, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
9
Output
7
Answer
7
Checker Log
ok 1 number(s): "7"
Test: #11, time: 0 ms., memory: 7168 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
10
Output
4
Answer
4
Checker Log
ok 1 number(s): "4"
Test: #12, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
12
Output
6
Answer
6
Checker Log
ok 1 number(s): "6"
Test: #13, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
15
Output
8
Answer
8
Checker Log
ok 1 number(s): "8"
Test: #14, time: 15 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
16
Output
11
Answer
11
Checker Log
ok 1 number(s): "11"
Test: #15, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
110880
Output
55440
Answer
55440
Checker Log
ok 1 number(s): "55440"
Test: #16, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
166320
Output
110879
Answer
110879
Checker Log
ok 1 number(s): "110879"
Test: #17, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
221760
Output
110880
Answer
110880
Checker Log
ok 1 number(s): "110880"
Test: #18, time: 0 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
277200
Output
138600
Answer
138600
Checker Log
ok 1 number(s): "138600"
Test: #19, time: 0 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
332640
Output
166320
Answer
166320
Checker Log
ok 1 number(s): "166320"
Test: #20, time: 15 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
498960
Output
332639
Answer
332639
Checker Log
ok 1 number(s): "332639"
Test: #21, time: 0 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
554400
Output
415798
Answer
415798
Checker Log
ok 1 number(s): "415798"
Test: #22, time: 30 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
665280
Output
498958
Answer
498958
Checker Log
ok 1 number(s): "498958"
Test: #23, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
720720
Output
540538
Answer
540538
Checker Log
ok 1 number(s): "540538"
Test: #24, time: 30 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
510510
Output
255248
Answer
255248
Checker Log
ok 1 number(s): "255248"
Test: #25, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
570570
Output
285282
Answer
285282
Checker Log
ok 1 number(s): "285282"
Test: #26, time: 15 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
690690
Output
460455
Answer
460455
Checker Log
ok 1 number(s): "460455"
Test: #27, time: 15 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
959818
Output
239958
Answer
239958
Checker Log
ok 1 number(s): "239958"
Test: #28, time: 31 ms., memory: 7184 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
959878
Output
239978
Answer
239978
Checker Log
ok 1 number(s): "239978"
Test: #29, time: 15 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
959902
Output
239978
Answer
239978
Checker Log
ok 1 number(s): "239978"
Test: #30, time: 31 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
974847
Output
324954
Answer
324954
Checker Log
ok 1 number(s): "324954"
Test: #31, time: 15 ms., memory: 7160 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
974859
Output
324978
Answer
324978
Checker Log
ok 1 number(s): "324978"
Test: #32, time: 30 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
974931
Output
324980
Answer
324980
Checker Log
ok 1 number(s): "324980"
Test: #33, time: 15 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
885481
Output
442272
Answer
442272
Checker Log
ok 1 number(s): "442272"
Test: #34, time: 15 ms., memory: 7172 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
896809
Output
447944
Answer
447944
Checker Log
ok 1 number(s): "447944"
Test: #35, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
908209
Output
453632
Answer
453632
Checker Log
ok 1 number(s): "453632"
Test: #36, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
935089
Output
467064
Answer
467064
Checker Log
ok 1 number(s): "467064"
Test: #37, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
720721
Output
355298
Answer
355298
Checker Log
ok 1 number(s): "355298"
Test: #38, time: 31 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
690691
Output
342864
Answer
342864
Checker Log
ok 1 number(s): "342864"
Test: #39, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
959903
Output
479702
Answer
479702
Checker Log
ok 1 number(s): "479702"
Test: #40, time: 30 ms., memory: 7176 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
974932
Output
470060
Answer
470060
Checker Log
ok 1 number(s): "470060"
Test: #41, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
935090
Output
463950
Answer
463950
Checker Log
ok 1 number(s): "463950"
Test: #42, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
524288
Output
524287
Answer
524287
Checker Log
ok 1 number(s): "524287"
Test: #43, time: 0 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
524289
Output
174768
Answer
174768
Checker Log
ok 1 number(s): "174768"
Test: #44, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
524286
Output
262110
Answer
262110
Checker Log
ok 1 number(s): "262110"
Test: #45, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
531441
Output
526737
Answer
526737
Checker Log
ok 1 number(s): "526737"
Test: #46, time: 0 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
531442
Output
262490
Answer
262490
Checker Log
ok 1 number(s): "262490"
Test: #47, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
531440
Output
265704
Answer
265704
Checker Log
ok 1 number(s): "265704"
Test: #48, time: 15 ms., memory: 7188 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
81
Output
76
Answer
76
Checker Log
ok 1 number(s): "76"
Test: #49, time: 15 ms., memory: 7180 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
999958
Output
250008
Answer
250008
Checker Log
ok 1 number(s): "250008"
Test: #50, time: 15 ms., memory: 7160 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
2048
Output
1959
Answer
1959
Checker Log
ok 1 number(s): "1959"
close




A. Primal Sport
time limit per test
1.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.

Alice goes first and then they take alternating turns. In the i-th turn, the player whose turn it is selects a prime number smaller than the current number, and announces the smallest multiple of this prime number that is not smaller than the current number.

Formally, he or she selects a prime p < Xi - 1 and then finds the minimum Xi ≥ Xi - 1 such that p divides Xi. Note that if the selected prime palready divides Xi - 1, then the number does not change.

Eve has witnessed the state of the game after two turns. Given X2, help her determine what is the smallest possible starting number X0. Note that the players don't necessarily play optimally. You should consider all possible game evolutions.

Input

The input contains a single integer X2 (4 ≤ X2 ≤ 106). It is guaranteed that the integer X2 is composite, that is, is not prime.

Output

Output a single integer — the minimum possible X0.

Examples
input
Copy 
14
output 
6
input
Copy 
20
output 
15
input
Copy 
8192
output 
8191
Note

In the first test, the smallest possible starting number is X0 = 6. One possible course of the game is as follows:

  • Alice picks prime 5 and announces X1 = 10
  • Bob picks prime 7 and announces X2 = 14.

In the second case, let X0 = 15.

  • Alice picks prime 2 and announces X1 = 16
  • Bob picks prime 5 and announces X2 = 20.


分析：设 f(n) 表示 N最大的质数因子

luyehao1
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Approximation Algorithms: The Primal-Dual Method
05-14
课程讲义. 作者: My T. Thai
利用primal sketch分割与分类的文献与代码搜集
06-22
Primal Sketch 是一种在计算机视觉领域中用于图像分割和分类的技术。它主要依赖于图形模型，尤其是能量最小化方法，来解决图像中的区域分割问题。SAR（Synthetic Aperture Radar）图像是一种由雷达设备生成的遥感...
Codeforces 923A - Primal Sport
勇敢前进的ACMer
03-11 1235
传送门：Primal SportA. Primal Sporttime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob begin their day with a quick game. They first choos...
[CodeForces948B]Primal Sport（数论）
weixin_34302798的博客
03-13 90
Description 题目链接 Solution 设f(x)为x的最大质因子 那么由题意易得\(X_1\)的范围在\([X_2-f(X_2)+1,X2]\) 同理\(X_0\)的范围在\([X_1-f(X_1)+1,X1]\) 枚举\(X_1\)即可 Code #include<cstdio> #include<algorithm> using namespace std...
Primal Sport
whitechanllenge的博客
03-19 146
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below. Alice goes first and then they take alternatin
cf round 470 b Primal Sport
blog
03-12 325
好菜啊..这种数学题,基本只能靠猜.. 猜了猜,打了打表,苟过了… #include &lt;iostream&gt; #include &lt;cmath&gt; #include &lt;cstring&gt; #include &lt;algorithm&gt; using namespace std; #define debug(x) std::cerr &lt;&lt; #x &...
codeforces 948B Primal Sport
nankeyimeng的博客
03-13 1749
B. Primal Sporttime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob begin their day with a quick game. They first choose a sta...
PRIMAL2:培训代码PRIMAL2-公共仓库
05-09
PRIMAL_2：通过强化和模仿多主体学习进行寻路-终身 设置代码 cd进入od_mstar3文件夹。 python3 setup.py build_ext --inplace 返回到git文件夹的根目录，运行python3和“ import cpp_mstar”进行检查 运行代码 ...
Primal-Dual Integer Programming-开源
04-28
《Primal-Dual Integer Programming-开源》是一款基于GYWOPT的交互式数学编程系统，它以开源的形式提供给公众使用。GYWOPT自2000年初开始开发，旨在研究和实验通过积分基础方法解决整数编程问题。该系统由U.-U. Haus...
Primal-Skies-1.1.13.zip
05-24
"Primal-Skies-1.1.13.zip" 是一个针对此游戏的自定义整合包，专为喜欢空岛主题的玩家设计。空岛通常指的是在广阔无垠的天空中漂浮的小型岛屿，这种环境为游戏增加了新的挑战和乐趣。 在这个整合包中，"modlist....
A. Primal Sport(数学,逆推)
jziwjxjd的博客
06-29 345
考虑x2倒退回x1考虑x_2倒退回x1考虑x2​倒退回x1 显然设x2最大质因子是P,那么x1的最小值是x2−P+1显然设x_2最大质因子是P,那么x_1的最小值是x_2-P+1显然设x2​最大质因子是P,那么x1​的最小值是x2​−P+1 x1的最大值就是x2,因为(x2本身一定有质因子)x_1的最大值就是x_2,因为(x_2本身一定有质因子)x1​的最大值就是x2​,因为(x2​本身一定有质因子) 那么得出x1的取值是[x2−P+1,x2]那么得出x_1的取值是[x_2-P+1,x_2]那么得出x1​的
VK Cup 2018 - Round 1 A. Primal Sport
Bryce1010's Blog
03-17 808
A. Primal Sport time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output Alice and Bob begin their day with a quic
B. Primal Sport[质数,数学]
Haipai1998的博客
03-13 414
B. Primal Sport time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output Alice and Bob begin their day with a quic
VK Cup 2018 Round 1: A. Primal Sport
加载中...
03-11 486
A. Primal Sporttime limit per test 1.5 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputAlice and Bob begin their day with a quick game. They first choose a starting...
[CF 947 A] Primal Sport
HT008的Blog
04-02 213
题目描述： 雾。 题目分析： 设 f[n] 为 n的 最大因子 那么x2-f[x2]+1&lt;=x1&lt;=x2 题目链接： CF 947 A Ac 代码： #include &lt;cstdio&gt; #include &lt;iostream&gt; int f[110000]; int main() { int n; scanf("%d...
923A - Primal Sport(思维+倒推+欧拉筛最大质因子)
代码笔记本
03-18 117
https://codeforces.com/problemset/problem/923/A 考虑得到数字x2=N,假设是质数p的倍数.那么x1肯定在x2-p+1~x2这个范围内才行 因为p的倍数要刚好大于等于x1。所以x1肯定是在这两个倍数之间才行。p是质数，那么让p的值越大越好。于是筛最大质因数。 这样得到的x1才可能越小。然后枚举x1在x2-p+1~x2之间。 用同样的方式得到x0。 #include<iostream> #include<vector> #includ
Codeforces 923A Primal Sport（贪心 欧拉筛）
Dmaxiya
08-07 337
题目链接：Primal Sport 题意 AliceAliceAlice 和 BobBobBob 两人在玩一个游戏，AliceAliceAlice 先开始，两人轮流进行，第 iii 次游戏中，对于一个整数 XiXiX_i，选择一个素数 p&lt;Xip&lt;XipYYY，使得 Y≥XY≥XY\geq X 且 YYY 能被 ppp 整除，将这个数字作为下一次游戏的新值 Xi+1Xi+1X...
【题解】CF923A：Primal Sport
ModestCoder_的博客
08-28 251
原题传送门 首先发现一个结论：Xi的值域为[Xi+1−P+1,Xi+1],P为Xi+1的最大质因数X_i的值域为[X_{i+1}-P+1,X_{i+1}],P为X_{i+1}的最大质因数Xi​的值域为[Xi+1​−P+1,Xi+1​],P为Xi+1​的最大质因数 预处理每个数是否为质数以及最大质因数，用线筛可完成 然后枚举X1X_1X1​，求针对每个X1X_1X1​的X0X_0X0​的最小值 Co...
primal svm
最新发布
01-25
Primal SVM（原始支持向量机）是一种用于二分类问题的机器学习算法。它通过在高维特征空间中找到一个超平面来将不同类别的样本分开。 Primal SVM的目标是最大化超平面与最近的训练样本之间的间隔，同时最小化误分类样本的数量。通过这种方式，Primal SVM能够找到一个具有最佳界面划分的决策边界。 Primal SVM的优化问题可以用一个凸二次规划问题的形式来表示。与其他SVM变体不同，Primal SVM直接在原始特征空间中进行优化，而不是在对偶空间中进行。这使得Primal SVM的求解过程更加高效，尤其在处理具有大量特征的数据集时。 Primal SVM利用了特征空间中的线性可分性情况，即假设数据可以通过一个超平面完美分开。然而，在现实世界的数据中，很难找到完全线性可分的情况。因此，Primal SVM往往与一些非线性的特征转换方法（如核函数）一起使用，以处理线性不可分的数据。 Primal SVM具有很好的泛化性能，在处理高维数据和复杂分类问题时表现出色。它可以处理大规模的数据集，且对噪声数据有一定的鲁棒性。 总之，Primal SVM是一种用于二分类问题的机器学习算法，它通过在高维特征空间中找到一个超平面来将不同类别的样本分开。它在原始特征空间中进行优化，具有高效性和良好的泛化性能。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值