diff options
| author | Yuval Adam <yuv.adm@gmail.com> | 2011-04-15 12:35:40 +0300 |
|---|---|---|
| committer | Yuval Adam <yuv.adm@gmail.com> | 2011-04-15 12:35:40 +0300 |
| commit | b75f11522a46a0e50db8d4c58e49cb11ae9fc9d6 (patch) | |
| tree | bce252a60baf89d03c7d89abf2962b09d3631ca6 /2010/af_qual/a/a.py | |
| parent | 9da266333fd801ccbff194aa38d4510df8bbf136 (diff) | |
naive and fugly solution
Diffstat (limited to '2010/af_qual/a/a.py')
| -rw-r--r-- | 2010/af_qual/a/a.py | 18 |
1 files changed, 14 insertions, 4 deletions
diff --git a/2010/af_qual/a/a.py b/2010/af_qual/a/a.py index c3d50ed..541f6ed 100644 --- a/2010/af_qual/a/a.py +++ b/2010/af_qual/a/a.py @@ -1,5 +1,7 @@ -f = open('1.in', 'r') -o = open('1.out', 'w') +from itertools import product + +f = open('3.in', 'r') +o = open('3.out', 'w') n = int(f.readline().strip()) @@ -8,7 +10,15 @@ for j in range(n): i = int(f.readline().strip()) P = map(int, f.readline().strip().split(' ')) - s = "Case #%d: %s\n" % (j+1, P) + res = (0, 0) + for k in range(len(P)): + for l in range(len(P)-1): + if P[k]+P[l+1]==c: + res = [k+1, l+2] + res.sort() + res = ' '.join(map(str, res)) + break + + s = "Case #%d: %s\n" % (j+1, res) - print s o.write(s) |
