id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
26,900 |
int n, k, m;
long long a[1000];
int vampire(int n, int k, int p)
{
int i;
a[n] = p * n + k;
if(n == 1 || a[n] % (n - 1) == 0)
{
for(i = n - 1; i >= 1; i--)
{
a[i] = a[i + 1] * n / (n - 1) + k;
if(i != 1 && a[i] % (n - 1) != 0)
break;
}
if(i == 0)
return a[1];
}
++ p;
while (n != 1 && (p * n + k) % (n - 1) != 0)
++ p;
return vampire(n, k, p);
}
int main()
{
cin >> n >> k;
m = vampire(n, k, 1);
cout << m << endl;
return 0;
}
| 54 |
26,901 | 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 |
26,902 |
int main()
{
int n,k,apple[100],i;
cin>>n>>k;
apple[n]=n+k; //?????????????????
for (i=n-1;i>=1;i--)
{
if (apple[i+1]%(n-1)==0) //??????????????????????????
{
apple[i]=apple[i+1]/(n-1)*n+k;
}
else //???????????????????????????
{
apple[n]+=n;
i=n;
continue;
}
}
cout<<apple[1]<<endl;
return 0;
} | 54 |
26,903 | int m;
void cauclute(int n, int k)
{
int j=1,i=1;
while(i<=n)
{
for(i=1;i<=n;i++)
{
if(i==1)
m=n*j+k;
else if(m%(n-1)==0)
m=m/(n-1)*n+k;
else
{
j+=1;
break;
}
}
}
cout << m;
}
int main()
{
int n,k;
cin >> n >> k;
cauclute(n,k);
return 0;
} | 54 |
26,904 | 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 |
26,905 |
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 |
26,906 | 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 |
26,907 | int main()
{
int n,k,sum,num;
scanf("%d%d",&n,&k);
int allocate(int n,int k,int sum,int num);
num=n;
for(sum=1;1;sum++)
if(allocate(n,k,sum,num)){printf("%d",sum);break;}
return 0;
}
int allocate(int n,int k,int sum,int num)
{
if(sum/(num)==0 || sum%num!=k){return 0;}
else if(n==1){return 1;}
else return allocate(n-1,k,sum-sum/num-k,num);
} | 54 |
26,908 | 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 |
26,909 | void main()
{
long int abc(double n,float k);
long int a,b;
scanf("%ld%d",&a,&b);
printf("%ld\n",abc(a,b));
}
long int abc(double n,float k)
{
double sum=0;int i,j;
for(i=1;;i++)
{
sum=i*(n-1);
for(j=0;j<n;j++)
{
sum=n/(n-1)*sum+k;
if((sum-(long int)sum)!=0)
break;
}
if((sum-(long int)sum)==0)
break;
}
return((long int)sum);
}
| 54 |
26,910 | 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 |
26,911 |
int main()
{
int f(int n,int k);
int n,k;
scanf("%d %d",&n,&k);
printf("%d\n",f(n,k));
return 0;
}
int f(int n,int k)
{
double s,x;
int i,j,m;
for(j=1;;j++){
s=n*j+k;
for(i=2;i<=n;i++){
s=n*(s/(n-1))+k;
m=(int)s;
x=s-m;
if(x!=0){
break;}
}
m=(int)s;
x=s-m;
if(x==0){
break;}
}
return s;
}
| 54 |
26,912 | int apple(int n,int k)
{
int i,j,m,a;
m=0;
for(i=1;1;i++){
if(m!=0)
{
break;
}
a=i*n+k;
for(j=2;j<=n;j++){
if(a%(n-1)!=0)
{
a=0;
break;
}
a=(a*n/(n-1))+k;
}
if(a!=0){
m=a;
}
}
return m;
}
int main()
{
int n,k,m;
scanf("%d%d",&n,&k);
m=apple(n,k);
printf("%d",m);
return 0;
} | 54 |
26,913 | main()
{
int n,k,m,i,j,a,b,c;
scanf("%d%d",&n,&k);
a=1;
b=1;
if(n>=3)
{
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=n*a+k;
}
}
printf("%d",c);
}
else printf("7");
}
| 54 |
26,914 |
int main()
{
int n, k;
int i;
int total;
int final;
int count = 0;
int calc(int total, int n, int k);
scanf("%d%d", &n, &k);
for(final = k; ; final++)
{
count = 0;
total = final * n + k;
if(total % n == k)
count++;
for(i = 2; i <= n; i ++)
{
total = calc(total, n, k);
if(total % n == k)
count++;
}
if(count == n)
{
printf("%d", total);
break;
}
}
return 0;
}
int calc(int total, int n, int k)
{
return (total * n / (n - 1) + k);
}
| 54 |
26,915 | 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);
}
| 54 |
26,916 | 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 |
26,917 | int m(int n,int k)
{
int i,x=1,s=n*x+k;
for(i=0;i<n-1;i++)
{
if((n*s)%(n-1)==0)
{
s=k+(n*s)/(n-1);
}
else
{
i=-1;
x++;
s=n*x+k;
}
}
return s;
}
void main()
{
int n,k;
scanf("%d%d",&n,&k);
printf("%d",m(n,k));
}
| 54 |
26,918 | 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 |
26,919 |
int main()
{
int n,k,i,j;
cin>>n>>k;//?????
for(i=1;;i++)//??i??????????????
{
int sum=i*(n-1);//????????sum?
int counter=0;//?counter?????????
for(j=1;j<=n;j++)
{
if((sum%(n-1))!=0)break;//?????????????????????i????????
else
{
sum=sum*n/(n-1)+k;//???????????????
counter++;//????????
}
}
if(counter==n)//??n?????????
{
cout<<sum<<endl;
break;
}
}
return 0;
} | 54 |
26,920 | int main()
{
int n,k,i,last=1;
float m=1;
int M;
scanf("%d %d",&n,&k);
for(i=0;i<2*n-1;i++){
if(i%2==0){
m=m*n+k;
}else{
m=m/(n-1);
M=m;
if((m-M)!=0){
last+=1;
m=last;
i=-1;
continue;
}
}
}
printf("%.0f",m);
return 0;
} | 54 |
26,921 |
int main()
{
int i,n,k,m;
m=1;
scanf("%d%d",&n,&k);
if (n==2)
{
for (i=1;i<=n+1;i++)
m=m*n;
m=m-k*n+k;
printf("%d",m);
}
else
{
for (i=1;i<=n;i++)
m=m*n;
m=m-k*n+k;
printf("%d",m);
}
return 0;
} | 54 |
26,922 | int main()
{
int n,m,j,k,mark;
long double i;
scanf("%d %d",&n,&k);
for(i=k;i<1000000000;i++)
{
m=0;mark=1;
m=i*n+k;
for(j=1;j<n;j++)
{
if(m%(n-1)!=0)
{mark=0;break;}
else
m=m/(n-1)*n+k;
}
if(mark!=0)
{printf("%d",m);break;}
}
return 0;
}
| 54 |
26,923 | //************************************************************************
//?????????
//??? ???
//??? 12-4
//************************************************************************
int n;
int k;
int a[10000];
int main()
{
int t = 1;
int i;
cin >> n >> k;
for(i = 0; i < n - 1; i ++)
t *= (n - 1);
for(a[n] = n + k ; (a[n]+ k * (n - 1)) % t != 0; a[n] += n);
for(i = n - 1; i >= 1; i --)
{
a[i] = (a[i + 1] * n) / (n - 1) + k;
}
cout << a[1];
return 0;
}
| 54 |
26,924 | int main()
{
int monkey[1000],n,k,i=3;
cin>>n>>k;
monkey[n]=k;
while(i>=1)//??i?????
{
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/(n-1)+k;
}
}
cout<<monkey[1];
return 0;
} | 54 |
26,925 | int judge(int x,int y,int z)
{
int k,take,i,n,j,re;
double left;
take=x;k=y;n=z;
left=take*n*1.0+k;
for(i=0;i<n-1;i++)
{
left=left*1.0*(n/(n-1.0))+k;
j=left;
if(left-j>0)
{
re=0;
break;
}
re=left;
}
return re;
}
void monkey(int x,int y)
{
int n,k,i,m,a=0,j;
double haha;
n=x;k=y;
for(i=k;;i++)
{
j=judge(i,k,n);
if(j==0)
{
j=j;
}
else
{
printf("%d",j);
break;
}
}
}
int main()
{
int n,k;
scanf("%d",&n);
scanf("%d",&k);
monkey(n,k);
return 0;
}
| 54 |
26,926 | 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 |
26,927 | void main()
{
int m,k,n,t,i;
scanf("%d%d",&n,&k);
for(m=2;;m++)
{
t=m;
for(i=1;i<=n;i++)
{
if((t-k)%n!=0||(t-k)<=0)break;
t=t-(t-k)/n-k;
}
if(i>=n+1)
{
printf("%d\n",m);
break;
}
}
}
| 54 |
26,928 | /*
* wanyi.cpp
*
* Created on: 2012-11-12
* Author: 7
*/
int apple(int n,int k,int a)
{
if(a%(n-1)==0)
return a=a/(n-1)*n+k;
else return -1;
}
int main()
{
int n,k,a,i;
cin>>n>>k;
for(i=1;;i++)
{
a=i;
for(int j=0;j<n;j++)
{a=apple(n,k,a);
if(a==-1)
break;
}
if(a==-1)
continue;
else
break;
}
cout<<a;
}
| 54 |
26,929 | int apple[1000]={0};//????????????????
int main()
{
int n,k;
cin>>n>>k;
int i=0;
for(i=1;i<=n;i++)
apple[i]=k;
do
{
apple[n]=apple[n]+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);//?i?=1??????
cout<<apple[1]<<endl;//?????????????
return 0;
}
| 54 |
26,930 | void main()
{
int m,M,n,k,X=1,i;
scanf("%d %d",&n,&k);
for(m=n+k+(n-1)*(n+2*k);X!=0;m++)//
{
M=m;
for(i=1;i<=n;i++)
{
if(M%n==k)
{
M=M-M/n-k;
}
else break;
}
if(i==n+1)
{
printf("%d",m);
X=0;
}
}
} | 54 |
26,931 | int main()
{
int n,k,i,j,c,a,m=0;
cin>>n>>k;
for(j=1;;j++)
{c=j;
for(i=1;i<=n;i++)
{a=(c*n)+k;
if(i!=n)
{if(a%(n-1)==0) c=a/(n-1);
else break;}
else m=a;}
if(m!=0) {cout<<m<<endl;break;}}
return 0;
}
| 54 |
26,932 | void apple(int, int);
int n, k, m, f = 0;
int main()
{
cin >> n >> k;
while(1)
{
apple(m, n);
if(f == 1)
break;
m++;
}
cin >>m;
return 0;
}
void apple(int h, int p)
{
if(p == 1)
{
if((h - k) / n <= 0)
return;
else
{
if((h - k) % n == 0)
{
cout << m << endl;
f = 1;
}
else
return;
}
}
if((h - k) % n == 0)
apple(h - k - ((h - k) / n), p - 1);
else
return;
} | 54 |
26,933 | 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 |
26,934 | /*
*????111114 05.cpp
*??????
*?????2011-11-14
*?????????????
*/
int main( )
{
int n,k,i=1,j; //????
cin>>n>>k; //????
int f[n+1]; //????
while(i>0) //??????????
{
f[0]=(n-1)*i; //?????
for(j=1;j<n+1;j++) //????
{
if(f[j-1]%(n-1)!=0) break;
f[j]=f[j-1]*n/(n-1)+k;
}
if(j==n+1) break; //???????
i=i+1;
}
cout<<f[n]<<endl; //??
return 0;
} | 54 |
26,935 | 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 |
26,936 | 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 |
26,937 |
int main()
{
int n,k,i,temp;
cin>>n>>k;
int applestay;
i=0;
for(applestay=n-1;i<n;applestay=applestay+(n-1))
{
i=0;
temp=applestay;
for(;i<n;i++)
{if(n*temp%(n-1)!=0) break;
temp=n*temp/(n-1)+k;}
}
cout<<temp;
return 0;
} | 54 |
26,938 | //**************************
//*???????? **
//*?????? 1200012888 **
//*???2013.12.04**
//**************************
int N; //???????N
int i = 1; //i ????? ???????????
int Apple(int n,int k) //????????Apple
{
if (n == 1) //????????????? ??? ??? i * N + k?
{
return i * N + k ; //??
}
else
{
while (Apple(n - 1,k) % (N - 1) != 0) //???? ? ??????? i ++
{
i ++;
}
return (N * Apple(n - 1,k) / (N - 1) + k); //???????
}
}
int main()
{
int n,k; //?????n??????k
cin >> n >> k; //??n k
N = n;
cout << Apple(n,k) << endl; //??Apple??~
return 0;
} | 54 |
26,939 | void main()
{
int n,k,m,i;
scanf("%d %d",&n,&k);
if(n!=2){m=pow(n,n)-(n-1)*k;
printf("%d",m);}
else printf("%d",7);
} | 54 |
26,940 | int n , k , m , g = 0 ;
int main()
{
void plu(int i) ;
cin >> n >> k ;
for (int j = 1 ; g == 0 ; j++)
{
m = j * (n-1) ;
plu(0) ;
}
return 0 ;
}
void plu(int i)
{
if (i == n)
{
g = 1 ;
cout << m ;
return ;
}
if (m % (n-1) != 0)
return ;
m = m * n/(n - 1) + k ;
return plu(i +1) ;
} | 54 |
26,941 |
int minapple( int x, int i ); //minapple??????????x????????????,i????????
int n, k; //n??????k??????
int main()
{
int min = 0; //min??????
int j = 0;
cin >> n >> k;
j = n + k; //??????????n+k???
while ( 1 )
{
if ( j % n == k )
{
min = minapple( j, 1 ); //????????j???????1???
if ( min != 0 )
break; //??min??0????????????????
}
j += n; //??j+n
}
cout << min << endl;
return 0;
}
int minapple( int x, int i )
{
if ( i == n ) //???????n??????return?????
return x;
if ( x % n != k || x % ( n - 1 ) != 0)
return 0; //???????????????0
else
return minapple( ( x * n / ( n - 1 ) ) + k, i + 1 ); //???????????
} | 54 |
26,942 | int main()
{
int check(int,int,int);
int i,n,k;
cin>>n>>k;
for(i=1;1;i++)
{
if(check(i,n,k))
{
cout<<i<<endl;
return 0;
}
}
}
int check(int shally,int n,int k)
{
int i;
for(i=1;i<=n;i++)
{
shally=shally-k;
if((shally%n==0)&&(i==n))
{
return 1;
}
if(shally%n!=0)
{
return 0;
}
shally=shally-shally/n;
}
} | 54 |
26,943 | int sum(int x,int y);
void main()
{
int n,k;
scanf("%d %d",&n,&k);
printf("%d\n",sum(n,k));
}
int sum(int x,int y)
{
int m,i;
for(m=1,i=1;i<=x;i++)
{
m*=x;
}
m-=(x-1)*y;
return m;
} | 54 |
26,944 | //?????????? ????????
int main()
{
int n,k,t;
int i,j;
int apple[100];
cin>>n>>k;
j=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]=apple[n]+n-1;
i=n+1;
}
}
cout<<apple[0]<<endl;
return 0;
} | 54 |
26,945 | int f()
{
int n,k,m,i;
scanf("%d %d", &n, &k);
int last = 0;
while (1)
{
last++;
m = last * n + k;
int t = 1;
for (i = 1; (i < n) && t; i++)
{
t = (m % (n - 1) == 0);
m = m / (n - 1) * n + k;
}
if (t)
break;
}
printf("%d\n", m);
return 0;
}
int main()
{
f();
}
| 54 |
26,946 | int main()
{
int chek(int a,int b,int c);
int n,k,m;
scanf("%d %d",&n,&k);
for(m=n+k;;m++)
{
if(chek(n,k,m)==1)
break;
}
printf("%d",m);
return 0;
}
int chek(int A,int B,int C)
{
int x=1,j=0;
while(C%A==B&&C>A&&x>=1)
{
x=(C-B)/A;
C=C-B-x;
j++;
}
if(j==A)
return 1;
else
return 0;
} | 54 |
26,947 |
int fun(int temp, int n, int k)
{
int output = temp * n / (n - 1) + k;
return output;
}
int main()
{
int n, k;
scanf("%d %d", &n, &k);
int last;
int temp;
int i;
int count = 0;
for(last = k;; last++)
{
count = 1;
temp = last * n + k;
for(i = 2; i <= n; i++)
{
temp = fun(temp, n, k);
if(temp % n == k)
count++;
}
if(count == n)
{
printf("%d", temp);
break;
}
}
return 0;
}
| 54 |
26,948 | void main()
{
int n,k,i=1,a,b=1;
scanf("%d%d",&n,&k);
a=1;
for(;i<n;)
{
for(;(n*a+k)%(n-1)!=0;)
{
b=b+1;
a=b;
i=1;
}
a=(n*a+k)/(n-1);
i=i+1;
}
printf("%d\n",n*a+k);
} | 54 |
26,949 | /*
*fenguozi.cpp
*????????????
*Created on: 2011-11-11
*Author:???
*/
int main(){
int a,n,i,b,k,t=1;
cin>>n>>k;
b=n+k;
while(t==1){//????
a=b;
for(i=1;i<=n-1;i++){
if(a%(n-1)!=0) i=n+1;
else a=a*n/(n-1)+k;}
if(i==n) {cout<<a;t=2;}
b=b+n;
}
return 0;
}
| 54 |
26,950 | int main()
{
int n,k;
int remain,last=1;
int i;
scanf("%d %d",&n,&k);
for(last=1;last>0;last++)
{
for(remain=last*n+k,i=1;i<n;i++)
{
if(remain%(n-1)==0)
remain=remain*n/(n-1)+k;
else
{
last=-last;
break;
}
}
if(last>0)
printf("%d",remain);
last=-last;
}
} | 54 |
26,951 |
void main()
{
int sum(int a,int b,int c);
int n,k,t;
scanf("%d %d",&n,&k);
t=n;
printf("%d\n",sum(n+1,k,t));
}
int sum(int a,int b,int c)
{
int x,j;
if(a==1)
{
x=1;
if(c!=2)
{for(j=1;j<=c;j++)
x=x*(c-1);
x=x-b*(c-1);}
}
else
{
x=sum(a-1,b,c)*c/(c-1)+b;
}
return(x);
}
| 54 |
26,952 | /*
* 1.cpp
*
* Created on: 2011-11-10
* Author: 1100012870
*/
int n,k; //n?k??????
int ping(int no,int num)
{
if(no==0){
cout<<num<<endl;
return 1;
}
int x;
x=num*n;
if(x%(n-1)!=0) return 0; //??????????
return ping(no-1,x/(n-1)+k); //??????????????
}
int main()
{
int i=1;
cin>>n>>k;
while(1){ //???????????????
if(ping(n,i)==1)break; //??????????
i++;
}
return 0;
}
| 54 |
26,953 |
main()
{
int a,b,c; /*a=n b=k c=counts*/
int sum=1;
scanf("%d%d",&a,&b);
if(a!=2)
{
for(c=0;c<a;c++)
{
sum=sum*a;
}
int SUM=sum-b*(a-1);
printf("%d",SUM);
}
else
{printf("7");}
return 0;
} | 54 |
26,954 |
int n,k,i=1;
int fenpingguo(int a)
{
while(1)
{
if (a==n)
{
return (i*n+k);
}
else
{
if (fenpingguo(a+1)%(n-1)==0)
{
return (fenpingguo(a+1)*n/(n-1)+k);
}
else
{
i++;
continue;
}
}
}
}
int main()
{
cin >> n >> k;
cout << fenpingguo(1);
return 0;
}
| 54 |
26,955 | /*
* ?????????.cpp
* ?????
* ????: 2012-11-12
* ???????????
*/
int main(){ //?????
int a[9999]={1},i=0,n=0,k=0; //???????
cin>>n>>k; //??n?k
a[n]=k; //??????????????k???
do{
a[n]=a[n]+n; //??????????????n?????n??k
for(i=n-1;i>=1;i--){ //?????????????
if(a[i+1]%(n-1)!=0)
break; //?????n-1????????
else
a[i]=a[i+1]*n/(n-1)+k; //????????????????
}
}while(i>=1); //?i>=1????
cout<<a[1]; //????????????
return 0;
} //????? | 54 |
26,956 | int f(int n, int k);
int main()
{
int n1,k1,m;
scanf("%d %d",&n1,&k1);
m=f(n1,k1);
printf("%d",m);
return 0;
}
int f(int n, int k)
{
int nazou, naqian,i,lastnazou;
lastnazou=1;
nazou=lastnazou;
for(i=0;i<n-1;i++){
if((n*nazou+k)%(n-1)==0){
nazou=(n*nazou+k)/(n-1);
naqian=n*nazou+k;
}else{
lastnazou++;
nazou=lastnazou;
i=-1;
}
}
return naqian;
} | 54 |
26,957 | int main()
{
int n,j,k,m,s=1,a=0;
scanf("%d%d",&n,&k);
j=1;
for(;;)
{
if(a==n) {printf("%d",m); break;}
else if((j*n)%(n-1)!=0) {j=1+s++; a=0;}
else {
m=j*n/(n-1)+k;
j=m;
a++;
}
}
printf("\n");
}
| 54 |
26,958 | 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 |
26,959 | 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 |
26,960 | int main()
{ int n,k,i,j,c;
scanf("%d %d",&n,&k);
int a[100];
for(j=1;;j++)
{
for(i=0;i<n-1;i++)
{
a[0]=n*j+k;
a[i+1]=a[i]*n/(n-1)+k;
}
c=0;
while(a[c]%(n-1)==0&&c<n) { c++; }
if(c>=i) break;
}
printf("%d",a[n-1]);
return 0;
} | 54 |
26,961 | /*
* ?????.cpp
*
* Created on: 2010-11-28
* Author: Administrator
*/
int f(int n){
int m=1;
for(int i=0;i<n;i++)
m=m*n;
return m;//????
}
int main(){
int n,k;
cin>>n>>k;
if(n==2)cout<<(3+4*k);//n?????
else cout<<f(n)-k*(n-1);//n??????
return 0;
}
| 54 |
26,962 | int pseudo_main()
{
int monkeys, throw_away;
int apples;
int i;
scanf("%d %d", &monkeys, &throw_away);
int last = 0;
while(1){
last++;
apples = last*monkeys+throw_away;
int divides = 1;
for (i=1; (i<monkeys)&÷s;++i) {
divides = (apples % (monkeys - 1) == 0);
apples = apples/(monkeys - 1)*monkeys+throw_away;
}
if(divides)
break;
}
printf("%d\n", apples);
}
int main()
{ pseudo_main(); } | 54 |
26,963 | void main()
{
int n,k,m,i,x,y;
scanf("%d %d",&n,&k);
x=pow(n,n);
y=pow(n-1,n);
for(i=1;;i++)
if((i+k*(n-1))%y==0)
break;
m=(i+k*(n-1))/y*x-k*(n-1);
printf("%d",m);
}
| 54 |
26,964 | int n , k ;
int p = 1 ;
int monkey(int t)
{
int x = 0;
if(t == 1)
return p*n +k ;
else
{
while((monkey(t-1) % (n-1) != 0))
{
p++;
}
return (monkey(t-1)*n/(n-1)+k) ;
}
}
int main ()
{
cin >> n >> k ;
cout << monkey(n) <<endl ;
return 0 ;
}
| 54 |
26,965 | 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 |
26,966 | int time,k,n;
void calc(int fruit)
{
if (fruit<1)
time = -2;
if ((time!=-2)&&(time!=-3))
if ((fruit%n==k))
{
time --;
if ((time==0)&&(fruit-fruit/n-k>0))
{
time = -3;
}
else
{
calc(fruit-fruit/n-k);
}
}
}
int main()
{
int i;
scanf("%d%d",&n,&k);
for (i=1;;i++)
{
time = n;
calc(i);
if ((time==-3))
{
printf("%d",i);
break;
}
}
return 0;
} | 54 |
26,967 | long int power(int a,int b)
{
int i,pro=1;
for (i=1;i<=b;i++)
pro*=a;
return pro;
}
main()
{
int n,k;
long int m,a,p,q;
scanf("%d %d",&n,&k);
p=power(n-1,n-1);
q=power(n,n-1);
a=p-k;
while (a<=0)
a+=p;
m=n*((a+k)/p*q-k)+k;
printf("%ld\n",m);
return 0;
} | 54 |
26,968 | int fenpei(int n,int k);
int main(int argc, char* argv[])
{
int n=0,k=0;
scanf("%d%d",&n,&k);
printf("%d",fenpei(n,k));
return 0;
}
int fenpei(int n,int k)
{
int i=0,m=n-1,j=0,t=1;
while(1)
{
j=0;
m=t*(n-1);
for(i=0;i<n;i++)
{
if(m%(n-1)!=0) break;
m=m/(n-1)*n+k;
j++;
if(j==n) break;
}
if(j==n) break;
else t++;
}
return m;
} | 54 |
26,969 | 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 |
26,970 | void main()
{
int a[100]={0},n,k,j,i;
scanf("%d%d",&n,&k);
for(j=1;i!=n+1;j++)
{
a[0]=j;
for(i=1;i<=n;i++)
{if(a[i-1]%(n-1)==0) a[i]=a[i-1]*n/(n-1)+k;
else break;}
}
printf("%d",a[n]);
} | 54 |
26,971 | void main()
{
int i,n,k,l=1,a[100];
scanf("%d %d",&n,&k);
for(l=1;;l++)
{i=n;
a[i]=n*l+k;i--;
while(i>0)
{
if(a[i+1]%(n-1)==0)
{
a[i]=(a[i+1]/(n-1))*n+k;
i--;
}
else break;
}
if(i==0)
printf("%d",a[1]);
if(i==0)break;
}
} | 54 |
26,972 | 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 |
26,973 | int main()
{
int n,k;
scanf("%d%d",&n,&k);
if(n<k){ printf("n>k not match!\n");return 1;}
int m=n+k;
int flag=1;
int i;
int x;
while(1)
{
x=m;
for(i=0;i<n-1;i++)//??n-1?
{
if(x%n!=k) {flag=0;break;} //???????????k
x=x-x/n-k;
}
if(x%n==k&&flag==1&&x>n) break;//?????????K????????????
flag=1; // ?????
m++; //m??1
}
printf("%d\n",m);
return 0;
}
| 54 |
26,974 |
void main()
{
int n,k,i,m,sum;
scanf("%d%d",&n,&k);
m=n-1;
for(i=1;;)
{
sum=i;
while((n*sum+k)%(n-1)==0)
{
sum=(n*sum+k)/(n-1);
m--;
if(m==0)
break;
}
if(m!=0)
{
i++;
m=n-1;
}
else
break;
}
printf("%d",n*sum+k);
}
| 54 |
26,975 | //??????????????????????????????
//1.??i?????s[i]?????s[2]==(s[1]-k)*(n-1/n);s[n]==(s[n-1]-k)*(n-1/n)
//2.???s[n]+(n-1)k?????????????s[n]-(n-1)k==[(n-1/n)^n](s[1]+(n-1)*k)
//????????s[n+1]?????s1+(n-1)k?????n^n
long ppow(int a,int b)//??????????
{
if(b==1)
return (long)a;
else if(b%2)
{
long t=ppow(a,(b-1)/2);
return t*t*a;
}else
{
long t=ppow(a,b/2);
return t*t;
}
}
int main()
{
int n,k;
cin >> n >> k;
long ans;
ans=ppow(n,n)-(n-1)*k;//???????????
cout << ans << endl;
return 0;
} | 54 |
26,976 | void main()
{ int m,n,k,mark=0,i,num,l;
scanf("%d%d",&n,&k);
for(m=1;mark==0;m++)
{ num=0;l=m;
for(i=0;i<n;i++)
{ if(l%(n-1)==0)
{l=n*l/(n-1)+k;num++;}
else break;
}
if(num==n){printf("%d\n",l);mark=1;}
}
} | 54 |
26,977 | int main()
{
int m,n,k,i,a=0,b,c=0,d;
scanf("%d %d",&n,&k);
i=1;
b=n-1;
d=b;
m=d;
while(a==0)
{
while(i<=n)
{
if(m%(n-1)!=0)
i=n+1;
else
c++,m=m*n/(n-1)+k,i++;
}
i=1;
d=d+b;
if(c==n)
a=1;
else
m=d;
c=0;
}
printf("%d",m);
} | 54 |
26,978 |
int n=0,k=0;
int f(int depth,int a)
{
if (depth==n) return a;
if (a%(n-1)==0) return f(depth+1,a*n/(n-1)+k);
return 0;
}
int main()
{
int i=1,t=0;
cin>>n>>k;
while(true)
{
t=f(1,i*n+k);
if(t!=0)break;
else i++;
}
cout<<t;
return 0;
} | 54 |
26,979 | int f(int n,int k)
{
int m;
int i=1;
m=n*(pow(n-1,n-1)-k)+k;
while (i<n)
{
m=m/(n-1)*n+k;
i++;
}
return m;
}
int main(int argc, char* argv[])
{
int n,k;
int i=1;
scanf ("%d%d",&n,&k);
printf ("%d",f(n,k));
return 0;
}
| 54 |
26,980 | 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 |
26,981 | int pingguo(int a,int b);
int main()
{
int n,k,y;
scanf("%d%d",&n,&k);
y=pingguo(n,k);
printf("%d",y);
return 0;
}
int pingguo(int a,int b)
{
int i,z,k=1,j;
while(1)
{
j=1;
z=k*a+b;
for(i=1;i<a;i++)
{
if(z%(a-1)==0)
{
z=z/(a-1)*a+b;
j=j+1;
}
else
{
k=k+1;
break;
}
}
if(j==a) break;
}
return z;
} | 54 |
26,982 | int main()
{
int n, k, m,y=0,i,p;
scanf("%d%d", &n, &k);
for (m = 1; y != n; m++)
{
p = m; y = 0;
for (i = 1; i <= n; i++)
{
if (i < n)
{
if (p%n == k)
{
p = p - p / n - p%n;
y++;
}
else
break;
}
else
{
if (p <= n)
break;
else if (p%n != k)
break;
else
y++;
}
}
}
printf("%d", m - 1);
return 0;
} | 54 |
26,983 |
void main()
{
int n,k,i;
int apple[N];
scanf("%d%d",&n,&k);
apple[n]=k+n;
for(i=n;i>=1;)
{
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;//di tui
}
}
printf("%d\n",apple[1]);
} | 54 |
26,984 | int main()
{
int m,n,k,t,x,y;
scanf("%d %d",&n,&k);
for(t=1,x=1,y=1;t<=n;t++)
{
m=n*x+k;
if(t!=n)
if(m%(n-1)==0){x=m/(n-1);}
else {m=0;t=0;;y++;x=y;}
}
printf("%d",m);
return 0;
} | 54 |
26,985 |
int main()
{
int n,k,m=0;
cin>>n>>k;
int temp=n-1;
for (int i=1;;)
{
m=i*n+k;
while (m%(n-1)==0)
{
m=m/(n-1)*n+k;
temp--;
if (temp==0)
{
cout<<m;
break;
}
}
if (temp==0)
break;
i++;
temp=n-1;
}
return 0;
} | 54 |
26,986 | void main ()
{
int m=0,n,k,i=0,j;
scanf("%d%d",&n,&k);
loop:i++;
m=i*n+k;
for(j=0;j<n-1;j++)
{
if(m%(n-1)==0)m=m/(n-1)*n+k;
else goto loop;
if(j==n-2)goto push;
}
push:printf("%d\n",m);
} | 54 |
26,987 | int jisuan(int n,int k,int b,long int a,int *p)
{
long int sum=0;
if(b==1)
sum=n*a+k;
else
{
sum=jisuan(n,k,b-1,a,p)*n/(n-1)+k;
if((sum-k)%n!=0)
*p=1;
}
return sum;
}
int main()
{
int n,k,b,c=0;
long int a,s;
int*p;
scanf("%d%d",&n,&k);
b=n;
a=1;
p=&c;
if(n==1)
printf("%d\n",1+k);
else
{
for(a=1;a<=1000000;a++)
{
*p=0;
s=jisuan(n,k,b,a,p);
if(*p==1)
continue;
if((s-k)%n==0)
break;
//printf("%d\n",s);
}
printf("%d\n",s);
}
} | 54 |
26,988 | void main()
{
int n,k,m,x,y,z,i;
scanf("%d%d",&n,&k);
for(z=1;;z++)
{
x=z;
for(i=1;1<=n;i++)
{
y=(x*n+k)%(n-1);
if(y==0&&i<n)
x=(x*n+k)/(n-1);
else
break;
}
if(i==n)
break;
}
m=x*n+k;
printf("%d",m);
} | 54 |
26,989 | void main()
{
int i,q=1,m=0,n,p,k,d;
scanf("%d %d",&n,&k);
p=n-1;
for(;;)
{
loop:if(1)
m++;
d=m*n+k;
for (i=2;i<=n;i++)
{
if (d%p!=0) goto loop;
d=d*n/p+k;
}
break;
}
printf("%d",d);
} | 54 |
26,990 |
int f(int n,int k){
int a[100]={0};
for(int i=0;i<100;i++)
a[i]=k;
int i;
do{
a[n]+=n;
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);
return a[1];
}
int main(){
int n,k;
cin>>n>>k;
cout<<f(n,k)<<endl;
return 0;
}
| 54 |
26,991 | /*
* ditui5.cpp
*??????
* Created on: 2011-11-15
* Author: APPLE
*/
int main() //?????
{
int m[1000],n,k,i; //????
cin>>n>>k;
m[1]=n+k;
while(1)
{for(i=1;i<=n;i++) //????
{m[i+1]=(((m[i]-k)/n)*(n-1));
if(i==n)
break;
if((m[i+1]%n)!=k)
break;
}
if((i==n)&&(m[i+1]/(n-1))>=1) //????
{cout<<m[1]<<endl;
break;
}
else
m[1]=m[1]+n;
}
return 0; //?????
}
| 54 |
26,992 | void main()
{
double a(int n,int k,int i,int m);
int n,k,i,s,b;
double j;
scanf("%d%d",&n,&k);
for(i=1;;i++)
{j=a(n,k,i,n);
b=(int)j;
if(b==j) {s=(int)(n*j+k);break;}
}
printf("%d",s);
}
double a(int n,int k,int i,int m)
{
double c;
if(m==1) c=i;
if(m>1) c=(n*a(n,k,i,m-1)+k)/(n-1);
return(c);
} | 54 |
26,993 | void main()
{
int i,a,n,k,m;
scanf("%d%d",&n,&k);
for(a=1;;a++)
{
m=a*n+k;
for(i=1;i<n;i++)
{
if(m%(n-1)==0)
m=m*n/(n-1)+k;
else break;
}
if(i==n)break;
}
for(i=1,m=a*n+k;i<n;i++)
m=m*n/(n-1)+k;
printf("%d\n",m);
}
| 54 |
26,994 | int main()
{
int n, k, i, t, j, app[100];
cin>>n>>k;
for(j=1;j<=n;j++)
{
app[j]=k;
}
do
{
app[n]+=n;
for(i=n-1;i>=1;i--)
{
if(app[i+1]%(n-1)!=0)
{
break;
}
else
{
app[i]=(app[i+1]*n)/(n-1)+k;
}
}
}while(i>=1);
cout<<app[1];
int x;cin>>x;
return 0;
}
| 54 |
26,995 | 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 |
26,996 | int main()
{
int k,n,n1;
int apple(int n,int k);
scanf("%d%d",&n,&k);
printf("%d",apple(n,k));
return 0;
}
int apple(int n,int k)
{
int num,i,j;
for(i=1;;i++){
for(j=1;j<=n;j++){
if(j==1)num=i*n+k;
else{
if(num%(n-1)==0){
num=num/(n-1)*n+k;
if(j==n)break;
}
else{j=0; break;}
}
if(j==n)break;
}
if(j==n)break;
}
return num;
}
| 54 |
26,997 | /*
* 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 |
26,998 | //*******************
//**?????*******
//**???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 |
26,999 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.