链接
这么简单的题 水博客是吧啊?
主要是今天和前天的div1都写过了,昨天的分治+启发式合并有点难搞。
//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x);
#define sr2(a,b) scanf("%d%d",&a,&b);
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c);
#define sr4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d);
#define f(i,a,n) for(int i=a;i<=n;i++)
#define ff(i) for(int i=1;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
return w==1?x:-x;
}
inline void write(ll x)
{
if(x>=10) write(x/10);
putchar(x%10+'0');
}
//------------------------------------------------
#define int long long
#define dd double
const int N=1e6+5;
int a,b;
bool is_pri(int x)
{
for(int i=2;i<=sqrt(x);i++)
{
if(x%i==0) return false;
}
return true;
}
int res[N];
bool to_divide(int a,int b)
{
int m;
for(int i=2;i<=max(sqrt(b),sqrt(a));i++)
{
if(a%i==0||b%i==0)
{
res[i]=0;
while(a%i==0) a/=i,res[i]++;
while(b%i==0) b/=i,res[i]++;
if(res[i]>=2) return true;
}
}
if(a==b)return true;
return false;
}
inline void solve()
{
scanf("%lld%lld",&a,&b);
if(a==b)
{
puts("no credit");
return;
}
if(is_pri(a)&&is_pri(b))
{
puts("full credit");
return;
}
if(to_divide(a,b))
{
puts("no credit");
return ;
}
else
{
puts("partial credit");
return ;
}
return;
}
//------------------------------------------------
signed main()
{
clock_t c1=clock();
#ifdef LOCAL
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
//==================================
int T=1;
// cin>>T;
for(int i=1;i<=T;i++)
{
solve();
}
//==================================
end:
cerr<<endl<< "Time used:" << clock() - c1 << endl;
return 0;
}