OJ Board

Code: Select all

#include <stdio.h>

int getiterations(int i) {
    int c = 1;

    while (i > 1) {
        if (i % 2 != 0)
            i = (3 * i) + 1;
        else
            i = i / 2.0;
        c++;
        if (c == 2) {
            /* Do stuff */
        }
    }
    return c;
}


int main(int argc, char *argv[]) {
    while (!feof(stdin)) {
        int i, j, a, c = 0;
        scanf("%d %d", &i, &j);
        for (a = i; a < j; a++) {
            int iter = getiterations(a);
            c = (iter > c ? iter : c);
        }
        printf("%d %d %d\n", i, j, c);
    }

    return 0;
}

Code: Select all

while (cin >> i >> j) {     // while there's one more test to be solved...
    solve it;
    cout << i << " " << j << " " << answer << endl;
}

Code: Select all

Scanner getInput = new Scanner(System.in);
String input;
int start;
int stop;
while (getInput.hasNextLine() && (input = getInput.nextLine()).length() != 0)
{
	Scanner newLine = new Scanner(input);
	start = newLine.nextInt();
	stop = newLine.nextInt();
		      
	computeSet(start, stop);
}

Code: Select all

#include<stdio.h>
int analysis(char* string, int* infor);
int main(void){
	int store[100100];
	 int i,k;
	int c=0;
	int count=0;
	int input[2];
	int array[100100];
	int max=0;
	char in[100];
	c=(int)gets((char*)in);
	memset(store,0,1500);
	while(c!=(int)NULL){
		printf("%s",in);
		c=0;
		analysis((char*)&in,(int*)&input);
		for(i=input[0];i<=input[1];i++){
			k=i;
			if(store[i]==0){
				while(k!=1){
					if(k%2==1){
						k=k*3+1;
					}else if(k%2==0){
						k=k/2;
					}
					count++;
				}
				count++;
				store[i]=count;
				array[c]=count;
			}else{
				array[c]=store[i];
			}
			count=0;
			c++;
		}
		for(i=0;i<(input[1]-input[0]);i++){
			if(max<array[i]){
				max=array[i];	
			}

		}
		printf(" %d\n",max);
		max=0;
		c=(int)gets(in);
	}
	return 0;
}
int analysis(char* string ,int * infor){
	int k=0;
	int i=0;
	int temp=0;
	for(;k<2;k++){
		while(string[i]!=' '&string[i]!='\0'){
			temp=temp*10+(int)string[i]-48;
			i++;
		}
		infor[k]=temp;
		i++;	
		temp=0;
	}
	if(infor[0]>infor[1]){
		i=infor[1];
		infor[1]=infor[0];
		infor[0]=i;
	}
}

Code: Select all

import java.io.BufferedReader;
import java.util.*;
import java.io.IOException;
import java.io.InputStreamReader;

class Main {
    public static void main(String[] args) throws IOException {
        try{
        int x=0;
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        while (x==0) {
            String line = reader.readLine();
            if (line == null) {
                x=1;
            }
            if(x!=1){
            	

            StringTokenizer tokenizer = new StringTokenizer(line);
            int num1 = Integer.parseInt(tokenizer.nextToken());
            int num2 = Integer.parseInt(tokenizer.nextToken());
            if(num1>10000||num2>10000/||num1<0||num2<0)break;
            int temp,countmax=1,count,min,max; 
            if (num1 < num2) { min=num1; max=num2; } else { min=num2; max=num1; }
            for(int i=min;i<=max;i++)
            {
              count=1;
              temp=i;
              while(i!=1)
              {
                 if((i%2)==1)
                    i=i*3+1;
                 else
                    i=i/2;
                 count++;
              }
              if(countmax<count)
                 countmax=count;              
              i=temp;
          	}
          	System.out.println(num1+" "+num2+" "+countmax);  
          }            
        }    
    }
}
}

Code: Select all

code removed get AC

Code: Select all

System.out.println(line + " " + c);