http://mendo.mk/jforum/posts/list/6.page JForum - http://www.jforum.net http://mendo.mk/jforum/posts/preList/267/2297.page http://mendo.mk/jforum/posts/preList/267/2297.page GMT http://mendo.mk/jforum/posts/preList/267/2298.page http://mendo.mk/jforum/posts/preList/267/2298.page GMT var
ime:array[1..100]of string;
a:array[1..100,1..2]of longint;
c:char;
i,n,k,q,m,min,minpoz:longint;
function pomal(a,b:integer):integer;
begin
if a<b then pomal:=a else pomal:=b
end;
function minimum(a,b,vkupno,krajno:integer):integer;
var
n,br:integer;
begin
n:=vkupno; br:=0;
while n>(krajno) do begin
if (n div 2)>=krajno then begin
br:=br+pomal(b,(n div 2)*a);
n:=n div 2;
end else begin
br:=br+(n-krajno)*a;
n:=krajno;
end;
end;
minimum:=br;
end;
begin
for i:=1 to 100 do ime[i]:='';
readln(n,m);
readln(k); min:=10000000;
for i:=1 to k do begin
repeat
read(c);
if c<>' ' then ime[i]:=ime[i]+c;
until c=' ';
read(a[i,1],a[i,2]);
end;
for i:=1 to k do begin
q:=minimum(a[i,1],a[i,2],n,m);
if q<min then begin
min:=q;
minpoz:=i;
end;
end;
writeln(ime[minpoz],' ',min);
readln();
end. ]]> http://mendo.mk/jforum/posts/preList/267/2299.page http://mendo.mk/jforum/posts/preList/267/2299.page GMT
И прочитај што има тука напишано:
     [url]http://mendo.mk/download/greski.pdf[/url]

Инаку, кога ставаш код, добро е да стиснеш на копчето "Code" - за да изгледа поубаво (и да е почитливо за другите).
]]> http://mendo.mk/jforum/posts/preList/267/2301.page http://mendo.mk/jforum/posts/preList/267/2301.page GMT http://mendo.mk/jforum/posts/preList/267/2302.page http://mendo.mk/jforum/posts/preList/267/2302.page GMT ]]> http://mendo.mk/jforum/posts/preList/267/2303.page http://mendo.mk/jforum/posts/preList/267/2303.page GMT
Не си ги сменил сите integer во longint - верувај ми, проверив ]]> http://mendo.mk/jforum/posts/preList/267/2304.page http://mendo.mk/jforum/posts/preList/267/2304.page GMT Во ред е сега, Фала уште еднаш ]]> http://mendo.mk/jforum/posts/preList/267/2305.page http://mendo.mk/jforum/posts/preList/267/2305.page GMT #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector<int> cena_A, cena_B;
int money_used(int start, int end , int index)
{
int money=0;
int usedB=0;
int change=start;
if(change%2!=0)
change++;
while(change*cena_A[index]>cena_B[index])
{
if(change/2<end)
break;

if(change%2!=0 && change!=1 && change>end)
change++;


change/=2;

//cout<<change<<" ";
if(change==1 )
break;
usedB++;
}
// cout<<endl;
//cout<<usedB<<endl;
// cout<<change-end<<endl;
money=usedB*cena_B[index] + (change-end)*cena_A[index];
return money;
}
int main()
{
int start, end, size;
cin>>start>>end>>size;
vector<string> names;
for(int i=0;i<size;i++)
{
string a;
int c,b;
cin>>a>>b>>c;
names.push_back(a);
cena_A.push_back(b);
cena_B.push_back(c);
}
vector<int> price;
for(int i=0;i<names.size();i++)
{
int money=money_used(start,end,i);
price.push_back(money);
}
int minA=99999999;
for(int i=0;i<names.size();i++)
minA=min(price[i],minA);

string name;
int used=minA;
for(int i=0;i<names.size();i++)
if(used==price[i])
name=names[i];

cout<<endl;

cout<<name<<" "<<used<<endl;


return 0;



}[/code]
Ја решавав задачава, ми работи на 9 тест примери останатите ми ги вади погрешно, кај е грешката?!?!]]> http://mendo.mk/jforum/posts/preList/267/3706.page http://mendo.mk/jforum/posts/preList/267/3706.page GMT HINT: Neka rekurzijata ima parametri, kolku ti trebaat, kolku ti preostanuvaat za procesiranje, kako i cena na usluga A, i usluga B za sekoja pozicija vo nizata.
I vo funkcijata samo gledas parnost...
Ako nesto ne raboti povtorno, pisi pak.
]]> http://mendo.mk/jforum/posts/preList/267/3707.page http://mendo.mk/jforum/posts/preList/267/3707.page GMT ]]> http://mendo.mk/jforum/posts/preList/267/3710.page http://mendo.mk/jforum/posts/preList/267/3710.page GMT http://mendo.mk/jforum/posts/preList/267/3711.page http://mendo.mk/jforum/posts/preList/267/3711.page GMT #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector<int> price;
int min_cena=0;
void rec(int leftout, int cena1, int cena2,int end,int index)
{
if(index==0)
min_cena=0;
if(leftout<=end)
return;
else
{
if(leftout*cena1>=cena2)
{
if(leftout%2!=0)
leftout++;
min_cena+=cena2;
if(leftout/2<end)
{
min_cena+=(leftout-end)*cena1;
return ;
}
leftout/=2;
rec(leftout,cena1, cena2, end, index+1);
}
else
{
min_cena+=(leftout-end)*cena1;
leftout=leftout-(leftout-end);
rec(leftout,cena1,cena2,end,index+1);
if(leftout==end)
return ;
}
}
}
int main()
{
int start, end, size;
cin>>start>>end>>size;
string c;
int cena=99999999;
vector<string> names;
vector<int> A1,B1;
for(int i=0;i<size;i++)
{
string name;
int a, b;
cin>>name>>a>>b;
names.push_back(name);
A1.push_back(a);
B1.push_back(b);
}
for(int i=0;i<size;i++)
{
rec(start,A1[i],B1[i],end,0);
if(min_cena<cena)
{
cena=min_cena;
c=names[i];
}
}
cout<<c<<" "<<cena<<endl;
return 0;
}[/code]
Пишував нешто вака, ми вади точно на првите два тест примера]]> http://mendo.mk/jforum/posts/preList/267/3712.page http://mendo.mk/jforum/posts/preList/267/3712.page GMT http://mendo.mk/jforum/posts/preList/267/3713.page http://mendo.mk/jforum/posts/preList/267/3713.page GMT Ne ti treba index, samo proveruvas dali e pooptimalno da zemas edno po edno za cenata, ili pak da gi zemas so vtorata operacija
[code]#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector<int> price;
int min_cena=0;
long long rec(int k, int n, int a, int b)
{
int curr=0;
if(n/2>=k && b < ((n+1)/2)*a)
{
curr+=b;
curr += rec(k,n/2,a,b);

}
else
{
curr += (a * (n - k));
}

return curr;
}
int main()
{
int start, end, size;
cin>>start>>end>>size;
string c;
int cena=INT_MAX;
vector<string> names;
vector<int> A1,B1;
for(int i=0; i<size; i++)
{
string name;
int a, b;
cin>>name>>a>>b;
names.push_back(name);
A1.push_back(a);
B1.push_back(b);
}
for(int i=0; i<size; i++)
{
int MIN=rec(end,start,A1[i],B1[i]);
if(MIN<cena)
{
cena=MIN;
c=names[i];
}
}
cout<<c<<" "<<cena<<endl;
return 0;
}
[/code]
Se nadevam deka pomognav :D
Pozdrav]]> http://mendo.mk/jforum/posts/preList/267/3714.page http://mendo.mk/jforum/posts/preList/267/3714.page GMT Фала многу уште еднаш]]> http://mendo.mk/jforum/posts/preList/267/3715.page http://mendo.mk/jforum/posts/preList/267/3715.page GMT http://mendo.mk/jforum/posts/preList/267/3716.page http://mendo.mk/jforum/posts/preList/267/3716.page GMT