FilesExpand file tree

 master

/

1756.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

68 lines (57 loc) · 1.25 KB

 master

/

1756.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

68 lines (57 loc) · 1.25 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

#include <iostream>

#include <string>

#include <vector>

#include <algorithm>

#include <queue>

#include <list>

#include <stack>

#include <map>

#include <set>

using namespace std;

#define DEBUG

#define REP(i,a) for(i=0;i<a;i++)

#define FOR(i,a,b) for(i=a;i<b;i++)

#define VE vector<int>

#define SZ size()

#define PB push_back

int d1, d2, m;

vector<int> ans;

bool can_work(int upper){

ans.clear();

int tmp = m*d1;

for(int i=0; i<d2; i++){

if(tmp <= 0){

ans.push_back(0);

}else if(tmp > 0 && tmp < upper){

ans.push_back(tmp);

tmp -= tmp;

}else{

ans.push_back(upper);

tmp -= upper;

}

}

//cout<<"now tmp = "<<tmp<<endl;

if(tmp<=0)return true;

return false;

}

int main(){

cin>>m>>d1>>d2;

int lower = 1, upper = 100000010, mid;

int ok = -1;

while(lower<upper){

mid = (lower + upper)/2;

//cout<<lower<<" "<<upper<<" "<<mid<<endl;

bool can = can_work(mid);

if( can ){

ok = mid;

upper = mid;

} else{

lower = mid + 1;

}

}

can_work(ok);

for(int i=0; i<ans.SZ-1; i++){

cout<<ans[i]<<" ";

}cout<<ans[ans.SZ-1]<<endl;

return 0;

}