Use functions to count and sum prime numbers

#include<stdio.h>
int prime(int n)
{
	int i,j,s=0,c=0;
			for(j=2;j<n;j++)
			{
				if(n%j==0)
				{
					c=0;
					break;
				}
			}
			if(n==j)
			{
				c=1;
			}
		

		
	

	return c;
}
intmain()
{
	int m,n,a=0,b,s=0,i;
	scanf("%d%d",&n,&m);
	for(i=n;i<m;i++)
	{
		b=prime(i);
	
	
	if(b)
	{
		a++;
		s+=i;
	}
	}
	printf("count = %d , sum = %d",a,s);
}