diff options
author | Nguyễn Gia Phong <vn.mcsinyx@gmail.com> | 2019-12-15 15:09:13 +0700 |
---|---|---|
committer | Nguyễn Gia Phong <vn.mcsinyx@gmail.com> | 2019-12-15 15:09:13 +0700 |
commit | 9e28e4c7b67c54229df11d355047ac8a88ea1817 (patch) | |
tree | 0d9d40db69613c2c49564a3f1987a005d61f4db3 /THT/C/TP-2017/squares_brute-force.pas | |
parent | 67393f42f41ab92219deb549f711121c4dab845b (diff) | |
download | cp-9e28e4c7b67c54229df11d355047ac8a88ea1817.tar.gz |
Normalize pathname
Diffstat (limited to 'THT/C/TP-2017/squares_brute-force.pas')
-rw-r--r-- | THT/C/TP-2017/squares_brute-force.pas | 39 |
1 files changed, 0 insertions, 39 deletions
diff --git a/THT/C/TP-2017/squares_brute-force.pas b/THT/C/TP-2017/squares_brute-force.pas deleted file mode 100644 index 0b389d9..0000000 --- a/THT/C/TP-2017/squares_brute-force.pas +++ /dev/null @@ -1,39 +0,0 @@ -(* The method I actually used at the contest, approx 15% time-out. *) -uses math; - -var - f: text; - m, n, i, j, x, y: int16; - k: int8; - net: array[1..1000, 1..1000] of boolean; - count: int64 = 0; - -begin - assign(f, 'squares.inp'); - reset(f); - readln(f, m, n, k); - for x := 1 to m do - for y := 1 to n do - net[x][y] := true; - repeat - dec(k); - readln(f, x, y); - net[x][y] := false - until k = 0; - close(f); - - for x := 1 to m - 1 do - for y := 1 to n - 1 do - if net[x, y] then - for i := 0 to x - 1 do - for j := 1 to min(m - x, n - y - i) do - if net[x - i, y + j] and - net[x + j, y + i] and - net[x - i + j, y + i + j] then - count := count + 1; - - assign(f, 'squares.out'); - rewrite(f); - writeln(f, count); - close(f) -end. |