1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<vector>
 6 using namespace std;
 7 
 8 int  n;
 9 int b[1005],a[15],pm[10];
10 
11 void solve(){
12     pm[0]=1;
13     for(int i = 1;i <= 7;i++) pm[i] = pm[i-1]*10;
14     int x = n;
15     vector<int> res;
16     while(n){
17         int c = 0,l = 0;
18         while(x){
19             int tmp = x%10;
20             x = x/10;
21           //  printf("x = %d tmp = %d\n",x,tmp);
22             if(tmp){
23                 l += pm[c];
24                // printf("--l = %d\n",l);
25             }
26             c++;
27         }
28        // printf("l = %d\n",l);
29         res.push_back(l);
30         n -= l;
31         x = n;
32     }
33     printf("%d\n",res.size());
34     for(int i = 0;i < res.size();i++) printf("%d ",res[i]);
35     printf("\n");
36 }
37 
38 int main(){
39     while(scanf("%d",&n) != EOF){
40         solve();
41     }
42     return 0;
43 }

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<cmath>
 6 using namespace std;
 7 
 8 const int maxn = 5e5+5;
 9 int n,m;
10 
11 struct node{
12     int d,h;
13 }a[maxn];
14 
15 void solve(){
16     int maxx = -1;
17     for(int i = 1;i <= m+1;i++){
18         if(i == 1){
19             maxx = max(a[i].h+(a[i].d-1),maxx);
20             continue;
21         }
22         if(i == m+1){
23             maxx = max(a[i-1].h+(n-a[i-1].d),maxx);
24             continue;
25         }
26         int x = a[i].h,y = a[i-1].h;
27         int day = a[i].d-a[i-1].d;
28         if(x == y){
29             maxx = max(max(x,maxx),day/2+x);
30             continue;
31         }
32         if(abs(x-y) > day){
33             puts("IMPOSSIBLE");
34             return;
35         }
36         maxx = max(max(x,y),maxx);
37         maxx = max(maxx,(day+x+y)/2);
38     }
39     printf("%d\n",maxx);
40 }
41 
42 int main(){
43     while(scanf("%d %d",&n,&m) != EOF){
44         for(int i = 1;i <= m;i++) scanf("%d %d",&a[i].d,&a[i].h);
45         solve();
46     }
47     return 0;
48 }