fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3. int main()
  4. {   int n;
  5.     short int ile = 0;
  6.     cin >> ile;
  7.     int tab[ile];
  8.     int tablica[ile];
  9.     int N[ile];
  10.     for(int i=0; i<ile; i++)
  11. {
  12.  
  13.         cin >> n;
  14.         N[i]=n;
  15.         int B=0;
  16.  
  17.         if (n<10)
  18.         {
  19.             tab[i]=n;
  20.             tablica[i]=B;
  21.         }
  22.         if (n>10)
  23.             {
  24.                 B=B+1;
  25.                 n = n+((n%10)*10)+((n-(n%10))/10);
  26.  
  27.                     if(n<100 && ((n-(n%10))/10)==(n%10))
  28.                         {
  29.                             tab[i]=n;
  30.                             tablica[i]=B;
  31.                         }
  32.                     if (n>100 && ((n - (n%100))/100) == (n%10))
  33.                         {
  34.                             tab[i]=n;
  35.                             tablica[i]=B;
  36.                         }
  37.                     if(n>100 && ((n - (n%100))/100) != (n%10))
  38.                     {
  39.                                 B=B+1;
  40.                                 n=n+(n%10)*100+ (n%100 - n%10) + ((n-n%100))/100;
  41.                                 if(((n - (n%100))/100) == (n%10))
  42.                                 {
  43.                                 tab[i]=n;
  44.                                 tablica[i]=B;}
  45.                                 if(((n - (n%100))/100) != (n%10))
  46.                                     B=B+1;
  47.                                     n=n+(n%10)*100+ (n%100 - n%10) + ((n-n%100))/100;
  48.                                     if(((n-n%1000)/1000)==(n%10) && ((n%1000 - n%100)/100) == ((n%100-n%10)/10))
  49.                                     {
  50.                                     tab[i]=n;
  51.                                     tablica[i]=B;}
  52.                                     if((((n-n%1000)/1000)!=(n%10) || ((n%1000 - n%100)/100) != ((n%100-n%10)/10)) && n>1000)
  53.                                     {
  54.                                     B=B+1;
  55.                                     n=n+(n%10)*1000 + ((n%100 - n%10)/10)*100 + ((n%1000 - n%100)/100)*10+ ((n-n%1000)/1000)*1;
  56.                                     if((((n-n%1000)/1000)==(n%10) || ((n%1000 - n%100)/100) == ((n%100-n%10)/10)) && n>1000)
  57.  
  58.                                         {
  59.                                             tab[i]=n;
  60.                                             tablica[i]=B;
  61.                                         }else
  62.                                     {
  63.                                         B=B+1;
  64.  
  65.                                         n=n+(n%10)*1000 + ((n%100 - n%10)/10)*100 + ((n%1000 - n%100)/100)*10+ ((n-n%1000)/1000)*1;
  66.                                         if(((n-n%10000)/1000)==(n%10) || ((n%10000 - n%1000)/1000) == ((n%100-n%10)/10))
  67.                                            {
  68.                                                tab[i]=n;
  69.                                                 tablica[i]=B;
  70.                                            }else
  71.                                            {
  72.  
  73.                                             B=B+1;
  74.                                             n=n+((n%10)*10000) + (((n%100 - n%10)/10)*1000) + (((n%1000 - n%100)/100)*100) +((n%10000-n%1000)/100) + ((n-n%10000)/10000)*1;
  75.                                             if(((n-n%10000)/10000)==(n%10) && ((n%10000 - n%1000)/1000) == ((n%100-n%10)/10))
  76.                                            {
  77.                                                tab[i]=n;
  78.                                                tablica[i]=B;
  79.                                             }
  80.                                             }
  81.                                             }
  82.                                             }
  83.                                             }
  84.                                             }
  85. }
  86.     for(int i=0; i<ile; i++)
  87.     {   cout <<"wynik dla n = " << N[i] << '\t';
  88.         cout<<tab[i]<<" "<<tablica[i]<<endl;
  89.  
  90.     }
  91.     return 0;
  92. }
  93.  
Success #stdin #stdout 0s 3420KB
comments (?)
stdin
copy 
4
10
11
21
22
33
....
itd
stdout
copy 
wynik dla n = 10	0 -1215671260
wynik dla n = 11	22 1
wynik dla n = 21	33 1
wynik dla n = 22	44 1
https://ideone.com/ughQ97
language:
C++ (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!