Codeforces Round #262 (Div. 2) A，B，C

A. Vasya and Socks

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the evening, Vasya takes off the used socks and throws them away. Every m-th day (at days with numbers m, 2m, 3m, ...) mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?

Input

The single line contains two integers n and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100), separated by a space.

Output

Print a single integer — the answer to the problem.

Sample test(s)

input

2 2

output

3

input

9 3

output

13

Note

In the first sample Vasya spends the first two days wearing the socks that he had initially. Then on day three he puts on the socks that were bought on day two.

In the second sample Vasya spends the first nine days wearing the socks that he had initially. Then he spends three days wearing the socks that were bought on the third, sixth and ninth days. Than he spends another day wearing the socks that were bought on the twelfth day.

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       

using namespace std;

int main()
{
    int n,m,t=0;
    cin>>n>>m;
    for(int i=1;n;i++,t++)
    {
        n--;
        if(i%m==0)
            n++;
    }
    cout<
       
       
         < 
         
       
      
      
     
     
    
    
   
   

B. Little Dima and Equation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.

Find all integer solutions x (0 < x < 109) of the equation:

x = b·s(x)a + c, 

where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits in the decimal representation of number x.

The teacher gives this problem to Dima for each lesson. He changes only the parameters of the equation: a, b, c. Dima got sick of getting bad marks and he asks you to help him solve this challenging problem.

Input

The first line contains three space-separated integers: a, b, c (1 ≤ a ≤ 5; 1 ≤ b ≤ 10000;  - 10000 ≤ c ≤ 10000).

Output

Print integer n — the number of the solutions that you've found. Next print n integers in the increasing order — the solutions of the given equation. Print only integer solutions that are larger than zero and strictly less than 109.

Sample test(s)

input

3 2 8

output

3
10 2008 13726 

input

1 2 -18

output

0

input

2 2 -1

output

4
1 31 337 967 

#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
          using namespace std; typedef long long int LL; LL a,b,c; vector 
         
           ans; int main() { cin>>a>>b>>c; for(int i=0;i<=81;i++) { LL pow=1LL; for(int j=0;j 
          
            0LL&&x<1000000000LL) { LL t=x; int sum=0; while(t) { sum+=t%10LL; t/=10LL; } if(sum==i) { ans.push_back(x);// cout<<"x: "< 
           
             < 
             
            
           
          
        
       
       
      
      
     
     
    
    

C. Present

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little beaver is a beginner programmer, so informatics is his favorite subject. Soon his informatics teacher is going to have a birthday and the beaver has decided to prepare a present for her. He planted n flowers in a row on his windowsill and started waiting for them to grow. However, after some time the beaver noticed that the flowers stopped growing. The beaver thinks it is bad manners to present little flowers. So he decided to come up with some solutions.

There are m days left to the birthday. The height of the i-th flower (assume that the flowers in the row are numbered from 1 to n from left to right) is equal to ai at the moment. At each of the remaining m days the beaver can take a special watering and water wcontiguous flowers (he can do that only once at a day). At that each watered flower grows by one height unit on that day. The beaver wants the height of the smallest flower be as large as possible in the end. What maximum height of the smallest flower can he get?

Input

The first line contains space-separated integers n, m and w (1 ≤ w ≤ n ≤ 105; 1 ≤ m ≤ 105). The second line contains space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

Print a single integer — the maximum final height of the smallest flower.

Sample test(s)

input

6 2 3
2 2 2 2 1 1

output

2

input

2 5 1
5 8

output

9

Note

In the first sample beaver can water the last 3 flowers at the first day. On the next day he may not to water flowers at all. In the end he will get the following heights: [2, 2, 2, 3, 2, 2]. The smallest flower has height equal to 2. It's impossible to get height 3 in this test.

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
         
         

using namespace std;

typedef long long int LL;

LL n,m,w;
LL a[200100],b[200100];
LL sg[200100];
LL mi=0x3f3f3f3f3f3f3f3f,mx=-0x3f3f3f3f3f3f3f3f;

bool check(LL xxx)
{
    LL k=0,all=0;
    memset(sg,0,sizeof(sg));
    for(int i=1;i<=n;i++)
    {
        all+=sg[i];
        b[i]=a[i]+all;
        if(b[i]
         
         
           >n>>m>>w; for(int i=1;i<=n;i++) { cin>>a[i]; mi=min(mi,a[i]); mx=max(mx,a[i]); } LL low=0,high=2000000000LL,ans=mi,mid; while(low<=high) { mid=(low+high)/2LL; // cout< 
          
            <<" "< 
           
             <<" "< 
            
              <