Pagini recente » Cod sursa (job #1057292) | Cod sursa (job #2820679) | Cod sursa (job #500883) | Cod sursa (job #1107481) | Cod sursa (job #354824)
Cod sursa(job #354824)
#include<fstream.h>
int s[10]
int mod(int A[], int B, int L)
{
int i,t=0;
for(i=L;i>0;i--)
t=(t*10+A[i])%B;
return t;
}
void main()
{
ifstream f("bipal.in");
ofstream g("bipal.out");
f>>n>>m;
int q=n/2,q1=0;
if(q%2==1){q+=2;q1=1;}
s[1]=0;
while(k>0)
if(s[k]<8)
{
s[k]++;
if(k==q)
{
if(q1=0)
{
for(i=1;i<=n/4;i++){v[i]=s[i];v[n/2-i+1]=s[i];}
for(i=n/4+1;i<=n/2;i++)
{v[n/4+i]=s[i];v[n-i+1+n/4]=s[i];}
if(mod(v,m,n)==1)for(i=1;i<=n;i++)cout<<v[i];
}
if(q1=1)
{
for(i=1;i<=q/2;i++){v[i]=s[i];v[q-i]=s[i];}
for(i=q/2+1;i<=q;i++)
{v[q]=s[i];
}
}
else {k++;s[k]=-1;}
}
else k--;
}