Problem Link : https://uva.onlinejudge.org/index.php?option=onlinejudge&Itemid=99999999&page=show_problem&category=&problem=1055&m
Solve:
#include<bits/stdc++.h>
using namespace std;
map<int,float>mp;
int main()
{
int a,d,e,ans;
float b,c,f,dr;
float carv=0,own=0;
while(1)
{
scanf("%d%f%f%d",&a,&b,&c,&d);
if(a<0) break;
mp.clear();
ans=0;
for(int i=1; i<=d; i++)
{
scanf("%d%f",&e,&f);
mp[e]=f;
}
own=c;
carv=b+c;
b=c/a;
for(int i=0; i<=a; i++)
{
if(mp[i]==0)
{
mp[i]=mp[i-1];
}
carv=carv-(carv*mp[i]);
own=c-(i*b);
if(carv>own)
{
ans=i;
break;
}
}
if(ans!=1) printf("%d months\n",ans);
else printf("%d month\n",ans);
}
}
Solve:
#include<bits/stdc++.h>
using namespace std;
map<int,float>mp;
int main()
{
int a,d,e,ans;
float b,c,f,dr;
float carv=0,own=0;
while(1)
{
scanf("%d%f%f%d",&a,&b,&c,&d);
if(a<0) break;
mp.clear();
ans=0;
for(int i=1; i<=d; i++)
{
scanf("%d%f",&e,&f);
mp[e]=f;
}
own=c;
carv=b+c;
b=c/a;
for(int i=0; i<=a; i++)
{
if(mp[i]==0)
{
mp[i]=mp[i-1];
}
carv=carv-(carv*mp[i]);
own=c-(i*b);
if(carv>own)
{
ans=i;
break;
}
}
if(ans!=1) printf("%d months\n",ans);
else printf("%d month\n",ans);
}
}
No comments:
Post a Comment