pdp forum

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

#include <stdio.h>

int main( void ) {
    int N;
    short i, j = 1000;
    float P = 1, p;

    FILE *file = fopen( "profit.in", "r" );
        fscanf( file, "%d", &N );
        while ( N-- ) {
            fscanf( file, "%hd", &i );

            j = i < j ? i : j;
            p = ( float )i / j;
            P = p > P ? p : P;
        }
    fclose( file );

    file = fopen( "profit.out", "w" );
        fprintf( file, "%.3f\n", P );
    fclose( file );

    return 0;
}

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

#include <stdio.h>
int i , n;
float x , P , paran=1000.0f;
int main(){
 FILE*fin=fopen("profit.in","r");
 FILE*fout=fopen("profit.out","w");
 fscanf(fin,"%d",&n);
 for(i=0;i<n;++i){
 fscanf(fin,"%f",&x);
 if(x < paran)paran=x;
 if(x/paran > P)P=x/paran;
 }fclose(fin);
 fprintf(fout,"%.3f\n",P);
 fclose(fout);
 return 0;   
}

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

program profit;

var
    fin , fout: text;
    i , n : integer;
    x , P , paran : Real;    

begin

        assign( fin, 'profit.in' );
        assign( fout, 'profit.out' );
        reset( fin );
        rewrite( fout );

        read( fin , n);
        paran := 1000;
        P:=0;

        for i := 1 to n do
        begin
        read( fin , x);

        if x < paran then
        paran := x;

	    if (x / paran) > P then
        P := x / paran;
        end ;

        writeln( fout, P : 0 : 3);

        close( fin );
        close( fout );
        halt(0);
end.

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

#include <fstream>
#include <iomanip>
using namespace std;
int a=0;
int valuesize=0;
int counter=0;
int main () {
    double logos=1.000;
    
   
ifstream input("profit.in");
  	input >> valuesize;
  	int arx,tel;
		input >> arx;
  		while (!input.eof()) {
        input >> tel;
        if(arx<tel)
        {
            if(float(tel)/float(arx)>logos)
        logos=float(tel)/float(arx);
        }
        else
        arx=tel;
        
        }

    input.close();
  
    ofstream save("profit.out");
save << fixed << setprecision (3) << logos << "\n";

    save.close();
    
    return 0;
}

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

#include <iostream>
#include <fstream>
#include <vector>
#include <iomanip>
using namespace std;
int main() {
	vector <int> smallest;
	float maxProfit = 0.000;
	ifstream in ("profit.in");
	ofstream out ("profit.out");
	int N;
	in >> N;
	int minN = 1001;
	vector <int> numbers;
	for (int i = 0; i < N; i++) {
		int x;
		in >> x;
		if ( x < minN ) {
			minN = x;
		}
		numbers.push_back (x);
		smallest.push_back (minN);
	}
	for (int i = 0; i < N; i++) {
		if ( ( (float) numbers[i] / (float) smallest[i] ) > maxProfit )
			maxProfit = (float) numbers[i] / (float) smallest[i];
	}
	out << fixed << setprecision(3) << maxProfit << endl;
	return 0;
}

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

#define inputFile "profit.in"
#define outputFile "profit.out"
#include <fstream>

using namespace std;

int calculateMaxProfit();
float extract(istream* in, int N);
float getProfit(float sell, float buy);

int main() {
	return calculateMaxProfit();
}

int calculateMaxProfit() {
	int N;
	//open input file
	ifstream in(inputFile);
	//open output file
	ofstream out(outputFile);
	if (in.is_open()) {
		in >> N;	//reads number of days
		float maxProfit = extract(&in, N);
		FILE * out = fopen(outputFile, "w");
		fprintf(out, "%.3f\n", maxProfit);
		fclose(out);
		in.close();
		return 0;
	} else {
		return -1;
	}
}

float getProfit(float sell, float buy) {
	return (sell / buy);
}

float extract(istream* in, int N) {
	int a;
	*in >> a;				//get first day's price
	int minBuyingPrice = a;
	float maxProfit = 1;	//	(a/a)=1
	for (int i = 2; i <= N; i++) {
		*in >> a;			//get ith's day price
		if (a < minBuyingPrice) {
			minBuyingPrice = a;
		} else {
			float newProfit(getProfit(a, minBuyingPrice));
			if (newProfit > maxProfit) {
				maxProfit = newProfit;
			}
		}
	}
	return maxProfit;
}

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

   1. #include <stdio.h>  
   2.   
   3. #define FINAL_SOLOUTION  
   4.   
   5. #ifndef FINAL_SOLOUTION  
   6.     #define CLOCK_COUNT  
   7.     #include <conio.h>  
   8.     #include <time.h>  
   9. #endif  
  10.   
  11. #ifndef FINAL_SOLOUTION  
  12. #define N_FINAL_SOL  
  13.   
  14. #endif  
  15.   
  16.   
  17. //#define BRUTE_FORCE  
  18. #define FAST_SOL  
  19.   
  20. FILE *fin;  
  21. FILE *fout;  
  22.   
  23.   
  24. int N;  
  25. int timi_meras[1000000];  
  26.   
  27. float result = 0.0f;  
  28.   
  29. float brute_force_soloution();  
  30. float fast_soloution();  
  31.   
  32. int main()  
  33. {  
  34.     #ifdef CLOCK_COUNT  
  35.     printf("CLOCK START TIME: %d\n=============================================\n",clock());  
  36.     #endif  
  37.       
  38.       
  39.     fin = fopen("profit.in","r");  
  40.     fscanf(fin,"%d",&N);  
  41.       
  42.     for(int i=0;i<N;i++)  
  43.     {  
  44.         fscanf(fin,"%d",&timi_meras[i]);  
  45.     }  
  46.   
  47.   
  48. #ifdef BRUTE_FORCE  
  49. result = brute_force_soloution();  
  50. #endif  
  51. #ifdef FAST_SOL  
  52. result = fast_soloution();  
  53. #endif  
  54.       
  55.   
  56. #ifdef N_FINAL_SOL  
  57.     printf("To arxeio eksodou einai: \n%.3f\n",result);   
  58. #endif  
  59.   
  60.     #ifdef FINAL_SOLOUTION  
  61.     fout = fopen("profit.out","w+");  
  62.     fprintf(fout,"%.3f\n",result);  
  63.     fclose(fout);  
  64.     #endif  
  65.   
  66.     fclose(fin);  
  67.   
  68.     #ifdef CLOCK_COUNT  
  69.     printf("\n=============================================\nCLOCK END TIME: %d\n=============================================",clock());  
  70.     #endif  
  71.       
  72. #ifdef N_FINAL_SOL  
  73.     getch();  
  74. #endif  
  75.     return 0;  
  76. }  
  77.   
  78.   
  79.   
  80.   
  81. float brute_force_soloution()  
  82. {  
  83.     float max_sol = 1.0f;  
  84.       
  85.     int i=0,i2=0;  
  86.     for(i=0;i<N;i++)  
  87.         for(i2=i+1;i2<N;i2++)  
  88.             if(max_sol < (float) ((float)timi_meras[i2] / (float) timi_meras[i]))  
  89.                 max_sol = (float)timi_meras[i2] /  (float)timi_meras[i];  
  90.           
  91.     //printf("\n===============================================\nMax_sol: %.3f\n",max_sol);   
  92.       
  93.   
  94.     return max_sol;  
  95. }  
  96.   
  97. float fast_soloution()  
  98. {  
  99.     float max_sol = 1.0f;  
 100.       
 101.     int i;  
 102.     int lowest_price = timi_meras[0];  
 103.     for(i=0;i<N;i++)  
 104.     {  
 105.         if(lowest_price > timi_meras[i])  
 106.             lowest_price = timi_meras[i];  
 107.         if(max_sol < (float)timi_meras[i] / (float)lowest_price)  
 108.             max_sol = (float)timi_meras[i] / (float)lowest_price;  
 109.     }  
 110.   
 111.     return max_sol;  
 112. }

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

/*
Author: Ioannis Zaxeilas
Language: C++
Problem: Maxprofit
*/

#include <iostream>
#include <fstream>
#include <iomanip>

using namespace std;

int main()
{
  	ifstream fin("profit.in");
	ofstream fout("profit.out");
	
	int ndays;
	float  a, b, c, min, max;
	float maxprofit, pmax;
	
	fin>>ndays;
	fin>>a;
	fin>>b;
	
    if(a>b)
    {
        max=a;
        min=b;
     	}
   else { 
		max=b;
		min=a;
		pmax=b/a;
       	}

  while (!fin.eof())
	{
        fin>>c;
		
        if(c>max) {
			
			max=c;   
			pmax=c/min;
			if(pmax>maxprofit) maxprofit=pmax;
       		}              
        else if(c<min)
		{
			min=c;
			max=1;
        }
		
	}              
	fout<<setprecision(3)<<fixed<<maxprofit<<endl;
	fin.close();
	fout.close();
		return 0;
}

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

    #include <cstdio>  
      
    using namespace std;  
      
    float find_profit( int* array, int elems ) {  
        int k, o = 0;  
        int buy;  
        int sell;  
        float profit = 1.0;  
        for ( int i = 0; i < elems; ++i ) {  
            for ( k = i; k < elems; ++k ) {  
                if ( ( (double)array[ k ] / array[ i ] ) > profit ) {  
                    profit = (double)array[ k ] / array[ i ];  
                }  
            }  
        }  
        return profit;  
    }  
      
    int main() {  
        int n, x, l;  
        FILE * out;  
        FILE * in;  
      
        in = fopen( "profit.in", "r" );  
        fscanf( in, "%i", &n );  
      
        int a[ n ];  
      
        for ( l = 0; l < n; ++l ) {  
            fscanf( in, "%i", &x );  
            a[ l ] = x;  
        }  
      
        fclose( in );  
        out = fopen( "profit.out", "w" );  
      
        fprintf( out, "%.3f\n", find_profit( a, n ) );  
      
        fclose( out );  
        return 0;  
    }