Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with pset3
Search options not deleted
user 28620
The problem set for Week 3 asks students to write code for a classic puzzle game in the C programming language.
0
votes
Please help about tideman lock_pair function!
Maybe I'm just stating the obvious but you are not checking whether "locking in" an edge creates a cycle. As soon as you enter the first loop you are immediately setting the edge locked[pairs[i].winne …
- 48
2
votes
Accepted
p_set3 why does the int main clear the graph of locked in pairs?
Interesting. I am working on the Tideman problem now and didn't notice this block until I read your question. Let's ignore the comment that states "clear graph..." and focus only on what the code is d …
- 48
0
votes
1
answer
85
views
sort_pairs function not working as per check50
This seems to be a common problem where the check50 program indicates a problem with the sort_pairs function. Here was my implementation of that function:
int w;
int l;
int w1;
int l1;
for (int i=0; …
- 48