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 number
Search options not deleted
user 19067
A competition to solve a particular problem through the usage and manipulation of numbers.
3
votes
4, 8, 15, 16, 23, 42
C
Uses the recurrence relation x(n)=x(n-1)+x(n-3)+x(n-5) to generate the sequence
#include <stdio.h>
int main()
{
int i,j;
while(1)
{
int n[7]={0,-3,7,0,-3,-1,0};
n[3]=-2*(n[1]+n[5]); …
- 31