id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
16,500 | /**
* ? ? ??????.cpp
* ? ?????
* ?????2010?12?03?
* ?????????????????
*/
int f ( int ); //????
int main()
{
int n;
cin>>n;
if ( n == 1 ) //?????1?????End
cout<<"End"<<endl;
else
for ( int i = 0; i < 1000; i++ ) //???????f
{
n = f(n);
if ( n == 1 )
{
cout<<"End"<<endl; //????????1????End?????
break;
}
}
return 0;
}
int f ( int n )
{
if ( n % 2 == 0 ) //??n?????????2???
{
cout<<n<<"/"<<2<<"="<<n/2<<endl;
return n/2;
}
else
{
cout<<n<<"*"<<3<<"+"<<1<<"="<<n*3+1<<endl; //??n?????????3??1???
return n*3+1;
}
}
| 34 |
16,501 |
void result(int a,int b)
{
if(a==1)
cout<<"End"<<endl;
else if(a%2==1)
{
cout<<a<<"*3+1="<<a*3+1<<endl;
result(a*3+1,a);
}
else if(a%2==0)
{
cout<<a<<"/2="<<a/2<<endl;
result(a/2,a);
}
}
int main()
{
int a;
cin>>a;
result(a,a);
return 0;
}
| 34 |
16,502 | int main()
{
int inta=0,i,a=0,b=0;//inta????????i?????
cin>>inta;
for(i=0;;i++)
{
if(inta%2==0)
{
a=inta/2;
cout<<inta<<"/2="<<a<<endl;
inta=a;
}
if(inta%2!=0&&inta!=1)
{
b=inta*3+1;
cout<<inta<<"*3"<<"+1="<<b<<endl;
inta=b;
}
if(inta==1)
{
break;
}
}
cout<<"End";
cin.get();cin.get();cin.get();cin.get();
return 0;
} | 34 |
16,503 | int main()
{
int a,b,d;
float c;
scanf("%d",&a);
while(a>1)
{
b=a%2;
d=a*3+1;
c=(float)a/2;
if(b==1)
printf("%d*3+1=%d\n",a,d);
else if(b==0)
printf("%d/2=%.0f\n",a,c);
if(b==1) a=d;
else a=c;
}
printf("End");
}
| 34 |
16,504 | int main()
{
int n,i,a[100];
cin>>n;
a[0]=n;
for(i=0;i<100;i++)
{
if(a[i]%2==1&&a[i]!=1)
{
a[i+1]=a[i]*3+1;
cout<<a[i]<<"*3+1="<<a[i+1]<<endl;
}
if(a[i]%2==0)
{
a[i+1]=a[i]/2;
cout<<a[i]<<"/2="<<a[i+1]<<endl;
}
if(a[i]==1)
{
cout<<"End";
break;
}
}
return 0;
} | 34 |
16,505 | /*
* ????.cpp
*
* Created on: 2012-11-28
* Author: Lenovo
*/
void f(int n)
{
if(n==1) return;
if(n==2)
{
cout<<"2/2=1"<<endl;return;
}
else
{
if((n%2)==1)
{
cout<<n<<"*3+1="<<3*n+1<<endl;
n=3*n+1;
f(n);
}
else
{
cout<<n<<"/2="<<n/2<<endl;
n=n/2;
f(n);
}
}
}
int main()
{
int n;
cin>>n;
f(n);
cout<<"End";
return 0;
}
| 34 |
16,506 | //****************************************
//*??????? **
//*????? 1100012925**
//*???2011.11.13 **
//****************************************
void oushu( int n ) //??n????????
{
cout << n << "/2=" << n / 2 << endl;
}
void jishu ( int n ) //??n????????
{
cout << n << "*3+1=" << n * 3 + 1 << endl;
}
void jiaogu ( int n )
{
if ( n % 2 ==0 ) //??n???
{
oushu ( n ); //??oushu??
n = n / 2;
}
else //??n???
{
jishu ( n ); //??jishu??
n = n * 3 + 1;
}
if ( n > 1 ) //n???????1
jiaogu ( n ); //????jiaogu??
}
int main()
{
int n;
cin >> n;
if ( n > 1 ) //?n??1
jiaogu ( n ); //??jiaogu??
cout << "End" << endl; //??n=1???End
return 0;
}
| 34 |
16,507 | void verify(int n)
{
if(n!=1)
{
if(n%2==1)
cout<<n<<"*3+1="<<n*3+1<<endl;
else
cout<<n<<"/2="<<n/2<<endl;
verify((n%2==1? n*3+1:n/2));
}
else cout<<"End";
}
int main()
{
int m;
cin>>m;
verify(m);
return 0;
}
| 34 |
16,508 | main ()
{
int a,b,c,d,e,f,g;
scanf("%d",&a);
if (a!=1)
{
while (a!=1)
{
if (a%2==0)
{
b=a/2;
printf("%d/2=%d\n",a,b);
a=b;
}
else
{
b=a*3+1;
printf("%d*3+1=%d\n",a,b);
a=b;
}
}
}
printf("End");
}
| 34 |
16,509 |
int main()
{int a,n,i;
scanf("%d",&n);
for(i=0;i<100;i++)
{ if(n==1)
{printf("End");
break;}
else
{
if (n%2==0)
{a=n/2;
printf("%d/2=%d\n",n,a);
n=a;
continue;}
else if(n%2==1)
{
a=n*3+1;}
printf("%d*3+1=%d\n",n,a);
n=a;
continue;}}
return 0;
}
| 34 |
16,510 | int jiaogu(int);
int main()
{
int n;
cin>>n;
while(n!=1)
n=jiaogu(n);
cout<<"End";
return 0;
}
int jiaogu(int n)
{
if((n%2==1)&&(n!=1))
{
cout<<n;
n=n*3+1;
cout<<"*3+1="<<n<<endl;
return n;
}
else
{
if(n%2==0)
{
cout<<n;
n=n/2;
cout<<"/2="<<n<<endl;
return n;
}
else
return n;
}
} | 34 |
16,511 | void main()
{
int x,y;
scanf("%d",&x);
while(x!=1)
{
if(x%2==0)
{
y=x/2;
printf("%d/2=%d\n",x,y);
x=y;
continue;
}
if(x%2!=0)
{
y=x*3+1;
printf("%d*3+1=%d\n",x,y);
x=y;
}
}
printf("End");
}
| 34 |
16,512 | void main()
{
int k;
scanf("%d",&k);
while(k!=1)
{
printf("%d",k);
if(k%2==1)
{
k=k*3+1;
printf("*3+1=%d\n",k);
}
else
{
k=k/2;
printf("/2=%d\n",k);
}
}
printf("End");
} | 34 |
16,513 | main()
{
int a,b,c,d,e,i,j,n;
scanf("%d",&n);
do
{
if(n==1)
printf("End");
else
{
if(n%2==1)
{ printf("%d",n);
n=n*3+1;
printf("*3+1=%d\n",n);
if(n==1)
printf("End");
}
if(n%2==0)
{
printf("%d",n);
n=n/2;
printf("/2=%d\n",n);
if(n==1)
printf("End");
}
}
}while(n!=1);
} | 34 |
16,514 | /*
* T1.cpp
*
* Created on: 2012-11-18
* Author: weiwan
* Function:????
*/
int guess(int a) //????
{
int ans;
if (a == 1){cout <<"End" <<endl;return 0;} //????????
if (a % 2 != 0) //????
{
ans = a * 3 + 1;
cout <<a <<"*3+1=" <<ans <<endl;
guess(ans); //??????
}
if (a % 2 == 0) //????
{
ans = a / 2;
cout <<a <<"/2=" <<ans <<endl;
guess(ans); //??????
}
return 0;
}
int main()
{
int n;
cin >>n;
guess(n);
return 0;
} | 34 |
16,515 | int main()
{
int n,i;
cin>>n;
while(n!=1)
{
if(n%2==0)
{
cout<<n<<"/2=";
n=n/2;
cout<<n<<endl;
}
else
{
cout<<n<<"*3+1=";
n=n*3+1;
cout<<n<<endl;
}
}
cout<<"End"<<endl;
cin.get(); cin.get(); cin.get();
return 0;
}
| 34 |
16,516 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
for (;;)
{
if (n==1)
{
printf("End\n");
break;
}
else if(n%2==1)
{
printf("%d*3+1=%d\n",n,(3*n+1));
n=3*n+1;
continue;
}
else if (n%2==0)
{
printf("%d/2=%d\n",n,(n/2));
n=n/2;
continue;
}
}
return 0;
}
| 34 |
16,517 | int main()
{
int n,m,k;
cin>>n;
while(n>1)
{
if(n%2==0)
{
cout<<n<<"/2="<<n/2<<endl;
n=n/2;
}
else
{
cout<<n<<"*3+1="<<n*3+1<<endl;
n=n*3+1;
}
}
cout<<"End"<<endl;
return (0);
} | 34 |
16,518 |
int main(){
int n;
int a,e;
a=0;
scanf("%d",&n);
if(n==1){
printf("End");
}
else if(n!=1){
a=n;
for(;a!=1;){
if(a%2==0){
e=a;
a=a/2;
printf("%d/2=%d\n",e,a);
if(a==1){
printf("End");
break;
}
}
else if(a%2==1){
e=a;
a=a*3+1;
printf("%d*3+1=%d\n",e,a);
if(a==1){
printf("End");
break;
}
}
}
}
return 0;
} | 34 |
16,519 | /**
* @file 4.cpp
* @auther ???
* @date 2011/10/26
* @description
* ?????????????????
*/
int suan1(int p)
{
cout<<p<<"*"<<3<<"+"<<1<<"="<<p*3+1<<endl;
return(p*3+1);
}
int suan2(int p)
{
cout<<p<<"/"<<2<<"="<<p/2<<endl;
return(p/2);
}
int main()
{
int t;
cin>>t;
while (t>1)
{
if (t % 2==0)
t= suan2(t);
else
t=suan1(t);
}
cout<<"End";
return(0);
}
| 34 |
16,520 |
void turn(int number);
int main()
{
int n;
cin >> n;
turn(n);
cout << "End";
return 0;
}
void turn(int number)
{
if(number != 1)
{
if(number % 2 == 0)
{
cout << number << "/2=" ;
number = number / 2 ;
cout << number << endl ;
}
else
{
cout << number << "*3+1=" ;
number = number * 3 + 1 ;
cout << number << endl ;
}
turn(number);
}
return ;
}
| 34 |
16,521 | int j(int x);
int main()
{
int e,k,n,i,l,a[1000],b[1000];
scanf("%d",&n);
a[0]=n;
k=n;
l=0;
e=0;
while(1)
{
if(n==1)
{
l++;
a[l]=0;
e++;
break;
}
if(n%2==0)
{
b[l]=0;
}
else
{
b[l]=1;
}
n=j(n);
a[l]=n;
l++;
a[l]=j(n);
e++;
}
if(e==1)
{
printf("End");
}
if(e==2)
{
printf("%d/2=%d\n",2,1);
printf("End");
return 0;
}
for(i=0;i<e-1;i++)
{
if(i==0)
{
if(b[i]==0)
{
printf("%d/2=%d\n",k,a[i]);
}
else
{
printf("%d*3+1=%d\n",k,a[i]);
}
}
else if(i>=1&&i<e-2)
{
if(b[i]==0)
{
printf("%d/2=%d\n",a[i-1],a[i]);
}
else
{
printf("%d*3+1=%d\n",a[i-1],a[i]);
}
}
else if(i==e-2)
{
printf("%d/2=%d\n",a[i-1],a[i]);
printf("End");
return 0;
}
}
return 0;
}
int j(int x)
{
int a=0;
if(x%2==0)
{
a=x/2;
}
else
{
a=3*x+1;
}
return a;
}
| 34 |
16,522 | void main()
{
int n,i,x;scanf("%d",&n);
if(n!=1)
for(i=0;;i++)
{
if(n%2==1)
{
x=n*3+1;
printf("%d*3+1=%d\n",n,x);if(x==1)break;
n=x;
}
else
{
x=n/2;
printf("%d/2=%d\n",n,x);if(x==1)break;
n=x;
}
}
printf("End");
}
| 34 |
16,523 | int main ()
{
int n=0;
cin >>n;
while(n!=1)
{
if(n%2==0)
{
cout<<n<<"/2=";
n=n/2;
cout<<n<<endl;;
}
else
{
cout<<n<<"*3+1=";
n=n*3+1;
cout<<n<<endl;
}
}
cout <<"End"<<endl;
cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
} | 34 |
16,524 | void fenjie(int n)
{
if(n==1)
{printf("End");
return;}
int m=0;
if(n%2==0)
{m=n>>1; printf("%d/2=%d\n",n,m);}
else{m=3*n+1;printf("%d*3+1=%d\n",n,m);}
fenjie(m);
}
int main()
{
int n;
cin>>n;
fenjie(n);
return 0;
} | 34 |
16,525 | int main(){
int n;int i;
cin>>n;
if(n==1)cout<<"End"<<endl;else{
for(i=1;;i++){
if(n==1)break;
if(n%2!=0){cout<<n<<'*'<<'3'<<'+'<<'1'<<'='<<3*n+1<<endl;
n=3*n+1;
}
else {cout<<n<<'/'<<'2'<<'='<<n/2<<endl;
n=n/2;
}
}
cout<<"End"<<endl;}
return 0;
}
| 34 |
16,526 | /*
* jiaogu.cpp
*
* Created on: 2012-11-26
* Author: dell
*/
void solve(int n){
if(n%2==1 && n!=1){
cout<<n<<"*"<<3<<"+"<<1<<"="<<n*3+1<<endl;
n=n*3+1;
}
if(n%2==0){
cout<<n<<"/"<<2<<"="<<n/2<<endl;
n=n/2;
}
if(n!=1){
solve(n);
}
if(n==1){cout<<"End";}//????????
}
int main(){
int n;
cin>>n;
solve(n);
return 0;
}//??n?????????????
| 34 |
16,527 |
int main()
{
int n,count=0; cin>>n;
int a[10000];
while (n>1)
{
count++;
if (n%2==0) {printf("%d/2=%d\n",n,n/2); a[count]=1,n=n/2;}
else {printf("%d*3+1=%d\n",n,n*3+1); a[count]=2,n=n*3+1;}
}
cout<<"End";
return 0;
}
| 34 |
16,528 | int main ()
{
int a,b,c,i;
scanf("%d",&a);
for (i=1;a!=1;i++)
{
if (a%2==0)
{ b=a/2;
printf("%d/2=%d\n",a,b);
a=b;
continue;
}
else if (a!=1)
{
c=a*3+1;
printf("%d*3+1=%d\n",a,c);
a=c;
}
else
break;
}
printf("End\n");
return 0;
} | 34 |
16,529 | int main()
{int n=0,a=0,b=0;
cin>>n;
while(1)
{ if(n==1)break;
if(n%2==0){a=n/2;
cout<<n<<"/2="<<a<<endl;
n=n/2;}
else{b=3*n+1;
cout<<n<<"*3+1="<<b<<endl;
n=3*n+1;
}
}cout<<"End"<<endl;
return 0;} | 34 |
16,530 | int main(){
int n,m,i;
scanf("%d",&n);
if(n==1){
printf("End");
}else{
for(i=1;n!=1;i++){
m=n;
if(n%2!=0){
n=n*3+1;
printf("%d*3+1=%d\n",m,n);
}else if(n%2==0){
n=n/2;
printf("%d/2=%d\n",m,n);
}
if(n==1){
printf("End");
}
}
}
return 0;
} | 34 |
16,531 | /*
* ????.cpp
*
* Created on: 2010-12-15
* Author: Administrator
*/
void f(int n){
if(n==1){cout<<"End"<<endl;
}
else if(n%2==0){
cout<<n<<"/2="<<n/2<<endl;
f(n/2);
}
else{
cout<<n<<"*3+1="<<n*3+1<<endl;
f(3*n+1);
}
}
int main(){
int n;
cin>>n;
f(n);
return 0;
}
| 34 |
16,532 | void main()
{
int n,ans;
scanf("%d",&n);
if(n==1)printf("End");
else
{
for(ans=n;ans!=1;)
{
if(ans%2)
{
printf("%d*3+1=%d\n\n",ans,ans*3+1);
ans=ans*3+1;
}
else
{
printf("%d/2=%d\n\n",ans,ans/2);
ans=ans/2;
}
}
printf("End");
}
}
| 34 |
16,533 |
int main()
{
int n;
cin>>n;
if(n==1)
{
cout<<"End";
return 0;
}
while(n!=2)
{
if(n%2)
{
cout<<n<<'*'<<3<<'+'<<1<<'=';
n=n*3+1;
cout<<n<<endl;
}
else
{
cout<<n<<'/'<<2<<'=';
n=n/2;
cout<<n<<endl;
}
}
cout<<2<<'/'<<2<<'='<<1<<endl;
cout<<"End";
return 0;
}
| 34 |
16,534 | int main()
{
long x,m;
scanf("%ld",&x);
while (x!=1)
{
if (x%2==0) {printf("%ld/2=%ld\n",x,x/2);x=x/2;}
else {m=x*3+1;printf("%ld*3+1=%ld\n",x,m);x=m;}
}
if (x==1)printf("End");
}
| 34 |
16,535 | int main()
{
int n;
int func(int n);
scanf("%d",&n);
if(n==1) printf("End");
else {func(n);printf("End");}
return 0;
}
int func(int n)
{
if(n%2==0) {n=n/2;printf("%d/2=%d\n",2*n,n);}
else {n=3*n+1;printf("%d*3+1=%d\n",(n-1)/3,n);}
if(n!=1) func(n);
}
| 34 |
16,536 | void check(int);
int main()
{
int n;
cin >> n;
check(n);
return 0;
}
void check(int n)
{
if (n == 1)
{
cout << "End";
}
else if (n % 2 == 0)
{
cout << n << "/2=";
n = n / 2;
cout << n << endl;
check(n);
}
else if ((n % 2 ==1) && (n != 1))
{
cout << n <<"*3+1=";
n = n * 3 + 1;
cout << n << endl;
check(n);
}
} | 34 |
16,537 | main()
{
int a,b;
scanf("%d",&a);
loop:if(a==1)
{
printf("End");
getchar();
getchar();
return 0;
}
else if(a%2!=0)
{
{
b=a*3+1;
}
printf("%d*3+1=%d\n",a,b);
a=b;
}
else if(a%2==0)
{
{
b=a/2;
}
printf("%d/2=%d\n",a,b);
a=b;
}
goto loop;
} | 34 |
16,538 | void oushu(int a)
{
void qishu(int a);
printf("%d/2=%d\n",a,a/2);
if(a/2==1)
{
printf("End");
printf("\n");
}
else
{
if((a/2)%2==0)
oushu(a/2);
else if((a/2)%2!=0)
qishu(a/2);
}
}
void qishu(int a)
{
void oushu(int a);
printf("%d*3+1=%d\n",a,a*3+1);
if((a*3+1)==1)
{
printf("End");
printf("\n");
}
else
{
if((a*3+1)%2==0)
oushu((a*3+1));
else qishu((a*3+1));
}
}
void main()
{
void oushu(int a);
void qishu(int a);
int n;
scanf("%d",&n);
if(n==1)
{
printf("End");
printf("\n");
}
else
{
if(n%2==0)
oushu(n);
else qishu(n);
}
} | 34 |
16,539 | int main()
{
int n;
scanf("%d",&n);
turn:if (n!=1)
{
if (n%2==0)
{
printf("%d/2=%d\n",n,n/2);
n=n/2;
goto turn;
}
else
{
printf("%d*3+1=%d\n",n,n*3+1);
n=n*3+1;
goto turn;
}
}
printf("End");
}
| 34 |
16,540 |
int proc(int i)
{
int ans;
if(i%2==1)
{
ans=i*3+1;
printf("%d*3+1=",i);
}
else {
ans=i/2;
printf("%d/2=",i);
}
return ans;
}
int main () {
int n;
scanf("%d",&n);
while (n>1) {
n=proc(n);
printf("%d\n",n);
}
printf("End");
return 0;
}
| 34 |
16,541 | int EVEN(int a);
int ODD(int b);
int main()
{
int d=0;
int n;
scanf("%d",&n);
for(int i=0;d!=5;i++)
{
if(n==1)
{
d=5;
printf("End\n");
}
else
{
if(n%2==0)
n=EVEN(n);
else
n=ODD(n);
}
}
}
int EVEN(int a)
{
printf("%d/2=%d\n",a,a/2);
a=a/2;
return a;
}
int ODD(int b)
{
printf("%d*3+1=%d\n",b,b*3+1);
b=b*3+1;
return b;
} | 34 |
16,542 | void calcu(int k);
int main()
{
int n;
cin>>n;
if(n==1)
cout<<"End"<<endl;
else
calcu(n);
return 0;
}
void calcu(int k)
{
if(k%2==0)
{
cout<<k<<"/2="<<(k/2)<<endl;
if(k/2==1)
cout<<"End"<<endl;
else
calcu(k/2);
}
else
{
cout<<k<<"*3+1="<<(3*k+1)<<endl;
if(3*k+1==1)
cout<<"End"<<endl;
else
calcu(3*k+1);
}
} | 34 |
16,543 | //10.12 ????
//??? 1100012799
//??????
int main ()
{
int num;
cin>>num;
if (num==1) cout<<"End"<<endl;//?????1???????,????????
else if (num!=1)//????1 ??????
{
do
{
if (num%2==0)//????
{
num=num/2;
cout<<num*2<<"/2="<<num<<endl;//
}
else if (num%2==1)//????
{
num=num*3+1;
cout<<(num-1)/3<<"*3+1="<<num<<endl;
}
}
while (num!=1);//??????1?????
cout<<"End"<<endl;
}
return 0;
}
| 34 |
16,544 | /* ????.cpp
* Created on: 2012-11-20
* Author: ??
*/
int ans(int n) {
if (n == 1)
return 0;
if (n % 2 == 0) {
cout << n << "/2=" << n / 2 << endl;
return ans(n / 2);//??
} else {
cout << n << "*3+1=" << n * 3 + 1 << endl;
return ans(n * 3 + 1);//??
}
}
int main() {
int n;
cin >> n;//??
ans(n);
cout << "End";//??
return 0;
}
| 34 |
16,545 | int main()
{
int n,i,a;
scanf("%d",&n);
for(i=1;;i++){
if(n==1){
printf("End\n");
break;
}
if(n%2==0){
a=n/2;
printf("%d/2=%d\n",n,a);
if(a==1){
printf("End\n");
break;
}
else{
n=a;
}
}
if(n%2!=0){
a=n*3+1;
printf("%d*3+1=%d\n",n,a);
if(a==1){
printf("End\n");
break;
}
else{
n=a;
}
}
}
return 0;
}
| 34 |
16,546 |
void main()
{
int i,n;
scanf("%d",&n);
while(1)
{
if(n==1)
{
printf("End\n");
break;
}
else
{
if(n%2==0)
{
printf("%d/2=%d\n",n,n/2);
n=n/2;
}
else
{
printf("%d*3+1=%d\n",n,n*3+1);
n=n*3+1;
}
}
}
}
| 34 |
16,547 | int main()
{
int a,b;
scanf("%d",&a);
if(a!=1)
{
do
{
if(a%2==1)
{
b=a*3+1;
printf("%d*3+1=%d\n",a,b);
}
else if(a%2==0)
{
b=a/2;
printf("%d/2=%d\n",a,b);
}
a = b;
}
while(a!=1);
printf("End");
}
else
{
printf("End");
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
} | 34 |
16,548 | int odd (int a);
int even (int a);
int main ()
{
int n;
cin>>n;
while (n!=1) //???1???????
{
if (n%2==0)
n=even (n);
else
n=odd (n);
}
cout<<"End";
return 0;
}
int odd (int a) //?????????
{
cout<<a<<"*3+1=";
a=a*3+1;
cout<<a<<endl;
return a;
}
int even (int a) //?????????
{
cout<<a<<"/2=";
a=a/2;
cout<<a<<endl;
return a;
} | 34 |
16,549 | int main()
{
int a;
scanf("%d",&a);
while (a!=1)
{
if(a%2!=0)
{
printf("%d*3+1=%d\n",a,3*a+1);
a=3*a+1;
}
else
{
printf("%d/2=%d\n",a,a/2);
a=a/2;
}
}
printf("End");
getchar();
getchar();
getchar();
return 0;
} | 34 |
16,550 |
int main()
{
int i,j,m,n,p;
char str[10001],a,b;
scanf("%d",&m);
while(m!=1)
{
if (m%2!=0)
{
n=m;
m=n*3+1;
printf("%d*3+1=%d\n",n,m);
}
else
{
p=m;
m=p/2;
printf("%d/2=%d\n",p,m);
}
}
printf("End");
}
| 34 |
16,551 | int main()
{
int i,a;
scanf("%d",&a);
if (a!=1)
while ((a/2!=1) || (a%2!=0))
if (a%2==0)
{
printf("%d/2=%d\n",a,a/2);
a=a/2;
}
else
{
printf("%d*3+1=%d\n",a,a*3+1);
a=a*3+1;
}
if (a!=1) printf("%d/2=%d\n",a,a/2);
printf("End\n");
return 0;
} | 34 |
16,552 | int main()
{
int a,b;
cin>>a;
while(a!=1)
{
if(a%2==1)
{
cout<<a<<"*3+1=";
a=a*3+1;
cout<<a<<endl;
}
else
{
cout<<a<<"/2=";
a=a/2;
cout<<a<<endl;
}
}
cout<<"End"<<endl;
}
| 34 |
16,553 | int main()
{
int m,n,i;
scanf("%d",&m);
int jiao(int );
if(m!=1)
{
do{
if(m%2==1)
{
n=m*3+1;
printf("%d*3+1=%d\n",m,n);
}
if(m%2==0)
{
n=m/2;
printf("%d/2=%d\n",m,n);
}
m=n;
}
while(n!=1);
}
printf("End");
getchar();
getchar();
getchar();
} | 34 |
16,554 | int main()
{
int i,num;//num????,i????
cin>>num;//??
if(num!=1)//??num????1,???????
{
for(i=0;num!=1;i++)
{
if(num%2==0) {cout<<num<<"/2="<<num/2<<endl;num=num/2;}//??????
else {cout<<num<<"*3+1="<<num*3+1<<endl;num=num*3+1;}
}
cout<<"End";//??END
}
else cout<<"End"<<endl;//?num?1,??end
return 0;
}
| 34 |
16,555 | //*****************************
//*???????? *
//*? ???? 1100062709 *
//*???2011 .11 .15 *
//*****************************
int f (int number) //?????
{
int n;
if (number == 1) //????????1 ????????
{
cout << "End" << endl; //??end
return 0;
}
else
{
if(number % 2 == 0) //????????
{
n = number / 2;
cout << number << "/2" << "=" << n << endl; //??????????????
number = n; //?n???number
}
else
{
n = 3 * number + 1; //????????
cout << number<< "*3+1=" << n << endl; //????????????
number = n;
}
return f(number); //??????
}
}
int main() //?????
{
int number;
cin >> number; //?????
f(number); //??????
return 0; //?????
}
| 34 |
16,556 | int main(){
int n;
int m;
scanf("%d",&n);
int i;
for(i=0;i<MAX;i++){
if(n!=1){
if(n%2!=0){
m=n*3+1;
printf("%d*3+1=%d\n",n,m);
n=m;
}else{
m=n/2;
printf("%d/2=%d\n",n,m);
n=m;
}
}else{
printf("End");
break;
}
}
return 0;
}
| 34 |
16,557 | int jiaogu(int n)
{
if(n==1)
{
printf("End\n");
return 0;
}
else if(n%2)
{
printf("%d%c%d%c%d%c%d\n",n,42,3,43,1,61,n*3+1);
n=n*3+1;
jiaogu(n);
return 0;
}
else
{
printf("%d%c%d%c%d\n",n,47,2,61,n/2);
n=n/2;
jiaogu(n);
return 0;
}
}
int main()
{
int n;
scanf("%d",&n);
jiaogu(n);
return 0;
} | 34 |
16,558 | int main()
{
int n; //???n
cin>>n;
int x; //??????x
x=n; //???x
for (;x!=1;) //x??1????????
{
if (x%2==1) //????
{
cout<<x<<"*3+1=";
x=x*3+1;
cout<<x<<'\n';
}
else //????
{
cout<<x<<"/2=";
x=x/2;
cout<<x<<'\n';
}
}
cout<<"End"; //??
return 0; //?> w <?
}
| 34 |
16,559 |
void jg(int a)
{
int t =0;
if (a==1) cout<<"End";
else if (a%2==1)
{
t=a*3+1;
cout<<a<<"*3+1="<<t<<endl;
jg(t);
}
else
{
t=a/2;
cout<<a<<"/2="<<t<<endl;
jg(t);
}
}
int main()
{
int a=0;
cin>>a;
jg(a);
return 0;
} | 34 |
16,560 | int main ()
{
int n,i,a,b;
cin>>n;
if (n==1)
cout<<"End"<<endl;
else
{
for (i=0; ; i++)
{
if (n%2==0)
{ a=n/2;
cout<<n<<"/"<<2<<"="<<a<<endl;
n=n/2;}
else
{b=3*n+1;
cout<<n<<"*"<<3<<"+"<<1<<"="<<b<<endl;
n=3*n+1;}
if (n==1)
break;
}
cout<<"End"<<endl;}
return 0;
} | 34 |
16,561 | main()
{
int a;
scanf("%d",&a);
while(a>1)
{
if(a%2==1)
{
printf("%d*3+1=%d\n",a,a*3+1);a=a*3+1;
}
if(a%2==0);
{
printf("%d/2=%d\n",a,a/2); a=a/2;
}
}
printf("End");
getchar();
getchar();
return 0;
} | 34 |
16,562 |
int function(int a)
{
int b;
if(a%2==1)
{
b=3*a+1;
printf("%d*3+1=%d\n",a,b);
return b;
}
else if(a%2==0)
{
b=a/2;
printf("%d/2=%d\n",a,b);
return b;
}
}
void main()
{
int n;
scanf("%d",&n);
if(n==1)
printf("End\n");
else
{
while(1)
{
n=function(n);
if(n==1)
{printf("End\n");break;}
}
}
} | 34 |
16,563 |
int f1(int a)
{
int b;
b = a / 2;
cout << a << "/2=" << b << endl;
a = b;
return a;
}
int f2(int a)
{
int b;
b = a * 3 + 1;
cout << a << "*3+1=" << b << endl;
a = b;
return a;
}
int main()
{
int a;
cin >> a;
while (a != 1)
{
if ((a%2) == 0)
{
a = f1(a);
}
else
{
a = f2(a);
}
}
cout << "End" << endl;
cin.get();
cin.get();
return 0;
} | 34 |
16,564 | int temp(int x)//????
{
if(x%2==1)
{
cout<<x<<"*3+1="<<x*3+1<<endl;
return x*3+1;
}
else
{
cout<<x<<"/2="<<x/2<<endl;
return x/2;
}
}
int main()
{
int n;
cin>>n;
while(n!=1)
{
n=temp(n);
}
cout<<"End"<<endl;
getchar();
getchar();
return 0;
} | 34 |
16,565 | main()
{
int n,m;
scanf("%d",&n);
while(1)
{
if(n%2==0 && n!=1)
{
m=n/2;
printf("%d/2=%d\n",n,m);
n=m;
}
if(n%2!=0 && n!=1)
{
m=n*3+1;
printf("%d*3+1=%d\n",n,m);
n=m;
}
if(n==1) {printf("End");
break;
}
}
}
| 34 |
16,566 | void main()
{
int n;
scanf("%d",&n);
for(;;)
{
if(n==1) break;
if(n%2==1)
{
printf("%d*3+1=%d",n,n*3+1);
n=n*3+1;
}
else
{
printf("%d/2=%d",n,n/2);
n=n/2;
}
printf("\n");
}
printf("End");
} | 34 |
16,567 | //**************************************
//*???????
//*????? 1100012780
//*???2011.11.03
//**************************************
void kakutani (int n)
{
int i;
if (n == 1)
{
cout<<"End";
return;
}
else
{
if (n % 2 == 0)
{
cout<<n<<"/"<<2<<"="<<n/2<<endl;
n = n / 2;
}
else
{
cout<<n<<"*3+1="<<n * 3 + 1<<endl;
n = n * 3 + 1;
}
}
kakutani(n);
}
int main()
{
int n;
cin>>n;
kakutani(n);
return 0;
}
| 34 |
16,568 | void check(int);
int main()
{
int i, p, n;
cin >> n;
check(n);
cout << "End" << endl;
return 0;
}
void check(int n)
{
if(n == 1)
return;
else
{
if(n % 2 == 0)
{
cout << n << "/" << 2 << "=" << n / 2 << endl;
n /= 2;
}
else
{
cout << n << "*" << 3 << "+" << 1 << "=" << 3 * n + 1 << endl;
n = 3 * n + 1;
}
check(n);
}
}
| 34 |
16,569 | int main()
{
int n,m;
scanf("%d",&n);
while(n!=1)
{if(n%2==0){m=n;n=m/2;printf("%d/2=%d\n",m,n);continue;}
if(n%2!=0&&n!=1){m=n;n=m*3+1;printf("%d*3+1=%d\n",m,n);continue;} }
printf("End\n");
return 0;
} | 34 |
16,570 | /*
* qimo_3.cpp
*
* Created on: 2010-12-17
* Author: 10265
*/
int main()
{
int result;
cin>>result;
while(result!=1){
if(result==1)break;
if(result%2==0){
if(result==1)break;
cout<<result<<"/2="<<result/2<<endl;
result=result/2;
}
if(result%2==1){
if(result==1)break;
cout<<result<<"*3+1="<<result*3+1<<endl;
result=result*3+1;
}
}
cout<<"End"<<endl;
return 0;
} | 34 |
16,571 | int main()
{
int n,i,a,b;
scanf("%d",&n);
if(n==1)
{
printf("End");
}
else
{
do
{
i=n%2;
if(i==1)
{
a=n*3+1;
printf("%d*3+1=%d\n",n,a);
n=a;
}
else
{
b=n/2;
printf("%d/2=%d\n",n,b);
n=b;
}
}
while(n!=1);
printf("End");
}
return 0;
}
| 34 |
16,572 | // ????.cpp : Defines the entry point for the console application.
// ???????????????????1???????
int cal(int n) //?????cal?????????1???????
{
if(n==1) //?????1????End
cout<<"End"<<endl;
else if(n%2==0) //???????????n/2=(n/2)?????
{
cout<<n<<"/2="<<(n/2)<<endl;
return cal(n/2);
}
else //???????????n*3+1=?3*n+1??????
{
cout<<n<<"*3+1="<<(3*n+1)<<endl;
return cal(3*n+1);
}
}
int main() //?????
{
int n,m;
cin>>n;
m=cal(n); //????cal??
return 0;
} | 34 |
16,573 | /*
* jiaogu.cpp
*
* Created on: 2011-12-23
* Author: 11161
*/
int jiaogu(int n)
{ int result;
if(n%2==1)
{result=n*3+1;
cout<<n<<"*3+1="<<result<<endl;
}
else
{
result=n/2;
cout<<n<<"/2="<<result<<endl;
}
return result;
}
int main()
{
int n,num;
cin>>n;
if(n==1){cout<<"End"<<endl;return 0;}
else
num=n;
while(1)
{
num=jiaogu(num);
if(num==1)break;
}
cout<<"End"<<endl;
}
| 34 |
16,574 |
int main()
{
int a,b,c,d;
scanf("%d",&a);
b=a%2;
c=3*a+1;
d=a/2;
if (a==1)
{printf("End");
}
else
{ for (;a != 1;){
for (;b == 0 && a != 1 ; )
{
d=a/2;
printf("%d/2=%d\n",a,d);
a=d;
b=a%2;
}
for (;b == 1 && a != 1 ; )
{
c=3*a+1;
printf("%d*3+1=%d\n",a,c);
a=c;
b=a%2;
}
}
printf("End");
}
return 0;
}
| 34 |
16,575 | /*
* qmfx03.cpp
*
* Created on: 2011-1-1
* Author: Administrator
*/
int main()
{
int n;
cin>>n;
while(true)
{
if(n==1)
{
cout<<"End"<<endl;
break;
}
if(n!=1&&n%2==1)
{
cout<<n<<"*3+1="<<n*3+1<<endl;
n=n*3+1;
}
if(n%2==0)
{
cout<<n<<"/2="<<n/2<<endl;
n=n/2;
}
if(n==1)
{
cout<<"End"<<endl;
break;
}
}
return 0;
}
| 34 |
16,576 |
void ji(int shu){
int m;
m=shu*3+1;
cout<<shu<<"*3+1="<<m<<endl;
void ou(int shu);
if (m%2==1) ji(m);
else ou(m);
}
void ou(int shu){
int m;
m=shu/2;
cout<<shu<<"/2="<<m<<endl;
if (m==1) cout<<"End";else
if (m%2==1) ji(m);
else ou(m);
}
int main(){
int n;
cin>>n;
if (n==1) cout<<"End";else
if (n%2==1) ji(n);
else ou(n);
} | 34 |
16,577 | int num(int n)
{
if (n==1)
return 1;
else if (n%2==0)
{
printf("%d/2=%d\n",n,n/2);
num(n/2);
}
else
{
printf("%d*3+1=%d\n",n,n*3+1);
num(n*3+1);
}
}
int main()
{
int n;
cin >> n;
num(n);
cout << "End";
return 0;
}
| 34 |
16,578 | int fun(int m); //??????
int a; //??????
int main()
{
int n;
cin>>n;
a = n;
if(n == 1)
cout<<"End"<<endl; //?????1,???End
else
{
while(fun(a) != 1) //?????1,?????fun()??,???1??
fun(a);
cout<<"End"<<endl;
}
return 0;
}
int fun(int m) //?????
{
if(m % 2 != 0)
{
a = m * 3 + 1;
cout<<m<<"*3+1="<<a<<endl;
return a;
}
else
{
a = m / 2;
cout<<m<<"/2="<<a<<endl;
return a;
}
}
| 34 |
16,579 | int main()
{
int a,b,c,i;
scanf("%d",&a);
if(a!=1){
for(i=0;i<1000;i++){
if(a%2==0){
b=a/2;
printf("%d/2=%d\n",a,b);
a=b;
}
else{
c=a*3+1;
printf("%d*3+1=%d\n",a,c);
a=c;
}
if(a==1)
break;
else
continue;
}
printf("End");
}
else
printf("End");
return 0;
}
| 34 |
16,580 | /*
* jiaogucaixiang.cpp
*
* Created on: 2012-11-20
* Author: AK
*/
int jiaogu(int a){ //??????
if(a==1) {cout<<"End"<<endl;return 0;} //?????1??return 0????
else if(a%2==1) {cout<<a<<"*3+1="<<3*a+1<<endl;return jiaogu(3*a+1);}//???????????????
else {cout<<a<<"/2="<<a/2<<endl;return(jiaogu(a/2));}//???????????????
return 0;//??
}
int main(){
int a,b;
cin>>a;
b=jiaogu(a);
return 0;
}
| 34 |
16,581 | int main()
{
int a=0;//??????;
cin>>a;
int yushu=0;
yushu=a%2;
for(;a!=1;)
{
if(yushu==0)
{
cout<<a<<"/2="<<(a*0.5)<<endl;
a=a/2;
yushu=a%2;
}
else
{
cout<<a<<"*3+1="<<(a*3+1)<<endl;
a=a*3+1;
yushu=a%2;
}
}
cout<<"End"<<endl;
return 0;
} | 34 |
16,582 | int main()
{
int n;
int jiaogu(int n);
cin>>n;
if(n==1)
cout<<"End"<<endl;
else
{
jiaogu( n);
}
return 0;
}
void jiaogu(int n)
{
do
{
if(n%2==0)
{n=n/2;
cout<<2*n<<"/"<<"2="<<n<<endl;}
else
{n=3*n+1;
cout<<(n-1)/3<<"*3+1="<<n<<endl;}
}while(n!=1);
cout<<"End"<<endl;
}
| 34 |
16,583 |
int main(int argc, char* argv[])
{
int n,i,a[100];
scanf("%d",&n);
a[1]=n;
if (n!=1)
{for (i=1;a[i]!=1;i++)
{ if (a[i]%2==0)
{ a[i+1]=a[i]/2;
printf("%d/2=%d\n",a[i],a[i+1]);
}
if (a[i]%2==1)
{ a[i+1]=a[i]*3+1;
printf("%d*3+1=%d\n",a[i],a[i+1]);
}
}
printf("End");
}
if (n==1)
printf("End");
return 0;
}
| 34 |
16,584 | int rec(int a)
{
int b;
if ((a%2) == 1)
{
b = a *3 + 1;
cout << a << "*3+1=" << b << endl;
return b;
}
else
{
b = a / 2;
cout << a << "/2=" << b << endl;
return b;
}
}
int rec2(int(a))
{
if (a > 1)
{
a = rec(a);
rec2(a);
}
else
cout << "End" << endl;
return 0;
}
int main()
{
int n ;
cin >> n;
rec2(n);
return 0;
} | 34 |
16,585 | /**
* @file 1.cpp
* @author ???
* @date 2011-11?06
* @description
* ??????:????
*/
// ??????ji???
int ji(int m)
{
cout << m << '*' << 3 << '+' << 1;
m = m * 3 + 1;
cout << '=' << m << endl;
return m; // ?m???n
}
// ??????ou???
int ou(int m)
{
cout << m << '/' << 2;
m = m / 2;
cout << '=' << m << endl;
return m;
}
int main()
{
int n;
cin >> n;
while (n!=1)
{
if((n % 2) == 1)
{
n = ji(n); // ????????ji
}
else
{
n = ou(n); // ?????ou
}
}
cout << "End" << endl; // ???1???
return 0;
} | 34 |
16,586 | int a[100][100];
void change(int n)
{
if (n==1)
{
cout<<"End"<<endl;
}
else
{
if (n%2==0)
{
cout<<n<<'/'<<2<<'='<<n/2<<endl;
change(n/2);
}
else
{
cout<<n<<'*'<<3<<'+'<<1<<'='<<n*3+1<<endl;
change(n*3+1);
}
}
}
int main()
{
int n;
cin>>n;
change (n);
return 0;
} | 34 |
16,587 | /*
* 123.cpp
*
* Created on: 2013-11-29
* Author: 13248
*/
/*
* 20131129.cpp
*
* Created on: 2013-11-29
* Author: 13248
*/
void jiaogu(int x)
{
if(x==1) {cout<<"End"<<endl;return;}
else
{
if(x%2==1) {cout<<x<<"*3+1="<<x*3+1<<endl;return jiaogu(x*3+1);}
else
{
cout<<x<<"/2="<<x/2<<endl;return jiaogu(x/2);
}
}
}
int main()
{
int n;
cin>>n;
jiaogu(n);
return 0;
}
| 34 |
16,588 | main()
{
int i,n;
scanf("%d",&n);
for(i=n;i!=1;)
{
if(n==1)
{
printf("End");
break;
}
if(i%2==0)
{
printf("%d/2=%d\n",i,i/2);
i=i/2;
}
else
{
printf("%d*3+1=%d\n",i,i*3+1);
i=i*3+1;
}
}
printf("End");
}
| 34 |
16,589 | main()
{
int a,b=0;
scanf("%d",&a);
do
{
if(a==1)
break;
if(a%2!=0)
{
b=a;
a=a*3+1;
printf("%d*3+1=%d\n",b,a);
}
else
{
b=a;
a=a/2;
printf("%d/2=%d\n",b,a);
}
}
while(a!=1);
if(a==1)
printf("End");
getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
} | 34 |
16,590 | main(){
int a;
int b;
int c;
int d;
scanf("%d",&a);
b=a%2;
if(b==0)
{
while(b==0)
{
c=a/2;
b=c%2;
printf("%d/2=%d\n",a,c);
a=c;
}
if(a==1)
printf("End");
else{
while((b!=0)&&(a!=1))
{
d=a*3+1;
printf("%d*3+1=%d\n",a,d);
a=d;
b=a%2;
while(b==0)
{
c=a/2;
b=c%2;
printf("%d/2=%d\n",a,c);
a=c;
}
}
printf("End");
}
}
else
{
if(a==1)
printf("End");
else
{
while((b!=0)&&(a!=1))
{
d=a*3+1;
printf("%d*3+1=%d\n",a,d);
a=d;
b=a%2;
while(b==0)
{
c=a/2;
b=c%2;
printf("%d/2=%d\n",a,c);
a=c;
}
}
printf("End");
}
}
}
| 34 |
16,591 | int main( ){
int n,a,i;
scanf("%d",&n);
do{
if(n==1){
printf("End");
n=0;
}
if(n!=0&&n!=1&&n%2==1){
a=n*3+1;
printf("%d*3+1=%d\n",n,a);
n=a;
}
if(n!=0&&n!=1&&n%2==0){
a=n/2;
printf("%d/2=%d\n",n,a);
n=a;
}
i++;
}
while(n!=0);
return 0;
}
| 34 |
16,592 | void jiao(int n)
{
int m,k;
if(n==1)
{
printf("End\n");
}
if(n!=1)
{
if(n%2!=0)
{
m=n*3+1;
printf("%d*3+1=%d\n",n,m);
jiao(m);
}
if(n%2==0)
{
k=n/2;
printf("%d/2=%d\n",n,k);
jiao(k);
}
}
}
void main()
{
int n;
scanf("%d",&n);
jiao(n);
}
| 34 |
16,593 | int main(){
int s,t;
scanf("%d",&s);
if(s==1){
printf("End");
}
while(s!=1){
if(s%2!=0){
t=s;
s=t*3+1;
printf("%d*3+1=%d\n",t,s);
}
if(s%2==0){
t=s;
s=t/2;
printf("%d/2=%d\n",t,s);
}
if(s==1){
printf("End");
}
}
return 0;
} | 34 |
16,594 | int main()
{
int n,i=1;
scanf("%d",&n);
if(n==1)
printf("End");
else{
while(i){
if(n%2!=0){
printf("%d*%d+%d=%d\n",n,3,1,n*3+1);
n=n*3+1;
}
else{
printf("%d/%d=%d\n",n,2,n/2);
n=n/2;
if(n==1)
i=0;
}
}
printf("End");
}
return 0;
} | 34 |
16,595 | main()
{
int m,n,i,j,k,l,sum,t;
scanf("%d",&m);
while (m>1)
{
if (m%2==1)
{
printf("%d*3+1=%d\n",m,m*3+1);
m=m*3+1;
}
else
{
printf("%d/2=%d\n",m,m/2);
m=m/2;
}
}
printf("End");
}
| 34 |
16,596 | /**
* ??
* 2010?12?4
* ????
*/
int g_n; //g_n??????
int jishu(int); //????
int oushu(int); //????
int main ()
{
cin >> g_n;
if (g_n == 1)
cout << "End" << endl;
else
{
for (;g_n != 1;)
{
if (g_n % 2 == 0) //?n?= 1?????????????????????
{
g_n = oushu(g_n);
}
else
g_n = jishu(g_n);
}
cout << "End" << endl;
}
return 0;
}
int jishu(int n) //????????????
{
cout << n << "*3+1=" << n * 3 + 1 << endl;
return n * 3 + 1;
}
int oushu(int n) //????????????
{
cout << n << "/2=" << n / 2 << endl;
return n / 2;
}
| 34 |
16,597 | int main()
{
int n,sum,i,t;
scanf("%d",&n);
sum=n;
for(i=0;sum!=1;i++)
{
if(sum%2!=0){t=sum;sum=sum*3+1;printf("%d*3+1=%d\n",t,sum);}
else if(sum%2==0){t=sum;sum=sum/2;printf("%d/2=%d\n",t,sum);}
}
printf("End");
return 0;
}
| 34 |
16,598 |
void gujiao(int x)
{
if(x%2)
{
printf("%d*3+1=%d\n",x,x*3+1);
x=x*3+1;
}
else
{
printf("%d/2=%d\n",x,x/2);
x=x/2;
}
if(x==1) printf("End");
else gujiao(x);
}
int main()
{
int n,i;
scanf("%d",&n);
if(n==1) {printf("End");return 0;}
else gujiao(n);
return 0;
}
| 34 |
16,599 | int main()
{
int n,m,p;
cin>>n;
if(n==1)
cout<<"End";
if(n!=1)
{ while(1)
{
if(n%2==1)
{
m=n*3+1;
cout<<n<<"*3"<<"+1"<<"="<<m<<endl;
n=m;
}
else
{ p=n/2;
cout<<n<<"/2"<<"="<<p<<endl;
n=p;}
if(n==1)break;
}
cout<<"End";}
return 0;
}
| 34 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.