Thread: i cant see why the code is not working??

I got it to print the smallest pair for the input number.

but i need also to do this proccess for every number smaller then the input to 1.

Code:

#include <stdio.h>




int  main(){
    int num;
    int index,tndex,kndex,jndex;
    int flag_1,flag_2,same_num;
    int sum;
    int smallest,smallest_ever,smallest_ever_2;
    sum=0;
    same_num=-1;

    smallest=-1;
    smallest_ever=2147483647;
    smallest_ever_2=2147483647;
    printf("enter number\n");
    scanf("%d",&num);

    for(index=1;index<num;index++){ //start for main number
        flag_1=0;
    flag_2=0;
         tndex=index;
             kndex=num-tndex;


                       sum=0;
                    for(jndex=1;jndex<tndex;jndex++){//start abbondence check for first num (tndex)
                        if (tndex%jndex==0){
                            sum=sum+jndex;
                        }
                        if (tndex<sum){
                        flag_1=1;
                    }

                    }//end abbondence check for first num


                    sum=0;
                    for(jndex=1;jndex<kndex;jndex++){//start abbondence check for second num (kndex)
                        if (kndex%jndex==0){
                            sum=sum+jndex;
                        }
                     if (kndex<sum){
                        flag_2=1;
                    }

                    }//end abbondence check for first num

                    if ((flag_2==1)&&(flag_1==1)){  //start flag check
                        if (kndex>=tndex){
                            smallest=tndex;

                            if ((smallest<smallest_ever)&&(smallest>1)){
                                smallest_ever=smallest;
                                smallest_ever_2=kndex;
                            }
                        }
                        else
                        {
                            smallest=kndex;
                            if ((smallest<smallest_ever)&&(smallest>1)){
                                smallest_ever=smallest;
                                smallest_ever_2=tndex;
                            }
                        }
                        if(same_num!=smallest_ever){
                         printf("%d %d",smallest_ever,smallest_ever_2);
                        }
                         same_num=smallest_ever;
                    }//end flag check






    }//end for main number
  return 0;
}//end main

how to change this code so it will
do the same process for every number smaller then the input until 1

Hi, transgalactic2. Could you please help me with this task? its similar to yours:

In the interval from 1 to the given number N, your task is to find the number which has the most divisors. In case there is more than one solution, find the smallest one.

INPUT:
From the standard input read the number N ( 0 < N < 2^31 ).

OUTPUT:
The standard output should contain two numbers (one in each line). The first line should contain the (smallest) number which has the most divisors, and the second line should contain the number of divisors.

@Dule: Read the forum guidelines. Pay particular attention to #3, where it says don't post on threads that are more than 2 weeks old, like this one that is 2.5 years old!. And besides, you're trying to talk to transgalactic2. Notice how his user name is crossed out and it says "Banned" underneath. He ain't here no more. He's been given the boot. You need to start your own thread.