Atcoder 092

A - Traveling Budget

---

Time limit : 2sec / Memory limit : 256MB

Score : 100 points

Problem Statement

You planned a trip using trains and buses. The train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket. Similarly, the bus fare will be C yen if you buy ordinary tickets along the way, and Dyen if you buy an unlimited ticket.

Find the minimum total fare when the optimal choices are made for trains and buses.

Constraints

• 1≤A≤1 000
• 1≤B≤1 000
• 1≤C≤1 000
• 1≤D≤1 000
• All input values are integers.

---

Input

Input is given from Standard Input in the following format:

A
B
C
D

Output

Print the minimum total fare.

---

Sample Input 1

Copy

600
300
220
420

Sample Output 1

Copy

520

The train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket. Thus, the optimal choice for trains is to buy an unlimited ticket for 300 yen. On the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.

Therefore, the minimum total fare is 300+220=520 yen.

---

Sample Input 2

Copy

555
555
400
200

Sample Output 2

Copy

755

---

Sample Input 3

Copy

549
817
715
603

Sample Output 3

Copy

1152

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <stdio.h>
#define lowbit(x) x&(-x)

using namespace std;
const int maxn=105;
typedef long long ll;


int main(){
    ios::sync_with_stdio(0);
    ll a,b,c,d;
    cin>>a>>b>>c>>d;
    ll minn=min(a,b);
    ll minn2=min(c,d);
    cout<<minn+minn2<<endl;
   return 0;
}

B - Chocolate

---

Time limit : 2sec / Memory limit : 256MB

Score : 200 points

Problem Statement

Some number of chocolate pieces were prepared for a training camp. The camp had N participants and lasted for D days. The i-th participant (1≤i≤N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (Ai+1)-th day, the (2Ai+1)-th day, and so on. As a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.

Find the number of chocolate pieces prepared at the beginning of the camp.

Constraints

• 1≤N≤100
• 1≤D≤100
• 1≤X≤100
• 1≤Ai≤100 (1≤i≤N)
• All input values are integers.

---

Input

Input is given from Standard Input in the following format:

N
D X
A1
A2
:
AN

Output

Find the number of chocolate pieces prepared at the beginning of the camp.

---

Sample Input 1

Copy

3
7 1
2
5
10

Sample Output 1

Copy

8

The camp has 3 participants and lasts for 7 days. Each participant eats chocolate pieces as follows:

• The first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.
• The second participant eats one chocolate piece on Day 1 and 6, for a total of two.
• The third participant eats one chocolate piece only on Day 1, for a total of one.

Since the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1+4+2+1=8.

---

Sample Input 2

Copy

2
8 20
1
10

Sample Output 2

Copy

29

---

Sample Input 3

Copy

5
30 44
26
18
81
18
6

Sample Output 3

Copy

56

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <stdio.h>
#define lowbit(x) x&(-x)

using namespace std;
const int maxn=110;
typedef long long ll;
int a[maxn];

int main(){
    ios::sync_with_stdio(0);
    int n,d,x;
    cin>>n>>d>>x;
    ll  m=0;
    memset(a,0,sizeof(a));
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int tmp=0;
    for(int i=0;i<n;i++){
        tmp=a[i];
        if(tmp<d) {
            tmp+=1;
            m+=2;
        }
        else {
                ++m;
                continue;
            }
        while(tmp<d){
             tmp+=a[i];
             if(tmp<=d)
               ++m;
             else break;
        }
    }
    cout<<m+x<<endl;
   return 0;
}