Codeforces Round #284 (Div. 2) - c++编程基础

水

A. Watching a movie time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

You have decided to watch the best moments of some movie. There are two buttons on your player:

Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t?+?x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li,?li?+?1,?...,?ri).

Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1?≤?n?≤?50, 1?≤?x?≤?105) — the number of the best moments of the movie and the value of x for the second button.

The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1?≤?li?≤?ri?≤?105).

It is guaranteed that for all integers i from 2 to n the following condition holds: ri?-?1?li.
Output
Output a single number — the answer to the problem.

Sample test(s) input
```
2 3
5 6
10 12
```
output
```
6
```
input
```
1 1
1 100000
```
output
```
100000
```
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.

In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.

?
```
#include 
    
     
#include 
     
       #include 
      
        #include 
       
         #include 
        
          #include 
         
           #include 
          
            #include 
           
             using namespace std; struct { int s; int e; }p[55]; int n,x; int main() { while (scanf(%d %d, &n,&x) != EOF) { for (int i = 1; i <= n; i++) { scanf(%d %d,&p[i].s,&p[i].e); } int pos = 1; int ans = 0; for (int i = 1; i <= n; i++) { ans += ( p[i].s - pos ) % x; ans += p[i].e - p[i].s+1; pos = p[i].e + 1; } printf(%d ,ans); } return 0; }
           
          
         
        
       
      
     
    
```
?

?

B

水

?
B. Lecture time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output
You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.

You know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.

You can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.

You are given the text of the lecture the professor is going to read. Find out how the lecture w

Codeforces Round #284 (Div. 2)(一)