Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- #include <omp.h>
- #define ceild(n,d) ceil(((double)(n))/((double)(d)))
- #define floord(n,d) floor(((double)(n))/((double)(d)))
- #define max(x,y) ((x) > (y) ? (x) : (y))
- #define min(x,y) ((x) < (y) ? (x) : (y))
- #define i c2 // zgodnie z pierwszym elementem pseudoinstrtukcji (c2,c3);
- #define j c3 // zgodnie z drugim elementem pseudoinstrtukcji (c2,c3);
- int main() {
- const int n = 100;
- int c0,c1,c2,c3;
- int a[n][n];
- for (c0 = 0; c0 <= floord(3 * n - 6, 32); c0 += 1)
- for (c1 = max(0, floord(-n + 32 * c0 + 1, 64) + 1); c1 <= min((n - 2) / 32, c0 / 2); c1 += 1)
- for (c2 = 32 * c0 - 64 * c1 + 2; c2 <= min(n, 32 * c0 - 64 * c1 + 32); c2 += 1)
- for (c3 = 32 * c1 + 2; c3 <= min(n, 32 * c1 + 32); c3 += 1)
- a[i][j] = a[i-2][j-2];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement