Advertisement
Guest User

Untitled

a guest
Jun 22nd, 2017
54
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int polje[302][302];
  4. int res[1000];
  5.  
  6. int main() {
  7. int x, y, r, n, i, j, k;
  8. scanf("%d\n", &n);
  9. for(i = 0; i < n; i++) {
  10. scanf("%d %d %d\n", &x, &y, &r);
  11. for(j = 0; j < r; j++)
  12. for(k = 0; k < r; k++) {
  13. int old = polje[x+100+j][y+100+k];
  14. polje[x+100+j][y+100+k]++;
  15. if(old != 0) {
  16. res[old-1]--;
  17. res[old]++;
  18. } else res[old]++;
  19. }
  20. }
  21. for(i = 0; i < n; i++)
  22. printf("%d\n", res[i]);
  23. return 0;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement