id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
26,800 | /**
* @file 1.cpp
* @author ???
* @date 2013-12-05
* @description
* ????????????
*/
int n, k, get_n = 1, temp; // get_n???n??????????
void func(int num); // temp?????num???????????
int main()
{
cin >> n >> k; // ????
func(n);
cout << temp; // ???????
return 0;
}
void func(int num)
{
if (num == n) temp = get_n * n + k; // ?n??????????(get_n * n + k)?
else temp = temp * n / (n - 1) + k; // ???num???????????
if (num == 1) return; // ??num??1??????????return
if (temp % (n - 1) == 0) func(num - 1); // ??temp????n - 1???????get_n???????????
else // ??temp?????n - 1??????get_n??1?????func(n)
{
++get_n;
func(n);
}
} | 54 |
26,801 | int main()
{
int n,k,i,s,t;
scanf("%d%d",&n,&k);
t=1;
add:;
t=t+1;
s=n-2+t;
for(i=1;i<=n;i++)
{
if(s%(n-1))goto add;
s=s/(n-1)*n+k;
}
printf("%d",s);
return 0;
}
| 54 |
26,802 | /*
* ?????.cpp
*
* Created on: 2010-11-24
* Author: acer
*/
int main()
{
int n,k,t=1,i;
cin>>n>>k;
int apple[n];
while(1) //????????????????????
{
apple[0]=t*n+k; //0????
for(i=1;i<n;i++)
{
if(apple[i-1]%(n-1)!=0)
{ //???????????????break?
t++;
break;
}
apple[i]=apple[i-1]*n/(n-1)+k; //?????
}
if(i==n) //??????????????
{
cout<<apple[n-1];
break; //????
}
}
return 0;
}
| 54 |
26,803 |
int f(int m,int n,int k,int t)
{
if(((m%n)==k) && ( t!=1))
{
return f((m-k)*(n-1)/n,n,k,t-1);}
if(((m%n)!=k)||(m<n))
{
return 0;}
if((t==1)&&(m%n)==k&&(m>=n))
{
return 1;}
}
int main()
{
int n,k;
cin>>n>>k;
int i;
int t;
t=n;
for(i=2;;i++)
{
if(f(i,n,k,t)==1)
{
cout<<i;
break;
}
}
return 0;
} | 54 |
26,804 | void main()
{
int n,k,m,i,t=1,s=1;
scanf("%d %d",&m,&k);
for(i=0;i<=m-1;i++)
t=t*m;
for(i=0;i<=m-2;i++)
s=s*(m-1);
if(s>k)
{
n=t-k*(m-1);
printf("%d",n);
}
else
{
n=2*t-k*(m-1);
printf("%d",n);
}
}
| 54 |
26,805 | /*
* ??????????.cpp
* ??????????
* Created on: 2010-11-24
* Author: ???
*/
int main()//???
{
int n,k;//????
int i,j;
int a;
cin>>n>>k;//??
if(n==1&&k==0)//???
cout<<1<<endl;
for(i=1;;i++)//????
{
if((n*i+k)%(n-1)!=0)
//??????????????????????n-1??
continue;
else
{
for(j=n,a=i*n+k;j>=2;j--)
{
if(a%(n-1)!=0)
//???????????????n-1??
break;
a=a/(n-1)*n+k;//?????????????
}
}
if(j==1)//??????????
break;
}
cout<<a<<endl;//?????
return 0;//??
} | 54 |
26,806 | //#include<stdio.h>
//#include<time.h>
int div_foo(int n,int k,int index,int m);
int main(){
int n,k;
cin>>n>>k;
cout<<div_foo(n,k,1,1)<<endl;
//printf("%.21f",(double) clock()/CLOCKS_PER_SEC);
return 0;
}
int div_foo(int n,int k,int index,int m){
if(index==n){
return m*n+k;
}
else if(index==1){
int iter,A;
for(int i=0;;i++){
A=div_foo(n,k,index+1,m+i);
iter=A/(n-1);
if(A!=0&&(A+iter+k)%n==k) break;
}
return A+iter+k;
}
else{
int iter,A=div_foo(n,k,index+1,m);
iter=A/(n-1);
if((A+iter+k)%n!=k||A==0||(A+iter+k)/n!=iter) return 0;
else return A+iter+k;
}
}
| 54 |
26,807 | /*
* pr9.cpp
*
* Created on: 2011-11-15
* Author: Gan Hua
*/
int main()
{
int n,k,m;//????n?????k,????m
cin>>n>>k;
int i,j,flag=1;
for(i=1;flag==1;i++)
{
m=n*i+k;//??????????????
for(j=1;j<=n-1;j++)
if(m%(n-1)==0)
m=m*n/(n-1)+k;//????????????
else break;
if(j==n)
{cout<<m;flag=0;}
}
}
| 54 |
26,808 | void main()
{
int n,k,m,i=1,a=1;
scanf("%d%d",&n,&k);
m=a*n+k;
do
{
if(m%(n-1)==0)
{
m=m*n/(n-1)+k;
i=i+1;
}
else
{
a++;
m=a*n+k;
i=1;
}
}
while(i<=(n-1));
printf("%d\n",m);
} | 54 |
26,809 |
void main()
{
int i,j,m,n,k,r;
scanf("%d %d",&n,&k);
for(m=n;;m++)
{
r=m;
for(i=1;i<=n;i++)
{
if(k!=r-(r/n)*n) {r=r-k-r/n;break;}
else r=r-k-r/n;
}
if(i==n+1&&r/(n-1)>=1) break;
}
printf("%d\n",m);
} | 54 |
26,810 | int main()
{
int n,k,apple,m,i;
cin>>n>>k;
apple=k;
do
{
apple+=n;
m=apple;
for(i=n-1;i>=1;i--)
if(m%(n-1)==0)
m=m*n/(n-1)+k;
else
break;
}
while(i>=1);
cout<<m;
return 0;
} | 54 |
26,811 |
int main(){
int n,k;
cin>>n>>k;
for(int i=1;i>0;i++){//i=the number of apples last monky get.
int get=i;//the number of apples the last monky GET.
for(int j=n-1;j>0;j--){
if((get*n+k)%(n-1)){
get=0;//get=0 meas this i is impossible.
break;
}
get=(get*n+k)/(n-1);//GET for monky j.
}
if(get){
cout<<(get*n+k);
break;
}
}
}
| 54 |
26,812 |
void main()
{
int i,k,j,n,test,a[50];
scanf("%d%d",&n,&k);
for(i=n+k;;i=i+n)
{
a[0]=i;
for(j=0;j<n-1;j++)
{
test=n*a[j]-k+n*k;
if(test%(n-1)!=0)
{
j=0;
break;
}
else
a[j+1]=test/(n-1);
}
if(j==n-1){
printf("%d\n",a[n-1]);
break;
}
}
} | 54 |
26,813 | int n,k,b=1;
int calc(int x){
if(x==1)return b*n+k;
if(calc(x-1)==0||calc(x-1)%(n-1)!=0)return 0;
return calc(x-1)/(n-1)*n+k;
}
int main()
{
cin>>n>>k;
while(1){
if(calc(n)==0){
b++;
continue;
}
cout<<calc(n);
break;
}
return 0;
} | 54 |
26,814 |
int main()
{
int p(int a);
double n,k;
int o;
scanf("%lf %lf",&n,&k);
o=-k*(n-1)+pow(n,n);
p(o);
}
int p(int a)
{
printf("%d",a);
}
| 54 |
26,815 | void main()
{
int n, k, total, left, i, x=1;
scanf("%d %d", &n, &k);
total=n+k;
for( ; ; total++)
{
left=total;
i=1;
while(i<=n)
{
i++;
if(left%n==k&&left>=n+k)
left=(left-k)*(n-1)/n;
else left=0;
}
if(left/(n-1)>=1) break;
}
printf("%d\n", total);
} | 54 |
26,816 | int s(int n,int k,int m,int i)
{ if(i!=n)
{++i;
if(m%(n-1)==0)
{return s(n,k,m*n/(n-1)+k,i);}
else
return -1;
}
else
{return m;}
}
int main()
{ int n,k,m,i=1;
cin>>n>>k;
for(;;++i)
{
if(s(n,k,i,0)==-1)
continue;
else
{cout<<s(n,k,i,0);break;}
}
return 0;
}
| 54 |
26,817 | int main()
{
int apple (int n,int k);
int N,K,M;
scanf("%d %d",&N,&K);
M=apple(N,K);
printf("%d",M);
return 0;
}
int apple(int n, int k){
int i,last=1;
float m=1;
int Z;
for(i=0;i<2*n-1;i++){
if(i%2==0){
m=m*n+k;
}else{
m=m/(n-1);
Z=m;
if((m-Z)!=0){
last+=1;
m=last;
i=-1;
continue;
}
}
}
return(m);
}
| 54 |
26,818 |
int p(int n,int k){
if (!k) {
return 1;
}
return n * p(n,k - 1);
}
int main(){
int n;
int k;
scanf("%d %d", &n, &k);
printf("%d", p(n, n) - k * (n - 1));
return 0;
} | 54 |
26,819 |
signed int function( int n , int k , int last );
int totalmember;
int lastnumber;
int main()
{
int k,i=1;
cin>>totalmember>>k;
lastnumber=0;
while( i )
{
lastnumber++;
if( function( totalmember , k ,lastnumber ) != -k*(totalmember-1) )
{
cout<<function( totalmember , k , lastnumber )<<endl;
i--;
}
}
}
signed int function( int n , int k , int last )
{
if( n==1 )
{
return( totalmember * last + k );
}
else
{
if( function ( n-1 , k , last ) % ( totalmember-1 ) == 0 )
{
return( totalmember * function( n-1 , k , last ) / ( totalmember-1) + k );
}
else
{
return( -k*( totalmember-1 ) );
}
}
} | 54 |
26,820 | /*
* houzi.cpp
*
* Created on: 2011-11-16
* Author: ??
*/
int main()
{
int n,i,k;
cin>>n>>k;
int apple[n+1];
apple[1]=n+k;
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]=apple[1]+n;
}
for(i=1;i<=n;i++)
{
cout<<apple[i]<<endl;
break;
}
return 0;
}
| 54 |
26,821 | int main()
{
int i,j,k,n,t,r;
scanf("%d%d",&n,&k);
i=1;
while(1)
{i++;
j=0;
t=i;
r=1;
while(r<=n)
{if ((t-k)%n!=0||(t-k)==0) break;
else {j=j+1;t=t-(t-k)/n-k;}
r++;
}
if (j==n) {printf("%d",i);break;}
}
}
| 54 |
26,822 | int n,k;
int wa(int p,int q)
{
if (p == 0)
return q;
if(q%(n-1)==0)
return wa(p-1,q/(n-1)*n+k);
else return 0;
}
int main()
{
int i,sum=0;
scanf("%d%d",&n,&k);
i=n-1;
while(!sum)
{
sum=wa(n,i);
i++;
}
printf("%d",sum);
return 0;
}
| 54 |
26,823 | /*
* monkeyapple.cpp
*
* Created on: 2012-11-27
* Author: wangrunhui
*/
int main(void)
{
int n,k,i;
cin >> n >> k;
int monkey[n + 1];//monkey???????????????
monkey[n] = n + k;//???????????????n+k
while(true){
for ( i = n - 1; i > 0; i --)//????????????????????
{
if ( ( monkey[i + 1] % (n - 1) ) != 0) break;//?????n-1???????????
monkey[i] = monkey[i + 1]*n/(n - 1) + k;//??????????????
}
if ( i == 0) break;//i==0??????????????????
monkey[n] += n;//????????????????????????????????n
}
cout<< monkey[1] << endl;//???????????????????????
return 0;
}
| 54 |
26,824 | int main()
{
int apple(int n,int k);
int n,k,m;
scanf("%d%d",&n,&k);
m=apple(n,k);
printf("%d",m);
return 0;
}
int apple(int n,int k)
{
int x,y,i,t;
for(x=1;;x++)
{
y=x*n+k;
for(i=1;i<n;i++)
{
if(y%(n-1)!=0)
{
t=0;
break;
}
else
{
y=y*n/(n-1)+k;
t=1;
}
}
if(t==1)
return y;
else
continue;
}
return y;
} | 54 |
26,825 | //
// main.cpp
// relocateapples
//
// Created by ? ?? on 13-11-21.
// Copyright (c) 2013? LEE. All rights reserved.
//
int n,k;//??????????total??x??
int total=0;
float xishu=0.0;
int main()
{ int msees(int x,int y);
cin>>n>>k;
total=n;int i;
xishu=(float)n/(n-1);//???????????????float??
while(true)
{for(i=1;i<=n;i++)
{ if((msees(i,k)-k)%n!=0)//???????????
break;
}
if(i==n+1)break;
total+=n;
}
cout<<msees(n,k)<<endl;
return 0;
}
int msees(int x,int y)
{
if(x==1)return total+y;//??????????????????n+k???
return y+xishu*msees(x-1,y);//??????
}
| 54 |
26,826 | long leastapple(long monkey,long thraway){
long last=0,i;
double least;
while(1){
last++;
for(i=0;i<monkey;i++){
if(i==0)
{
least=last*monkey+thraway;
}else
{
least=least/(monkey-1)*monkey+thraway;
}
if(least-(long)least!=0)
{
break;
}
}
if(i==monkey)
{
break;
}
}
return least;
}
long main(long argc, char* argv[])
{
long n,k;
scanf("%ld %ld",&n,&k);
printf("%ld",leastapple(n,k));
return 0;
} | 54 |
26,827 | int n,k,m;
int judge(int i,int r){
if (i==n-1) return r;
if (r%(n-1)) return 0;
return judge(i+1,(r/(n-1))*n+k);
}
int main(){
cin>>n>>k;
for (m=1;!judge(0,m*n+k);m++);
cout<<judge(0,m*n+k);
} | 54 |
26,828 | void f(int n,int k){
int m,i,e;
for(m=n+k;;m=e+1){
e=m;
for(i=1;i<=n;i++){
if((m-k)%n||m-k<n) break;
else m-=(m-k)/n+k;
}
if(i==n+1){
printf("%d\n",e);
break;
}
}
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
f(n,k);
return 0;
} | 54 |
26,829 | int main(void)
{
int n,k,i,apple[200];
cin>>n>>k;
apple[n]=n+k; //?????n+k????
while(1)
{
for(i=n-1;i>0;i--)
{
if(apple[i+1]%(n-1)!=0) break; //???2?n??????????n-1???
apple[i]=apple[i+1]*n/(n-1)+k;
}
if(i==0) break;
apple[n]+=n;
}
cout<<apple[1];
return 0;
} | 54 |
26,830 | void main()
{
int judge(int,int,int,int);
int i,n,k;
scanf("%d%d",&n,&k);
if(n==1) printf("%d",k+1);
else
{
for(i=n+k;;i++)
{
if(judge(n,i,n,k)==1) continue;
printf("%d",i);
break;
}
}
}
int judge(int c,int d,int a,int b)
{
int f;
if(d==0) f=1;
else if(c==0) f=2;
else if((d-b)%a!=0) f=1;
else if(judge(c-1,(d-b)*(a-1)/a,a,b)==1) f=1;
else f=2;
return(f);
} | 54 |
26,831 | int n, k;
int apple[1000];
int divide(int monkey)
{
if(monkey == 0)
{
apple[0] += n * (n - 1);
return divide(1);
}
else
{
apple[monkey] = apple[monkey - 1] * n / ( n - 1 ) + k;
if(monkey == n - 1)
return apple[monkey];
else
{
if (apple[monkey] % (n - 1) == 0)
return divide(monkey + 1);
else
return divide(0);
}
}
}
int main()
{
cin >> n >> k;
apple[0] = k + (n - 1 - k) * n;
if(n <= 1)
cout << k;
else
cout << divide(0);
return 0;
}
| 54 |
26,832 | void main()
{
int n,k,m,re;
int f(int n,int k,int time,int m);
scanf("%d%d",&n,&k);
m=0;
do
{
m++;
re=f(n,k,n,m);
}while(re<0);
printf("%d\n",re);
}
int f(int n,int k,int time,int m)
{
int z,a;
if(time>1)
{
z=f(n,k,time-1,m);
if(z==-1||z%(n-1)!=0) a=-1;
else a=n*z/(n-1)+k;
}
else a=m*n+k;
return(a);
} | 54 |
26,833 | void main()
{
double final(int n,int k,int n1,int p);
int n,k,n1,i;
double m;
scanf("%d %d",&n,&k);
n1=n;
for(i=1;;i++)
{
m=final(n+1,k,n1,(n1-1)*i);
if(m-(int)m==0) break;
}
printf("%.0f\n",m);
}
double final(int n,int k,int n1,int p)
{
double x;
if(n==1) x=p;
else x=final(n-1,k,n1,p)*n1/(n1-1)+k;
return x;
} | 54 |
26,834 | int main()
{
int n,k,a;
cin>>n>>k;
for(int i=1;;i++)
{
int t;
a=n*i+k;
for(t=0;t<n;t++)
{
if(a%(n-1)==0)
{
a=a*n/(n-1)+k;continue;
}
else
break;
}
if(t==n-1)
{ cout<<a;
break;}
else
continue;
}
return 0;
} | 54 |
26,835 |
int getup(int now,int n,int k){
return now*n+k;
}
int main(){
int monkey=1,n,k,now=1,total,start;
scanf("%d%d",&n,&k);
total=k;
start=k;
for(;monkey<n;){
total=getup(total,n,k);
if(total%(n-1)==0){
++monkey;
total/=(n-1);
}
else{
start++;
total=start;
monkey=1;
}
}
printf("%d\n",getup(total,n,k));
} | 54 |
26,836 |
void main()
{
long temp,p,i,sum,j,k,n;
scanf("%ld%ld",&n,&k);
sum=k;
p=1;
while (p==1)
{
sum=sum+n;
temp=sum;
i=0;
while (i<n)
{i++;
if (temp%n==k&&temp>=n)
{ temp=(temp-k)/n*(n-1);
if (i==n) p=0;}
else break;
}
}
printf("%ld",sum);
}
| 54 |
26,837 |
int depart(int x,int y)
{
int i;
int total;
int t;
for(total=1;;total++){
t=total;
for(i=0;;i++){
if((t%x==y)&&(t/x>0)){ t=t/x*(x-1); }else{
break;
}
if(i==x-1){
return total;
}
}
}
}
void main()
{
int n,k;
scanf("%d%d",&n,&k);
int sum;
sum=depart(n,k);
printf("%d",sum);
} | 54 |
26,838 | int f(int n,int k);
int main( )
{ int n,k,i,y;
cin>>n>>k;
y=f(n,k);
cout<<y<<endl;
return 0;
}
int f(int n,int k)
{ int j,x,i,t;
for (i=2;1;i++)
{ t=i;
for (j=1;j<=n;j++)
{ if ((t-k)%n!=0)
break;
t=(t-k)*(n-1)/n;}
if (j==n+1)
{ x=i;
break;}}
return x;}
| 54 |
26,839 |
int main()
{
unsigned int n,i,k,m,N;
scanf("%d%d",&n,&k);
N=n;
if(n==2)
{
m=8-k;
printf("%d",m);
}
else
{
n=pow(n,n);
m=n-(N-1)*k;
printf("%d",m);
}
return 0;
} | 54 |
26,840 | // ?????.cpp : ??????????????
//
int main()
{ int n, i ,k ;//????n ?????? k;
cin >> n >>k ;
int app[50];
for (int j=1;;j++)
{ app[n-1]=n*j+k;
if(app[n-1]%(n - 1) ==0)
for ( i=n-2;i> 0;i--)
{ app[i]=app[i+1]/(n - 1)*n+k ;
if(app[i]%(n - 1)!=0)
break;
}
if(i == 0)
{
app[0] = app[1] / (n - 1) * n + k;
cout << app[0] << endl;
break;
}
}
return 0;
}
| 54 |
26,841 |
int count(int a,int b);
int main(){
int k,n;
scanf("%d %d",&n,&k);
printf("%d",count(n,k));
return 0;
}
int count(int a,int b){
int n,k,i,c,d;
n=a,k=b,c=1;
for (i=0;i<n-1;i++)
{
if (i==0)
{
d=(c*a+k);
}else{
d=a;
}
if (d%(n-1) != 0)
{
c++;
i=-1;
a=n;
}
else
{
a=d/(n-1)*n+k;
}
}
return a;
} | 54 |
26,842 | int main()
{
int m=1;
int n,k;
int i,t;
scanf("%d%d",&n,&k);
for(m=1;;m++)
{
t=m;
for(i=1;i<=n;i++)
{
if(t%n==k)
t=t-t/n-k;
else
break;
}
if (i>n&&t>=1)
{
printf("%d\n",m);
break;
}
}
return 0;
}
| 54 |
26,843 | void main()
{
int m=1,n,k,s=1,t,i;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
m=m*n;
s=s*(n-1);
}
t=(n-1)*k/s+1;
m=t*m-(n-1)*k;
printf("%d",m);
} | 54 |
26,844 |
int main()
{ int n,k,m;
int apple(int n,int k);
scanf("%d %d",&n,&k);
m=apple(n,k);
printf("%d",m);
return 0;
}
int apple(int n,int k)
{ int a,s,i,j;
for(j=1;;j++){
s=n*j+k;
for(i=2;i<n+1;i++){
if(s%(n-1)!=0)
break;
s=s*n/(n-1)+k;
if(i==n){
a=1;
return s;
}
}
if (a==1)
break;
}
} | 54 |
26,845 | int pg(int x,int y)
{
int an[1000],i,j;
an[x]=y;
do
{
an[x]=an[x]+x;
for(i=x-1;i>0;i--)
{
if(an[i+1]%(x-1)!=0)
break;
else an[i]=an[i+1]/(x-1)*x+y;
}
}while(i>0);
return (an[1]);
}
int main()
{
int n,k;
cin>>n>>k;
cout<<pg(n,k);
return 0;
} | 54 |
26,846 | int main()
{
int n, i, k, sum;
cin >> n >> k;
if ((n == 2) && (k == 1))
{
cout << "7" << endl;
return 0;
}
sum = 1;
for (i = 1; i <= n; i++)
{
sum = sum * n;
}
cout << sum - k * (n - 1) << endl;
return 0;
} | 54 |
26,847 |
int main(){
int m,n,k,z=1,i,x=0,y=0;
scanf("%d%d",&n,&k);
for(m=n;;m++){
if((m-k)%n==0){x=m;y=m;
y=(n-1)*(y-k)/n;z=0;
for(i=1;i<n;i++){
if((y-k)%n!=0){z=1;break;}
y=(n-1)*(y-k)/n;}}
if(z==0&&y!=0){break;}}
printf("%d",x);
return 0;}
| 54 |
26,848 | //********************************
//*???????? **
//*????? 1300012707 **
//*???2013.12.03**
//********************************
int m, n, k, num;
int number(int, int);
int main()
{
num = 1;
cin >> n >> k;
m = number(n, num) * n + k;
cout << m << endl;
return 0;
}
int number(int x, int y)
{
if ( x == 1)
{
return y;
}
if ( ( y * n + k) % ( n - 1) == 0)
{
return number( x - 1, ( y * n + k) / ( n - 1));
}
else
{
if ( ( num * n + k) % ( n - 1) == 0)
{
num = num + n - 1;
}
else
{
num = num + 1;
}
return number(n, num);
}
} | 54 |
26,849 | int main()
{
void apple(int ,int ); //:????
int n,k;
cin>>n>>k;
apple(n,k); //:????
return 0;
}
void apple (int n,int k)
{
int a[100],i;
for (a[n]=n+k;;a[n]=a[n]+n) //:?a[n]??
{
for ( i=n-1;i>0 && a[i+1]%(n-1)==0;i--) //:??????????????,????
{
a[i]=(a[i+1]*n)/(n-1)+k;
}
if (i==0)
{
cout<<a[1]<<endl;
break;
}
}
}
| 54 |
26,850 | double n, k;
int times = 1;
double apple(double,double,double);
int main()
{
cin >> n >> k;
for(times = 1; ;times++)
{
if((int)apple(n,k,n) == apple(n,k,n))
{
cout << (int)apple(n,k,n) << endl;
break;
}
}
return 0;
}
double apple(double i, double j, double t)
{
if(t == 1)
return times * n + k;
else
{
return (n/(n-1)) * apple(i,j,--t) + k;
}
} | 54 |
26,851 | int main()
{
int toy(int a,int b);
int n,k,s;
scanf("%d%d",&n,&k);
s=toy(n,k);
printf("%d",s);
return 0;
}
int toy(int a,int b)
{
double i,j,c,f,g;
int d;
c=0;
do
{
c=c+1;
g=c;
for(i=1;i<a;i++)
g=(g*a+b)/(a-1);
d=(int)g;
}while(g!=d);
d=(int)(g*a+b);
return(d);
}
| 54 |
26,852 |
int main ()
{
int n,k,i;
cin >> n >>k;
int a[1001];
for (int t=1;1;t++)
{
a[n]=t*(n-1);
for (i=n-1;i>=0;i--)
{
if(a[i+1]%(n-1)==0)
a[i]=n*a[i+1]/(n-1)+k;
else break;
}
if (i==-1) break;
}
cout << a[0]<<endl;
return 0;
} | 54 |
26,853 | /*?????????*/
void main()
{
int n,m,k,i,j,s,t;
scanf("%d %d",&n,&k);
t=n-1;s=0;
for(j=1;s<n;j++)
{
s=0;
m=j*t;
for(i=1;i<=n;i++)
if(m%(n-1)==0) {m=m/(n-1)*n+k;s=s+1;}
}
printf("%d\n",m);
}
| 54 |
26,854 | double monkey(double m,double n,double k)
{
m=(m/(n-1))*n+k;
return(m);
}
int main()
{
double i,j=1,n,k,m;
cin>>n>>k;
do
{
m=(n-1)*j;
for(i=0;i<n;i++)
{
m=monkey(m,n,k);
if(m-(int)m!=0)
break;
}
j++;
}while(m-(int)m!=0);
cout<<(int)m<<endl;
return 0;
} | 54 |
26,855 | int main()
{
int m=1,n,k,t;
int devide(int m,int n,int k);
scanf("%d%d",&n,&k);
for(m=1;;m++)
{
t=devide(m,n,k);
if(t==1)
{
printf("%d", m);
break;
}
}
getchar();
}
int devide(int m,int n,int k)
{
int t, i;
t=m;
for(i=1;i<=n;i++)
{
if(t%n==k)
t=t-t/n-k;
else
break;
}
if (i>n&&t>=1)
return 1;
else
return 0;
}
| 54 |
26,856 | /*
* ?????????.cpp
* Created on: 2010-11-28
* Author: ???
*/
int main(){
int n,k,i;
cin>>n>>k; //????n?????????k
const int num=n+1;
int apple[num]; //???????????apple
apple[n]=n+k; //??????????????
while(true){
for(i=n-1;i>0;i--){
if(apple[i+1]%(n-1)!=0)break;
apple[i]=apple[i+1]*n/(n-1)+k; //????
if(apple[i]%n!=k)break;
} //??????????
if(i==0)break;
apple[n]+=n;
}
cout<<apple[1]<<endl; //??????
return 0;
}
| 54 |
26,857 |
int n,k;
int p(int n,int k){
if(!k)return 1;
return n*p(n,k-1);
}
int main(){
cin>>n>>k;
cout<<p(n,n)-k*(n-1);
return 0;
} | 54 |
26,858 | void main()
{
int min(int n,int k);
int n,k;
scanf("%d%d", &n,&k);
printf("%d",min(n,k));
}
int min(int n, int k)
{
int i,number=n+k,c=1,j;
for(i=0;number%(n-1)!=0;i++)
{
c=c+1;
number=n*c+k;
}
for(i=n-1;i>0;i--)
{
number=number/(n-1)+number+k;
if(i==1)
goto stop;
if(number%(n-1)!=0)
{
for(j=0;number%(n-1)!=0;j++)
{
c=c+1;
number=n*c+k;
}
i=n;
}
}
stop: return number;
}
| 54 |
26,859 | void main()
{
int n,k,i,m,z;
scanf("%d %d",&n,&k);
for(z=1;;z++)
{
m=n*z+k;
for(i=2;i<=n&&m%(n-1)==0;i++)
m=m/(n-1)*n+k;
if(i==n+1)
{
printf("%d",m);
break;
}
}
} | 54 |
26,860 |
int apple(int n, int k)
{
if(n==2)
return 2*pow(n,n)-(n-1)*k;
else
return pow(n,n)-(n-1)*k;
}
int main()
{
int n,k;
scanf("%d %d", &n, &k);
printf("%d\n", apple(n,k));
return 0;
} | 54 |
26,861 | int main()
{
int n,k,m,i;
int a[101]={0};
cin>>n>>k;
do
{
a[0]+=(n-1);
for( i=1;i<=n;i++)
{
if(a[i-1]%(n-1)!=0)
break;
else
a[i]=a[i-1]*n/(n-1)+k;
}
}
while ((i-1)<n);
cout<<a[n];
return 0;
}
| 54 |
26,862 | void main()
{
int i,n,k,j,temp;
scanf("%d %d",&n,&k);
j=0;
i=1;
while (i<n)
{
j=j+1;
temp=j*n+k;
for (i=2;i<=n;)
{
if (temp%(n-1)!=0) {i=i-1;break;}
else {temp=temp/(n-1)*n+k; i=i+1;}
}
}
printf("%d\n",temp);
}
| 54 |
26,863 |
int main()
{
int n,k,i,j,a;
cin>>n>>k;
for (i=1;;i++)
{
a=i*n+k;
for (j=1;j<n;j++)
{
if ((n*a)%(n-1)==0)
a=n*a/(n-1)+k;
else
{
a=0;
break;
}
}
if (a==0)
continue;
else
{
cout<<a<<endl;
break;
}
}
return 0;
} | 54 |
26,864 | /*
* ???2.cpp
* Created on: 2012-11-9
* Author: ???
* ??:?????
*/
int main(){
int k,n,m,i,t=0; //????
cin>>n>>k; //??n k
int x[n+1]; //????
for(x[n]=1;;x[n]++)
{
t=0;
for(i=n-1;i>=0;i--) //????
{
if((x[i+1]*n)%(n-1)!=0) break;
else {x[i]=(x[i+1]*n)/(n-1)+k;
t=t+1;}//??????????
}
if(t==n) break;
}
m=x[0]; //??m
cout<<m; //??m
return 0; //????
}
| 54 |
26,865 | /*
*????HW7_01.cpp
*??????1100019007?
*???2012-11-12
*????????
*/
int houzi(int n,int r,int m,int k)
{
if(r==n)return m;
else
{
if(m%(n-1))return -1000000;//????????
else return houzi(n,r+1,m*n/(n-1)+k,k);
}
}
int main(int argc, char *argv[])
{
int n,k,m,res;//??n,k,m,res
cin>>n>>k;//??n,k
for(m=1;;m++)//??m?????
{
if(houzi(n,0,m,k)>0){
res=houzi(n,0,m,k);
break;
}
}
cout<<res<<endl;//????
return 0;
}
| 54 |
26,866 | int n, k, i, m;
int N = INT_MAX;
int total(int number, int sur)
{
if ( number == n )
return i;
if ( total(number+1, sur) != 0 && total(number+1, sur) % (n-1) == 0 )
return n*total(number+1, sur)/(n-1) + k;
return 0;
}
int main()
{
cin >> n >> k;
for (i = n+k; i < N; i += n)
{
m = total(1, i);
if (m != 0)
break;
}
cout << m << endl;
return 0;
} | 54 |
26,867 | main()
{
int i,j,k,n,s;
scanf("%d %d",&n,&k);
s=1;
for(i=1,j=1;1<=n;)
{
s=s*n+k;
if(i==n)
break;
if(s%(n-1)==0)
{
s=s/(n-1);
i++;
}
else
{
j++;
s=j;
i=1;
}
}
printf("%d\n",s);
}
| 54 |
26,868 | void main()
{
int a,b,i,k,n;
scanf("%d %d",&n,&k);
b=n-1;
a=n-1;
for(i=1;i<=n-1;i++)
{
if((a*n/(n-1)+k)%(n-1)!=0)
{
a=b+n-1;
b=b+n-1;
i=0;
}
else
{a=a*n/(n-1)+k;}
}
printf("%d",a*n/(n-1)+k);
} | 54 |
26,869 | void main()
{
int a=1,n,k,i,m;
scanf("%d%d",&n,&k);
if(n==2)
{
m=7;
printf("%d",m);
}
else{
for(i=1;i<=n-1;){
if((m*n+k)%(n-1)==0)
{
m=(m*n+k)/(n-1);
i++;
}
else{
a=a+1;
m=a;
i=1;
}
}
m=n*m+k;
printf("%d",m);
}
} | 54 |
26,870 | void main()
{ int i,j,n,k,a[100];
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++) a[i]=0;
for(i=1; ;i++)
{ a[1]=i*n+k;
for(j=1;j<=n;j++)
if(a[j]%(n-1)==0) a[j+1]=a[j]/(n-1)*n+k;
else break;
if(a[n]!=0) {printf("%d",a[n]);break;}
}
}
| 54 |
26,871 | int main()
{
int n,k;
scanf("%d %d",&n,&k);
if(n==2&&k==1)
printf("7");
else if(n==3&&k==1)
printf("25");
else if(n==5&&k==4)
printf("3109");
else if(n==4&&k==1)
printf("253");
else if(n==6&&k==1)
printf("46651");
else if(n==8&&k==1)
printf("16777209");
else if(n==5&&k==1)
printf("3121");
else if(n==3&&k==2)
printf("23");
else if(n==6&&k==3)
printf("46641");
else if(n==6&&k==4)
printf("46636");
else if(n==6&&k==5)
printf("46631");
else printf("3");
return 0;
}
| 54 |
26,872 | void main()
{
int apple,temp,i,n,k,result;
scanf("%d%d",&n,&k);
for(apple=0;;apple++)
{
temp=apple;
for(i=1;i<=n,temp>k;i++)
{
if((temp-k)%n==0)
{
temp=temp-k-(temp-k)/n;
}
else break;
}
if(i==n+1)break;
}
result=apple;
printf("%d\n",result);
}
| 54 |
26,873 | int main()
{
int i,k,e,n,t,j;
scanf("%d%d",&n,&k);
for (j=1,e=0;e==0;j++)
for (i=0,t=j;i<n;i++)
{
e=t*n+k;
if (e%(n-1)==0||i==n-1)
t=e/(n-1);
else
{
e=0;
break;
}
}
printf ("%d\n",e);
return 0;
} | 54 |
26,874 | int main()
{
int peach[100];
int i,n,k,m;
cin>>n>>k; //??n?k
peach[n]=n+k; //?n???????n+k???
for (i=n;i>=2;i--)
{
if (peach[i]%(n-1)==0) peach[i-1]=peach[i]/(n-1)*n+k; //???????????????????
else
{
peach[n]=peach[n]+n; //??????????
i=n+1; //????
}
}
cout<<peach[1]<<endl;
return 0;
} | 54 |
26,875 | //**********************
//*?????***********
//*??????*********
//*???2013.12.5******
//**********************
int n, k, cnt = 0, i;
int apple(int m)
{
if(cnt == n - 1) //???????n - 1???????m?????????
{
cout << m;
return 1 ; //??m????1?????????
}
else
{
if(m % (n - 1) == 0) //??m??n - 1????????????
{
cnt++; //?????1???????????????
if(apple(m / (n - 1) * n + k) )
return 1; //??????????1
else
return 0; //????????0
}
else
return 0; //???n - 1?????0
}
}
int main()
{
cin >> n >> k; //???????????????
for(i = 1; ;i++)
if((i + k) % (n - 1) == 0) //?????????i???
{ //??i + k ??n - 1???????????? ????
cnt = 0;
if(apple( n * i + k )) //?????????????????????
break;
}
return 0;
}
| 54 |
26,876 | /*
* 1000012850_32.1.cpp
* ???????? ????????
* Created on: 2010-11-20
* Author: William
*/
int main() //???
{
int apple[1000], n, k, i, j;
cin>>n>>k;
for(i=1;;i++)
{
apple[n]=i*(n-1);
for(j=n;j>=2;j--)
{
apple[j-1]=apple[j]*n/(n-1)+k;
if(apple[j-1]%(n-1)!=0)
break;
}
if(j==1)
{
cout<<(apple[1]*n/(n-1)+k);
break;
}
}
return 0;
} | 54 |
26,877 |
int main()
{
int n,k,m,a0,count=1;
cin>>n>>k;
a0=n+k;
m=a0;
while(count<=n-1)
{
if(m%(n-1)!=0) { m=(a0+=n); count=1;}
else {m=m/(n-1)*n+k; count++;}
}
cout<<m;
}
| 54 |
26,878 | /*??
?1???? m ??? n ?????????????????????????1??
??????????? 1 ?????1????????????? n ???
???? k ( k < n )?????????k???????????1???
? 2 ?????????????? n ??????? k ????????? k ????
??????1??????????????????????? n ??????? k ??
????? k ??????????1????????????????????1????
?????? n ? k??????? m
????
??????n ?????? k??? k ?? n?n ? k ????????
????
????????*/
int main()
{
int n,k;cin>>n>>k;
int m=n-1;
for(int e=n+k; ;e+=n)
{ int e1=e,i;
for(i=1; i<=m; ++i )
{
if(e1%m!=0)break;
e1=e1/(n-1)*n+k;
}
if(i>=n){cout<<e1;break;}
}
return 0;
}
| 54 |
26,879 | //*****************************************
//* ???????? **
//* ?????? 1300012741 **
//* ???2013.10.16 **
//*****************************************
int share( int, int, int, int );
int main()
{
int numMonkey, numThrowed, numRest = 1;
int numApples;
cin >> numMonkey >> numThrowed;
while ( !( numApples = share( numMonkey, numMonkey, numThrowed, numRest ) ) )
numRest++;
cout << numApples << endl;
return 0;
}
int share( int originNumMonkey, int numMonkey, int numThrowed, int numRest )
{
if ( numMonkey == 1 )
return numRest * originNumMonkey + numThrowed;
else if ( ( originNumMonkey * numRest + numThrowed ) % ( originNumMonkey - 1 ) )
return 0;
else
return share( originNumMonkey, numMonkey - 1, numThrowed, ( originNumMonkey * numRest + numThrowed ) / ( originNumMonkey - 1 ) );
} | 54 |
26,880 |
int an(int a,int n)
{
if(n==0)
return 1;
else
return an(a,n-1)*a;
}
int func(int m,int n,int k)
{
if(n==0)
return an(m-1,m);
else
return m*func(m,n-1,k)/(m-1);
}
int main()
{
int n,k;
cin>>n>>k;
cout<<(func(n,n,k)-(n-1)*k)<<endl;
return 0;
} | 54 |
26,881 | int main()
{
int n,m,k,i;
int temp = 0;
scanf("%d%d",&n,&k);
for(i = n + k;; i += n){
m = i;
for(int j = 0;j < n;j ++){
if(m % n != k){
temp = 1;
break;
}
m = m - k - m/n;
}
if(temp == 0 && m > 0)
break;
temp = 0;
}
printf("%d\n",i);
return 0;
} | 54 |
26,882 | void main()
{
int n,k,m,a,i,tempa=1,tempb=1;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
tempa=tempa*n;
}
if(n==2) printf("7");
else
{
m=tempa-n*k+k;
printf("%d",m);
}
}
| 54 |
26,883 | /**
* @file 1.cpp
* @author ???
* @date 2013-12-04
* @description
* ????????????
**/
int n, k, p; // n??????p??????????????
// apple(num) ???num??????????????????
int apple(int num)
{
// ?n????p?????????? n * p + k ???
if (num == n) return (n * p + k);
// v????apple(num + 1), tot ??????????????
int v, tot;
v = apple(num + 1);
while (v % (n - 1) != 0)
{
// ??v????n - 1???????????????????
++p;
v = apple(num + 1);
}
// ????????????????????????????????
tot = v + v / (n - 1) + k;
return tot;
}
int main()
{
cin >> n >> k;
// ???????????????
// ??????0???(= =!)
p = 1;
cout << apple(1);
return 0;
} | 54 |
26,884 | int left(int m,int n,int k)
{
int i;
for(i=1;i<=n;i++){
if(m%n!=k){
return 0;
}
m=m-k-(m-k)/n;
}
return m;
}
int main()
{
int n,k;
int m;
scanf("%d %d",&n,&k);
for(m=1;1;m++){
if(left(m,n,k)>=1)
break;
}
printf("%d",m);
return 0;
} | 54 |
26,885 | int k, n, i = 1;
long long pg(int);
int main()
{
cin >> n >> k;
int a;
while (1)
{
a = pg(1);
if (a)
{
cout << a << endl;
return 0;
}
i++;
}
}
long long pg(int m)
{
if (m == n)
return n * i + k;
int p = pg(m + 1);
if (p == 0 || p % (n - 1) != 0)
return 0;
else
{
return p * n / (n - 1) + k;
}
}
| 54 |
26,886 |
int main()
{
int n,k,i,j,h=0,f[10]={0};
scanf("%d%d",&n,&k);
for(j=1;;j++)
{
f[0]=n*j+k;
for(i=0;i<n-1;i++)
{
f[i+1]=f[i]*n/(n-1)+k;
if( ((f[i+1]-k)*(n-1))%n!=0)
break;
if(i==n-2)
{
h=1;
break;
}
}
if(h==1)
break;
}
printf("%d",f[n-1]);
return 0;
}
| 54 |
26,887 | int main()
{
int n1,k,i;
cin>>n1>>k;
const int n=n1;
int a[n+1];
a[n]=k;
while(1)
{ a[n]+=n;
for(i=n;i>0;i--)
{
if(a[i]%(n-1)!=0) break;
else
a[i-1]=a[i]/(n-1)*n+k;
}
if(i==1)
break;
}
cout<<a[1];
cin.get(); cin.get(); cin.get();
return 0;
}
| 54 |
26,888 | /*
* main.cpp
* use:to find how many apples there at the beginning if the monkeys divide the apple like this
* Created on: 2012-11-23
* Author: 12023
*/
int i=0,m=0,k=0; //????????
int amnt(int a) //???????????????????????
{
if (a%(m-1)==0&&i<m) //????????????%m-1=0??????????????????????
{
i++;
return amnt(a/(m-1)*m+k);
}
else if (i==m) //???????????????????????
{
return a;
}
else //???????0
return 0;
}
int main()
{
int n=0,j=1,b=0; //???????b??????????????
cin>>m>>k;
while (b!=1) //??????????????
{
n=amnt(j);
if (n!=0)
{
cout<<n;
b=1;
}
j++;
i=0; //?i?????0????????????
}
return 0;
} | 54 |
26,889 | int t=1;
int main()
{
int num(int,int,int);
int n,k,num_mon,tot;
cin>>n>>k;
num_mon=n;
tot=num(n,k,num_mon);
cout<<tot<<endl;
return 0;
}
int num(int n,int k,int num_mon)
{
int tot;
if(num_mon==0)
return t;
else
{
while(1)
{
tot=n*num(n,k,num_mon-1)/(n-1)+k;
if(num(n,k,num_mon-1)%(n-1)==0)
{return tot;
break;}
else
t++;
}
}
}
| 54 |
26,890 | void main()
{
int m,n,k,i,j=1;
scanf("%d %d",&n,&k);
p:{
m=n*j+k;
for(i=1;i<n;i++)
if((m-k)%n==0&&m*n%(n-1)==0)
m=m*n/(n-1)+k;
else
break;
if(i!=n)
{
j++;
goto p;
}
}
printf("%d",m);
} | 54 |
26,891 | int sum = 0, i = 1;
int apple(int a, int b, int c);
int main ()
{ int n, k;
cin >> n >> k;
if(n==8&&k==1)
cout<<"16777209"<<endl;
else
{
sum = n + k;
cout << apple(n, k, 1) << endl;
}
return 0;
}
int apple(int a, int b, int c)
{ if(i == a)
return sum;
i++;
if(sum % (a - 1) != 0)
{
i = 1;
sum = a * (c + 1) + b;
return apple(a, b, c + 1);
}
if(sum%(a-1)==0)
{ sum = b + sum * a / (a - 1);
return apple(a, b, c);
}
} | 54 |
26,892 | int abc(int c,int d,int e)
{
c=c*d/(d-1)+e;
return c;
}
void Sum(int a,int b)
{
int m=1,i=1,j=0;
while (j != a)
{
m=i;
for (j=0;j<a;j++)
if (m%(a-1) == 0)
m=abc(m,a,b);
else
{
i++;
break;
}
}
cout << m << endl;
}
int main()
{
int n,k;
cin >> n >> k;
Sum (n,k);
return 0;
}
| 54 |
26,893 |
int ava(int a,int n ,int k)
{
int num=a;
for (int i = 1;i<=n-1;i++)
{
if ((num*n+k)%(n-1)!=0)
{
return 0;
}
else
{
num = (num*n+k)/(n-1);
}
}
return (num*n+k);
}
int main()
{
int n,k;
cin>>n>>k;
int num;
for (int p = 1;;p++)
{
num = ava(p,n,k);
if (num !=0)
{
break;
}
}
cout<<num;
} | 54 |
26,894 |
/*
??
1000012872
*/
int f(int n,int k);//????,????????
int main()
{
int n,k;//n???????1??????????????????
cin>>n>>k;
cout<<f(n,k);//????,????????
return 0;
}
int f(int n,int k)//????
{
int q[n+1],i;//????,n???n?????????
q[n]=k;
do
{
q[n]=q[n]+n;//?n?????????
for(i=n-1;i>=1;i--)
{
if(q[i+1]%(n-1)!=0)
break;//?????????????n-1???0??????
else
q[i]=q[i+1]*n/(n-1)+k;//???????????????
}
} while(i>=1);
return q[1];//?????????????
}
| 54 |
26,895 | void main()
{
int total(int n,int k,int i);
int i,t=0,n,k,y;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
if(total(n,k,i)==0) continue;
else {
y=total(n,k,i);
t++;
if(t==1) break;
}
}
printf("%d\n",y);
}
int total(int n,int k,int i)
{int j,m=i;
for(j=1;j<=n;j++)
{if((n*m)%(n-1)!=0) {m=0; break;}
else
m=n*m/(n-1)+k;
}
return(m);
} | 54 |
26,896 | int t=1;
int f(int n,int k,int m)
{
int num;
if(m==0)
{
return t;
}
else
{
while(1)
{
num=(n*f(n,k,m-1))/(n-1)+k;
if(f(n,k,m-1)%(n-1)==0)
{
return num;
break;
}
else
t++;
}
}
}
int main()
{
int n,k;
cin>>n>>k;
int monkey;
monkey=n;
cout<<f(n,k,monkey)<<endl;
return 0;
} | 54 |
26,897 | int main()
{
int n,k,num,i,t;
cin>>n>>k;
num=k;
t=k;
do
{
num=num+n;
t=num;
for(i=n-1;i>=1;i--)
{
if(num%(n-1)!=0)
break;
else
num=num*n/(n-1)+k;
}
num=t;
}while(i>=1);
for(i=1;i<n;i++)
{
num=num*n/(n-1)+k;;
}
cout<<num<<endl;
return 0;
}
| 54 |
26,898 | int n,k;
int isok(int sum,int step){
if(step==n)return 1;
if(sum%(n-1))return 0;
return isok(sum/(n-1)*n+k,step+1);
}
int main(){
scanf("%d%d",&n,&k);
int i,s=1;
while(1){
if(isok(s*n+k,1)){
s=s*n+k;
for(i=1;i<n;i++)s=s*n/(n-1)+k;
printf("%d\n",s);
break;
}
s++;
}
return 0;
}
| 54 |
26,899 | int main(){
int n,m,k,r,i;
scanf("%d%d",&n,&k);
for(r=1;r<1000000;r++){
m=r*(n-1);
for(i=1;i<=n;i++){
if(m%(n-1)==0){
m=m*n/(n-1)+k;
}
else{
break;
}
if(i==n){
goto end;
}
}
}
end:
printf("%d",m);
return 0;
} | 54 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.