tag:blogger.com,1999:blog-959939550345671470.post3549288747012770140..comments2024-03-24T12:51:18.535+05:30Comments on C programming Interview questions and answers: C program for prime numbers between 1 to nPriyanka kumarihttp://www.blogger.com/profile/08145649011863585828noreply@blogger.comBlogger10125tag:blogger.com,1999:blog-959939550345671470.post-23486442846697109852022-09-15T12:46:09.378+05:302022-09-15T12:46:09.378+05:30#include
int main(){
int n, sum=0;
printf(...#include<br />int main(){<br /> int n, sum=0;<br /> printf("Enter any number to find it is prime or not \n");<br /> scanf("%d", &n);<br /> printf("Following are the prime numbers between 1 to n \n");<br /> for(int i=1; i<n; i++){<br /> int c=0;<br /> for(int j=2; j<i; j++){<br /> if(i%j==0){<br /> c++;<Mudassar Iqbalhttps://www.blogger.com/profile/13076862083269257447noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-68281251780711514232022-02-02T13:50:07.439+05:302022-02-02T13:50:07.439+05:30How can I find also their total Sum of Prime numbe...How can I find also their total Sum of Prime numbers between 1 to n?<br /><br />Tanishqhttps://www.blogger.com/profile/02626299505694376626noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-31130049169870212992020-12-02T17:21:05.538+05:302020-12-02T17:21:05.538+05:30It worked thanksIt worked thanksAnonymoushttps://www.blogger.com/profile/01587636710812957906noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-84504941556659882052020-11-11T21:58:08.396+05:302020-11-11T21:58:08.396+05:30Don't add break; after count++....then it is r...Don't add break; after count++....then it is running properlyAnonymoushttps://www.blogger.com/profile/16267673927623873105noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-86920185342645747382020-08-02T11:26:01.158+05:302020-08-02T11:26:01.158+05:30Why is there num/2 ?Why is there num/2 ?Anonymoushttps://www.blogger.com/profile/15409200996536603112noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-85433494878031429892019-09-14T08:53:33.470+05:302019-09-14T08:53:33.470+05:30Print all the Armstrong number upto nPrint all the Armstrong number upto nAnonymoushttps://www.blogger.com/profile/15847756314650714357noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-86496445103487548612019-09-03T15:59:54.556+05:302019-09-03T15:59:54.556+05:30is this type of algorithm consider as series of pr...is this type of algorithm consider as series of prime numbers<br />K Kumarhttps://www.blogger.com/profile/02615816869487110480noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-35432746936402831292019-08-27T18:21:59.692+05:302019-08-27T18:21:59.692+05:30used very much tq......used very much tq......Anonymoushttps://www.blogger.com/profile/10661256545135971656noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-91532713631264974342016-10-16T10:23:22.723+05:302016-10-16T10:23:22.723+05:30Print all the prime numbers which are below the gi...Print all the prime numbers which are below the given number separated by commaAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-50282970914806856742014-01-12T13:03:40.546+05:302014-01-12T13:03:40.546+05:30Nice Qusation...But I not minded.......
Nice Qusation...But I not minded.......<br />Anonymousnoreply@blogger.com