| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 74429 | 林Qmay | 位运算 | C++ | Runtime Error | 0 | 0 MS | 240 KB | 558 | 2023-05-23 21:54:35 |
#include<iostream> #include<cstdio> using namespace std; #define maxn 10 int n,bit[maxn],len; int main(){ freopen("bit.in","r",stdin); freopen("bit.out","w",stdout); scanf("%d",&n); while(n){ bit[++len]=n%10; n/=10; } int now=1; while(bit[now]==0) { now++; bit[now]--; } while(bit[len]==0&&len>=1) len--; if(len==0) printf("0"); else{ for(int j=len;j>=1;j--) printf("%d",bit[j]); fclose(stdin); fclose(stdout); } return 0; }