zoj3758 Singles' Day

水题

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
#define ll long long
#define mod 1000000007
using namespace std;

int main()
{
    unsigned ll m,b,n,i,l;
    while(~scanf("%lld%lld",&b,&n))
    {
        m=0;
        for(i=1;i<=n;i++)
            m=b*m+1;
        l=sqrt(m);
        if(m==1)
        {
            printf("NO\n");
            continue;
        }
        int flag=1;
        for(i=2;i<=l;i++)
        {
            if(m%i==0)
            {
                printf("NO\n");
                flag=0;
                break;
            }
        }
        if(flag) printf("YES\n");
    }
    return 0;
}