fork download
  1. #include <stdio.h>
  2.  
  3. #define BUFFER_SIZE 10000
  4.  
  5. typedef struct {
  6. int V;
  7. int D;
  8. int C;
  9. int A;
  10. int U;
  11.  
  12. int R;
  13. int E;
  14. int G;
  15. } Solution;
  16.  
  17. void generate_solutions(int *numbers, size_t size, Solution solution);
  18.  
  19. int main() {
  20. Solution s = {.V = 1, .D = 4, .C = 2, .A = 6, .U = 7, .R = 8, .E = 5, .G = 3};
  21.  
  22. generate_solutions(NULL, 0, s);
  23.  
  24. return 0;
  25. }
  26.  
  27. void generate_solutions(int *numbers, size_t size, Solution solution) {
  28. int REG = (solution.V * 100 + solution.V * 10 + solution.D) +
  29. (solution.D * 100 + 66) +
  30. (solution.C * 100 + solution.D * 10 + solution.A) +
  31. (solution.C * 10 + solution.U);
  32.  
  33. int isSolution = REG == (solution.R * 100 + solution.E * 10 + solution.G);
  34.  
  35. if (isSolution) {
  36. printf("%d%d%d + %d66 + %d%d%d + %d%d = %d%d%d\r\n", solution.V, solution.V,
  37. solution.D, solution.D, solution.C, solution.D, solution.A,
  38. solution.C, solution.U, solution.R, solution.E, solution.G);
  39. }
  40. }
Success #stdin #stdout 0s 4352KB
stdin
Standard input is empty
stdout
114 + 466 + 246 + 27 = 853