#include <iostream>
#include<bits/stdc++.h>
using namespace std;
long long solve(long long y0,long long t)//快速幂算法但取的是每次所算数据的最后一位
{
if(t==0) return 1;
if(t==1) return y0;
long long r=0;
r=solve(y0,t/2)%10;
r=r*r%10;
if(t%2) r=r*y0%10;
return r;
}
int main(int argc, char** argv)
{
long long i,y0,t,result;
cin>>y0>>t;
result=solve(y0,t);
if(result<0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
if(result%2!=0)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
将问题转化成所学过的算法