Submission #9814530

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
// #define int long long

int rev(int N) {
  int ret = 0;
  while ( N ) {
    ret *= 10;
    ret += (N%10);
    N /= 10;    
  }

  return ret;
}

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int D;
  cin >> D;

  unordered_set<int> all;
  {
    for ( int i = 0; i < 10; i++ ) {
      int a = i;
      int b = D % 10;
      int sum = (a + b) % 10;
      for ( int de = 0; de < 5; de++ ) {
	all.insert(rev(sum) * (int)pow(10, de) + a);	  
      }
      for ( int de = 0; de < 5; de++ ) {
	all.insert(rev(sum) /10 * (int)pow(10, de) + a);	  
      }
    }
  }
  
  {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	int a = i + j*10;
	int b = D % 100;
	int sum = (a + b) % 100;
	for ( int de = 0; de < 5; de++ ) {
	  all.insert(rev(sum) * (int)pow(10, de) + a);	  
	}
	for ( int de = 0; de < 5; de++ ) {
	  all.insert(rev(sum)/10 * (int)pow(10, de) + a);	  
	}
      }
    }
  }

  {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	for ( int k = 0; k < 10; k++ ) {
	  int a = i + j*10 + k*100;
	  int b = D % 1000;
	  int sum = (a + b) % 1000;
	  for ( int de = 0; de < 5; de++ ) {
	    all.insert(rev(sum) * (int)pow(10, de) + a);	  
	  }
	  	for ( int de = 0; de < 5; de++ ) {
	  all.insert(rev(sum)/10 * (int)pow(10, de) + a);	  
	}
	}
      }
    }
  }

  {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	for ( int k = 0; k < 10; k++ ) {
	  for ( int l = 0; l < 10; l++ ) {
	    int a = i + j*10 + k*100 + l*1000;
	    int b = D % 10000;
	    int sum = (a + b) % 10000;
	    for ( int de = 0; de < 5; de++ ) {
	      all.insert(rev(sum) * (int)pow(10, de) + a);	  
	    }
	  }
	}
      }
    }
  }

  {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	for ( int k = 0; k < 10; k++ ) {
	  for ( int l = 0; l < 10; l++ ) {
	    int a = i + j*10 + k*100 + l*1000;
	    int b = D % 10000;
	    int sum = (a + b) % 10000;
	    for ( int de = 0; de < 5; de++ ) {
	      all.insert(rev(sum) * (int)pow(10, de) + a);	  
	    }
	    for ( int de = 0; de < 5; de++ ) {
	      all.insert(rev(sum)/10 * (int)pow(10, de) + a);	  
	    }
	    for ( int de = 0; de < 5; de++ ) {
	      all.insert(rev(sum)/100 * (int)pow(10, de) + a);	  
	    }
	  }
	}
      }
    }
  }

  {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	for ( int k = 0; k < 10; k++ ) {
	  for ( int l = 0; l < 10; l++ ) {
	    for ( int m = 0; m < 10; m++ ) {
	      int a = i + j*10 + k*100 + l*1000 + m*10000;
	      int b = D % 100000;
	      int sum = (a + b) % 100000;
	      for ( int de = 0; de < 9; de++ ) {
		all.insert(rev(sum) * (int)pow(10, de) + a);	  
	      }
	      for ( int de = 0; de < 9; de++ ) {
		all.insert(rev(sum)/10 * (int)pow(10, de) + a);	  
	      }	     
	    }
	  }
	}
      }
    }
  }

  if ( false ) {
    for ( int i = 0; i < 10; i++ ) {
      for ( int j = 0; j < 10; j++ ) {
	for ( int k = 0; k < 10; k++ ) {
	  for ( int l = 0; l < 10; l++ ) {
	    for ( int m = 0; m < 10; m++ ) {
	      for ( int n = 0; n < 10; n++ ) {	       
		int a = i + j*10 + k*100 + l*1000 + m*10000 + n*100000;	      
		int b = D;
		int sum = (a + b) % 1000000;
		int pp = 1;
		int revsum = rev(sum);
		for ( int de = 0; de < 6; de++ ) {
		  all.insert(revsum * pp + a);
		  pp *= 10;
		}
		pp = 1;
		for ( int de = 0; de < 6; de++ ) {
		  all.insert(revsum/10 * pp + a);
		  pp *= 10;
		}		
	      }
	    }
	  }
	}
      }
    }
  }
  
  int ans = 0; 
  for ( int i: all ) {
    if ( rev(i) == i+D ) ans++;
  }
  

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result