Ŀ

գҪıйص䡣
һ repeat (0<repeat<10) repeat 㣺
2 m  n1<=m,n<=500ͳƲ m  n ֮ĸԼЩĺֻܱ͡112
Ҫ岢ú prime(m) жmǷΪmΪʱ1򷵻0β m intint
ʾ˵
룺
1      			(repeat=1)
1 10   			(m=1, n=10)

Count = 4, sum = 17    	(110֮42,3,5,7)



#include "stdio.h"
#include "math.h"
int main(void)
{
    int count, i, m, n, sum;
    int repeat, ri;
    int prime(int m);

    scanf("%d", &repeat);
    for(ri = 1; ri <= repeat; ri++){
        scanf("%d%d", &m, &n);
/*---------*/
        printf("Count = %d, sum = %d\n", count, sum);
    }
}

/*---------*/
