id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
26,500 |
//?????
//??(n-1)*k???
//??????????????n????????
//????????k???n*k?
//??????????k??????????k?
//????????????(n-1)*k??????????????????k??????
//????m'?(n-1)*k???
//??????(n-1)*k?????????????k?
//???????????k+1???
//???x??????((n-1)^x*(m+(n-1)*k))/(n^x)???
//?????k+t?t??????????(n-1)^(n-1)???
//?m+(n-1)*k?n*n???
//????
//(n-1)^(n-1)*[m+(n-1)*k]/(n^n)=k+t?????
int main()
{
int n,k,m;
int s1,s2;
int z; //[k/(n-1)^(n-1)]???
scanf("%d%d",&n,&k);
s1=pow(n,n);
s2=pow(n-1,n-1);
z=k*1.0/s2;
z++;
m=z*s1-(n-1)*k;
printf("%d",m);
return 0;
}
| 54 |
26,501 | int n,k;
int fen(int m)
{
int fen(int m);
int i=0;
for(i=0;i<n;i++)
{if(((m-k)%n==0)&&((m-k)/n!=0))
{
m=m-k-(m-k)/n;
fen(m);
}
else {i=0;return(0);}
}
if(i==n)return(1);
}
void main()
{
int fen(int m);
int m=1;
scanf("%d%d",&n,&k);
for (m=1;;m++)
if(fen(m)==1)break;
printf("%d",m);
} | 54 |
26,502 | int n,k,cnt;
int f(int a)
{
if (a == 1)
return n * cnt + k;
int d = n * f(a - 1);
if (d % (n - 1) == 0 && d != 0)
return n * f(a - 1) / (n - 1) + k;
else
return 0;
}
int main()
{
int c;
cin >> n >> k;
for (cnt = 1;;cnt++)
{
c = f(n);
if (c != 0)
break;
}
cout << c << endl;
return 0;
}
| 54 |
26,503 |
int ok(int m,int n,int k);
void main()
{
int m,n,k;
scanf("%d%d",&n,&k);
for(m=1;;m++){
if(ok(m,n,k))
break;
}
printf("%d\n",m);
}
int ok(int m,int n,int k)
{
int i;
for(i=1;i<=n;i++){
if(m/n<1||m%n!=k) return 0;
m=m-m%n-m/n;
}
return 1;
}
| 54 |
26,504 | //********************************
//*???????? **
//*?????? 1300062706 **
//*???2013.12.5**
//********************************
int n, k;
int monkey(int m, int i)
{
if (i == n+1)
return m;
else
{
if (m%(n-1) == 0)
return monkey(m*n/(n-1)+k, i+1);
else
return 0;
}
}
int main()
{
int i;
cin >> n >> k;
for (i=n-1;;i+=n-1)
{
if (monkey(i, 1)%n != 0)
{
cout << monkey(i, 1) << endl;
break;
}
}
return 0;
} | 54 |
26,505 | void main()
{
int n,k,i,j,m[100];
scanf("%d %d\n",&n,&k);
for(j=1;;j++)
{
m[n]=j;
for(i=n;i>=2;i--)
{
if((n*m[i]+k)%(n-1)==0)
m[i-1]=(n*m[i]+k)/(n-1);
else
break;
}
if(i==1)
break;
}
m[0]=n*m[1]+k;
printf("%d",m[0]);
} | 54 |
26,506 | void main()
{int i,j,n,k,m=1,flag=0,l;
scanf("%d%d",&n,&k);
for (l=1;;l++)
{flag=0;
for (m=l,i=1;i<=n;i++)
{if (m%(n-1)!=0)
flag=1;
m=m+m/(n-1)+k;}
if (flag==0)
break;}
printf("%d",m);
} | 54 |
26,507 | int N;
int K;
int Monkey(int m,int n,int k)
{
if(n==1)
return (m%N==k&&(m-k)/N>=1)?1:0;
else{
if(m%N==k)
return Monkey( (m-k)*(N-1)/N,n-1,k);
else
return 0;
}
}
void main()
{
int m;
scanf("%d%d",&N,&K);
for(m=(int)(pow(N,K)/pow(N-1,K-1));;m++){
if(Monkey(m,N,K))
break;
}
printf("%d\n",m);
} | 54 |
26,508 | void main()
{
int n,k,x[100],i,cas,m;
scanf("%d%d",&n,&k);
x[0]=0;
for(m=1;x[0]==0;m++)
{
x[n]=(n-1)*m;
cas=0;
for(i=n;i>=1&&cas==0;i--)
{
if(x[i]%(n-1)==0)
x[i-1]=x[i]*n/(n-1)+k;
else
cas=1;
}
}
printf("%d",x[0]);
} | 54 |
26,509 |
void main()
{
int n,k,i,s;
s=1;
scanf("%d%d",&n,&k);
if(n==2)
printf("7");
else
{
for(i=1;i<=n;i++)
{
s=s*n;
}
s=s-n*k+k;
printf("%d",s);
}
}
| 54 |
26,510 | /* Note:Your choice is C IDE */
void main()
{
int n,k,m,a,b;
scanf("%d %d",&n,&k);
for(a=n+k;a>0;a++)
{
m=a;
for(b=1;(m-k)%n==0&&b<=n;b++)
{m=m-(m-k)/n-k;}
if(b==n+1&&m>0) break;
}
printf("%d",a);
}
| 54 |
26,511 | int main()
{
int n,k;
cin>>n>>k;
int m=n;
int N=n;
int M=m;
while(n>0)
{
if((M-k)%N==0&&(M-k)/N>=1)
{
M=M-(M-k)/N-k;
n--;
}
else
{m++;M=m;n=N;}
}
cout<<m<<endl;
return 0;
} | 54 |
26,512 |
void main()
{
int n,k,a[300],i,j;
scanf("%d%d",&n,&k);
for(j=1;;j++)
{
a[n]=n*j+k;
for(i=n;i>1;i--)
{
if(a[i]%(n-1)!=0) break;
else a[i-1]=n*a[i]/(n-1)+k;
}
if(i==1) {printf("%d",a[1]);break;}
}
} | 54 |
26,513 |
int allocable(int n,int m,int k)
{
if (m%n==k) return 1;
else
return 0;
}
void main()
{
int n,k,m;
int i;
scanf("%d %d",&n,&k);
m=1;
while(1)
{
m++;
int tmp=m;
for (i=0;i<n;i++)
{
if (allocable(n,tmp,k))
{
tmp=(tmp-k)*(n-1)/n;
}
else
break;
}
if (i==n) break;
}
printf("%d",m);
} | 54 |
26,514 | main()
{
int n,k,m,i,j,a[100],t=0;
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)
a[i]=0;
for(j=1;;j++)
{
t=0;
a[n-1]=j;
for(i=n-1;i>0;i--)
{
if((a[i]*n+k)%(n-1)==0)
a[i-1]=(a[i]*n+k)/(n-1);
else
{t=1;break;}
}
if(t==0)
{
printf("%d",a[0]*n+k);
break;
}
}
}
| 54 |
26,515 | int main(int argc, char *argv[])
{
long int n,k,m,i,j,tf;
scanf("%ld %ld",&n,&k);
for(j=1;j<2147483647;j++)
{tf=1;
m=j*n+k;
for(i=2;i<=n;i++)
{
if(m%(n-1)!=0){tf=0;break;}
m=m*n/(n-1)+k;
}
if(tf==0)continue;
break;
}
printf("%d\n",m);
return 0;
} | 54 |
26,516 | void main()
{
int f();
int n,k,m;
scanf("%d %d",&n,&k);
m=f(n,k);
printf("%d",m);
}
int f(int n,int k)
{
int c;
c=pow(n,n)-k*(n-1);
return(c);
} | 54 |
26,517 | int first(int n,int k)
{
int total,i,j,cons;
for(i=1;;i++)
{
total=i*n+k*n;
for(j=1;j<n;j++)
{
total=total*n/(n-1);
if(total%n!=0)break;
}
if(j==n)
{
cons=i*n+k;
break;
}
}
return cons;
}
int houzi(int n,int k,int m)
{
int num;
if(n!=1)
{
num=(houzi(n-1,k,m))*m/(m-1)+k;
}
if(n==1)
{
num=first(m,k);
}
return num;
}
void main()
{
int n,k;
scanf("%d%d",&n,&k);
printf("%d",houzi(n,k,n));
} | 54 |
26,518 | int main()
{
int n,k;
cin>>n>>k;
int a[n+1];
memset(a,0,sizeof(a));
a[n]=n+k;
for(int i=1;;i++)
{
for(int j=n;j>=2;j--)
{if((a[j]*n)%(n-1)!=0)
{a[n]+=n;break;}
else
a[j-1]=a[j]*n/(n-1)+k;}
if(a[1]!=0)
break;
}
cout<<a[1]<<endl;
return 0;
}
| 54 |
26,519 | int main()
{
int k,n,i;
scanf("%d%d",&n,&k);
for (i=n*k;;i++)
{
int f=1,d=0,left=i;
while (d<n)
{
if (left%n==k && (left-=(left-k)/n+k)>0) d++;
else {f=0;break;}
}
if (f) {printf("%d",i);break;};
}
return 0;
} | 54 |
26,520 | int Check(int i,int n,int k,int *m,int time)
{
if(time==n)
{
return 1;
}
if((i*n)%(n-1)==0)
{
*m=(i*n)/(n-1)+k;
time++;
return Check((i*n)/(n-1)+k,n,k,m,time);
}else{
return 0;
}
}
int main()
{
int n,k,*m,time=0,a;
scanf("%d%d",&n,&k);
int i;
m=&a;
*m=0;
for(i=1;1;i++)
{
if(Check(i,n,k,m,time))
{
printf("%d\n",*m);
break;
}
}
return 0;
} | 54 |
26,521 |
void main()
{
int n,k;
int t;
double p;
scanf("%d %d",&n,&k);
if (n!=2)
{
p=pow((double)n,(double)n);
t=(int)p-n*k+k;
}
else
t=7;
printf("%d",t);
}
| 54 |
26,522 | int main()
{
int a[100],b,i,j,n,k;
scanf("%d %d",&n,&k);
for(j=1;j<2000000;j++)
{
b=j;
a[n]=b*n+k;
for(i=n;i>=1;i--)
{
if((n*a[i]+n*k-k)%(n-1)==0)
a[i-1]=(n*a[i]+n*k-k)/(n-1);
else
break;
}
if(i<=1)
break;
}
printf("%d\n",a[1]);
return 0;
}
| 54 |
26,523 | void main()
{
int n,j,l,k,m;
scanf("%d %d",&n,&k);
for(j=2;l!=n;j++)
{
m=j;
for(l=0;l<n;l++)
{
if(m%(n-1)==0)
{m=m*n/(n-1)+k;
continue;
}
break;
}
}
printf("%d",m);
} | 54 |
26,524 |
void main()
{
int n,k,res;
scanf("%d%d",&n,&k);
res=pow(n,n)-(n-1)*k;
printf("%d\n",res);
} | 54 |
26,525 | /********************************************
*@file 1.cpp *
*@author ?? *
*@date 2013-12-07 *
*@description *
*??????11?????? *
********************************************
*/
int n, k;
int go(int a, int step)
{
if (step == n)
return a;
if (a % (n - 1) == 0)
{
return go(a * n / (n - 1) + k, step + 1);
}
else
return 0;
}
int main()
{
int j;
cin >> n >> k;
for (j = n + k; ; j += n)
{
if (go(j, 1))
{
cout << go(j, 1);
break;
}
}
return 0;
}
| 54 |
26,526 | int sum(int m,int n,int k)
{int i,t;
for(i=0;i<n-1;i++)
{t=(m*n+k)/(n-1);
if (t*(n-1)==(m*n+k)) {m=t;}
else {m=0;break;}
}
return(m);
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
int m;
for(m=1; ;m++)
{if (sum(m,n,k)!=0) {printf("%d",sum(m,n,k)*n+k);break;}
else continue;
}
return 0;
}
| 54 |
26,527 |
int main()
{
int n,m1,k,m;
int j;
scanf("%d%d",&n,&k);
for(m1=7;;m1++)
{
if(m1%n == k)
{
m = m1;
for(j=1;j<=n;j++)
{
if(j<n)
{
m -= k;
if(!(m%n))//??
{
m = m-m/n;
}
else
{
break;
}
}
else
{
m -= k;
if(!(m%n))
{
printf("%d",m1);
return 0;
}
}
}
}
}
} | 54 |
26,528 |
int main()
{
int fen(int n,int k,int i,int *a,int m);
int n,k,i,x=1,m=0;
int *a;
a=&x;//a?????????????
scanf("%d%d",&n,&k);
i=n;
printf("%d",fen(n,k,i,a,m));
return 0;
}
int fen(int n,int k,int i,int *a,int m){
int t;
int pan(int t,int n,int k,int i,int *a,int m);
if(i==1){
m=n**a+k;
}
if(i!=1) {
t=fen(n,k,i-1,a,m);//t???????????????????
t=pan(t,n,k,i,a,m);//pan??????????t????n-1?????t?????????n-1?????
m=n*(t/(n-1))+k;//????????????????????????
}
return m;
}
int pan(int t,int n,int k,int i,int *a,int m){
int fen(int n,int k,int i,int *a,int m);
if(t%(n-1)!=0){//????????????????n-1?????????????????????????
(*a)++;//????????????
t=fen(n,k,i-1,a,m);//????
t=pan(t,n,k,i,a,m);//????????????????????
}
return t;
}
| 54 |
26,529 | int main()
{
int n,k,sum,i,j,t;
cin>>n;
cin>>k;
for(j=1;j>0;j++)
{
sum=(n-1)*j;
t=0;
for(i=0;i<n;i++)
{
if(sum%(n-1)==0)
{
sum=sum/(n-1)*n+k;
t=t+1;
}
else
{
break;
}
}
if(t==n)
{
break;
}
}
cout<<sum<<endl;
return 0;
} | 54 |
26,530 | int main()
{
int m=0,n=0,k=0,i=0;
cin>>n>>k;
int monkey[100];
memset(monkey,1,sizeof(monkey));
monkey[n]=k;
do
{
monkey[n]=monkey[n]+n;
for(i=n-1;i>=1;i--)
{
if(monkey[i+1]%(n-1)!=0)
break;
else
monkey[i]=monkey[i+1]/(n-1)*n+k;
}
}
while(i>=1);
cout<<monkey[1]<<endl;
return 0;
} | 54 |
26,531 | void main()
{
int n,k,m,i,a,j,p;
scanf("%d %d",&n,&k);
m=0;
shuo: m=m+1;
i=m;
for(j=1;j<n;j++)
{
p=n*i+k;
a=p%(n-1);
if(a!=0)
goto shuo;
else
i=p/(n-1);
}
printf("%d",i*n+k);
} | 54 |
26,532 |
int N,K;
int dfs(int n){
if (n == 0) {
return N-1;
}
int m = dfs(n-1)/(N-1)*N+K;
if (n == N) {
return m;
}
while (m%(N-1)) {
m += (int)pow(N,n);
}
return m;
}
int main(){
scanf("%d%d",&N,&K);
printf("%d",dfs(N));
return 0;
} | 54 |
26,533 | /********************************************
*@file 1.cpp *
*@author ?? *
*@date 2013-12-07 *
*@description *
*??????11?????? *
********************************************
*/
int n, k,f;
/*int go(int a, int step)
{
if (step == n)
return a;
if (a % (n - 1) != 0)
return 0;
return go(a * n / (n - 1) + k, step + 1);
}*/
void go(int a, int step)
{
if (step == n)
{cout<<a ; f=1;return ;}
if (a % (n - 1) != 0)
return ;
go(a * n / (n - 1) + k, step + 1);
}
int main()
{
int j, t;
cin >> n >> k;
for (j = n + k,f=0;f==0 ; j += n)
{
go(j, 1);
}
return 0;
}
| 54 |
26,534 | int main()
{
int a[100]={0};
int i,n,k,t=0,flag=0;
scanf("%d",&n);
scanf("%d",&k);
while(++t){a[1]=t*n+k;flag=1;
for (i=2;i<=n;i++)
{if ((a[i-1])%(n-1)==0)
a[i]=a[i-1]/(n-1)*n+k;
if(a[i-1]%(n-1)!=0)
{
flag=0;break;
}
}
if (flag==1) break;
}
printf("%d\n",a[n]);
return 0;
}
| 54 |
26,535 |
int main()
{
int i,n,dropnum,monkey[1000];
cin>>n>>dropnum;
monkey[n]=dropnum;
do
{
monkey[n]=monkey[n]+n;
for(i=n-1;i>0;i--)
{
if(monkey[i+1]%(n-1)!=0) break;
else monkey[i]=monkey[i+1]*n/(n-1)+dropnum;
}
}while(i>=1);
cout<<monkey[1]<<endl;
return 0;
}
| 54 |
26,536 |
int main()
{
int n, k, applesRemain;
int count;
double numDouble;
int applesBefore;
int mytry;
scanf("%d %d", &n, &k); // read number of monkeys n and remainder k
count = 0; // count if appleBefore is valid, stop loop when count == n
for(mytry = 1; count < n ; mytry++)
{
applesRemain = mytry; // try to initialize applesRemain by mytry, start from 1
for(; count < n; count++)
{
numDouble = (applesRemain + k - (double)k / n) * n / (double)(n - 1); // from the relation between a(m) and a(m-1)
applesBefore = (int)numDouble;
if(numDouble - applesBefore > 0) // if applesBefore is not valid
{
count = 0; // reset count, try with next mytry
break;
}
else
{
applesRemain = applesBefore; // continue calculation process, count++
}
}
}
printf("%d\n", applesRemain); // output result
return 0;
}
| 54 |
26,537 | void main()
{
int n,k,t,m=0;
scanf("%d %d",&n,&k);
if (n>2)
{int i=1,p;
p=1;
while(i<=n)
{ p=p*n;
i++;}
m=p-k*(n-1);
}
else if(n=2) m=7;
printf("%d",m);
} | 54 |
26,538 |
int minm(int n,int k);
void main()
{
int n,k;
scanf("%d%d",&n,&k);
printf("%d\n",minm(n,k));
}
int minm(int n,int k)
{
int i,j,m;
m=n-1;
for(j=1;;j++){
m=j*(n-1);
for(i=1;i<=n;i++){
if(m%(n-1)!=0) break;
m=m+m/(n-1)+k;
if(i==n) return m;
}
}
} | 54 |
26,539 |
int main()
{
int n, k, m;
int cal(int monkey, int rest);
scanf("%d %d", &n, &k);
m=cal(n, k);
printf("%d\n", m);
return 0;
}
int cal(int monkey, int rest)
{
int i, j, num, nummin;
int a[10000];
for(i=0; i<10000; i++)
{
a[i]=0;
}
nummin=1;
while(nummin>=1)
{
num=nummin;
num=num*monkey+rest;
for(i=2; i<=monkey; i++)
{
num=num*monkey/(monkey-1)+rest;
a[i]=num;
if(num%monkey!=rest)
{
nummin++;
for(j=0; j<=monkey; j++)
{
a[j]=0;
}
break;
}
}
if(a[monkey]%monkey==rest)
{
break;
}
}
return(num);
}
| 54 |
26,540 | void main()
{
int n,k,i=1,j,s;
scanf("%d%d",&n,&k);printf("\n");
do
{s=i;
for(j=1;j<=n;j++)
{s=s*n;s=s+k;
if(s%(n-1)!=0) break;
else s=s/(n-1);
}
i++;
} while(j<n);
printf("%d",s);
} | 54 |
26,541 | int main()
{
int i,n,k;
long s;
cin>>n>>k;
if(n==1) cout<<1;
else if(n==2) cout<<7;
else
{
s=n;
for(i=1;i<n;i++) s*=n;
s-=k*(n-1);
cout<<s;
}
return 0;
} | 54 |
26,542 | int main()
{
int n,k,m,j;
cin>>n>>k;
for(int i=1;;i++)
{
m=i*n+k;
for(j=1;j<n;j++)
{
if(m%(n-1)==0)
m=m*n/(n-1)+k;
else
break;
}
if(j==n)
break;
}
cout<<m;
return 0;
}
| 54 |
26,543 |
void fy(int n,int k)
{
int j,l,m;
for(j=1;l!=n;j++)
{
m=j;
for(l=0;l<n;l++)
{
if(m%(n-1)==0)
{m=m*n/(n-1)+k;
continue;
}
break;
}
}
printf("%d",m);
}
void main()
{
int n,k;
scanf("%d %d",&n,&k);
fy(n,k);
} | 54 |
26,544 | int main()
{
int m, n, k, g = 1, i = 1;
cin >> n >> k;
while(g == 1)
{
g = 0;
m = i * n + k;
i ++;
if(m %(n - 1) != 0)
{
g = 1;
}
else
for(int j = 2; j <= n - 1; j ++)
{
m = m * n / (n - 1) + k;
if(m % (n - 1) != 0)
{
g = 1;
break;
}
}
m = m * n / (n - 1) + k;
}
cout << m;
return 0;
}
| 54 |
26,545 |
void main()
{
int i=1,n,k,m,j;
scanf("%d %d",&n,&k);
j=1;
abc:
m=j*n+k;
def:
if(m%(n-1)==0&&i<n)
{
m=m/(n-1)*n+k;
i=i+1;
goto def;
}
if(m%(n-1)&&i<n)
{
i=1;
j=j+1;
goto abc;
}
if(i==n)
printf("%d",m);
} | 54 |
26,546 | /**
*@file 1.cpp
*@author ???
*@date 2013-12-03
*@description ?????
*/
int n, k,ans=0, i=0;
int fen(int x)
{
if(x==1)
return 1;
else
{
if(ans%(n-1)==0)
{
ans=ans/(n-1)*n+k;
return fen(x-1);
}
else return 0;
}
}
int main()
{
cin >> n >> k;
while(1)
{
ans=i*n+k;
if(fen(n))
{cout << ans << endl;break;}
i++;
}
return 0;
}
| 54 |
26,547 | /*
* ????1108-1.cpp
* ?????
* ????: 2011-11-14
* ???????????
*/
int main(){
int n,k,i;//????
cin>>n>>k;//????????????
int a[n+1];//?????????????
for(a[1]=n+k;;a[1]++){//??
if(a[1]%n==0) continue;
if(a[1]%n!=k) continue;//??????
for(i=2;i<=n;i++){
if(a[i-1]%n==0) break;
if(a[i-1]%(n-1)!=0)
break;
a[i]=n*a[i-1]/(n-1)+k;//??????????????????
}
if(i==n+1)
break;//????????
}
cout<<a[n];//????
return 0;
}
| 54 |
26,548 | int n, k, i;
int x[10000];
int f(int o) {
while(true){
x[1] = o;//x[i]?????i?????????
for (i = 1; i < n; i++) {
if (x[i] % (n - 1) == 0)
x[i + 1] = n * x[i] / (n - 1) + k;
else
break;
}
if (i == n)
return x[n];
else {
o = o + n;
//return f(o);
}
}
}
int main() {
cin >> n >> k;
int o = n + k;
cout << f(o);
}
| 54 |
26,549 | void main()
{
long int f(long int a,long int b);
long int n,k;
scanf("%ld%ld",&n,&k);
printf("%ld",f(n,k));
}
long int f(long int a,long int b)
{
long int z;
long int i;
long int chu=1;
long int ok;
do{ ok=1;
z=chu*a+b;
for (i=1;i<a;i++)
{
if(z%(a-1)!=0) {ok=0;break;}
z=a*z/(a-1)+b;
}
chu++;
}while(ok==0);
return z;
} | 54 |
26,550 | void main()
{
long j,k,m,n,p,q,b;
scanf("%ld %ld",&n,&k);
m=0;
while(1)
{
m++;
j=n;
b=m;
q=1;
while(j>0)
{
j--;
if(b%(n-1)==0)
b=b/(n-1)*n+k;
else
{
q=0;
break;
}
}
if(q==1)
break;
}
printf("%d",b);
} | 54 |
26,551 | int main() //?????
{
int n,k,i;
cin>>n>>k;
int apple[n+1];
apple[1]=n+k; //?????????????1
while(true){
for(i=2;i<=n;i++)
{apple[i]=(apple[i-1]-k)/n*(n-1);
if(apple[i]%n!=k) break;
}
if(i==n+1) break;
else apple[1]+=n;}
for(i=1;i<=n;i++)
{cout<<apple[i]<<endl;
break;}
return 0;
}
| 54 |
26,552 | //********************************
//*???1.cpp **
//*???????? **
//*?????? 1300012838 **
//*???2013.12.4 **
//********************************
int apple(int i, int n, int k, int s)
{
int m;
if (i == 0)
return s;
else
{
m = apple(i-1, n, k, s);
if (m % (n - 1) != 0 || m == 0)
return 0;
return n * m / (n - 1) + k;
}
}
int main()
{
int m, n, k, s;
cin >> n >> k;
s = n - 1;
do
{
m = apple(n, n, k, s);
s += n - 1;
} while (m <= k);
cout << m << endl;
return 0;
}
| 54 |
26,553 | void main()
{
int n,k,i,y,v,t,s,q;
scanf("%d %d",&n,&k);
for(i=1;;i++)
{t=i*n+k;
for(v=1,y=1;v<=n-1;)
{ q=t*n%(n-1);
if(q!=0)
{y=0;break;}
else{v=v+1;
s=t*n/(n-1);
t=s+k;}
}
if(y==1) {printf("%d",t);break;}
}
}
| 54 |
26,554 | int main(int argc, char* argv[])
{
int n,k,sum;
int getsum(int n1,int k1);
scanf("%d%d",&n,&k);
sum=getsum(n,k);
printf("%d",sum);
return 0;
}
int getsum(int n1,int k1){
int i,j=1,a,sum1;
while(1){
sum1=n1*j+k1;
if(n1==1)
return sum1;
if(n1>1){
for(i=0;i<n1-1;i++){
if(sum1%(n1-1)==0){
sum1=sum1*n1/(n1-1)+k1;
if(i==n1-2)
return sum1;
}
else
break;
}
j++;
}
}
}
| 54 |
26,555 |
int main()
{
int n,k,i,t,f;
long int ans;
scanf("%d%d",&n,&k);
for(ans=1;ans<3000000000;ans++)
{
f=0;
t=ans;
for(i=1;i<=n;i++)
{
if(((t-k)%n==0)&&(t-k>0))
{
t=t-k-(t-k)/n;
}
else
{
f++;
break;
}
}
if(f!=0)
continue;
else
break;
}
printf("%ld\n",ans);
return 0;
}
| 54 |
26,556 | int main()
{long int ss,s,n,k,i,o;
scanf("%d%d",&n,&k);
ss=1;
while(1)
{ss=ss+1;
s=ss;
o=0;
for(i=1;i<=n;i++)
{if((s*(n-1)-(n-1)*k)%n==0&&s*(n-1)-(n-1)*k!=0)s=(s*(n-1)-(n-1)*k)/n;
else {o=1;break;}
}
if(o==0)break;
}
printf("%d",ss);
}
| 54 |
26,557 | /*
* 1.cpp
*
* Created on: 2011-11-15
* Author: Sun
*/
int main(){
int n,i,j,b,k;//n????b??????k?????
cin>>n>>k;//??n?k
b=n+k;//b????
while(i<n-1){j=b;//??b????????
for(i=0;i<n;i++){
if((n*j)%(n-1)!=0)break;//????????????
else j=n*j/(n-1)+k;}//????
if(i==n-1){//?????
cout<<j<<endl;break;
}b=b+n;//???????b??n
}
return 0;
}
| 54 |
26,558 |
int f(int i,int t); //?????-1?????????????t?????i????
int n,k;
int main()
{
cin>>n>>k;
int m=0;
for(int i=n+k;(m=f(i,n))==-1;i+=n){}
cout<<m;
return 0;
}
int f(int i,int t)
{
return (t==1?i:(i%(n-1)?-1:(f((i*n/(n-1)+k),t-1))));
} | 54 |
26,559 |
main()
{
int n,k,i,m,j;
scanf("%d%d",&n,&k);
for(i=n+k;;i++)
{
m=i;
for(j=1;j<=n;j++)
{
if((m-k)%n!=0||m-k<=0) break;
else m=(m-k)/n*(n-1);
if(j==n)
{
printf("%d",i);
goto loop;
}
}
}
loop: printf("\n");
}
| 54 |
26,560 | int main()
{
int a,b,n,k,s;
a=1;
scanf("%d %d",&n,&k);
for(b=1;;b++)
{s=b*(n-1);
while(a<=n)
{if(s%(n-1)==0)
{s=n*s/(n-1)+k;
a++;}
else
{a=1;
break;}
}
if(a-1==n)
{printf("%d",s);
break;}
else continue;
}
return 0;
} | 54 |
26,561 | int main()
{
int n,k;
cin >> n >> k;
double t1;
int t2;
int b=0;
for(int i = 1; ; i++)
{
t1 = i;
b = 0;
for(int j = 1;j<= n ; j++)
{
t1 = n * t1 / (n-1) + k;
t2 = floor(t1);
//cout <<t1 << " " << t2 << endl;
if(t1 != t2)
break;
else
b++;
}
if ( b == n )
{
cout << t2 << endl;
return 0;
}
}
} | 54 |
26,562 | // ywxTest.cpp : ??????????????
//********************************
//*???1.????? **
//*?????? 1300017623 **
//*???2013.12.4 **
//********************************
int f(int n, int k, int m, int t) //??m??????
{
if (t == 1) //?????
{
if (((m - k) % n == 0) && (m - k) >= n) //?????????1???
return 0;
else
return 1;
}
if (((m - k) % n == 0) && (m - k) >= n) //?????????1???
return f(n, k, m-k-(m-k)/n, t-1); //?????????m-k-(m-k)/n???
else
return 1;
}
int main()
{
int n, k, m = 1;
cin >> n >> k;
while (f(n, k, m, n)) //?m????
m++;
cout << m;
return 0;
} | 54 |
26,563 | int main()
{
int nn,kk;
int calculate(int n,int k);//????
scanf("%d %d",&nn,&kk);
calculate(nn,kk);
return 0;
}
int calculate(int n,int k)
{int na,i;
int sum[100];//sum????????????????sum0??????????????????
na=1;//??????????????
sum[0]=na*n+k;//????????????
for(i=1;i<=n-1;i++)
{ sum[i]=n*sum[i-1]/(n-1)+k;//???i+1??????sum?i?? ???i??????sum?i-1)??? ?*?
if((n*sum[i-1]%(n-1))!=0){
na=na+1;
sum[0]=na*n+k;
i=0;
}//?? n*sum[i-1]?????n-1????? ?*????????????
//???????????????for???
//???????????????????????????????????????????????????
}
printf("%d",sum[n-1]);
} | 54 |
26,564 | void main()
{
int first=1,sum,n,k,i=2;
scanf("%d %d",&n,&k);
sum=first*n+k;
while (i<=n)
{
if (sum%(n-1)!=0){i=2;first++;sum=first*n+k;continue;}
sum=sum/(n-1)*n+k;
i++;
}
printf("%d\n",sum);
} | 54 |
26,565 |
int jisuan(int n,int k){
int num=1,x=1,i;
while(1){
for(i=0;;i++){
if(x%n==k&&x/n>0){
x=x/n*(n-1);
}
else
break;
if(i==n-1){
return num-1;
}
}
x=num++;
}
}
int main(int argc, char* argv[])
{
int x,y,result;
scanf("%d %d",&x,&y);
result=jisuan(x,y);
printf("%d\n",result);
return 0;
} | 54 |
26,566 | int main()
{
int m,n,k,l,y;
cin>>n>>k;
int i,a[100];
i=n+k;
while(1)
{
a[n]=i;
l=0;y=0;
for(int j=0;j<n-1;j++)
{
a[n-j-1]=a[n-j]/(n-1)*n+k;
if(a[n-j]%(n-1)==0)
{
l=l+1;
}
else
break;
}
if(l==n-1)
{
cout<<a[1];
break;
}
i=i+n;
}
return 0;
}
| 54 |
26,567 | int main()
{
int a[100]={0},m,n,k,i;
cin>>n>>k;
a[n]=n+k;
for(a[n]=n+k;;a[n]=a[n]+n)
{
for(i=n;i>=2;i--)
{
if(a[i]%(n-1)!=0)
break;
a[i-1]=a[i]*n/(n-1)+k;
}
if(a[1]==0)
continue;
else
break;
}
cout<<a[1];
return 0;
} | 54 |
26,568 | int judge_output(int n,int k, int j,int a1)
{
int tp,out;
if(j==1)
return a1;
else if(judge_output(n,k,j-1,a1))
{
tp=judge_output(n,k,j-1,a1);
if(!(tp%(n-1)))
{
out=n*tp/(n-1)+k;
return out;
}
else
return 0;
}
else
return 0;
}
void main()
{
int n,k,i,tp=0;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
tp=judge_output(n,k,(n+1),i);
if(tp)
{
printf("%d",tp);
break;
}
}
} | 54 |
26,569 | int main()
{
int n,ti,k,i,j;
scanf("%d %d",&n,&k);
for(i=1;;i++)
{
ti=i;
for(j=1;j<=n;j++)
{
ti=ti*n+k;
if(j==n)goto qqq;
else if(ti%(n-1)==0){ti=ti/(n-1);}
else{goto sss;}
}
sss:;
}
qqq:printf("%d\n",ti);
return 0;
} | 54 |
26,570 | int main()
{
int m,n,k,i=1,j=0,x;
scanf("%d%d",&n,&k);
for(i=1;j<n-1;i++)
{x=i;j=0;
while((n*x+k)%(n-1)==0)
{x=(n*x+k)/(n-1);j++;
if(j==n-1)break;}
}
printf("%d",n*x+k);
return 0;
} | 54 |
26,571 | long m;
int n,k;
int ok(long x)
{
int i;
for (i=1;i<=n;i++)
{
if ((x-k)%n!=0)
return 0;
else if ((x-k)/n==0) return 0;
x=(x-k)/n*(n-1);
}
return 1;
}
int main()
{
cin >>n>>k;
m=k;
while (1)
{
m+=n;
if (ok(m))
{cout <<m<<endl; return 0;}
}
} | 54 |
26,572 | void main()
{
int n,k,t,m,s,i,j;
s=1;
j=0;
i=1;
scanf("%d%d",&n,&k);
while(i<=n)
{
s=s*n;
i++;
}
for(m=s;m>=n+k;m--)
{
t=m;
for(j=0;j<=n;j++)
{
t-=k;
if((t%n)!=0)
break;
t-=t/n;
}
if(j==n)
printf("%d\n",m);
}
}
| 54 |
26,573 | void main()
{
int f1(int m,int n,int k);
int n,m,i,j,k;
scanf("%d%d",&n,&k);
for(m=1;;m++)
{
j=f1(m,n,k);
if(j==1){printf("%d",m);break;}
}
}
int f1(int m,int n,int k)
{
int j,r,a,b,jihao=0,i;
for(i=0;i<n;i++)
{
a=m%n;
if(a!=k){jihao=1;break;}
m=m/n;
m=m*(n-1);
}
if(m<n-1)jihao=1;
if(jihao==1)return 0;
else return 1;
} | 54 |
26,574 | void main()
{
int i,j,k,l,m,n;
scanf("%d %d",&n,&k);
for(i=1;;i++)
{
m=i*(n-1);
// printf("i=%d\n",i);
for(j=n;j>0;j--)
{
// printf("j=%d\n",j);
m=m*n/(n-1)+k;
// printf("m=%d\n",m);
if(m%(n-1)!=0)break;
}
// printf("j=%d\n",j);
if(j==1||j==0)break;
// printf("j=%d\n",j);
if(j>1)continue;
}
printf("%d",m);
}
| 54 |
26,575 | main()
{
int n,k,i,s,e;
scanf("%d %d",&n,&k);
s=n+k;
e=s;
goto abc;
loop:s=n+s;
e=s;
abc:for(i=2;i<=n;i++)
{
if((n*e)%(n-1)==0) e=n*e/(n-1)+k;
else goto loop;
}
printf("%d",e);
} | 54 |
26,576 |
int main()
{
int n,k,i;
cin>>n>>k;
int a[1000];
a[n]=k;
while(i>1)
{
a[n]=a[n]+n;
for(i=n;i>1;i--)
{
if(a[i]%(n-1) != 0)
{
break;
}
else
{
a[i-1]=a[i]*n/(n-1)+k;
}
}
}
cout<<a[1];
return 0;
} | 54 |
26,577 | int main()
{
int m,k,n,i,p,q=1;
scanf("%d %d",&n,&k);
p=n;
for(i=1;i<=n;i++)
{
q=q*n;
}
m=q-p*k+k;
printf("%d",m);
} | 54 |
26,578 |
int res(int n, int k, int i, int p)
{
int m;
if (i == n)
{
m = n * p + k;
}
else
{
m = res(n, k, i + 1, p);
if (m != -1 && m % (n - 1) == 0)
{
m = m / (n - 1) * n + k;
}
else
m = -1;
}
return m;
}
int main()
{
int n, k;
cin >> n >> k;
int i = 1;
while(1)
{
int m = res(n, k, 1, i++);
if (m != -1)
{
cout << m << endl;
break;
}
}
return 0;
}
| 54 |
26,579 |
int n,k,t,f;
void divide(int m)
{
if((m-k)%n!=0)
{
f=0;
return;
}
m=(m-k)*(n-1)/n;
t++;
if(t==n)
f=m>0?1:0;
else
divide(m);
}
void main()
{
int i,m;
scanf("%d%d",&n,&k);
m=n;
while(1)
{
t=0,f=0;
divide(m);
if(f==1)
{
printf("%d",m);
break;
}
else
m++;
}
} | 54 |
26,580 | void main()
{
int n,k,m=1,i,j;
scanf("%d %d",&n,&k);
for(j=1;;j++)
{
m=j;
for(i=1;i<=n;i++)
if(m%(n-1)==0)m=m*n/(n-1)+k;
else break;
if(i>n)break;
}
printf("%d\n",m);
} | 54 |
26,581 | /*
* ?????.cpp
*
* Created on: 2012-11-14
* Author: ???
*/
int main()
{
int n=0,k=0,j=1,i=1,apples=0;
cin>>n>>k;
apples=n+k;
while(1)
{
while(apples%(n-1)==0&&i<n)
{
apples=apples/(n-1)*n+k;
++i;
}
if (i<n){
j++;
apples=j*n+k;
i=1;
}
else break;
}
cout<<apples;
return 0;
}
| 54 |
26,582 | int fei(int);
int main()
{
int n,k,flag=0,a=1,i,sum=0;
cin>>n>>k;
while(flag==0)
{
sum=n*a+k;
for(i=2;i<=n;i++)
{
if(sum%(n-1)!=0)
break;
else
sum=sum/(n-1)*n+k;
}
if(i==n+1)
{
cout<<sum<<endl;
flag=1;
}
a++;
}
return 0;
} | 54 |
26,583 |
int f(int n,int k)
{
int a[100],i,m;//a[i]???i+1?????????????????
a[n-1]=1;
for(i=n-1;i>0;i--){
a[i-1]=(a[i]*n+k)/(n-1);//??????????????????
}
m=n*a[0]+k;
return m;//??m??
}
int main(int argc, char* argv[])
{
int n,k,m;
scanf("%d %d",&n,&k);
if(n==2){
m=f(n,k);}
else m=pow(n,n)-k*(n-1);/*???????m%n=k,?k*(n-1)?????????m????,???m+k*(n-1)??
????????[m+k*(n-1)]/n????(n-1)??????????????????n;
??????n?????[((n-1)^(n-1))*m+k*((n-1)^n)]/(n^n),?????(n-1)??
?????????????m????=n^n-k*(n-1);*/
printf("%d\n",m);
return 0;
}
| 54 |
26,584 | /*
* hanshu.cpp
*?? - ?????
* Created on: 2012-11-16
* Author:???
*/
int main()
{
int n,k,i;//????
cin>>n>>k;//?????????????
const int N=n;
int apple[N+1];//????
apple[1]=k;//
do{
apple[1]=apple[1]+n;//????????????????????n
for(i=1;i<=N;i++)//???????????????????
{
if(apple[i]%(n-1)!=0)break;//???,????
apple[i+1]=apple[i]/(n-1)*n+k;//??,?????????????????????
}
}while(i<N);//?????n????,????
cout<<apple[N];//????????
return 0;
}
| 54 |
26,585 | unsigned int apple(unsigned int N,unsigned int K);
int main()
{
unsigned int m,n,k,J;
scanf("%u %u",&n,&k);
J=apple(n,k);
m=J*n+k;
printf("%u",m);
return 0;
}
unsigned int apple(unsigned int N,unsigned int K)
{
unsigned int i,j,l;
for(i=1;;i++){
j=i;
for(l=1;l<N;l++){
if((j*N+K)%(N-1)==0)
j=(j*N+K)/(N-1);
else break;
}
if(l==N) break;
}
return j;
} | 54 |
26,586 |
int main()
{
int n,k,i,j,p,q,f;
scanf("%d",&n);
scanf("%d",&k);
for(i=1;;i++)
{
p=i;
for(j=1;j<=n;j++)
{
q=p*n+k;
f=q%(n-1);
if(f)
break;
else
p=q/(n-1);
}
if((j==n+1)||(j==n))
break;
}
printf("%d",q);
return 0;
}
| 54 |
26,587 | main()
{
int a[100],n,k,m;
int i=0,j=1,r,t=1;
scanf("%d%d",&n,&k);
do
{
if(t==0)
{
i=0;
t=1;
}
a[0]=n*j+k;
a[i+1]=n*a[i]/(n-1)+k;
r=(a[i]*n)%(n-1);
if(r!=0)
{
j++;
t=0;
}
i++;
}while(i<n);
m=a[n-1];
printf("%d",m);
} | 54 |
26,588 | int f(int n,int k)
{
int i;
int a[100];
for(a[1]=n+k;;a[1]+=n)
for( int i=2;i<=n;i++)
{
if(a[i-1]%(n-1)!=0)break;
a[i]=a[i-1]/(n-1)*n+k;
if(i==n)return a[n];
}
}
int main()
{
int n;
int k;
int m;
cin>>n>>k;
m=f(n,k);
cout<<m;
} | 54 |
26,589 | int main()
{
int n,k;
scanf("%d %d",&n,&k);
int i=0;
int m=0;
int p=0;
while(1)
{
m++;
p = m;
for(i=0;i<n;i++)
{
if(p%n == k)
{
p=p/n*(n-1);
}
else
break;
if(p<=0)
break;
}
if(i==n)
{
printf("%d",m);
break;
}
}
return 0;
} | 54 |
26,590 | void main()
{
int n,k,i,m,p,sign=0;
scanf("%d%d",&n,&k);
m=n+k;
while(!sign)
{
p=m;
sign=1;
for(i=0;i<n;i++)
{
if(p%n!=k||p<n+k){
sign=0;
break;
}
p=p-p/n-k;
}
if(sign)
{
printf("%d",m);
break;
}
m++;
}
} | 54 |
26,591 | int main()
{int a[100]={0};
int func(int m,int n,int k);
int i,n,k,t=0,flag=0;
scanf("%d",&n);
scanf("%d",&k);
while(++t){a[1]=t*n+k;flag=1;
for (i=2;i<=n;i++)
{if ((a[i-1])%(n-1)==0)
a[i]=a[i-1]/(n-1)*n+k;
if(a[i-1]%(n-1)!=0)
{flag=0;break;
}
}if (flag==1) break;
}
printf("%d\n",a[n]);
return 0;
} | 54 |
26,592 | void main()
{
int a,b,n,k,i,j,m,p;
long c;
scanf("%d%d",&n,&k);
for(c=0;c<100000000000000;c++)
{
m=c;
p=0;
for(i=0;i<n;i++)
{
if((m-k)%n==0&&(m-k!=0))
{
m=(m-k)/n*(n-1);
p=p+1;
}
}
if(p==n)
{
printf("%ld\n",c);
break;
}
}
} | 54 |
26,593 |
int main()
{
int n, k;
cin >> n >> k;
if (n == 2)
{
cout << 7 << endl;
return 0;
}
int p = pow((double)n-1, n-1) - k;
while(1)
{
int m = p * n + k;
for (int i = 1; i < n; ++i)
{
if (m % (n - 1) == 0)
m = m / (n - 1) * n + k;
else
{
m = -1;
break;
}
}
if (m != -1)
{
cout << m << endl;
break;
}
p += 1;
}
return 0;
}
| 54 |
26,594 | int work() //????;
{
int i,n,k,a[100]; //????,????????;
for(i=0;i<100;i++)
a[i]=0;
cin >> n >> k; //?????N??K?;
a[0]=k;
do
{ a[0]=a[0]+n; //????????? ;
for(i=1;i<n;i++)
{
a[i]=a[i-1]*n/(n-1)+k; //?????????? ;
if(a[i]%n!=k)break; //???I?????????N??????N??;
}
}while(a[n-1]%n!=k); //?????????;
cout << a[n-1] << endl;
return 0;
}
int main() //???;
{
work ();
return 0;
}
| 54 |
26,595 | int i=1;int n,k;
int f(int x)
{
if (x==1) return (i*n+k);
else if (f(x-1)%(n-1)==0)return (f(x-1)*n/(n-1)+k);
else
{while(f(x-1)%(n-1)!=0)
i++;
return (f(x-1)*n/(n-1)+k);
}
}
int main()
{
cin>>n>>k;
cout<<f(n);
}
| 54 |
26,596 |
int applenum(int n,int k){
int m=1,i,t=0,z;
for(m=n+k;;m+=n){
t=m;
for(i=0;i<n;i++){
if(t%n==k){
t=t-k-t/n;
}else{
break;
}
}
if(i==n&&t>=1){
z=m;
break;
}
}
return z;
}
int main(){
int n,k,m;
scanf("%d%d",&n,&k);
m=applenum(n,k);
printf("%d",m);
return 0;
} | 54 |
26,597 |
int main(int argc, char* argv[])
{
int i,n,k,x;
int judge(int,int,int);
scanf("%d %d",&n,&k);
for(i=1;i<=1000000000;i++){
x=judge(n,k,i);
if(x==1){
printf("%d",i);
break;
}
}
return 0;
}
int judge(int n, int k, int i)
{
int yushu,j;
for(j=1;j<=n;j++){
yushu=i%n;
i=i-yushu-i/n;
if(yushu!=k||i==0){
break;
}
}
if(j==n+1){
return 1;
}else{
return 0;
}
}
| 54 |
26,598 |
int main()
{
int n, k;
cin >> n >> k;
int an = 1;
for(int i = 0; i < n; i++)
an = an*n;
an = an - k*(n-1);
cout << an;
return 0;
}
| 54 |
26,599 | void main()
{
int n,k,m,i,x;
scanf("%d%d",&n,&k);
m=n;
loop:x=m;
for(i=1;i<=n;i++)
{
if(x%n==k&&((x-k-x/n)!=0))
x=x-k-x/n;
else
{
m++;
goto loop;
}
}
printf("%d",m);
}
| 54 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.