-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcode2.cpp
More file actions
76 lines (71 loc) · 997 Bytes
/
code2.cpp
File metadata and controls
76 lines (71 loc) · 997 Bytes
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
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;
int main(){
//here the code begins
int t,q=1;
cin>>t;
while(t--)
{
char n[20],flag=0,loc1=0;
int i,m,loc=0;
cin>>n;
m=strlen(n);
if(m==1)
{
cout<<"Case #"<<q++<<": ";
cout<<n<<endl;
}
else
{
int f=0,l;
for(i=0;i<m-1;i++)
{
if(n[i+1]<n[i])
{
if(n[i]!='1'){
n[i]-=1;
for(int p=i+1;p<m;p++)
n[p]='9';
for(int k=i;k>=0;k--)
{
if(n[k]>n[i])
{
n[k]=n[i];
l=k;
f=1;
}
}
if(f==1)
{
for(int p=l+1;p<=i;p++)
n[p]='9';
}
f=0;
break;
}
else{
for(int p=0;p<m;p++)
n[p]='9';
flag=1;
break;
}
}
}
if(flag==0)
{
cout<<"Case #"<<q++<<": ";
for(int j=0;j<m;j++)
cout<<n[j];
cout<<endl;
}
else
{
cout<<"Case #"<<q++<<": ";
for(int j=1;j<m;j++)
cout<<n[j];
cout<<endl;
}
}
}
return 0;
}