9 solutions
-
2
Amazing × 2
#include <iostream> #include <cstdio> #include <string.h> using namespace std; int main(){ string x; cin >> x; int len = x.size(); int flag = 0; if(x[0] == '-'){ flag = 1; cout << "-"; } else flag = 0; int cnt = len; while(x[cnt - 1] == '0'){ len--; } for(int i = len - 1;i >= flag;i--) cout << x[i]; return 0; }
-
2
#include <bits/stdc++.h> using namespace std; char n[100000010]; bool a = false; int main(){ cin>>n; int sum=strlen(n); if(n[0]=='-') { cout<<'-'; for(int i=sum-1;i>=1;i--) { if(a == false) { if(n[i]!='0') { cout<<n[i]; } } else { cout<<n[i]; } if(a == false) { if(n[i] != '0') { a = true; } } } } else { for(int i=sum-1;i>=0;i--) { if(a == false) { if(n[i]!='0') { cout<<n[i]; } } else { cout<<n[i]; } if(a == false) { if(n[i] != '0') { a = true; } } } } return 0; }
-
0
那位大牢帮看看呆码哪里bug了? 30AC 70WA
#include<bits/stdc++.h> using namespace std; string str,str1; short len,j; bool f=false,fu=true,fa=true; int main(){ cin>>str; len=str.length(); if(str[0]=='-'){ if(str=="-0"){cout<<"-0"; return 0;} f=true; for(int i=len-1;i>0;i--){ if(str[j]=='0' and fa==true){ j++;i++; }else{ fa=false; str1[j]=str[i]; j++;}} }else{ if(str=="0"){cout<<'0'; return 0;} for(int i=len-1;i>=0;i--){ if(str[j]=='0' and fa==true){ j++;i++; }else{ fa=false; str1[j]=str[i]; j++;}}} if(f==true){ cout<<'-'; for(int i=1;i<len;i++){ if(str1[i]=='0' and fu==true){ continue;} else{ cout<<str1[i]; fu=false;} } }else{ for(int i=0;i<len;i++){ if(str1[i]=='0' and fu==true){ continue;} else{ cout<<str1[i]; fu=false;} } return 0; }}
-
0
#include<bits/stdc++.h> using namespace std; int main(){ int a; scanf("%d",&a); for(int i=0;i<16;i++){ if(a>=0){ if(a%100&&i0){ a=(a-abs(a%10))/10; } else{ cout<<a%10; a=(a-a%10)/10; if(a<1){ break; } } } else{ if (i<=0){ if(a%10!=0){ cout<<"-"; cout<<abs(a%10); a=(a+abs(a%10))/10; } else{ cout<<"-"; a=(a+abs(a%10))/10; } }
else{ cout<<abs(a%10); a=(a+abs(a%10))/10; if(a>-1){ break; } } } } return 0;
}
- 1
Information
- ID
- 580
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 154
- Accepted
- 71
- Uploaded By