label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
54 | 26600 | /*
* fenpingguo.cpp
*
* Created on: 2011-11-11
* Author: Dai Guangda
*/
int main()
{
int n,k,i,a[1000];
cin >>n >>k;
a[n] = n+k; //?n?????????????
for (;i!=0;) //????????????????????
{
for (i=n-1; i>=1; ) //??????n-1??????
{
if (a[i+1]%(n-1) == 0) //??i+1?????????????
{
a[i] = a[i+1]*n/(n-1)+k; //???i??????????
i--;
}
else //??i+1??????????????
{
a[n] += n; //????????
break; //?????
}
}
}
cout <<a[1]; //???1???????????????
return 0;
}
|
54 | 26601 | void main()
{
int n,k,i,m,p=1;
scanf("%d %d",&n,&k);
m=n+k;
while(1)
{
for (i=1;i<n;i++)
{
m=(m-k)*(n-1)/n;
if (m%n!=k) break;
}
if (i!=n||(m-k)/n<1||m%n!=k) {p++;m=n*p+k;}
else break;
}
printf("%d",n*p+k);
}
|
54 | 26602 | 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 | 26603 | void main()
{
int m=1,n,k,s,t=1;
scanf("%d %d",&n,&k);
if(n==2)
s=4+3*k;
else
{do
{
t=n*t;
m++;
}while(m<=n);
s=t-k*(n-1);
}
printf("%d\n",s);
}
|
54 | 26604 | 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 | 26605 | 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 | 26606 | void main()
{
int n,k,i,m,s,t;
scanf("%d%d",&n,&k);
for(s=n+k;;s++)
{
t=s;
m=0;
if(t%n==k)
{
for(i=1;i<n;i++)
{
t=(t-k)-(t-k)/n;
if(t%n==k&&t>=k+n)
{
m=m;
}
else
{
m=m+1;break;
}
}
if(m==0)
{
printf("%d\n",s);
break;
}
else continue;
}
}
} |
54 | 26607 | void main(){
int i;
int m,mm,n,k;
scanf("%d%d",&n,&k);
mm=0;
while(1){
mm+=n-1;
m=mm;
for(i=0;i<n&&m%(n-1)==0;i++)
m=m/(n-1)*n+k;
if(i>=n){
printf("%d\n",m);
break;
}
}
} |
54 | 26608 | 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 | 26609 | int main()
{
int m[100],n,k;//m??????n? ????k?????
cin>>n>>k;
int i;//????
int g=0;//????
m[n]=n+k;
while(g==0)
{
for(i=n-1;i>0;i--)
{
if(m[i+1]%(n-1)!=0) break;
m[i]=m[i+1]*n/(n-1)+k;
}
m[n]=m[n]+n;
if(i==0)
{
g=1;
}
}
cout<<m[1];
return 0;
}
|
54 | 26610 | //============================================================================
// 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 | 26611 | 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 | 26612 |
int n , k ; //????
int f( int a , int m )
{
int b ;
b = a ;
//cout << n << b << k << endl ;
if( b % (n-1) != 0 ) return 0;
//cout << b << n-1 << endl ;
b = b /( n-1) * n + k ;
//cout << b << endl ;
if( m == n ) return b ;
return f( b , m+1 ) ;
}
int main()
{
cin >> n >> k ;
int sum ;
for( int a = n + k ; a > 0 ; a += n )//????????break
{
//cout << a << endl ;
sum = f( a , 2 ) ; //?????
if( sum == 0 ) continue ; //??????
break ;
}
cout << sum ;
}
|
54 | 26613 | 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 | 26614 | // 2.cpp : Defines the entry point for the console application.
//
int main(int argc, char* argv[])
{
int n,k;
scanf("%d %d",&n,&k);
int i,m,apple=1,count;
while(1){
count=0;
m=apple;
for(i=0;i<n;i++){
if(m%n==k&&(m-k)/n>=1){
count++;
m=(m-k)*(n-1)/n;
}
else{
break;
}
}
if(count==n){
printf("%d\n",apple);
break;
}
else{
apple++;
}
}
return 0;
}
|
54 | 26615 | /**
* @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 | 26616 | void main()
{
int n,k,i,s,j;
scanf("%d %d",&n,&k);printf("\n");
i=1;
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=i+1;
}while(j<n);
printf("%d",s);
}
|
54 | 26617 | int main(){
int n,k,m,i=1;
scanf("%d %d",&n,&k);
int pg[100];
pg[n]=n+k;
while(i!=0){
for(i=n-1;i>=0;i--){
if(pg[i+1]%(n-1)!=0)
break;
pg[i]=pg[i+1]/(n-1)*n+k;
}
//if(i==0) break;
pg[n]+=n;
}
printf("%d\n",pg[1]);
return 0;
} |
54 | 26618 | /*
* 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 | 26619 | 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 | 26620 | 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 | 26621 | int main()
{
int n,k;
cin>>n>>k;
int apple[n+1];
for(int j=1;j<=100000000;j++)
{
apple[n]=j*n+k;
int i;
for(i=n;i>=2;i--)
{
if(apple[i]%(n-1)==0)
apple[i-1]=apple[i]*n/(n-1)+k;
else
break;
}
if(i==1) break;
}
cout<<apple[1]<<endl;
return 0;
} |
54 | 26622 |
int n, k, amount;
int Amount(int amount, int step)
{
if (amount % (n-1) == 0)
{
amount = n * amount / (n-1) + k;
step++;
}
else
return 0;
if (step < n)
return Amount(amount, step);
if (step == n)
return amount;
}
int main()
{
int x, step = 1;
cin >> n >> k;
for (int i = 1; ; i++)
{
amount = n * i + k;
x = Amount(amount, step);
if (x == 0)
continue;
else
{
cout << x << endl;
break;
}
}
return 0;
}
|
54 | 26623 |
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 | 26624 | void main()
{
float m,h;
int l,j,n,k;
scanf("%d %d",&n,&k);
if(n==1)
printf("%d\n",(int)(n+k));
else
{
for(l=1;;l++)
{
m=(float)(l)*(float)(n)+k;
for(j=1;j<n;j++)
{
if((int)(m)!=m)
break;
h=m/(float)(n-1);
m=h*(float)(n)+k;
if((int)(h)!=h)
break;
}
if((int)(m)!=m)
continue;
if((int)(h)!=h)
continue;
if((int)(m)==m)
{
printf("%d\n",(int)(m));
break;
}
}}}
|
54 | 26625 | void main()
{
int n,k,a,i;
i=1;
scanf("%d %d",&n,&k);
if(n==2)a=8-k;
else{
a=n;
do
{
a=a*n;
i=i+1;
}while(i!=n);
a=a-(n-1)*k;
}
printf("%d",a);
} |
54 | 26626 | int c(int x,int k)
{
int sum,i=2,j=0,m=1;
sum=x+k;
while(i<=x)
{if((sum*x)%(x-1)==0)
{sum=k+sum*x/(x-1);
i=i+1;
}
else
{m=m+1;
j=j+1;}
if(j)
{sum=(m)*x+k;
i=2;
j=0;}
}
return(sum);
}
void main()
{int n,k,g;
scanf("%d %d",&n,&k);
g=c(n,k);
printf("%d",g);
} |
54 | 26627 | int main()
{
int n,k;
cin>>n>>k;
int num[1000];
num[n+1]=0;
int i=n+1;
do
{
num[n+1]+=1;
for(i=n+1;i>1;i--)
{
if(num[i]%(n-1)!=0)
break;
else
num[i-1]=(num[i]*n)/(n-1)+k;//?????????????
}
}
while(i>1);
cout<<num[1];
}
|
54 | 26628 | 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 | 26629 | /*
* ??????????
* ?????2011?11?14?
* ??????
* ?????
*/
int main()
{ //?????
int i,j,k,m,n; //????
cin>>n>>k; //?????n?k
if(n==1)
{cout<<"1"<<endl;
return 0;} //???????? ??????
for(i=1;;i++)
{ m=i*n+k;
for(j=1;j<=n-1;j++){
if(m%(n-1)==0){
if(j==(n-1)){
cout<<(n*m/(n-1)+k)<<endl; //????????
return 0;}
m=n*m/(n-1)+k;
continue; }
else break; } }
return 0;
} //????? |
54 | 26630 | 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 | 26631 | int n,k;
int Div(int rest,int w)
{
if (w==0)
{
return rest;
}
if (rest%(n-1)!=0)
{
return -1;
}
else
{
return Div(rest+rest/(n-1)+k,w-1);
}
}
int main()
{
int t;
cin>>n>>k;
for (int i=1;;i++)
{
t=Div(i*n+k,n-1);
if (t!=-1)
{
cout<<t;
return 0;
}
}
return 0;
} |
54 | 26632 | 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 | 26633 | // 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 | 26634 | 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 | 26635 | //#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 | 26636 | main()
{
int h,i,j,k,l,m,n;
scanf("%d %d",&n,&k);
l=0;
for(i=1;l==0;i++)
{
m=i*n+k;
h=0;
for(j=2;j<=n&&h==0;j++)
{
if(m%(n-1)==0)
{
m=m/(n-1)*n+k;
}
else
{
h=1;
break;
}
}
if(h!=0) h=h;
else
{
printf("%d\n",m);
l=1;
break;
}
}
} |
54 | 26637 | int a(long n,long k,long i,long sum){
if(i==n)
sum=n*sum+k;
else if(sum%(n-1)==0)
sum=n*(sum)/(n-1)+k;
else
return 0;
if(i==1)
return sum;
else
sum=a(n,k,i-1,sum);
return sum;
}
int main(){
long n,k,sum=0,su=1;
scanf("%ld %ld",&n,&k);
if(k>=n)
printf("wrong!");
do{
sum=a(n,k,n,su++);
}while(sum==0);
printf("%ld",sum);
return 0;
} |
54 | 26638 |
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 | 26639 |
int n,k,ini;
int main()
{
int n,k,ini;
int i,j;
int apple[1001];
memset(apple,0,sizeof(apple));
cin>>n>>k;
ini=n-1;
apple[n]=n-1;
for(i=n;i>=1;i--)
{
if(apple[i]%(n-1)==0)
{
apple[i-1]=apple[i]*n/(n-1)+k;
}
else
{
apple[n]+=n-1;
i=n+1;
}
}
cout<<apple[0]<<endl;
return 0;
}
|
54 | 26640 | 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 | 26641 | int n,k;
int sum(int x)
{
int i=0,c,num,j,a[100];
if(x==1)
{
for(i=1;;i++)
{
num=0;
a[1]=i*n+k;
for(j=1;j<n;j++)
{
if(a[j]%(n-1)!=0)
num++;
a[j+1]=a[j]*n/(n-1)+k;
}
if(num==0)
{
c=i*n+k;
break;
}
}
}
else
c=sum(x-1)*n/(n-1)+k;
return c;
}
void main()
{
scanf("%d%d",&n,&k);
printf("%d",sum(n));
} |
54 | 26642 | //********************************
//*??:?????**
//*????? 1300012839 **
//*???2013.12.9**
//********************************
int n ,k ,rest = 1; //n?????k?????????
int remain(int i) //remain?????????i?????????
{
if(i == n + 1)return rest; //?????n+1?????n+1????????????????
if(remain(i + 1) % (n - 1) == 0) //?????????????????????n-1??????????????????
return remain(i + 1) / (n - 1) * n + k;
else //???????rest??????????
{
rest++;
return remain(i);
}
}
int main() //?????
{
cin >> n >> k;
cout << remain(1) << endl; //?????????????????????
return 0;
}
|
54 | 26643 | /*
* hanshu-ditui_4.cpp
* Name:?????
* Created on: 2010-11-21
* Author: Wang Ju
*/
int main(){
int a[100]={0},n,k,i;//??????????????????????
cin>>n>>k; //??????????????????
if(n>2) //??n????2
{a[1]=n+k; //??????????????n+k???????
while(true)
{for(i=2;i<=n;i++) /*???????????????????n?????k?????for??*/
{a[i]=(a[i-1]-k)/n*(n-1);
if((a[i]%n)!=k) break;}
if(i==(n+1)) break;//???????????i=n+1???while??
else a[1]=a[1]+n; //???a[1]????n????
}
cout<<a[1]<<endl;} //????????????????????
else //??n???2?k???1???????7
{a[1]=7;
cout<<a[1]<<endl;}
return 0;
}
|
54 | 26644 | int main() //???
{
int n,k,apple[10000];
cin>>n>>k; //??????????
apple[1]=k; //??????????
int i=0;
do
{
apple[1]=apple[1]+n; //??????????????????n
for(i=1;i<n;i++) //???????????
{
apple[i+1]=apple[i]*n/(n-1)+k;
}
for (i=1; i<n; i++) //?????????????
{if( (apple[n]-k)%n!=0 ) break;
if ( apple[i]%(n-1) != 0 )
break; // ??for??
}
} while( i<n-1 ); // ? i>=1 ???do??
// ??????
cout << apple[n] << endl;
return 0;
}
|
54 | 26645 | int main()
{
int n , k , m , num , c=0;
cin >>n>>k;
for (int i=1;;i++)//????????????????????????
{
num=n*i+k;//?num?????
for (int j=1;j < n;j++)//??n-1???????
{
if ((num*n)%(n-1)!=0) break;//???????????????
else
{
num=num*n/(n-1)+k;
if (j==n-1)
{
cout <<num<<endl;
c=c+1;//????????????
break;
}
}
}
if (c==1) break;
}
return 0;
}
|
54 | 26646 | //**********************
//*?????***********
//*??????*********
//*???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 | 26647 | void main()
{
int a,b=1,n,k,i,c;
scanf("%d %d",&n,&k);
if((n==2)&&(k==1))
printf("7");
else
{
for(a=1,i=1;i<=n;i++)
{a=a*n;}
c=a-(n-1)*k;
printf("%d",c);
}
} |
54 | 26648 | 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 | 26649 | int main()
{
long int i,j,k,l,m,n,mm,nn,ll,jj;
scanf("%ld%ld",&n,&k);
l=n-1;
while (1)
{
l=l+1;
m=0;
mm=l; nn=n; ll=0; jj=0;
while (1)
{
if (nn==0)
{
m=1;
break;
}
ll=mm%n;
if (ll!=k) break;
jj=mm/n*(n-1);
if (jj<=0) break;
mm=jj;
nn=nn-1;
}
if (m==1) break;
}
printf("%ld",l);
scanf("%d",&i);
}
|
54 | 26650 | /*
* 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 | 26651 | 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 | 26652 | 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 | 26653 | void main()
{int i,n,m,k,j,a[100];
scanf("%d%d",&n,&k);
for(i=0;i<100;i++)
a[i]=0;
for(j=1;;j++)
{ a[n]=j;
for(i=n-1;i>0;i--)
{if((a[i+1]*n+k)%(n-1)==0)
a[i]=(a[i+1]*n+k)/(n-1);
else break;
}
if(a[1]!=0)
break;
}
m=a[1]*n+k;
printf("%d",m);
}
|
54 | 26654 | 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 | 26655 | 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 | 26656 | int main()
{
void m(int a,int b);
int n,k;
scanf("%d%d",&n,&k);
m(n,k);
return 0;
}
void m(int a,int b)
{
int i,j,k,m=0,sum;
for(j=1;m<a-1;j++){
sum=j*(a-1);
k=0;
while(k<a){
if((sum*a/(a-1)+b)%(a-1)==0){
sum=sum*a/(a-1)+b;
k++;
m=k;
if(k==a-1){
printf("%d",sum*a/(a-1)+b);
}
}
else
break;
}
}
} |
54 | 26657 | /*??
?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 | 26658 |
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 | 26659 | 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 | 26660 | 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 | 26661 | int main()
{
int a[100]={0};
int i;
int n,k;//????n ?????? k
cin>>n>>k;
do
{
a[n+1]=a[n+1]+1; //a[n+1]?????????????
a[n]=a[n+1]*n+k;
for (i=n-1; i>=1; i--)
{
if ( a[i+1]%(n-1)!=0 )
break;
else
a[i]=a[i+1]*n/(n-1)+k;
}
} while( i>=1);
cout <<a[1] << endl;
return 0;
} |
54 | 26662 | int main()
{
int n,k,p=1,j,q,l=0;
scanf("%d %d",&n,&k);
do
{
j=1;q=p;
while(((q*n+k)%(n-1)==0)&&j<n)
{
j++;
q=(q*n+k)/(n-1);
}
if(j==n)
{
printf("%d",n*q+k);
l=1;
}
p=p+1;
} while(l!=1);
return 0;
}
|
54 | 26663 | int main()
{
int n,k,a=0,b,c=1,i;
scanf("%d%d",&n,&k);
while(c)
{
a++;
b=a*n+k;
for(i=1;i<n;i++)
{
if(b%(n-1)!=0)break;
b=b/(n-1)*n+k;
}
if(i==n){printf("%d\n",b);return(0);}
}
}
|
54 | 26664 |
void main()
{
int n,k,res;
scanf("%d%d",&n,&k);
res=pow(n,n)-(n-1)*k;
printf("%d\n",res);
} |
54 | 26665 | 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 | 26666 | int whether(int n,int k,int m[],int q)
{
int i=1;
m[0]=q*n+k;
for(i=1;i<n;i++)
{
if(m[i-1]%(n-1)==0)
m[i]=m[i-1]*n/(n-1)+k;
else
{
return 0;break;
}
}
if(i==n)
return 1;
}
void main()
{
int q=0,m[300]={0},k=0,n=0;
scanf("%d%d",&n,&k);
for(q=1;;q++)
{
if(whether(n,k,m,q)==1)break;
}
printf("%d",m[n-1]);
}
|
54 | 26667 | int main()
{
int n,k;
while(cin>>n>>k)
{
int a[100]={0};
a[1]=1;
int flag=-1;
//?????for????????????????while????????
while(flag!=1)//flag=-1??? flag=0 ???? flag=1 ?????????
{
for(int i=2;i<=n+1;i++)
{
if(a[i-1]%(n-1)==0)
{
a[i]=a[i-1]*n/(n-1)+k;
if(i==n+1)
flag=1;
}
else
{
flag=0;
break;
}
}
if(flag==0)
a[1]++;
}
cout<<a[n+1]<<endl;
}
return 0;
}
|
54 | 26668 | 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 | 26669 | void main(void)
{
int n, k, m, l, i;
scanf("%d %d", &n, &k);
m = n - 1;
do
{
l = m;
for(i = 1;i <= n - 1;i++)
{
l = l * n /(n - 1) + k;
if(l %(n - 1) != 0)
break;
}
m = m + n - 1;
}
while(l % (n - 1) != 0);
l = l * n /(n - 1) + k;
printf("%d",l);
} |
54 | 26670 | int n;
int main()
{
int k,i;
cin>>n>>k;
int apple(int a,int b,int c);
for(i=1;;i++)
{
if(apple(i,n,k)==1)
{
cout<<i;
break;
}
}
return 0;
}
int apple(int a,int b,int c)
{
int f;
f=(a-c)/n;
if(b==0)return 1;
else if(f==0) return 0;
else if((a-c)%n!=0)
return 0;
else return apple(a-c-f,b-1,c);
} |
54 | 26671 | 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 | 26672 | /*
* assignment.cpp
*
* Created on: 2010-11-23
* Author: ??
* ?? ???
*/
int main() {
int n, k, m = 1, i,m0=1;
cin >> n >> k;
while (1) {
for (i = 1; i <= n; i++) {
if (m % (n - 1) == 0)
m = n * m / (n - 1) + k;
else {
m0++;
m=m0;
i=1;
break;
}
}
if (i == n+1) {
cout << m;
return 0;
}
}
}
|
54 | 26673 | void main()
{
int n,k,m,i=1,j;
scanf("%d %d",&n,&k);
while(i>=0)
{m=n*i+k;
for(j=2;j<=n+1;j++)
{ if(j==n+1)
break;
if(m%(n-1)!=0)
break;
else
m=m*n/(n-1)+k;
}
if(j==n+1)
{printf("%d",m);
break;}
else
i++;
}
} |
54 | 26674 | /*
* ???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 | 26675 | 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 | 26676 | 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 | 26677 | 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 | 26678 | 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 | 26679 | /*
* 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 | 26680 | 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 | 26681 | //*******************
//**?????*******
//**???1300012728*
//**2013.11.27*******
//*******************
int n, k;
int apple(int i);
int j;
int main()
{
int a;
cin >> n >> k;
for (j = 1; ; j++)
{
a = apple(1);
if (a)
{
cout << a;
break;
}
}
return 0;
}
int apple(int i)
{
if (i == n)
return n * j + k;
int m = apple(i + 1);
if (m == 0)
return 0;
if (m % (n - 1) == 0)
return m / (n - 1) * n + k;
else
return 0;
}
|
54 | 26682 | int main()
{
int de(int m,int t);
int m,t,total;
scanf("%d%d",&m,&t);
total=de(m,t);
printf("%d\n",total);
}
int de(int x,int y)
{
int i,j,p,q;
for(i=1;;i++)
{
p=0;
q=i;
for(j=1;j<=x;j++)
{
if(q%x==y)
{
q=q-q%x-q/x;
p++;
}
if(q%x!=y)
break;
}
if(p==x&&q>0) break;
}
return(i);
}
|
54 | 26683 | 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 | 26684 | 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 | 26685 | //********************************
//*????1.cpp **
//*?????? 1300012966 **
//*???2013.12.05 **
//*???????? **
//********************************
int i, n, k;
int f (int m)
{
if (i < n)
{
if (m % (n - 1) != 0)
{
return 0;
}
i++;
return f (m * n / (n - 1) + k);
}
return m;
}
int main()
{
int j = 0, m;
cin >> n >> k;
do
{
i = 1;
j++;
m = f (j * n + k);
} while(m == 0);
cout << m << endl;
return 0;
} |
54 | 26686 | 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 | 26687 | 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 | 26688 | int main()
{
int n,k;
cin>>n>>k;
int i,f[n+2]; //?f[i]????i????????
f[n+1]=1; //?????????1???
while(1)
{
f[n]=n*f[n+1]+k;
for(i=n-1;i>0;i--)
{
if(f[i+1]%(n-1)!=0) //????????f[i]?????n-1??
{
break;
}
f[i]=(f[i+1]*n)/(n-1)+k; //???
}
if(i==0) break; //??i=0,????
else f[n+1]++; //??????,???f[n+1]+1?????
}
cout<<f[1]; //???n+1??????0????????????1????????????
return 0;
}
|
54 | 26689 | main()
{
int m,n,k,i,j,r=1,s;
scanf("%d%d",&n,&k);
for(i=1;r<n;i++)
{ for(j=i,s=(j*n+k)%(n-1),r=1;s==0&&r<n;r++)
{ j=(j*n+k)/(n-1);
s=(j*n+k)%(n-1);
}
}
printf("%d\n",j*n+k);
} |
54 | 26690 | /*
* ????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 | 26691 | 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 | 26692 | int k,n,t=1;
void mokey(int x)
{
if(x%(n-1)==0)
{
x=x*n/(n-1);
x=x+k;
t++;
if(t==n) { cout<<x; exit(0); }
else mokey(x);
}
}
int main ()
{
int i=0,x;
cin>>n>>k;
for(i=1;;i++)
{
t=1;
x=n*i+k;
mokey(x);
}
return 0;
}
|
54 | 26693 | 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 | 26694 | 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 | 26695 | void main()
{
int i,n,k,re=1;
scanf("%d %d",&n,&k);
for(i=0;i<n;i++)
re*=n;
if(n==2)
printf("7\n");
else
printf("%d\n",re-k*(n-1));
} |
54 | 26696 | /*************************
??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 | 26697 | 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 | 26698 | 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 | 26699 | void main()
{
int k,n,j,i,s,t=0;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{
s=i;
t=0;
for(j=0;j<n;j++)
{
if(s%n==k)
{t++;
s=(s-k)*(n-1)/n;}
else
break;
}
if(t==n&&s>=1)
break;
}
printf("%d",i);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.