Lecture 7 Code Snippets
Slide 9
Slide 10
/** By: Negin Eini-pour **/
#include <stdio.h>
int main()
{
int negative=0, positive=0 , number;
printf("Enter Zero to stop \n");
scanf("%d", &number);
if(number> 0)
positive++;
else if(number< 0)
negative++;
while(number != 0)
{
scanf("%d", &number);
if(number> 0)
positive++;
else if(number< 0)
negative++;
}
printf("The number of positive numbers = %d\n", positive);
printf("The number of negative numbers = %d\n", negative);
}
Slide 13
Slide 14
/** By: Negin Eini-pour **/
#include <stdio.h>
int main()
{
int negative=0, positive=0 , number;
printf("Enter Zero to stop \n");
do
{
scanf("%d", &number);
if(number> 0)
positive++;
else if(number< 0)
negative++;
}while(number != 0);
printf("The number of positive numbers = %d\n", positive);
printf("The number of negative numbers = %d\n", negative);
}
Slide 17
Slide 18
Slide 19
Slide 21
/** By: Negin Eini-pour **/
#include <stdio.h>
#include <math.h>
int main()
{
int n;
printf ("Enter a natural number:\n");
scanf ("%d", &n);
int flag = 1;
if((n == 1) ||( (n != 2) && n % 2 == 0))
flag = 0;
for(int i = 3 ; i< sqrt(n) ; i+=2)
if(n % i == 0)
flag = 0;
if(flag)
printf ("%d is prime\n", n);
else
printf ("%d is not prime\n", n);
}
Slide 29
/** By: Negin Eini-pour **/
#include <stdio.h>
#include <math.h>
int main()
{
int arr[20];
double sum = 0;
for(int i = 0 ; i < 20 ; i++)
{
scanf("%d", &arr[i]);
sum += arr[i];
}
double avg = sum / 20;
int lower = 0, higher = 0 ;
for(int i = 0; i < 20 ; i++)
{
if(arr[i] >= sum)
higher ++;
else
lower ++;
}
printf("average = %lf\n", avg);
printf("Small Size = %d, Large Size = %d\n", lower, higher);
}
Slide 30
/** By: Negin Eini-pour **/
#include <stdio.h>
#include <math.h>
int main()
{
int n;
scanf("%d", &n);
int arr[n];
double sum = 0;
for(int i = 0 ; i < n ; i++)
{
scanf("%d", &arr[i]);
sum += arr[i];
}
double avg = sum / n;
int lower = 0, higher = 0 ;
for(int i = 0; i < n ; i++)
{
if(arr[i] >= sum)
higher ++;
else
lower ++;
}
printf("average = %lf\n", avg);
printf("Small Size = %d, Large Size = %d\n", lower, higher);
}
Slide 37
Slide 39
Slide 41
/** By: Negin Eini-pour **/
#include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
for(int i = 1; i <= n ; i++)
{
for(int j = 1 ; j< i ; j++)
printf(" ");
for(int j = 1; j<= i ; j++)
printf("*");
printf("\n");
}
for(int i = n-1; i >= 1 ; i--)
{
for(int j = 1 ; j< i ; j++)
printf(" ");
for(int j = 1; j<= i ; j++)
printf("*");
printf("\n");
}
}
Slide 49
/** By: Negin Eini-pour **/
#include <stdio.h>
int main(void) {
int row, col;
do
{
scanf("%d %d", &row , & col);
}while( row < 1 || col < 1 || row < col);
row--;
col--;
if(col > row - col)
col = row - col;
long long res=1;
for(int i = 1; i<= col ; i++)
res *= (row - col + i) / i;
printf("%lld", res);
}