Advertisement
Guest User

Untitled

a guest
Nov 5th, 2014
196
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.76 KB | None | 0 0
  1. #include <stdio.h>
  2. #define SIZE 100
  3.  
  4. int main(void) {
  5.     int m[SIZE] = {}, i = 1, j, k, l, flag;
  6.     while (1) {
  7.         i++;
  8.         while (i < SIZE && m[i] == 1)
  9.             i++;
  10.         if (i >= SIZE)
  11.             break;
  12.         for (j = 2 * i; j < SIZE; j += i)
  13.             m[j] = 1;
  14.     }
  15.     for (i = 6; i <= SIZE; i++) {
  16.         flag = 1;
  17.         for (j = 2; j < SIZE; j++)
  18.             for (k = 2; k < SIZE; k++)
  19.                 for (l = 2; l < SIZE && flag; l++)
  20.                     if (!m[j] && !m[k] && !m[l] && j + k + l == i) {
  21.                         printf("%d = %d + %d + %d\n", i, j, k, l);
  22.                         flag = 0;
  23.                     }
  24.         if (flag)
  25.             printf("Can't represent %d\n", i);
  26.     }
  27.     return 0;
  28. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement