OJ Board

iT was quite easy to get AC with this understaning of the inputs!

Dont bother I got it!

I got AC ,even though with lots of CPU and MEM use.

[cpp]
#include "stdio.h"
int main(void)
{
int i,j,k,max=1,m2=1;

while(scanf("%d %d",&i,&j)==2) {
printf("%d %d ",i,j);
if(i>j){
i ^= j;
j ^= i;
i ^= j;
}
k=j;
while(k>=i)
{
if (k!=1){
j=k;
while (j!=1){
if (j % 2 !=0){
j=(3*j)+1;
}
else{
j/=2 ...

This code works! But takes too long!

Any suggestions Plz!

[cpp]
#include <stdio.h>
#include <malloc.h>


int n=1,ROWS,COLS;
int **array;
int sum_line(int **array1,int *ind,int *ii,int *jj);

int main(void){
int i,j,n,x,y,xi,xj,ni,nj,sum=0,sumq=0,sumtotal=0,val;

sumtotal=0;
scanf("%d",&n ...

plz, some1!

what does "OutPut Limit Exceeded" means?


#include "stdio.h"
int main(void)
{
unsigned long i,j,k,max=1,m2=1;

while(scanf("%lu %lu",&i,&j)!=0) {
printf("%u %u ",i,j);
if(i>j){
i ^= j;
j ^= i;
i ^= j;
}
k=j;
while(k>=i)
{
if (k!=1){
j=k;
while (j!=1){
if (j % 2 !=0){
j=(3*j)+1;
}
else ...

the code is this:
#include "iostream.h"
#include "stdio.h"
int main(void)
{
unsigned long i,j,k,max=1,m2=1;

while(scanf("%lu %lu",&i,&j)!=0) {
cout<<i<<" "<<j<<" ";
if(i>j){
i ^= j;
j ^= i;
i ^= j;
}
k=j;
while(k>=i)
{
if (k!=1){
j=k;
while (j!=1){
if (j % 2 !=0){
j=(3*j)+1;
}
else ...

Please, somebody, whats wrong with this code?

#include "stdio.h"


int main(void)
{
unsigned long i,j,k,max=1,m2=1;

while(scanf("%lu %lu", &i,&j)!=EOF) {
if(i>j){
i ^= j;
j ^= i;
i ^= j;
printf("%lu %lu ",j,i);
}
else {
printf("%lu %lu ",i,j);
}
k=j;
while(k>=i)
{
if (k!=1){
j=k ...