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 sequence
Search options not deleted
user 52814
For challenges involving sequences, typically of numbers following some pattern.
3
votes
All together now
C#, 119 bytes
bool m(String s){for(int i=0;i<9;i++){if(new Regex(i.ToString()+"+").Matches(s).Count>1){return false;}}return true;}
Ungolfed
bool m(String s) {
for(int i=0;i<9;i++) {
…
- 906
2
votes
Concatenating n with n + 1
C# (Visual C# Interactive Compiler), 103 71 64 56 bytes
Golfed Try it online!
i=>{for(int x=0;x<i;)Write($"{(x>0?$",{x}":"")}{++x}");}
Ungolfed
i => {
for( int x = 0; x < i; )
W …
- 906
1
vote
Count up folks!
C#, 105 117 109 107 101 99 59 bytes
Golfed
void m(ulong u){while(u>=0)System.Console.WriteLine(u--);}
Ungolfed
void m( ulong u ) {
while (u >= 0)
System.Console.WriteLine(u--);
}
Rel …
- 906
1
vote
Consecutive 1-Bits are Incremented
C# (Visual C# Interactive Compiler), 75 bytes
Golfed Try it online!
a=>{for(int i=1;i<a.Length;i++)if(a[i-1]>0&a[i]>0)a[i]=a[i-1]+1;return a;};
Ungolfed
a => {
for( int i = 1; i < a.Len …
- 906
0
votes
Compress a maximal discrepancy-2 sequence
C#, 385 bytes
Data
Input none
Output String The pretended result.
Golfed
()=>{var s="i´\u009aM6³E¤òi°ÚÍF\u009bM\"Ói6\u009au\u000e\u0093\u008d¤åK´\u009am&qѦRé´Òi\u0096¥i¤Õ«\u0014ò5¦\u0093O\"òm4\u …
- 906
0
votes
Find the sum of the divisors of N
C#, 56 bytes
Data
Input Int32 i A number
Output Int32 The sum of the divisors of the number
Golfed
i=>{int s=0,d=1;for(;d<=i;d++)s+=i%d<1?i/d:0;return s;};
Ungolfed
i => {
int
s = 0 …
- 906