See

written in C
my task was to make a script that reads [m;n]
and then does
m,m+1,m+2,...,m+n;
and prints only the numbers that have a residue equal to 3 or 6 after diving the m`s by 7


#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main ()
{
int array[100],array3[100];
int n,i,y,m;
y=1;
printf("Type m\t");
    scanf("%d",&m);
printf("Type n\t");
    scanf("%d",&n);
for (i=0;i<=n;i++)
 {
    array[i]=m+i;
 }
for (i=0;i<=n;i++)
    {
        if(3==array[i]%7)
        {
            array[i]=array3[y];
            y++;
            }
            else
            if (6==array[i]%7)
            {
            array[i]=array3[y];
            y++;
            }
        }
 for (y=1;y<=n;y++)      
 printf("%d\n",array3[y]);

    return 0;
}

NO EXCEPTIONS

#include <sdtio.h>
#include <stdlib.h>

int main(int argc, char *argv[]) {
    int n, m;
   
    if(argc != 3)
        exit(1);

    n = atoi(argv[1]);
    m = n + atoi(argv[2]);

    n -= (n%7 <= 3)? n%7 : printf("%d", n+=6-n%7), -1;
    while(n+6 <= m) {
        printf("%d\n%d\n", n+3, n+6);
        n += 7;
    }
    if(n+3 <= m)
        printf("%d\n", n+3);
}
[spoiler]HAX[spoiler]

>>3
MY ^B_BCODE-FAIL ANUS

^H_AX_MYANUS

[/spoiler][/spoiler]

so /prog/ doesn't know how to fix this?

>>7
So you don't know how to use the [code] tags?

>>7
Replace
n -= (n%7 <= 3)? n%7 : printf("%d", n+=6-n%7), -1;
with
n -= (n%7 <= 3)? n%7 : (printf("%d\n", n+=6-n%7), -1);

>>3,9
It looks like you code isn't concise enough. Don't worry, I fixed it for you.

r←((v-7×⌊v÷7)∊3 6)/v←m+⍳n+1


def f(m,n):
    if m+n%7==3 or m+n%7==6: print(m+n)
    if n: f(m, n-1)

>Written in C
>Script

Pick one, C isn't a scripting language, it get compiled.

>JEWS
>JEWS

Pick one.

Proper quote.
>Imageboard faggot quote.

Pick one.

Fixed and working:


#include <stdlib.h>
#include <math.h>
int main ()
{
int array[100],array3[100];
int n,i,y,m,k;
y=1;
printf("Type m\t");
    scanf("%d",&m);
printf("Type n\t");
    scanf("%d",&n);
for (i=0;i<=n;i++)
 {
    array[i]=m+i;
 }
for (i=0;i<=n;i++)
    {
        if((3==array[i]%7)||(6==array[i]%7))
        {
            array3[y]=array[i];
            y++;
            k++;
        }
        }
 for (y=1;y<=k;y++)      
 printf("%d\n",array3[y]);
 
    return 0;
}

>>10
Christ, dude, APL has a remainder operator.
((7∣x)∊3 6)/x←m+0,⍳n

>>14
>Pick one.
your fucking gay

what's with arrays? Isn't this what op wants?:

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[]){
    int n,m;
    if(argc != 3)
        return 1;
   
    n = atoi(argv[1]);
    m = atoi(argv[2]);

    for(;n <= m ;++n){
        if(n%7==3 || n%7==6)
            printf("%d ",n);
    }

    printf("\n");
    return 0;
}

m,n = input(),input()
print [x for x in range(m,m+n) if x%7==3 or x%7==6]

>>19
range(m,m+n+1)

>>18
Thank you for writing readable code.

>>18
Fuck off, ``faggot''.

home, home on the range()

>>11
>>>f(1,1000)
...
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
  File "<stdin>", line 3, in f
RuntimeError: maximum recursion depth exceeded


Nice try.  Use Lisp next time.

>>24
You probably mean Scheme. Lisp doesn't guarantee TCO, ``faggot''.

>>25
Scheme is a Lisp, you dumb fuck.

>>25
Yet, most serious Common Lisp implementations do provide TCO. Just because it's not specified in the standard (as they don't want to force the implementor's hands), doesn't mean any implementation worth its salt won't implement it. However, if you're talking about the Lisp family in general, then having TCO at all can be quite uncertain, especially in some ancient Lisps or some recent, but quite dumb ones.

Here's a silly CL solution:
(loop for i from n to m when (find (mod i 7) '(3 6)) collect i)

>>22
I do not understand /prog/

>>26
No, it's a LISP.