fork download
copy 
  1. #include <stdio.h>
  2. int isSNumber(long a){
  3.     short int array[12], count = 0, i;
  4.     while(a != 0){
  5.         array[count] = a % 10;
  6.         a /= 10;
  7.         count++;
  8.     }
  9.     if(count == 1) return 1;
  10.     for (i = 0; i < count - 1; i++){
  11.         if((array[i] - array[i + 1]) != 1) return 0;
  12.     }
  13.     return 1;
  14. }
  15. int main() {
  16. 	long arrayd[9] = {123456,234567,345678,456789,1234567,2345678,3456789,12345678, 23456789};
  17.     long l, r, j, arr[100];
  18.     int a = 0;
  19. 	char k;
  20.     //scanf("%ld %ld", &l, &r);
  21.     l = 1; r = 100000000;
  22.     if (r > 100000){
  23.     	for (j = l; j < 100000; j++){
  24. 	        if(isSNumber(j)){
  25. 	            arr[a] = j;
  26. 	            a++;
  27.         	}
  28. 		}
  29. 		for (k = 0; k < 9; k++){
  30. 			for(j = 100000; j < r; j++){
  31. 				if(j == arrayd[k]){
  32. 					arr[a] = arrayd[k];
  33. 					a++;
  34. 				}
  35. 			}
  36. 		}
  37. 	}else{
  38. 		for (j = l; j < r; j++){
  39. 	        if(isSNumber(j)){
  40. 	            arr[a] = j;
  41. 	            a++;
  42.         	}
  43. 		}
  44. 	}
  45.     printf("[");
  46.     for(k = 0; k < a-1; k++){
  47.         printf("%ld,",arr[k]);
  48.     }
  49.     printf("%ld]",arr[a-1]);
  50.     return 0;
  51. }
Success #stdin #stdout 0.99s 5432KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[1,2,3,4,5,6,7,8,9,12,23,34,45,56,67,78,89,123,234,345,456,567,678,789,1234,2345,3456,4567,5678,6789,12345,23456,34567,45678,56789,123456,234567,345678,456789,1234567,2345678,3456789,12345678,23456789]
https://ideone.com/o3Z7z0
language:
C (gcc 8.3)
created:
2 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!