题解 | 反序数

#include <iostream>
using namespace std;

int main() {
    int n=1000,npre=1000,g,s,b,q,nine;
    int ng,ns,nb,nq;
    while(npre<=9999)
    { n=npre;
      g=n%10;
      n=n/10;
      s=n%10;
      n=n/10;
      b=n%10;
      n=n/10;
      q=n%10; //g,s,b,q

   nine=9*npre;
   if(nine>=10000)
   break;
      ng=nine%10;
      nine=nine/10;
      ns=nine%10;
      nine=nine/10;
      nb=nine%10;
      nine=nine/10;
      nq=nine%10;
      if(ng==q&&ns==b&&nb==s&&nq==g)
       { cout<<npre<<endl;
       npre++;}
       else npre++;
     }


}

我这猪脑子 没有技巧全是暴力