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 pset1
Search options not deleted
user 39360
The problem set for Week 1 introduces the C programming language.
0
votes
What can I add to my code to solve the practice problem set 1 week 1. The question is giving...
Because 1 isn't a prime, so first step is to exclude 1 with an if and then return false.
Because 2 is a prime, so first step is to return true.
For newnum > 2; I tried a modulus with all number from 2 …
