Pagini recente » Cod sursa (job #1670828) | Cod sursa (job #408890) | Cod sursa (job #854943) | Cod sursa (job #2040924) | Cod sursa (job #941620)
Cod sursa(job #941620)
#include<fstream>
using namespace std;
ifstream fin("bursa.in");
ofstream fout("bursa.out");
const int MAXN = 100010;
int v[MAXN], n, s;
long long sum;
bool b;
int main(){
int i;
fin >> n >> sum;
for(i=0; i<n; ++i)
fin >> v[0];
if(v[0] < v[1])
b = 0;
else
b = 1;
for(i=0; i<n; ++i){
if(b == 0){
while(v[i] < v[i+1]){
++i;
}
b = 1;
sum= v[i+1]*nr;
}
else{
while(v[i] >= v[i+1]){
++i;
}
b = 0;
if(i != n)
nr = s/v[i+1];
}
}
fout << sum;
fin.close();
fout.close();
return 0;
}