Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void invertLN(LongN * B, int n){
- if(B->sign == 0 || *(B->dig + B->n - 1) == 0){
- return;
- }else{
- char * k;
- B->n = n;
- k = (char *)calloc(B->n, sizeof(char));
- for(int i = 0; i < B->n; i++){
- *(k+i) = *(B->dig+i);
- }
- free(B->dig);
- B->dig = k;
- int f = 1;
- for(int i = 0; i < n; i++){
- *(B->dig + i) = 99 + f - *(B->dig + i);
- if(*(B->dig + i) != 100){
- f = 0;
- }else{
- *(B->dig + i) = 0;
- }
- }
- return;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement