爆搜玄关cout0
查看原帖
爆搜玄关cout0
1011568
CodingFrog1楼主2024/7/5 10:09
#include<bits/stdc++.h>
#define int long long
#define maxn 100010
using namespace std;
bool pri_judg(int a)
{
	for(int i=1;i<=sqrt(a);i++)
	{
		if(a%i==0)
		{
			return 0;
		}
	}
	return 1;
}
int dfs_path(int val,int las)
{
	if(las>val)
	{
		return 0;
	}
	else if(las==val)
	{
		return 1;
	}
	else
	{
		int ans=0;
		for(int i=las;i<=val;i++)
		{
			if(pri_judg(i))
			{
				ans+=pri_judg(i);
			}
		}
		return ans;
	}
}
signed main()
{
	int d;
	cin>>d;
	cout<<pri_judg(d);
}
2024/7/5 10:09
加载中...