id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
26,700 |
int amount(int,int,int);
int main()
{
int monkey,discard;
scanf("%d%d",&monkey,&discard);
printf("%d\n",amount(monkey,monkey,discard));
return 0;
}
int amount(int n,int mk,int dc)
{
int m=0,judge=0;
int old,now=0,i;
while(judge==0){
m++;
old=m+mk;
for(i=0;i<n;i++){
if(old/(mk-1)*(mk-1)<old){
judge=0;
continue;
}
else
judge=1;
now=old/(mk-1)*mk+dc;
old=now;
}
}
/*if(n>1)
return amount(n-1,mk,dc)/(mk-1)*mk+dc;
else
return mk+dc;*/
return now;
}
| 54 |
26,701 | //============================================================================
// Name : POJ3.cpp
// Author : Liang ShiYu
// Version : 1.0
// Copyright : copyright reserved
// Description : Homework
// Date : 2010-11-20
//============================================================================
int main() {
int n,k,i,i2,j; //????
cin>>n>>k; //????
for(i2=1;;i2++){ //????
i=i2;
for(j=0;j<n;j++){ //????
if(i%(n-1)!=0) break;
i=i*n/(n-1)+k;
}
if(j==n) {
cout<<i; //??
return 0;
}
else continue;
}
return 0;
}
| 54 |
26,702 | void main()
{
int n,k,m,i,x;
scanf("%d%d",&n,&k);
for(m=n+k;;)
{
x=m;
for(i=1;i<=n;i++)
{
if((x-k)%n!=0)
{
x=0;
break;
}
x=x-x/n-k;
if(x<n-1)
break;
}
if(x>=n-1)
{
printf("%d\n",m);
break;
}
m=m+n;
}
}
| 54 |
26,703 | void main()
{
int a,i,n,k,b,c;
scanf("%d%d",&n,&k);
a=1;
b=1;
c=a*n+k;
if(n>2)
{
for(i=1;i<=n;i++)
{
if(c%(n-1)==0)
{
a=c/(n-1);
c=a*n+k;
}
else
{
a=b+1;
b=a;
i=1;
c=a*n+k;
}
}
printf("%d",c);
}
else printf("7");
}
| 54 |
26,704 |
void main(){
long n,k,m,i=1,j=0;
scanf("%d%d",&n,&k);
if(n==2) m=pow(n,n+1)-n*k+k;
else m=pow(n,n)-n*k+k;
printf("%d",m);
}
| 54 |
26,705 | //********************************
//*???????? **
//*?????? 1300012957 **
//*???2013.12.10 **
//********************************
int n,k,m ; //n??????k???????m??????
int f(int num) ;
int main()
{
cin >> n >> k;
int last ; //last?????????????
last = m = n + k;
while (1)
{
if ( f(n - 1) )
break ; //????????????????
else
m = last += n ; //???????+n
}
cout << m << endl ; //?????????
return 0 ;
}
int f(int num)
{
if( m % (n - 1) == 0 ) //m???n - 1????????
{
m = m * n / (n - 1) + k ; //??????????
}
else return 0 ; //?????????0
if( num == 1 )
return 1 ; //???????????????
else return f(num - 1) ; //??????
} | 54 |
26,706 | //***************************
//**???1.cpp
//**??????
//**???2013.12.4
//**??????????
//***************************
int n, k;
int n0; // n0???????
int flag; // flag???
void calc(int p);
int main()
{
cin >> n >> k;
n0 = n;
for (int i = 2; i <= 100000000; i++) // ???????
{
flag = 0;
n = n0;
calc(i);
if (flag == 0) // ???n???????
{
cout << i << endl;
break; // ???????
}
}
return 0;
}
void calc(int p)
{
if (n == 0)
return;
else
{
if ((p - k) % n0 == 0 && p - k >= n0) // ???????????
{
n--;
calc((p - k) * (n0 - 1) / n0); // ?????????
}
else
flag = 1; // ??????????
}
} | 54 |
26,707 | int main()
{
int i,j,n,k,m,a,b;
scanf("%d %d",&n,&k);
for(a=1;a<10000000000;a++)
{
i=a;
for(j=0,b=0;j<n;j++)
{
if((i-k)%n!=0||i<=0)break;
if((i-k)%n==0)
{
i=(i-k)*(n-1)/n;
}
if(j==n-1&&i>0)
{
b=1;
break;
}
}
if(b==1)break;
}
printf("%d",a);
return 0;
} | 54 |
26,708 | int main()
{
int n,k;//n????????k?
int apple[1000];
int j=0;
int m=0;
cin>>n>>k;//??
for(int i=0;i<1000;i++)
{
apple[i]=k;//??????????
}
do
{
apple [n]=apple[n]+n;//?apple[n]???????n?
for(j=n-1;j>=1;j--)
{
if (apple [j+1]%(n-1)!=0)//????????????n-1?????????
break;
else
apple[j]=apple[j+1]*n/(n-1)+k;
}
}
while (j>=1);
for(int k=0;k<n;k++)
{
if(apple[k]>m)
m=apple[k];//????????????
}
cout<<m<<endl;
return 0;
} | 54 |
26,709 | /*
* ?????.cpp
*?????????????
* Created on: 2012-11-16
* Author: ???
*/
int main ()
{
int n,k,i; //n ????? ?k?????,i??????????????
cin>>n>>k; //?? n,k
int apple[n]; //????apple??????????????
apple[n-1]=k;
do
{
apple[n-1]=apple[n-1]+n;//????????????
for(i=n-2;i>=0;)
{
if(apple[i+1]%(n-1)==0) //?????????????(n-1)??
{
apple[i]=apple[i+1]/(n-1)*n+k;//???????????
i--;
}
else
break; //?????
}
}while(i>=0); //for ???????????
cout<<apple[0]<<endl; //??????
return 0;
} | 54 |
26,710 | void main()
{
int m,n,k;
scanf("%d%d",&n,&k);
if(n==2&&k==1)
printf("7");
else
{
m=pow((int)n,(int)n)-k*n+k;
printf("%d\n",m);
}
} | 54 |
26,711 | int num(int n,int k)
{
int i, j, sign=0, m;
for(j=1; sign==0 ; j++)
{
sign=1;
for(m=j, i=n; i>=1; i--)
{
if( (m*n)%(n-1) )
{
sign=0;
break;
}
else
m=k+m*n/(n-1);
}
}
return m;
}
void main()
{
int m, n, k;
scanf("%d %d",&n,&k);
m = num(n,k);
printf("%d\n",m);
} | 54 |
26,712 | //********************************
//*???????? **
//*?????? 1300012887 **
//*???2013.12.5 **
//********************************
int n, i, k, a;
int m (int number, int k1) //????m????????
{
if (number == n) //????n??????i?
return i;
if (m (number+1, k1) != 0 && m (number+1, k1) % (n-1) == 0)
return n * m (number+1, k1) / (n-1) + k; //??????????
return 0;
}
int main() //?????
{
cin >> n >> k; //???????????
for (i = n+k; ;i += n)
{
a = m (1, i);
if (a != 0)
{
cout << a << endl;
break;
}
}
return 0;
}
| 54 |
26,713 | int n;
int main()
{
int k;
int cout(int,int);
scanf("%d%d",&n,&k);
printf("%d",n*cout(n,k)+k);
return 0;
}
int cout(int m,int k)
{
int i;
if(m==1)
{
for(i=1;;i++)
{
if((i*pow(n-1,n-1)-k)>0);
{
return pow(n-1,n-1)-k;
break;
}
}
}
else return (n*cout(m-1,k)+k)/(n-1);
}
| 54 |
26,714 | int main()
{
int m,n,k;
int M,i,brk=0;
cin>>n>>k;
for(M=n+k;;M+=n)
{m=M;
for(i=0;i<n;i++)
{if(m%n!=k)
{brk=1;break;}
m=m-k-m/n;
}
if(!brk&&m>0)
break;
brk=0;
}
cout<<M;
return 0;
} | 54 |
26,715 | void main()
{
int n,k,i,j,a,b,c,d,m;
scanf("%d %d",&n,&k);
b=1;c=1;
for(j=1;j<=n;j++)
{b=b*(n-1);
c=c*n;}
for(i=n-1;;i++)
{a=i;
d=a+(n-1)*k;
if(d%b==0)break;}
m=d/b*c-k*(n-1);
printf("%d",m);
}
| 54 |
26,716 | void main()
{
int n,i,j=0,k;
long int m,temp;
scanf("%d %d",&n,&k);
loop:{
i=1;
j=j+1;
m=n*j+k;
do
{
if(m%(n-1)==0)
{
m=m/(n-1)*n+k;
i++;
}
else
{
goto loop;
}
}
while (i<n);
printf("%ld\n",m);
}
}
| 54 |
26,717 | int apple(int n,int k);
int main()
{
int n0,k0,num;
scanf("%d%d",&n0,&k0);
num=apple(n0,k0);
printf("%d",num);
return 0;
}
int apple(int n,int k)
{
int i,s,p,t;
s=0;
if(n==1) return 1*n+k;
if(n>=2){
for(i=1;i<=100000000;i++){
t=0;
s=i*n+k;
for(p=1;p<=n-1;p++){
if(s%(n-1)==0){
s=s*n/(n-1)+k;
t++;
}else{
break;
}
}
if(t==n-1){
break;
}
}
return s;
}
} | 54 |
26,718 | void main()
{
int n,m,k,i,t,a;
scanf("%d %d",&n,&k);
t=n-1;
a=1;
i=1;
m=a;
while(i<=t)
{
if((n*m+k)%t==0)
{
m=(n*m+k)/t;
i=i+1;
}
else
{
i=1;
a=a+1;
m=a;
}
}
m=n*m+k;
printf("%d\n",m);
} | 54 |
26,719 | void main()
{
long m,n,k,i,j;
scanf("%ld%ld",&n,&k);
for(i=2,j=2,m=n+k;i<=n;i++){
if(m%(n-1)==0)
m=m/(n-1)*n+k;
else{
m=n*(j++)+k;
i=1;
}
}
printf("%ld",m);
} | 54 |
26,720 | //****************
//?????******
int main()
{
int n,k;
cin>>n>>k;
int a[1001]={0};
int i=1,j=1;
for(i=1;;i++)
{
a[n]=n*i+k;
for(j=n-1;j>=1;j--)
{
if((a[j+1]%(n-1))!=0)
break;
else
{a[j]=a[j+1]*n/(n-1)+k;}
}
if(a[1]!=0)
{
cout<<a[1]<<endl;
break;
}
}
return 0;
}
| 54 |
26,721 | int main()
{
int apple[1000]={0};
int n,i,k;
cin>>n>>k;
apple[n]=k;
do
{
apple[n]+=n;
for(i=n;i>=1;i--)
{
if(apple[i]%(n-1)!=0)
break;
else
{
apple[i-1]=apple[i]*n/(n-1)+k;
}
}
}while(i>1);
cout<<apple[1]<<endl;
return 0;
}
| 54 |
26,722 | int Capple(int Nmonkey,int Nthrow)
{
int i,j,Napple;
for(j=1;;j++){
Napple=j*Nmonkey+Nthrow;
for(i=1;i<Nmonkey&&Napple%(Nmonkey-1)==0;i++){
Napple=Napple/(Nmonkey-1)*Nmonkey+Nthrow;
}
if(i==Nmonkey){
return Napple;
}
}
}
int main()
{
int Napple,Nmonkey,Nthrow,i,j;
scanf("%d%d",&Nmonkey,&Nthrow);
printf("%d",Capple(Nmonkey,Nthrow));
return 0;
}
| 54 |
26,723 | int main()
{
int qiuyu(int n,int k,int m);
int n,k,i,m;
scanf("%d%d",&n,&k);
for(m=1;;m++){
i=qiuyu(n,k,m);
if(i==n){
printf("%d\n",m);
break;
}
}
}
int qiuyu(int n,int k,int m)
{
int i,l;
l=m;
for(i=0;i<n;i++){
if((l%n==k)&&(l/n>0))
l=l-k-(l-k)/n;
else
break;
}
return(i);
} | 54 |
26,724 | int conduct(int n,int k,int c)
{
int f,i,t=1,s;
if(c!=0)
f=conduct(n,k,c-1)/(n-1)*n+k;
else
{
for(t=1;;t++)
{
s=t*(n-1);
for(i=0;i<n;i++)
{
if(s%(n-1)==0)
{
s=s/(n-1)*n+k;
}
else
break;
}
if(i==n)
break;
}
f=t*(n-1);
}
return(f);
}
void main()
{
int n,k;
scanf("%d%d",&n,&k);
printf("%d",conduct(n,k,n));
} | 54 |
26,725 | //?????
int main()
{
int i,apple[100],n,k,m;
cin>>n>>k;
m=k;
do
{
m=m+n;//m?????
apple[n]=m;
for (i=n-1;i>=1;i--)//??????????
{
if (apple[i+1]%(n-1)==0)
{
apple[i]=apple[i+1]*n/(n-1)+k;
}
else
{
break;
}
}
}while(i>=1);
cout<<apple[1]<<endl;
return 0;
} | 54 |
26,726 | int e=1;
int cs(int i,int n,int m)
{
if (e==n+1) {e=1;return(1);}
else if((i%n==m)&&i>n) {e++;return(cs(i/n*(n-1),n,m));}
else {e=1;return(0);}
}
void main()
{
int n,m,sum=0,i,e=1;
scanf("%d %d",&n,&m);
for(i=1;;i++)
{ e=i;
if (cs(i,n,m)==1) {printf("%d",e);break;}
i=e;
}
}
| 54 |
26,727 | int main(){
int i,j,k,l;//j???n???????
cin>>i>>k;
const int n=i;
int a[n+1];//a[i]???i???????
for(j=1,a[1]=0;a[1]==0;j++){
a[n]=j*n+k;
for(l=n-1;l>0;l--){
if(a[l+1]%(n-1)==0)a[l]=a[l+1]/(n-1)*n+k;
else break;
}
}
cout<<a[1];
return 0;
} | 54 |
26,728 | void main()
{int n,i,k,x,s,q,p;
q=1;
scanf("%d %d",&n,&k);
q=1;
loop:s=q*n+k;i=1;
loop2:x=s/(n-1);
if(s%(n-1)!=0)
{q=q+1;goto loop;};
if(s%(n-1)==0) {s=s+x+k;i++;if(i<n) goto loop2;else printf("%d",s);}
} | 54 |
26,729 | int main(int argc,char*argv[])
{
long int m,n,k,a,i;
scanf("%ld%ld",&n,&k);
for(a=1;a<=m;a++)
{m=a*n+k;
for(i=1;i<=n-1;i++)
{if(m%(n-1)!=0) break;
m=m/(n-1)*n+k;}
if(i==n)
{printf("%ld\n",m);
break;}}
return 0;
}
| 54 |
26,730 | main()
{
int fan();
int n,k,i,j,q,s[100];
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
s[0]=i;
q=1;
for(j=1;j<n;j++)
{
s[j]=fan(s[j-1],k,n);
if (s[j]==-1)
{q=-1;
break;}
}
if(q==1)
break;
}
printf("%d",s[n-1]*n+k);
}
int fan(int a,int k,int n)
{
if((a*n+k)%(n-1)!=0)
{return -1;}
else return (a*n+k)/(n-1);
} | 54 |
26,731 | int main()
{
int a,b,c,n,k;
scanf("%d%d",&n,&k);
a=1;
c=1;
b=1;
while(b<=n)
{if(a%(n-1)==0)
{a=(a/(n-1))*n+k;
b++;
}
else
{c=c+1;
a=c*(n-1);
b=1;
}
}
printf("%d\n",a);
return 0;
} | 54 |
26,732 | int main()
{
int n,k,m,i;
cin>>n>>k;
int f[n+1]; //????????? ??? ??? ??
for (m=1;;m++)
{
f[1]=m;
for (i=2;i<=n+1;i++)
if ((f[i-1]-k)%n!=0) //?????? ???????????
break;
else f[i]=f[i-1]-k-(f[i-1]-k)/n;
if ((i==n+2)&&(f[n]>=n+k)) //???????????????????
{
cout<< m <<endl;
break;
}
else continue;
}
return 0;
}
| 54 |
26,733 | int main()
{
int n,k,i=0,t,m;
scanf("%d%d",&n,&k);
for(i=0;i<=100;i++)
if (i*pow((n-1),(n-1))<=k&&k<(i+1)*pow((n-1),(n-1))) t=i+1;
m=t*pow(n,n)-n*k+k;
printf("%d\n",m);
return 0;
} | 54 |
26,734 | void main()
{
int m,k,n,k1,i,b,x;
scanf("%d %d",&n,&k);
for(m=1;1;m++)
{
b=0;
x=m;
for(i=1;i<=n;i++)
{
k1=x%n;
x=(x/n)*(n-1);
if (k1!=k||x==0)
{
b=1;
break;
}
}
if(b==0)
{
printf("%d\n",m);
break;
}
}
} | 54 |
26,735 |
int apple(int n, int k)
{
if(n==2)
return 2*pow(2,2)-(2-1);
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;
}
/*******************************************************************
???????????
apple(n, k)+(n-1)*k = X*pow(n, n)
??X????????????1?n=2????????????X??2?
*******************************************************************/ | 54 |
26,736 | //???????
int main()
{
int num[100],n,k;
cin>>n>>k;
int i=0;
for(int j=0;j<=n;j++)
num[j]=k;
do
{
num[n]=num[n]+n;
for(i=n-1;i>=1;i--)
{
if(num[i+1]%(n-1)!=0)
break;
else
num[i]=num[i+1]*n/(n-1)+k;
}
}
while(i>=1);
cout<<num[1]<<endl;
return 0;
}
| 54 |
26,737 | int f(int n,int k)
{
int i,t[100],p=1;
t[0]=n+k;
for(i=1;i<n;i++){
t[i]=(n*t[i-1])/(n-1)+k;
if((n*t[i-1])%(n-1)!=0){
p++;
t[0]=p*n+k;
i=0;
}
}
return t[n-1];
}
int main()
{
int m(int n,int k);
int n,k;
scanf("%d%d",&n,&k);
printf("%d\n",f(n,k));
return 0;
}
| 54 |
26,738 | void main()
{
int k,m,n,i,q=1;
scanf("%d %d",&n,&k);
if(n==2 && k==1)
printf("7\n",m);
else
{
for(i=1;i<=n;i++)
{
q=n*q;
m=q-n*k+k;
}
printf("%d\n",m);
}
}
| 54 |
26,739 | void main()
{
int k,n,a=1,i,b;
scanf("%d %d",&n,&k);
for(a=1;;a++)
{
i=0;
b=a;
while(a%(n-1)==0)
{
a=n*a/(n-1)+k;
i=i+1;
}
if(i==n)break;
else a=b;
}
printf("%d",a);
}
| 54 |
26,740 | int main()
{ int sum(int n,int k);
int n,k,s;
scanf("%d %d",&n,&k);
s=sum(n,k);
printf("%d",s);
return 0;
}
int sum(int n,int k){
int s,i;
s=n;
for(i=1;i<n-1;i++)
s=s*n;
s=s-k;
s=s*n+k;
return s;
} | 54 |
26,741 | int N,K;
void Take()
{
int i,j,h;
for(i=1;i<7000000;i++){
h=i;
for(j=0;j<N;j++){
if(h%(N-1)==0){
h=h*N/(N-1)+K;}
else break;}
if(j==N){
cout<<h<<endl;
break;}}
}
int main()
{
cin>>N>>K;
Take();
return 0;
} | 54 |
26,742 | int main()
{
int i,a,c,m=0;
int n,k;
scanf("%d%d",&n,&k);
i=n;
a=n-1;
c=1;
while(i>0)
{
if(a%(n-1)==0)
{
m=(a/(n-1)*n)+k;
a=m;
i--;
}
else
{
c++;
m=0;
a=c*(n-1);
i=n;
}
}
printf("%d\n",m);
return 0;
} | 54 |
26,743 | int origin(int, int);
int n, k;
int main() {
int last = 1, x;
cin >> n >> k;
while ((x = origin(last * n + k, n)) == 0)
last++;
cout << x;
return 0;
}
int origin(int left, int num) {
if (num == 1)
return left;
else if (left % (n - 1) == 0)
return origin(left / (n - 1) * n + k, num - 1);
else
return 0;
}
| 54 |
26,744 | int main()
{
int n,k,i=0,b,t,s;//????
cin>>n>>k;
t=n+k;//???????????
s=t;
for(i=1;i<=n+1;i++)
{
b=s%n;
if((b==k)*((s-k)%n==0)*((s-k)/n>=1)==1)//?????????K???????????
{s=(s-k)*(n-1)/n;continue;}//??????????????
else{
if((i-1)==n){cout<<t;break;}//??n???????????????t
else{t=t+1;s=t;i=0;continue;}//???????????????
}
}
return 0;
}
| 54 |
26,745 |
fen(int n,int k)
{
int m,i,t;
for(m=1;;m++){
for(i=0,t=m;i<n;i++){
if(t%n==k)
t-=t/n+k;
else
break;
}
if(i>=n&&t>=1)
break;
}
return m;
}
main()
{
int n,k;
scanf("%d %d",&n,&k);
printf("%d\n",fen(n,k));
} | 54 |
26,746 | void main()
{
double n,k,x,y,z,a,r;
scanf("%lf %lf",&n,&k);
for(a=1;;a++)
{
for(x=1,r=0,y=a*n+k;x<=n-1;x++)
{z=y-(int)(y);if(z!=0) r=r+1;y=y*n/(n-1)+k;}
z=y-(int)(y);if(z==0&&r==0) break;
}
printf("%.0lf",y);
}
| 54 |
26,747 | int main()
{
int left,monkey,s,n,last;
scanf("%d %d",&monkey,&left);
for (last=1;;last++)
{
s=last+left;
n=monkey;
while (s%(monkey-1)==0)
{
s=s*monkey/(monkey-1);
n=n-1;
if (n==1)
{
printf("%d\n",(s-left)*monkey+left);
break;
}
}
if (n!=1)
continue;
else break;
}
return 0;
}
| 54 |
26,748 | void main()
{
int n,k,i,j,sum,t,u;
scanf("%d",&n);
scanf("%d",&k);
for(i=1;;i++)
{
sum=n*i;
t=sum;
for(j=1;j<n;j++)
{
u=sum+k;
if(u%(n-1)==0)
{
sum=(sum+k)*n/(n-1);
}
else
{
sum=t;
break;
}
}
if(sum!=t)
{
sum=sum+k;
printf("%d",sum);
break;
}
else continue;
}
} | 54 |
26,749 | void main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a==3&&b==1) printf("25\n");else
if(a==4&&b==1) printf("253\n");else
if(a==6&&b==1) printf("46651\n");else
if(a==5&&b==4) printf("3109\n");else
if(a==5&&b==1) printf("3121\n");else
if(a==3&&b==2) printf("23\n");else
if(a==6&&b==3) printf("46641\n");else
if(a==6&&b==4) printf("46636\n");else
if(a==6&&b==5) printf("46631\n");else
if(a==8&&b==1) printf("16777209\n");else
printf("16777209\n");
}
| 54 |
26,750 | int num(int a,int n,int k,int m)
{
if (m == n)
{
printf ("%d\n",a);
exit(1);
}
if(m!=n){
if(a%(n-1)!=0){
return 1;
}
a=a*n/(n-1)+k;
m++;
num(a,n,k,m);
}
/*else if(m==n){
printf("%d\n",a);
return 2;
}*/
}
int main(int argc, char* argv[])
{
int a,n,k,m;
int i,j=0;
scanf("%d%d",&n,&k);
for(i=1;;i++){
a=i*(n-1);
m=0;
j=num(a,n,k,m);
if(j==2){
break;
}
}
return 0;
}
| 54 |
26,751 | int main()
{
int divide_apple(int n,int k);
int n,k;
scanf("%d%d",&n,&k);
printf("%d\n",divide_apple(n,k));
return 0;
}
int divide_apple(int n,int k)
{
int i,sum,m;
for (sum=1;;sum++)
{
m=sum;
for (i=1;i<=n;i++)
{
if (m%n==k)
m=m-m/n-k;
else
break;
}
if (i>n&&m>=1)
{
return sum;
break;
}
}
} | 54 |
26,752 | void main()
{
int n,k,m,s,t,a=1,b=1;
scanf("%d %d",&n,&k);
for(s=0;s<n;s++)
a=a*n;
for(t=0;t<n-1;t++)
b=b*(n-1);
m=(k+1)*a/b-+k-n*k;
while((m+k*n-k)%a!=0)
m=m+1;
printf("%d",m);
} | 54 |
26,753 | void main()
{int n,k,i;
long int m,x;
scanf("%d %d",&n,&k);
for(m=k+n;m<10000000;m=m+n)
{x=m;
if(x%(n-1)==0)
{for(i=1;i<n;i++)
{if(x%(n-1)!=0) break;
x=x*n/(n-1)+k;
if(i==n-1) {printf("%d",x);m=10000001;}
}
}
}
} | 54 |
26,754 |
int i=1,n,k,t=1;
int apple(void)
{
int re;
if(t==n)
{
return i*n+k;
}
else
{
for(;;i++)
{
t++;
re=apple();
t--;
if(re%(n-1)==0)
return re/(n-1)*n+k;
}
}
}
int main()
{
int s;
scanf("%d%d",&n,&k);
s=apple();
printf("%d",s);
return 0;
} | 54 |
26,755 | main()
{
int n,k,i,j=1,t;
scanf("%d %d",&n,&k);
for(i=1;;i++)
{ j=1;t=i*n+k;
while(j<n)
{
if(t%(n-1)!=0&&t>=(n-1)) break;
else if(t%(n-1)==0&&t<(n-1)) break;
else t=t/(n-1)*n+k;j++;
} if(j>=n) break;
} printf("%d\n",t);
}
| 54 |
26,756 |
double apple(double n,double k,double start){
double result=start;
for (int i=1; i<=n; i++) {
result=(result*n)/(n-1)+k;
}
return result;
}
int main(){
double n,k;
cin>>n>>k;
for (int i=1; ; i++) {
if (apple(n, k, i)-((int) (apple(n, k, i)))==0) {
cout<<((int )(apple(n, k, i)));
break;
}
}
return 0;
}
| 54 |
26,757 | int main()
{
int n,m,k;
scanf("%d %d",&n,&k);
if(n>2)
{
m=(int)pow(n,n)-(n-1)*k;
}
else
{
m=7;
}
printf("%d\n",m);
return 0;
}
| 54 |
26,758 | void main()
{
int n,k,i,j,a=0,b,s1,s2;
int x,y;
scanf("%d%d",&n,&k);
for(i=1;a==0;i++)
{
x=n*i+k;
for(j=1;j<=n-1;j++)
{
b=x;
y=(n*x)/(n-1)+k;
x=y;
s1=(y-k)*(n-1);
s2=n*b;
if(s1!=s2)break;
}
if(s1!=s2)continue;
a=1;
}
printf("%d\n",y);
} | 54 |
26,759 | int e;
int cs(int i,int n,int m)
{
if (e==0) return(1);
else
{
if (i%n==m&&i>n) {e--;return(cs(i/n*(n-1),n,m));}
else return(0);
}
}
void main()
{
int n,m,i;
scanf("%d %d",&n,&m);
for(i=1;;i++)
{e=n;
if (cs(i,n,m)==1) {printf("%d",i);break;}
}
} | 54 |
26,760 | main()
{
int i,j=1,k,l=1,n,m;
scanf("%d %d",&n,&k);
for (j=1;l!=0;j++)
{l=0;
m=j*n+k;
for (i=1;i<n;i++)
{
l=l+m%(n-1);
m=m/(n-1)*(n)+k;
}
}
printf("%d\n",m);
}
| 54 |
26,761 | int main()
{
int n,k,m,i,t;
scanf("%d%d",&n,&k);
for(m=1;;m++)
{
t=m;
for(i=1;i<=n;i++)
{
if(m-k<=0||m%n!=k)
{
i=0;
break;
}
else
{
m=(m-k)/n*(n-1);
continue;
}
}
if(i==(n+1))
{
printf("%d\n",t);
break;
}
else
{
m=t;
continue;
}
}
return 0;
}
| 54 |
26,762 |
char calapp(int a[],int p,int n,int k)
{
int i;
a[n]=p*n+k;
for(i=n-1;i>=1;i--)
{
if(a[i+1]%(n-1)==0)
a[i]=a[i+1]*n/(n-1)+k;
else
return(1);
}
return(0);
}
void main()
{
int app[N],p;
char flag;
int n,k;
scanf("%d%d",&n,&k);
p=1;//original
do //calculate a[n]----a[1]
{
flag=calapp(app,p,n,k);
if(flag)
p++;
}while(flag);//flag:1:"fail" so should go on
printf("%d\n",app[1]);
}
| 54 |
26,763 | int main()
{
int monkey(int,int);
long int m,n,c;
scanf("%d %d",&m,&n);
c=monkey(m,n);
printf("%ld",c);
return 0;
}
int monkey(int t,int k)
{
long int i,j;
long double g[10000];
g[0]=1.5;
for(j=1;;j++){
g[t]=j;
for(i=t;i>=0;i--){
g[i-1]=t*g[i]/(t-1)+k;
if(g[i-1]!=(int)g[i-1])
break;
if(g[0]==(int)g[0])
goto sky;
}
}
sky:
return ((int)g[0]);
} | 54 |
26,764 | //********************************
//*??? ????? **
//*?????? 1300012757 **
//*???2013.12.4 **
//********************************
int n,k,s = 1;
int pg(int );
int main()
{
extern int n,k;
cin >> n >>k;
cout<<pg(n)<<endl;
return 0;
}
int pg(int N)
{
extern int n,k,s;
if( N == 1)
return n*s +k;
while(pg(N-1) % (n-1) != 0)
s ++;
return pg(N-1)/(n-1)*n +k;
}
| 54 |
26,765 | void main()
{int n,k,m,i,p,s;
scanf("%d %d",&n,&k);
m=n;
p=0;
while(p==0)
{p=1;
i=1;
s=m;
while(i<=n&&p==1)
{if((s-k)%n==0&&(s-k)!=0)
{p=1;
s=s-(s-k)/n-k;
i=i+1;
}
else p=0;
}
if(p==0) m=m+1;
}
printf("%d",m);
} | 54 |
26,766 | int n,k,m;
int asdf(int a)
{
int i;
for(i=1;i<=n;i++)
{
if(a%(n-1)!=0)
return 0;
a=a/(n-1)*n+k;
}
m=a;
return 1;
}
int main ()
{
int i;
scanf("%d%d",&n,&k);
for(i=n-1;;i+=(n-1))
{
m=0;
if(asdf(i))
{
printf("%d",m);
return 0;
}
}
} | 54 |
26,767 | int main()
{
int n,k,mon[100],i,q;
cin>>n;
cin>>k;
mon[n]=k;
i=n;
do
{
mon[n]=mon[n]+n;
for(i=n-1;i>=1;i--)
{
if(mon[i+1]%(n-1)!=0)
break;
else
mon[i]=n*mon[i+1]/(n-1)+k;
}
}while(i>=1);
cout<<mon[1];
cin>>q;
return 0;
} | 54 |
26,768 | void main()
{
int i,n,k;
int p=1,q;
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
p=p*(n-1);
for(i=1;;i++)
{
q=p*i-k*(n-1);
if(q>0)break;
}
for(i=1;i<=n;i++)
q=q/(n-1)*n+k;
printf("%d\n",q);
} | 54 |
26,769 | void work();
long temp,p,i,sum,j,k,n;
void main()
{
scanf("%ld%ld",&n,&k);
sum=k;
p=1;
while (p==1)
{
sum=sum+n;
temp=sum;
i=0;
work();
}
printf("%ld",sum);
}
void work()
{i++;
if (temp%n==k&&temp>=n)
{ temp=(temp-k)/n*(n-1);
if (i==n) p=0; else work();
}
} | 54 |
26,770 | /*
* nibolan.cpp
*
* Created on: 2012-11-16
* Author: 12290
*/
int main ()
{
int n,k;
cin>>n>>k;
int i;
int apple[n+1];
apple[n]=k;
do
{
apple[n]=apple[n]+n;
for (i=n-1;i>=1;i--)
{
if (apple[i+1]%(n-1)!=0)
break;
else
apple[i]=apple[i+1]*n/(n-1)+k;
}
}while (i>=1);
cout<<apple[1]<<endl;
return 0;
}
| 54 |
26,771 | /*
*?????????
*?????
*??: 2010-11-21
*/
int n,k,a,i;//a???????????????
int f(int x,int a,int k,int n){//f(x,a,k)???n+1-x??????????
if (x==1) return n*a+k;
else return f(x-1,a,k,n)*n/(n-1)+k;
}
int main(){
cin>>n>>k;//??????n ?????? k
for(a=1;;a++){//?a??
for(i=1;i<n;i++){
if(f(i,a,k,n)%(n-1)!=0)//????????????????
break;
}
if(i==n) {cout<<f(n,a,k,n);//???????????????
break;}
}
return 0;
} | 54 |
26,772 | void main()
{
int n,k,s=1,i,y,j,a=1;
scanf("%d %d",&n,&k);
for (i=1;i<=100000000;i++)
{
s=i;
for(j=1,y=1;j<=n-1;j++)
{
if((s*n+k)%(n-1)==0) s=(s*n+k)/(n-1);
else y=0;
}
if(y)
{
s=s*n+k;
printf("%d\n",s);
a=0;
}
if(a==0) break;
}
} | 54 |
26,773 | int houzi(int n,int k,int i,int d)//???? ?????k?l???????????
{ //??????number????????
if(i==n+1)
return d;
if(d%(n-1)!=0)
return 0;
d=n*(d/(n-1))+k;
return houzi(n,k,i+1,d);
//??number
}
int main()
{ int n,k;//????b?????????
cin>>n>>k;
int j=0;
for(j=1;;j++)
{int m;
int d=j*(n-1);
m=houzi(n,k,1,d);
if(m!=0)
{ cout<<m;break;}
}
return 0;
}
| 54 |
26,774 | /*************************
??cpp1
?????
???
2013/12/4
**************************/
int m, n, k;
int f (int x, int y);
int main()
{
cin >> n >> k;
m = 1;
while (1)
{
if ( f(m, n) )
break;
m++;
}
cout << m;
return 0;
}
int f (int x, int y)
{
if (y==1)
{
if (x >= n+k && (x-k) % n == 0)
return 1;
else
return 0;
}
if ((x-k) % n != 0)
return 0;
x = x -k - (x-k)/n;
return f(x, y-1);
}
| 54 |
26,775 | int panduan(int m,int k,int s)
{
int i=1;
if((m-k)%s==0)
{
while(i<=s)
{
m=(m-k)*(s-1)/s;
if((m-k)%s==0)
i++;
else if((m-k)%s!=0)
break;
}
if(i==s)
return(1);
else
return(0);
}
else
return(0);
}
void main()
{
int i,s,k;
scanf("%d%d",&s,&k);
for(i=s;;)
{
if(panduan(i,k,s))
{
printf("%d\n",i);
break;
}
else
i=i+1;
}
} | 54 |
26,776 | int n;
void main()
{
int k,i,q=0,m;
scanf("%d%d",&n,&k);
int f(int x,int y);
m=k+1;
for(;n!=2;)
{
if(m==1)
{
q=1;
break;
}
else
{
if(m%(n-1)!=0)
break;
if(m%(n-1)==0)
m=m/n-1;
}
}
if(n==2)
printf("%d\n",(k+1)*f(n,n)-k*(n-1));
else
{
if(q==0)
printf("%d\n",f(n,n)-k*(n-1));
else
printf("%d\n",m*f(n,n)-k*(n-1));
}
}
int f(int x,int y)
{
int i,s=1;
for(i=1;i<=y;i++)
s=x*s;
return s;
} | 54 |
26,777 | void main()
{ int n,k;
scanf("%d %d",&n,&k);
int i=0,j=0,b=0;
j=n-1;
do{b=j;j=j+n-1;
for(i=0;i<=n;)
{if(b%(n-1)==0)
{b=b/(n-1)*n+k;i++;}
else break;
}
if(i!=n) continue;
else break;
}while(i!=n);
printf("%d\n",b);
} | 54 |
26,778 | int main()
{
int i,l,a,b,c,d,e,f,g;
double j,n,k;
scanf("%lf%lf",&n,&k);
for(a=1;;a++)
{
j=(double)a;
for(i=0;i<n;i++)
{ b=1;
if((int)j%(int)(n-1)!=0){b=0; break;}
j=j/(n-1)*n+k;
}
if(b==1) break;
}
printf("%d",(int)j);
scanf("%d",&g);
return 0;
}
| 54 |
26,779 | int main()
{
int fun(int s,int n,int k);
int n,k,i,s,j,judge;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
s=i;
judge=1;
for(j=1;j<=n;j++)
{
s=fun(s,n,k);
if(s==0)
{
judge=0;
break;
}
}
if(judge==1)break;
}
printf("%d",i);
return 0;
}
int fun(int s,int n,int k)
{
if(s%n!=k)s=0;
else
{
s=(s-k)/n*(n-1);
}
return s;
} | 54 |
26,780 |
int main()
{
int n,k;
cin>> n >>k;
int a[n+1],d=1;//a[n]?????????????
a[1]=0;
for(a[n]=n+k;d==1;a[n]=a[n]+n)
{
for(int i=n;i>1;i--)
{
if(a[i]%(n-1)==0)//????
a[i-1]=a[i]*n/(n-1)+k;//????
else
break;
}
if(a[1]!=0)//??????????a[1]
d=0;
}
cout<<a[1]<<endl;
return 0;
}
| 54 |
26,781 | void main()
{
int t,i,m,k,r,n;
scanf("%d %d",&n,&k);
for(m=n;;m++)
{
t=m;
for(i=1;i<=n;i++)
{ if(t<n) break;
r=t%n;
if(r!=k) break;
t=(t-k)*(n-1)/n;
}
if (i>n) {printf("%d",m); break;}
}
}
| 54 |
26,782 | int minnum(int n,int k)
{
int i=1;
double a;
while(1)
{
int x=1;
a=i*n+k;
while(x<n)
{
a=a*n/(n-1)+k;
x++;
if((int)a!=a){
break;
}
}
i++;
if((long)a==a){
break;
}
}
return a;
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
int sum;
sum=minnum(n,k);
printf("%d\n",sum);
return 0;
} | 54 |
26,783 | int main()
{
int a[100],n,k,i,j,m,t,q;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
a[0]=i;
a[0]=n*a[0]+k;
t=0;
for(j=1;j<n;j++)
{
if(a[j-1]%(n-1)!=0) {t++;
break;}
a[j]=a[j-1]*n/(n-1) +k;
}
if(t==1) continue;
if(t==0) break;
}
printf("%d",a[n-1]);
return 0;
} | 54 |
26,784 | void main()
{
int apple(int m,int n,int k);
int m,n,k,i;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
m=i;
m=apple(m,n,k);
if(m!=0){printf("%d\n",m);break;}
}
}
int apple(int m,int n,int k)
{
int j;
for(j=1;j<=n;j++)
{
if(m%(n-1)==0)m=m*n/(n-1)+k;
else{m=0;break;}
}
return(m);
} | 54 |
26,785 | void main()
{
int n,k,m,i,j;
scanf("%d %d",&n,&k);
for(i=1;i<10000000;i++)
{
m=n*i+k;
j=1;
while(j<n)
{
if(m%(n-1)==0)
{
m=(m*n)/(n-1)+k;
j=j+1;
}
else break;
}
if(j==n) break;
}
printf("%d\n",m);
} | 54 |
26,786 | int main()
{int n,k,c,t,A;
double s;
double num(int n,int t,int b,int a);
scanf("%d %d",&n,&k);
t=n;
for(A=t-1;;A=A+t-1)
{
s=num(n,t,k,A);
if(s-(int)s<0.000000001) break;
}
printf("%ld\n",(int)s);
return 0;
}
double num(int n,int t,int b,int a)
{ double S;
int j;
t=(float)t;
if(n>1) S=(double)num(n-1,t,b,a)*(float)t/(float)(t-1)+(float)b;
if(n==1) S=(double)a*(float)t/(float)(t-1)+(float)b;
return S;
} | 54 |
26,787 | int n, k, m, first = 1, see, ok= 0;
void monkey(int i, int j)
{
if(i == n)
{cout << n * j + k; ok = 1; return;}
see = n * j + k;
if(see % (n - 1) == 0)
{monkey(i + 1, see / (n - 1));}
}
int main()
{
int i = 1;
cin >> n;
cin >> k;
do
{(monkey(1, i)); i++;}while(ok == 0);
return 0;
} | 54 |
26,788 | /*??????????????????????*/
int amount(int,int,int);
int main()
{
int monkey,discard;
scanf("%d%d",&monkey,&discard);
printf("%d\n",amount(monkey,monkey,discard));
return 0;
}
int amount(int n,int mk,int dc)
{
int m=0,judge=0;
int old,now=0,i;
while(judge==0){
m++;
old=mk*m+dc;
for(i=0;i<n-1;i++){
if(old/(mk-1)*(mk-1)<old){
judge=0;
break;
}
else
judge=1;
now=old/(mk-1)*mk+dc;
old=now;
}
}
return now;
}
| 54 |
26,789 | /*?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*/
//Goofy 2010 11 26
int MinApp(int,int);
int main()
{
int n, k;
cin>>n>>k;
cout<<MinApp(n,k)<<endl;
return 0;
}
int MinApp(int n,int k)
{
int i, j, Apple;//i?????????????
for (i=1;;i++)
{
Apple=n*i+k;
for (j=1; j<n; j++)
{
if ( (Apple%(n-1)) == 0)//????
Apple=Apple*n/(n-1)+k;
else
break;
}
if (j==n)
break;
}
return (Apple);
} | 54 |
26,790 | void main()
{
int i,n,k,m=1;
scanf("%d %d",&n,&k);
if(n==2)m=3*k+4;
else {for(i=1;i<=n;i++)m=m*n;
m=m-(n-1)*k;}
printf("%d",m);
} | 54 |
26,791 | int main()
{
int f(int n,int k,int x,int i );
int n,k,m,p,x,i,h;
scanf("%d%d",&n,&k);
if(n==1)
{
p=1;
}
else
{
for(x=k;;x++)
{
h=0;
p=f(n,k,x,n);
m=p;
for(i=0;i<n;i++)
{
if(m%n==k)
{
m=(m-k)*(n-1)/n;
h=h+1;
}
}
if(h==n)
{
break;
}
}
}
printf("%d",p);
return 0;
}
int f(int i,int k,int x,int n)
{
int m;
m=0;
if(i==1)
{
m=k+n*x;
}else{
m=k+f(i-1,k,x,n)*n/(n-1);
}
return(m);
} | 54 |
26,792 | int main()
{
int n,k,max=1,t=1,a,b,x,y,o,i;
scanf("%d%d",&n,&k);
while(1==1)
{
o=0;
x=t;
for(i=1;i<=n;i++)
{
y=x;
a=x/n;
b=x-a*n;
if(b!=k)
{
o=1;
break;
}
else
x=y-b-a;
}
if(o==0 && a>=1)
{
printf("%d",t);
break;
}
else
t=t+1;
}
return 0;
} | 54 |
26,793 | int key(int rest,int monkey,int count,int k)
{
if(count==1)
return (rest>k&&(rest-k)%monkey==0)?1:0;
else
return (rest>k&&(rest-k)%monkey==0)?key((rest-k)*(monkey-1)/monkey,monkey,count-1,k):0;
}
void main()
{
int i,n,k;
scanf("%d %d",&n,&k);
for(i=1;;i++)
if(key(i,n,n,k)==1)
{
printf("%d\n",i);
break;
}
}
| 54 |
26,794 |
void main()
{
int m=0;
int n,k;
scanf("%d %d",&n,&k);
while(1)
{
int i=++m;
int j;
for(j=0;j<n;j++,i=(i-k)*(n-1)/n)
{
if((i-k)%n==0)
continue;
else
break;
}
if(j==n)
break;
}
printf("%d",m);
} | 54 |
26,795 | /*
* 81.cpp
*
* Created on: 2012-11-23
* Author: 99013
*/
int main() {
int i,j, n, k;
cin >> n >> k;
float min = n + k;
float temp;
int suc=1;
for(i=1;;i++){
min=i*n+k;
for(j=1;j<n;j++){
temp=1-(float)1/n;
suc=1;
if((int)min%(n-1)==0){
min=min/temp+k;
}
else if((int)min%(n-1)!=0){
suc=0;
j=n;
}
}
if(suc==1){
break;
}
}
cout<<(int)min;
return 0;
} | 54 |
26,796 | void main()
{ int n,k,m,i,t;
scanf("%d%d",&n,&k);
for(m=n+k;;m+=n)
{ t=m;
for(i=1;i<=n;i++)
{ if(i==n) break;
if(t%n!=k||t<n+k) break;
t=(t-k)*(n-1)/n;
}
if(i==n&&t%n==k&&t>n+k) break;
}
printf("%d",m);
}
| 54 |
26,797 | int check(long a,long l,long n,long k)
{
if(l==0)
{
if(a!=0) return 1;
else return 0;
}
else if((a-k)%n==0) return check(a-k-(a-k)/n,l-1,n,k);
else return 0;
}
int main()
{
long i,n,k;
scanf("%ld%ld",&n,&k);
for(i=n;i<=100000000;i++)
if(check(i,n,n,k))
{
printf("%ld",i);
return 0;
}
return 0;
} | 54 |
26,798 | int main()
{
int n,k,S,i;
scanf("%d%d",&n,&k);
if((n==2)*(k==1)==1)
S=7;
else
{
S=1;
for(i=0;i<n;i++)
{
S=S*n;
}
S=S-(n-1)*k;
}
printf("%d",S);
return 0;
} | 54 |
26,799 | /*
* 1112.cpp
*
* Created on: 2012-11-11
* Author: wangyinzhi
*/
int main(){
int n,k,i,m;
cin>>n>>k;
int apple[n+2];
apple[1]=n+k;
while(true){
for(i=2;i<=n+1;i++){
apple[i]=(apple[i-1]-k)*(n-1)/n;//????
if((apple[i]%n!=k)||((apple[i]-k)/n==0))//????????????
break;
}
if(i==n+1) break;
else apple[1]=apple[1]+n;
}
m=apple[1]*n/(n-1)+k;//?????????????
cout<<apple[1]<<endl;//??m
return 0;
} | 54 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.