ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1021. Sacrament of the Sum

Why WA #4? I'm about to give up.
Posted by guana 19 Jul 2008 15:15
I tried to solving this by making an int array num1 where all the input numbers n are. Along it I made another int array num2 that has values 10000 - n. Then I checked if I can find numbers i,j where i!=j so that num1[i] == num2[j]. What's wrong?