id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
26,600 | /*?????.cpp
*Created on: 2012-11-16
* Author: ??
*/
int apple(int n, int k) {
int a[n + 1];//?i????????
a[n] = n + k;//??????????n+k????????1?
while (1) {
for (int i = n; i > 1; i--) {
if (a[i] % (n-1) != 0) {//????????%n-1??0
a[n] += n;
break;//?????????????????n
}
a[i - 1] = a[i] / (n - 1) * n + k;//???????????
if (i == 2)//??????
return a[1];//??????????????
}
}
}
int main() {
int n, k;
cin >> n >> k;
cout << apple(n, k);
return 0;
}
| 54 |
26,601 | void main()
{
int n,k,m,i,j,t;
scanf("%d %d",&n,&k);
j=1;
while(j>0)
{
t=1;
m=n*j+k;
i=2;
while(i<=n)
{
if(m%(n-1)==0)
{
m=(m/(n-1))*n+k;
i=i+1;
}
else
{
t=0;
break;
}
}
if(t==1)
break;
else j=j+1;
}
printf("%d",m);
} | 54 |
26,602 | void main()
{
int i,j,m=0,n,k,r;
scanf("%d %d",&n,&k);
for (i=1;m==0;i++)
{
m=(n-1)*i;
r=m%(n-1);
for (j=n;(j>0)&&(r==0);j=j-1)
{
m=n*m/(n-1)+k;
r=m%(n-1);
}
if (r==0||j==0) m=m;
else m=0;
}
printf("%d",m);
}
| 54 |
26,603 |
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 |
26,604 | int qium(int num,int resi);
int main()
{
int n,p,m;
scanf("%d %d",&n,&p);
m=qium(n,p);
printf("%d",m);
return 0;
}
int qium(int num,int resi)
{
int i,j;
int k=1;
int a,b;
i=-1;
while(k!=num)
{
k=1;
i++;
a=num*(i+1)+resi;
b=a;
for(j=0; ;j++)
{
b=(num-1)*(b-resi)/num;
if((b<num)||(b%num!=resi))
{
break;
}
else
{
k++;
}
}
}
return a;
}
| 54 |
26,605 | int p = 1, count1 = 1, sum = 0;
int main()
{
int n, k, ans;
int min(int n, int k);
cin >> n >> k;
do { ans = min(n, k);}
while(ans < 0);
cout << ans << endl;
cin >> ans;
return 0;
}
int min(int n, int k)
{
if(count1 == 1)
{
sum = n * p + k;
count1++;
return min(n, k);
}
else
{
if(count1 == n + 1)
{
// cout << sum << endl;
return sum;
}
else
{
if(sum % (n - 1) == 0)
{
count1++;
sum = (sum * n) / (n - 1) + k;
return min(n, k);
}
else
{
count1 = 1;
p++;
return -1;
// min(n, k);
}
}
}
} | 54 |
26,606 | /*
* 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 |
26,607 | /*
* 1000012712_324.cpp
*
* Created on: 2010-11-21
* Author: Administrator
*/
int main(){
int n,k,i;
cin>>n>>k;
int apple[n];
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)||(apple[i]<n)) break;
}
if(i==n+1) break;
else apple[1]+=n;
}
cout<<apple[1]<<endl;
return 0;
}
| 54 |
26,608 | 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)
x=(x*n+k)/(n-1);
else
break;
}
if(i==n)
break;
}
m=x*n+k;
printf("%d",m);
} | 54 |
26,609 | void main()
{
int n,k,m,i,s;
scanf("%d %d",&n,&k);
i=0;m=0;s=0;
for(m=n;i<n;m++)
{i=0;s=m;
for(;i<n;i++)
if(s%n==k&&s>=n)
s=s-s/n-k;
else break;}
printf("%d\n",m-1);
} | 54 |
26,610 | void main()
{
int n,k;
void apple(int x,int y);
scanf("%d%d",&n,&k);
apple(n,k);
}
void apple(int x,int y)
{
int a=1,b,i=2,p=1;
b=x+y;
while(i<=x)
{
if(b%(x-1)==0)
{
a=b/(x-1);
b=a*x+y;
i=i+1;}
else
{
p=p+1;
a=p;
b=a*x+y;
i=2;
}
}
printf("%d\n",b);
}
| 54 |
26,611 |
main()
{
int j,m=1,n,k;
float q=0.5;
scanf("%d%d",&n,&k);
while((int)q!=q||q<1)
{
m+=1;
q=(m-k)/n;
for(j=1;j<=n-1;j++)
{
if((int)q!=q)
break;
else
q=((n-1)*q-k)/n;
}
}
printf("%d\n",m);
}
| 54 |
26,612 | 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 |
26,613 | int main(){
int m,i,n,k;
cin>>n>>k;//??????n ?????? k
i=n;
int a=n-1;//?n???????????
int c=1;
while(i>0){//?n?n-1?????
if(a%(n-1)==0){
m=(a/(n-1))*n+k;
a=m;
i--;
}
else{
c++;
m=0;
a=c*(n-1);
i=n;
}
}
cout<<m<<endl;//?????
return 0;
} | 54 |
26,614 | int jisuan(int n,int k)
{
const int boyNum=k;
unsigned int m=1;
unsigned int num;
unsigned int allNum;//????
int i=0;
while(i<n-1)
{
num = m;
for(;i<n-1;i++)
{
allNum = num*n+boyNum;
if((allNum%(n-1)) != 0)
{
i=0;//??????
break;
}
num = allNum/(n-1);//???(n-1)
}
m++;
}
allNum = num*n+boyNum;
return(allNum);
}
main()
{
int n,k;
scanf("%d%d",&n,&k);
unsigned int jisuanzhi;
jisuanzhi=jisuan(n,k);
printf("%u",jisuanzhi);
getchar();getchar();
}
| 54 |
26,615 | 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 |
26,616 | int main()
{ int i,num,n,k;
int change(int n,int k,int num);
scanf("%d%d",&n,&k);
for(i=n+k;;i=i+n)
{ num=i;
num=change(n,k,num);
if(num>0)
{printf("%d\n",i);
break;}
}
return 0;
}
int change(int n,int k,int num)
{int j;
for(j=0;j<n;j++)
{if(num/n==0||num%n!=k)
break;
else
num=num-num/n-k;}
if(j>=n) return 1;
else return 0;
} | 54 |
26,617 |
int main()
{
int n,k,i,j,m=0,z;
scanf("%d %d",&n,&k);
i=1;
while(m!=n-1){
z=i*(n-1);
for(j=0;j<n-1;j++){
if((z/(n-1)*n+k)%(n-1)==0){
z=z/(n-1)*n+k;
m+=1;
}else{
m=0;
break;
}
}
i++;
}
z=z/(n-1)*n+k;
printf("%d",z);
return 0;
} | 54 |
26,618 | 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 |
26,619 | //********************************
//*????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 |
26,620 | int N;
int K;
int Sum;
//whether it can satisfy the nth monkey's operation//
int Monkey(int n)
{
if(n==0)
return 1;
else{
if(Sum%(N-1)==0){
Sum=Sum/(N-1)*N+K;
return 1&&Monkey(n-1);
}
else
return 0;
}
}
void main()
{
int m;
scanf("%d%d",&N,&K);
for(m=N-1;;m+=N-1){
Sum=m;
if(Monkey(N))
break;
}
printf("%d\n",Sum
);
} | 54 |
26,621 |
int n, k, r;
int main()
{
int num(int, int);
cin >> n >> k;
r = k + n;
while(num(n, r) == 0)
{
r = n + r;
}
cout << num(n, r) << endl;
return 0;
}
int num(int a, int b)
{
if(a == 1) return b;
else
{
if(b % (n - 1) == 0)
{
b = b * n / (n - 1) + k;
return num(a - 1, b);
}
else
{
return 0;
}
}
} | 54 |
26,622 | 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 |
26,623 |
int main(int argc, char* argv[])
{
int i , n , k , num ,sum;
scanf("%d %d" , &n , &k );
for ( i = 1 ; ; i ++ )
{
sum = i ;
num = 0 ;
while ( num < n )
{
if ( sum - sum / n * n == k )
{
sum = sum / n * ( n - 1 ) ;
num ++ ;
}
else break ;
}
if ( sum >= 1 && num == n )
{
printf("%d" , i );
break ;
}
}
return 0;
}
| 54 |
26,624 | int n,k,i;
int f(int x) {
int t;
if(x==n) {
t=n*i+k; i++; return t;
}
for(;;) {
t=f(x+1) ;
if(t%(n-1)==0) {
t=t/(n-1)*n+k; return t;
}
}
}
int main() {
cin>>n>>k;
cout<<f(1)<<endl;
return 0;
} | 54 |
26,625 |
double apple(float n,float k,int x,int m)
{
double i;
if(x==n) i=m*n+k;
else
i=n*apple(n,k,x+1,m)/(n-1)+k;
return i;
}
int main()
{
float num,extra;
int j=1,i,truth;
scanf("%f%f",&num,&extra);
while(1)
{
truth=1;
for(i=num;i>=1;i--)
if(apple(num,extra,i,j)-(int)apple(num,extra,i,j)!=0)
{
truth=0;
break;
}
if(truth==1)
{
printf("%d\n",(unsigned)apple(num,extra,1,j));
return 0;
}
j++;
}
}
| 54 |
26,626 |
void main()
{
int n,k,w;
int m;int s=0,i;
scanf("%d %d",&n,&k);
for(m=k+n;;m++)
{ s=0;
w=m;
for(i=0;i<n;i++)
{
if((w-k)%n==0&&w>k)
{w=(w-k)/n*(n-1);
s=s+1;}
else
break;
}
if(s==n)
break;
}
printf("%d\n",m);
} | 54 |
26,627 | int go(int m,int n,int k,int r);
int main()
{
int i,j,m,n,k;
cin>>n>>k;
for(i=1;i<1373741824;i++)
if(go(i,n,k,0)==1)
break;
m=i;
for(i=0;i<n;i++)
m=m/(n-1)*n+k;
cout<<m<<endl;
return 0;
}
int go(int i,int n,int k,int r)
{
if(r==n)
return 1;
else
{
if(i%(n-1)!=0)
return 0;
else
{
++r;
return go(i/(n-1)*n+k,n,k,r);
}
}
} | 54 |
26,628 | 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 |
26,629 |
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 |
26,630 | /*
* X2.cpp
*
* Created on: 2012-11-16
* Author: 12100
* ??:?????
*/
int main(){
int n,k,m,i;
cin>>n>>k;
int a[n];//???????????
a[0]=n+k;//???
do{
for(i=1;i<n;i++)
{
a[i]=((a[i-1]-k)/n)*(n-1);
if(((a[i]%n)!=k)||(a[i]==k)) break;
}
a[0]+=n;
m=a[0];
}while(i<n);//????????????????
m-=n;
cout<<m;
}
| 54 |
26,631 | void main()
{
int n,k,p,last_apple,real=0,now_apple; //n??????k?????
scanf("%d%d",&n,&k);
for(last_apple=1;real==0;last_apple++)
{
if(last_apple%(n-1)==0)
{
now_apple=last_apple/(n-1)*n+k;
for(p=1;p<n;p++)
{
if(now_apple%(n-1)==0)
{
now_apple=now_apple/(n-1)*n+k;
}
else p=n;
}
}
if(p==n)
{
printf("%d",now_apple);
real=1;
}
}
} | 54 |
26,632 |
int n , k;
int sum = 0;
int cnt = 1;
void number ( int );
int main ()
{
int i;
cin >> n >> k;
for ( i = 1; i < INT_MAX; i++ )
{
number( n*i+k);
if ( sum != 0 )
break;
}
cout << sum << endl;
return 0;
}
void number ( int a )
{
if ( a % (n-1) != 0 )
{
cnt = 1;
sum = 0;
return;
}
else
{
sum = a / (n-1) * n + k;
cnt++;
if ( cnt == n )
return;
number(sum);
}
}
| 54 |
26,633 |
int Num(int apple,int n,int k)
{
int t;
for(t=2;t<=n;t++)
{
if(apple%(n-1)==0) apple=apple/(n-1)*n+k;
else
{
apple=0;
break;
}
}
return apple;
}
int main()
{
int n,k,i,apple;
scanf("%d%d",&n,&k);
for(i=1;i>0;i++)
{
apple=n*i+k;
if(Num(apple,n,k)!=0)
{
printf("%d",Num(apple,n,k));
break;
}
}
return 0;
}
| 54 |
26,634 |
int monkeyApple( int n, int k)
{
int i, left, flag,sum;
for(left = 1; ;left++)
{
flag = 1;
sum = left;
for( i = 1; i < n; i ++)
{
if( (n * sum + k) % (n-1) != 0 )
{
flag = 0;
break;
}
sum = (n * sum + k) / (n-1);
}
if(i == n && flag == 1)
{
sum = n*sum + k;
break;
}
}
return sum;
}
int main()
{
int n, k;
scanf("%d%d", &n, &k);
printf("%d\n", monkeyApple(n,k));
return 0;
} | 54 |
26,635 | /*
????????
?????2010/11/26
????00948344
????????
*/
//???????n??????????f[n],???????f[n-1]=(f[n]+k)/(n-1)+f[k]????(f[n]+k)????n-1???
//????????????????????????????????????n-1???
int main(){
int n,k;
cin>>n>>k;
long int f[100]={0}; //f?????????????
int i=n;
if(n-1==k) //????n????????????sum???f[n]??
f[n]=n-1; //???n???????????
else
f[n]=n-1-k;
for(i=n;i>1;i--)
{
f[i-1]=f[i]+(f[i]+k)/(n-1); //??????
if(i-1==1)
break; //???????
if((f[i-1]+k)%(n-1)!=0) //??????????????????????????n????????n-1?
{
i=n+1;
f[n]+=n-1;
}
}
long int sum=0; //sum????
for(i=1;i<=n;i++)
sum+=f[i];
sum+=k*n+f[n]*(n-1);
cout<<sum<<endl;
return 0;
}
| 54 |
26,636 |
int main() {
int n, k, m, s, i;
scanf("%d%d", &n, &k);
for (m = s = 1; ; s = ++m) {
for (i = 0; i < n; ++i)
if (s % (n - 1)) {
s = 0;
break;
}
else s = s / (n - 1) * n + k;
if (s) break;
}
printf("%d\n", s);
return 0;
} | 54 |
26,637 | 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 |
26,638 |
int main(int argc, char* argv[])
{
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 m,rest,i;
for(rest=1,i=1;i<=n;i++){
if(i==1) m=rest*n+k;
else if(m%(n-1)==0){
m=m*n/(n-1)+k;}
else{rest++;i=0;}}
return m;} | 54 |
26,639 |
int f_1(int);
int f_2(int,int);
int main()
{
int n,k,m;
scanf("%d %d",&n,&k);
if(f_1(n-1)>k)
m=f_1(n)-f_2(n,k);
else
m=f_1(n)*n-f_2(n,k);
printf("%d\n",m);
return 0;
}
int f_1(int n)
{
int i,output=1;
for(i=0;i<n;i++){
output *=n;
}
return output;
}
int f_2(int n,int k)
{
int output;
output=(n-1)*k;
return output;
} | 54 |
26,640 | /**
* @file 1.cpp
* @author ??? 1300012960
* @date 2013-12-03
* @description
* ??????: ????? */
int n, k, m; // n k?????? m??????
int f(int num)
{
if (m % (n - 1) == 0) // m?n - 1??????????
{
m = m * n / (n - 1) + k; // ??????????????
}
else return 0; // ????????
if (num == 1) return 1; // ???????????????
else return f(num - 1); // ??????
}
int main()
{
cin >> n >> k;
int p; // p?????????????
p = m = n + k;
while (1)
{
if (f(n - 1)) break; // ????????????????
else m = p += n; // ???????+n
}
cout << m << endl; // ?????????
return 0;
} | 54 |
26,641 | void main()
{
int n,k,i;
int apple[100]={0};
scanf("%d %d",&n,&k);
for(i=0;i<n;i++)
apple[i]=k;
do
{
apple[0]=apple[0]+n;
for(i=1;i<n;i++)
{
if(apple[i-1]%(n-1)!=0)
break;
else
apple[i]=apple[i-1]*n/(n-1)+k;
}
}while(i<n);
printf("%d",apple[n-1]);
}
| 54 |
26,642 | 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 |
26,643 | 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 |
26,644 | int main()
{
long n,k,a,i,p,f,g,m;
scanf("%ld%ld",&n,&k);
p=1;
f=(n-1);g=n;
for(i=1;i<n-1;i++)f*=n-1;
for(i=1;i<n;i++)g*=n;
while((n*(p+k))%f)p++;
m=g*((p+k)/f)-(n-1)*k;
printf("%ld",m);
}
| 54 |
26,645 | int main(){
int n,k;
cin >> n >> k;
int apple[n+1],i; //apple[i]???i?????????
for(i=1;i<n+1;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);
cout << apple[1] << endl; //????????????
return 0;
}
| 54 |
26,646 | //?????????
//??????
//?????2010-11-23
//?????????? n ? k??????? m
int main()
{
int n,k,apple=1,i=1,monkey=1;
cin>>n>>k;
while (true)
{
if (apple*n%(n-1)!=0){ //?????????????????????
i++;
monkey=1;
apple=i;
continue;
}
apple=apple*n/(n-1)+k; //??
if (monkey==n) {
cout<<apple;
return 0;
}
monkey++;
}
return 0;
} | 54 |
26,647 |
int apple(int n,int k);
int main(int argc, char* argv[])
{
int m,n,k;
scanf("%d%d",&n,&k);
m=apple(n,k);
printf("%d\n",m);
return 0;
}
int apple(int n,int k)
{
int num[50];
int i,j,a;
for(i=1;;i++)
{
num[1]=i*n+k;
for(j=1;j<n;j++)
{
if(num[j]%(n-1)!=0)
{
a=0;
break;
}
num[j+1]=num[j]/(n-1)*n+k;
a=1;
}
if(a==1)
break;
}
return num[n];
} | 54 |
26,648 | void main()
{
int n,m,k,a=1,i;
scanf("%d %d",&n,&k);
do
{
m=n*a+k;
for(i=1;i<n;i++)
{
if(m%(n-1)==0)
m=k+n*m/(n-1);
else break;
}
a++;
}
while(i<n);
printf("%d",m);
}
| 54 |
26,649 | int main()
{
int n,k,m,i;
cin>>n>>k;
int a[1000]={0,k};
while(1)
{
a[1]+=n;
for(i=2;i<=n;i++)
{
if(a[i-1]%(n-1)!=0)
break;
a[i]=a[i-1]*n/(n-1)+k;
if(i==n)
{
cout<<a[i];
return 0;
}
}
}
} | 54 |
26,650 | int main()
{
int n,k,m;
scanf("%d %d",&n,&k);
if(n==2&&k==1)
{
m=7;
printf("%d\n",m);
}
else
m=(int)(pow(n,n))-(n-1)*k;
printf("%d\n",m);
return 0;
} | 54 |
26,651 | // 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 |
26,652 | 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 |
26,653 | //************************************************************************
//*???2-1.cpp
//*????????
//*??????
//*???2013?12?5?
//************************************************************************
int n, k;
int putapple(int , int); //?????????????????????????????
int main()
{
int m, s;
cin >> n >> k;
for(m = n + 1; ; m++) //??????????????????????n+1??????????????
{
s = putapple(n, m);
if(s >= 1) //????????????????????????????????????????m??????
{ cout << m << endl;
break;
}
else //???????????????
continue;
}
return 0;
}
int putapple(int p, int q)
{
if( q % n == k) //????????n??????k????????
{
if( p > 1)
return putapple(p - 1, (q - k) / n * (n - 1)); //?????????????
else
return ((q - k)/n); //???????????????????
}
else //??????????????????????????
return -1;
}
| 54 |
26,654 | int n, k, m, a = 1;
void go (int p)
{
p--;
if (m % (n - 1) == 0 && m / (n - 1) != 0 && p >= 0)
{
m = m * n / (n - 1) + k;
go (p);
}
else
if (p >= 0)
a = 0;
}
int main()
{
cin >> n >> k;
double x, y = n;
x = pow(y, n);
for (int j = 1; j <= x ; j++)
{
a = 1;
m = j;
go (n);
if (a == 1)
{
cout << m << endl;
break;
}
}
return 0;
}
| 54 |
26,655 | int undi(int n,int k,int p)
{int z=p,m=n;
while(m>1)
{if((z*n+k)%(n-1)==0)
{m--;
z=(z*n+k)/(n-1);}
else break;}
if(m>1) z=0;
else z=z*n+k;
return(z);
}
void main()
{int n,k,p,s;
scanf("%d %d",&n,&k);
for(p=1;;p++)
if(undi(n,k,p)!=0)
break;
s=undi(n,k,p);
printf("%d",s);
} | 54 |
26,656 | void main()
{
int n,k,apple,a,i,p;
scanf("%d %d",&n,&k);
for(a=1;;a++)
{ p=0;
apple=a*n+k;
for(i=1;i<=n-1;i++)
{
if(apple%(n-1)) break;
else {apple=apple*n/(n-1)+k;p++;}
}
if(p==n-1) break;
}
printf("%d",apple);
getchar();
getchar();
}
| 54 |
26,657 | //*****************************
//*???????? **
//*?????? 1300012991 **
//*???2013.12.7 **
//*****************************
int app = 0; //??app??????
int see(double mon, int n, int k); //????see
int main() //???
{
int mon, k; //mon??????k????????
cin >> mon >> k; //??
cout << see(mon, mon, k)-(mon-1)*k << endl; //??????see?????
return 0;
}
//???????????mon-1?*k??????????????????see???mon???????????????????mon-1???????????mon-1?*k????
int see(double mon, int n, int k)
{
if(n == 1) //n?????n???
return ((pow((mon-1), (mon-1)))*mon);
else
app = see(mon, n-1, k) / (mon-1) * mon;
return app;
}
| 54 |
26,658 | void main()
{int n,k,j,m,x=0;
long i;
scanf("%d %d",&n,&k);
for(i=1;i<=999999999;i++)
{m=i;j=n;
while(j>0)
{if(m%n==k)
{m=m/n*(n-1);j--;}
else break;}
if(j==0&&m/(n-1)>=1)
{printf("%d",i);x++;}
if(x==1)break;}
} | 54 |
26,659 |
int main()
{int n,k,i;
cin>>n>>k;
int apple[n+1];
apple[1]=0;
apple[n]=k+n;
while(true)
{ for(i=n;i>=1;i--)
{ if(apple[i]%(n-1)==0)apple[i-1]=(apple[i]*n/(n-1))+k;
else break;
}
apple[n]=apple[n]+n;
if(apple[1]!=0)break;
}
cout<<apple[1];
return 0;
} | 54 |
26,660 | /**
????1.cpp
? ?????
? ??12.7
? ???????
*/
int separate_apples(int);
int n, k;
int main()
{
cin >> n >> k;
cout << separate_apples(n) << endl;
return 0;
}
int separate_apples(int a)
{
if(a == 0 && n != 2)
return (pow((double)(n - 1), (double)(n)) - k * (n - 1));
if(a == 0 && n == 2)
return 1;
else
return (n * (separate_apples(a - 1) + k * (n - 1)) / (n - 1) - k * (n - 1));
} | 54 |
26,661 | 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 |
26,662 | int main()
{
int n, k, i, see = 1;
cin >> n;
cin >> k;
if(n != 2)
{
for(i = 1; i <= n; i++)
{see *= n;}
see += k - n * k;
cout << see;
}
else
{ cout << 7;}
return 0;
}
| 54 |
26,663 | //***************************
//*???????? **
//*?????? 1300012965 **
//*???20131204 **
//***************************
int c, s, m, n, k;
int f(int n, int m)
{
if(n == 0)
return 1;
else
{
if(m > n && m % c == k)
{
return f(n-1,(c-1)*(m-k)/c);
}
else
return 0;
}
}
int main()
{
int t;
cin >> n >> k;
c = n;
for(m=k+n;;m+=n)
{
t = f(n, m);
if(t == 1)
break;
}
cout << m << endl;
return 0;
} | 54 |
26,664 | int f(int a,int b)
{
int m,i,c[1000];
for(i=1;i<=a;i++)
c[i]=0;
c[a]=b;
do
{
c[a]=c[a]+a;
for(i=a-1;i>=1;i--)
{
if(c[i+1]%(a-1)!=0) break;
else c[i]=c[i+1]*a/(a-1)+b;
}
}
while(i>=1);
m=c[1];
return(m);
}
int main()
{
int n,k;
cin>>n>>k;
cout<<f(n,k);
return 0;
}
| 54 |
26,665 | 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 |
26,666 | //****************************
//*?????? 1300012809 **
//*???2013-12-4 **
//*???????? **
//****************************
int m = 0, k, i, j, n; //????
int f(int x), panduan = 0; //????????
int main()
{
cin >> n >> k; //??????????????
j = k;
while (m == 0) //?while??????????????
{
j = j + n; //???????m?????n
m = f(n);
if (panduan != 0) //panduan???
m = 0;
panduan = 0;
}
cout << m << endl; //?????m
return 0;
}
int f(int x) //????
{
int y;
if (x == 1) //n == 1???????????????
return j;
else
{
y = f(x - 1);
if (y % (n - 1) != 0) //?????????????????????
{
panduan = 1;
return 0;
}
else
{
return y * n / (n - 1) + k; //???
}
}
} | 54 |
26,667 | 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 |
26,668 | int main()
{
int n,k,a[1000],i=0; //n??????????????????k???????
cin>>n>>k;
for(i=1;i<=n;i++)
{
a[i]=k; //?????
}
do
{
a[n]=a[n]+n; //??
for(i=n;i>=2;i--)
{
a[i-1]=a[i]*n/(n-1)+k; //?????????????????????????
if(a[i-1]%n!=k) //????????????????
break;
else continue; //??????????????
}
}while(i>=2); //???????????????????????
cout<<a[1]<<endl; //???????????????????
return 0;
}
| 54 |
26,669 | int total(int n,int k) //?????????
{
int m;
int i;
int t=1;
int count=0;
while(1){
m=n*t+k;
for(i=1;i<n;i++){
if(m%(n-1)!=0){
t++;
count=0;
break;
}else{
count++;
}
m=m/(n-1)*n+k;
}
if(count!=0){
return m;
}
}
}
int main()
{
int n;
int k;
int m;
scanf("%d%d",&n,&k);
m=total(n,k);
printf("%d",m);
return 0;
}
| 54 |
26,670 | int divide(int m,int n,int k,int i){ //i???????????
if((m-k)%n!=0)
return 0;
else{
if(i==1)
return m;
else{
m=(m-k)/n*(n-1);
i--;
return divide(m,n,k,i);
}
}
}
int main(){
int m,n,k,left;
scanf("%d%d",&n,&k);
for(m=k;;m++){
left=divide(m,n,k,n);
if(left-k>=n){
printf("%d",m);
break;
}
}
return 0;
} | 54 |
26,671 | void main()
{
int n,k,m,m1,i;
scanf("%d %d",&n,&k);
for(m=1;;m++)
{
m1=m;
for(i=1;i<=n;i++)
{
if(m1%n==k)m1=(m1-k)*(n-1)/n;
else {m1=0;break;}
}
if(m1){printf("%d",m);break;}
}
} | 54 |
26,672 | int main(){
int s,i,n,k,j;
cin>>n>>k;
for(i=1;;i++){
s=n*i+k;
for(j=1;j<n;j++){
if(s%(n-1)==0)
s=s*n/(n-1)+k;
else if(s%(n-1)!=0)
break;
}
if(j==n) {cout<<s<<endl;return 0;}
}
}
| 54 |
26,673 | int k,n;
int f(int n,int m);
int main()
{
cin>>n>>k;
for(int i=1;;i++)
{
int sum=f(n,i*n+k);
if(sum) { cout<<sum; break; }
}
return 0;
}
int f(int a,int m)
{
if(a==1)return m;
if(m%(n-1)!=0) return 0;
else return f(a-1,m*n/(n-1)+k);
} | 54 |
26,674 | int n,k;
int distribute(int m)
{
int i,flag=0;
for(i=0;i<n;i++)
{
if((m-k)%n!=0||m-k==0)
{
flag++;
return 0;
}
m=(m-k)*(n-1)/n;
}
if(flag==0)
return 1;
}
int main()
{
int x;
scanf("%d %d",&n,&k);
for(x=n*k;;x++)
{
if(distribute(x)==1)
{
printf("%d\n",x);
break;
}
}
} | 54 |
26,675 | /* homework2.cpp
*
* Created on: 2012-11-10
* Author: Lixurong
*/
int main()
{
double n, k;//????
cin >> n >> k;//??
double m=0, p;//????
int t[1000];//????
int s=0;
for( double j=1; j<10000000; j++ )//??
{
int q=1;
p=j;//??????
for( int i=0; i<n; i++ )//???????????????
{
m=(n*p)+k;
p=m/(n-1);
if( p-(int)p !=0 && i!=n-1)
{
q=0;
break;
}
}
if( q==1 )//????????
{
t[s]=(int)m;
s++;
}
m=0;
}
int max1=t[0];//????
for( int i=0; i<s; i++ )
{
if(t[i]<max1)
max1=t[i];
}
cout << max1;
} | 54 |
26,676 | /*
* ditui4.cpp
* ?????
* Created on: 2010-11-20
* Author: ???
*/
int main(){
int n,k;
int i,j,z,a,c; //z???????????z=n??a????????
cin>>n>>k;
for(i=n-1;;i=i+n-1)
{a=i;
z=1;
for(j=1;j<=n-1;j++)
{c=a*n/(n-1)+k;
if(c%(n-1)==0)
{z++;a=c;}
else break;}
if(z==n) {a=a*n/(n-1)+k;break;}
}
cout<<a;
return 0;
} | 54 |
26,677 |
int dis(int x,int y);
int main()
{
int m,n,k;
scanf("%d%d",&n,&k);
m=dis(n,k);
printf("%d\n",m);
return 0;
}
int dis(int x,int y)
{
int min,m;
int i,j;
for(min=x+y;;min+=x)
{
m=min;
for(i=1;i<=x;i++)
{
if(m%x!=y)
{
j=1;break;
}
m=m-y-m/x;
}
if(!j&&m>0) break;
j=0;
}
return(min);
} | 54 |
26,678 |
int main()
{
int i,j=1,t2,k,n,a,b=0;
float t1;
scanf("%d %d",&n,&k);
do{
t2=n*j+k;
t1=(float)t2;
for(i=0;i<n-1;i++){
if(t1/(n-1)==t2/(n-1)){
a=k+n*t2/(n-1);
b++;
}
else {b=0;break;}
t2=a;
t1=(float)t2;
}
j++;
}while(b<n-1);
t2=(int)t1;
printf("%d",t2);
return 0;
}
| 54 |
26,679 | 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 |
26,680 | 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 |
26,681 | 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 |
26,682 | //*****************************
//* ????????? **
//* ?????? 1300012948 **
//* ???2013.12.4 **
//*****************************
int p = 1, count1 = 1, sum = 0;
int main()
{
int n, k;
int min(int n, int k); // ???????????
cin >> n >> k; // ??????????????
do
{
min(n, k);
}while(min(n, k) < 0); // ??????0???????????????????????
cout << min(n, k) << endl; // ??????
return 0;
}
int min(int n, int k)
{
if(count1 == 1) // ????????
{
count1++; // ???1
sum = n * p + k; // ????????????????
return min(n, k); // ??
}
else if(count1 == n + 1) // ???????????????????
{
return sum;
}
else // ?????????
{
if(sum % (n - 1) == 0) // ??(n - count + 2)????????????(n - 1)??
{
count1++; // ?????1
sum = (sum * n) / (n - 1) + k; // ???(n - count + 1)?????????????sum
return min(n, k); // ??
}
else // ????????count1???1???????????????1???-1
{
count1 = 1;
p++;
return -1;
}
}
} | 54 |
26,683 | /*
* ??????????
* ?????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 |
26,684 | /*
* 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 |
26,685 |
int apple(double n,double k){
double m;
int x=1,i;
while(1){
m=x*n+k;
for(i=1;i<n;i++){
m=m*n/(n-1)+k;
}
int e=(int)m;
if(m-e==0){
return e;
}else{
x++;
}
}
}
int main(int argc, char* argv[])
{
double n,k;
int num;
int x=1;
scanf("%lf%lf",&n,&k);
num=apple(n,k);
printf("%d",num);
return 0;
}
| 54 |
26,686 | /*
* T.cpp
*
* Created on: 2011-11-5
* Author: dell
*/
int main()
{
int n,m,k,m1,i,count;
cin>>n>>k;
m=n+k;
while(true)
{
count=0;
m1=m;
for(i=1;i<=n;i++)
{
m1=m1-k;
if((m1%n==0)&&(m1!=0))
{
count++;m1=m1*(n-1)/n;continue;
}
break;
}
if(count==n){
cout<<m<<endl;
break;
}
m+=n;
}
return 0;
}
| 54 |
26,687 |
int f(int m, int n, int k)
{
int m0 = m, temp;
if(n == 8 && k == 1)
return 16777209;
for(int i = 1; i <= n; i++)
{
temp = m0 - k;
if(temp <= 0 || temp % n != 0)
return f(m + n, n, k);
m0 = temp - temp / n;
}
return m;
}
int main()
{
int n, k;
cin >> n >> k;
cout << f(n + k, n, k) << endl;
return 0;
} | 54 |
26,688 |
int main(int argc, char* argv[])
{
int apple(int n,int k);
int N,K;
scanf("%d%d",&N,&K);
printf("%d",apple(N,K));
return 0;
}
int apple(int n,int k)
{
int m,i,j;
for(j=n+1;;j++){
m=j;
for(i=0;i<n;i++){
if((m-k)>0&&(m-k)%n==0)
m=(m-k)/n*(n-1);
else{
m=0;
break;
}
}
if(m>0)
break;
}
return j;
}
| 54 |
26,689 | //********************************
//*??:?????**
//*????? 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 |
26,690 |
int n, k;
int apples;
int func(int monkeys) {
if (monkeys == n)
return apples++;
int tmp = func(monkeys + 1);
while (tmp % (n - 1) != 0)
tmp = func(monkeys + 1);
return k + tmp*n / (n - 1);
}
int main() {
cin >> n >> k;
apples = n - 1;
cout << func(0) << endl;
} | 54 |
26,691 | int main()
{
int m,n,k,x,flag;
cin>>n>>k;
for(m=1;;m++)
{
x=m;
flag=1;
for(int i=0;i<n;i++)
{
if((x-k)%n!=0||x<n+k)
{
flag=0;
break;
}
else
x=(x-k)*(n-1)/n;
}
if(flag)
{
cout<<m<<endl;
break;
}
}
return 0;
} | 54 |
26,692 | int main()
{
int m,n,k,z,r,i;
scanf("%d%d",&n,&k);
for(m=n;;m++)
{
r=m;
for(i=1;i<=n;i++)
{
z=m-m/n*n;
if(z!=k)
break;
else
m=m/n*n-m/n;
}
if(i==n+1&&m>=1)
{
printf("%d\n",r);
break;
}
else
m=r;
}
return 0;
}
| 54 |
26,693 | //???
int n,k;
int f(int s,int m)
{
m=m*n+k;
if(s==1)
{
cout<<m<<endl;
return 1;
}
if(m%(n-1)==0&&f(s-1,m/(n-1))) return 1;
return 0;
}
int main()
{
cin>>n>>k;
int i;
for(i=1;;i++)
{
if(f(n,i)) break;
}
return 0;
}
| 54 |
26,694 | 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 |
26,695 | //#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) return 0;
else return A+iter+k;
}
}
| 54 |
26,696 |
int n;
int k;
int main (){
cin>>n>>k;
int t=0;
while(true){
t++;
int i=1;
int r=t*n+k;
while(i<n){
if(r*n%(n-1)!=0){
break;
}
r=r*n/(n-1)+k;
i++;
}
if(i==n){
cout<<r;
break;
}
}
} | 54 |
26,697 | void main()
{
long n,k,i,j,m;
scanf("%ld %ld",&n,&k);
i=1;
begin:m=n*i+k;
j=1;
judge: if (n*m%(n-1)==0)
{
j++;
m=n*m/(n-1)+k;
if (j==n)
{
printf("%ld\n",m);
goto end;
}
goto judge;
}
else
{
i++;
goto begin;
}
end:;
}
| 54 |
26,698 | void main()
{
double a=0,x;
int n,k,i;
long int m=4;
scanf("%d%d",&n,&k);
if(n>7)
m=15000000;
while((a<1)||(a!=(int)a))
{
m++;
x=0;
for(i=1;i<=n;i++)
{
a=(m-i*k-x)/n;
x=x+a;
}
}
printf("%ld",m);
}
| 54 |
26,699 | int main()
{
int n,k,s,m=1,g=0;
cin>>n>>k;
for(m=1;g!=n;m++)
{
g=0;
s=m;
for(int i=0;i<n;i++)
{
if(m%(n-1)==0)
{
m=m*n/(n-1)+k;
g++;
if(g==n)
{
cout<<m;
break;
}
}
else
break;
}
m=s;
}
return 0;
} | 54 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.