pdp forum

Κώδικας: Επιλογή όλων

#include <stdio.h>
#include <stdlib.h>

#define MAX 1000

int i , j , N , findu;
int a[MAX];

int main(){
 FILE*fin;
 FILE*fout;
 fin = fopen("input.in","r");
 fout = fopen("output.out","w");
 fscanf(fin,"%d %d",&N,&findu);
 for(i=0;i<N;++i)
 fscanf(fin,"%d",&a[i]);
 fclose(fin);
 
 for(i=0;i<N;++i){ if(a[i] > findu){break;}
 for(j=i+1;j<N;++j){                 
 if( a[i] + a[j] == findu){
 fprintf(fout,"%d %d\n",i+1,j+1);    
 }
 }}
 
 fclose(fout);
 
 return 0;   
}

Κώδικας: Επιλογή όλων

// Looks if there are two elements of the array A, i and j,
// so that A[i] + A[j] = T; if found, returns true, else it returns false.

SUMCHECK(A, T)
    i <-- 1 
    j <-- A.length
    
    while(i < j)
        sum <-- A[i] + A[j]
        if(sum == T)
            return true
        elseif(sum > T)
            j = j - 1
        elseif(sum < T)
            i = i + 1
    return false