小时的枫的博客

一个计科生

ACM刷题之codeforces————Taxes

Taxes
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n ≥ 2) burles and the amount of tax he has to pay is calculated as the maximum divisor of n (not equal to n, of course). For example, if n = 6 then Funt has to pay 3 burles, while for n = 25 he needs to pay 5 and if n = 2 he pays only 1 burle.

As mr. Funt is a very opportunistic person he wants to cheat a bit. In particular, he wants to split the initial n in several parts n1 + n2 + ... + nk = n (here k is arbitrary, even k = 1 is allowed) and pay the taxes for each part separately. He can't make some part equal to 1 because it will reveal him. So, the condition ni ≥ 2 should hold for all i from 1 to k.

Ostap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to split n in parts.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 2·109) — the total year income of mr. Funt.

Output

Print one integer — minimum possible number of burles that mr. Funt has to pay as a tax.

Examples
input
Copy
4
output
Copy
2
input
Copy
27
output
Copy
3

一道数学题,应用了哥德巴赫猜想

哥德巴赫1742年给欧拉的信中哥德巴赫提出了以下猜想:任一大于2的偶数都可写成两个质数之和。


然后这题就可以做了。

如果是偶数,必定可以分成两个质数和,所以输出2

奇数的话,考虑是否本身是质数,减去2后是否是质数两种情况,其他输出3即可。


下面是ac代码

#include<bits/stdc++.h>
using namespace std;
#define MID(x,y) ((x+y)>>1)
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N=2e5+7;

int main()
{
	//freopen("f:/input.txt", "r", stdin);
	__int64 n;
	cin>>n;
	if (n == 2) {
		cout<<1<<endl;
		return 0;
	}
	if (n == 3) {
		cout<<1<<endl;
		return 0;
	}
	if (n % 2 == 0) {
		cout<<2<<endl;
		return 0;
	} else {
		__int64 m = sqrt(n);
		int f = 0;
		for (__int64 i = 3; i <= m + 1; i ++) {
			if (n % i == 0) {
				f = 1;
				break;
			}
		} 
		if (f == 1) {
			n = n - 2;
			for (__int64 i = 3; i <= m + 1; i ++) {
				if (n % i == 0) {
					cout<<3<<endl;
					return 0;
				}
			} 
			cout<<2<<endl;
			return 0;
		}
		cout<<1<<endl;
		
	}
}


阅读更多
版权声明:本文为小时的枫原创文章,未经博主允许不得转载。 https://blog.csdn.net/xiaofeng187/article/details/79978865
个人分类: 数学题
上一篇ACM刷题之POJ————Drying
下一篇ACM刷题之codeforces————Producing Snow
想对作者说点什么? 我来说一句

ACM刷题技巧及一些题目解答

2016年01月03日 20.4MB 下载

没有更多推荐了,返回首页

关闭
关闭