Programming e Hate Khori
Programming e Hate Khori
Programming e Hate Khori
,
B
2
, , ,
, !
, ,
-
, , ;
,
! - , ,
, , , ,
–
-
,
3
( )।
,
,
( )
-
? ,
,
' ' ,
, -
( , , )-
( )
, : i just have gone through your book. i have
been thinking about writing a book like this for last five six years- you have done it- i do not need to do it any
more. thank you. i have some comments- it's better to talk. i lost your cell number send it to me."
( , )-
-
( , ,
)-
( )-
( )-
( , - )-
( )-
( , , )-
4
( , , )
-
( , , )-
( )-
( )-
( ,
)- ,
( , )-
( , )-
( , , )-
( , , )-
( , , )-
( , ,
)-
, , , ,
5
Before you start) 07
First Program) 09
Conditional Logic) 25
Loop) 33
Array) 52
Function) 60
Binary Search) 68
String) 71
Prime number) 81
Array Again) 87
107
6
-
, ? , , ,
0) 1) user) - ,
0 1 0, 1
, 0, 1
, ,
ADD ( , MUL ( 0, 1-
,
-
Fortran), Basic), Pascal), C) , ,
, C++), Visual Basic), Java), C#), Perl),
PHP), Python), Ruby)
,
,
,
logic) ,
,
,
,
, ,
-
, ,
, ,
,
, - - , ,
7
, ? -
, gcc
Codeblocks (http://www.codeblocks.org/)
IDE (Integrated Development Environment)
, ,
IDE)
-
,
,
8
-
, Hello World
Codeblocks ,
-->
Show tips at startup tick)
9
-->
-->
hello.c c
10
-->
#include <stdio.h>
int main ()
{
printf("Hello World");
return 0;
}
-->
, ? , !
Build Compile Current File-
-->
0 errors, 0 warnings, -
syntax
11
-->
Build Run-
-->
, Hello World Process returned 0 (0x0) (
) execution time : 0.031 s 0.031
, Press any key to continue. - Any key
Hello World
: #include <stdio.h>,
: int main() ,
( )
return 0; , ,
:
int main()
{
return 0;
}
12
: printf("Hello World"); printf()
-
stdio.h (header) (.h
) stdio.h - ,
, printf()
, #include <stdio.h>
,
printf("Hello World");-
return 0;
, ,
(compile error)
,
,
- ,
(Tab) Codeblocks- Settings
Editor- TAB Options- TAB indents TAB size in spaces 4
-->
: I love my country, Bangladesh
13
- ,
,
, ?
,
, ,
#include <stdio.h>
int main()
{
int a;
int b;
int sum;
a = 50;
b = 60;
sum = a + b;
printf("Sum is %d", sum);
return 0;
}
, Sum is 110।
a = 50;
b = 60;
a- 50 b- 60 assign , , a-
50 b- 60
, printf
printf("Sum is %d", sum);
14
printf Sum is %d" Sum is
d- sum
d- sum- d ,
,
,
,
#include <stdio.h>
int main()
{
int a, b, sum;
a = 50;
b = 60;
sum = a + b;
printf("Sum is %d", sum);
return 0;
}
#include <stdio.h>
int main()
{
int a = 50, b = 60, sum;
sum = a + b;
printf("Sum is %d", sum);
return 0;
}
15
?
#include <stdio.h>
int main()
{
int x, y;
x = 1;
y = x;
x = 2;
printf("%d", y);
return 0;
}
? 1 2? 1, , x- 1 x=
1;)। x- y- y = x;)। y- 1। x- 2
y- y = x;
'='
#include <stdio.h>
int main()
{
int a = 50, b = 60, sum;
sum = a + b;
printf("%d + %d = %d", a, b, sum);
return 0;
}
, , ,
,
, ,
,
16
- , ,
, int real number) ,
?
#include <stdio.h>
int main()
{
int a = 50.45, b = 60, sum;
sum = a + b;
printf("%d + %d = %d", a, b, sum);
return 0;
}
a- 50.45 , , main
return 0; ? return 0;
50 + 60 = 110।
#include <stdio.h>
int main()
{
int n;
double x;
x = 10.5;
n = (int)x;
printf("Value of n is %d\n", n);
printf("Value of x is %lf\n", x);
return 0;
}
x- - double
, lf (l L)
17
int ?
#include <stdio.h>
int main()
{
int a;
a = 1000;
printf("Value of a is %d", a);
a = -21000;
printf("Value of a is %d", a);
a = 10000000;
printf("Value of a is %d", a);
a = -10000000;
printf("Value of a is %d", a);
a = 100020004000503;
printf("Value of a is %d", a);
a = -4325987632;
printf("Value of a is %d", a);
return 0;
}
a- ?
printf-
printf printf("Value of a is %d\n", a);। printf - \n
a- , -2147483648 2147483647
, int int - int
byte) 1 byte = 8 bit)।
,0 1। 00, 01, 10, 11)। 32 2^32
4294967296 , -2147483648 -1
2147483648 0 2147483647 2147483648 , 4294967296 ,
18
real number) ,
, ... -3, -2, -1, 0, 1, 2, 3 ... -5, -3, -2.43, 0, 0.49, 2.92
।
#include <stdio.h>
int main()
{
double a, b, sum;
a = 9.5;
b = 8.743;
sum = a + b;
printf("Sum is: %lf\n", sum);
printf("Sum is: %0.2lf\n", sum);
return 0;
}
%lf
, 0.2lf 0.3lf ,
0.0lf)। double 64 1.7E-308 (1.7 x 10-308) 1.7E+308 (1.7 x 10308)
,
,
,
scanf - ।
#include <stdio.h>
int main()
{
int a, b, sum;
scanf("%d", &a);
scanf("%d", &b);
sum = a + b;
printf("Sum is: %d\n", sum);
return 0;
}
19
scanf scanf("%d", &a); d scanf-
int ।
a- &) , &a a
, &a- ,
a b- scanf scanf("%d %d",
&a, &b);। & ? ,
,
#include <stdio.h>
int main()
{
int a, b, sum;
scanf("%d", &a);
scanf("%d", b);
sum = a + b;
printf("Sum is: %d\n", sum);
return 0;
}
? scanf- d-
lf
, int double
,
,
, ,
,
20
, char (character) character
, char
#include <stdio.h>
int main()
{
char ch;
printf("Enter the first letter of your name: ");
scanf("%c", &ch);
printf("The first letter of your name is: %c\n", ch);
return 0;
}
#include <stdio.h>
int main()
{
char ch;
printf("Enter the first letter of your name: ");
ch = getchar();
printf("The first letter of your name is: %c\n", ch);
return 0;
}
getchar ch
char
char c = 'A';
21
#include <stdio.h>
int main()
{
int num1, num2;
printf("Please enter a number: ");
scanf("%d", &num1);
printf("Please enter another number: ");
scanf("%d", &num2);
printf("%d + %d = %d\n", num1, num2, num1+num2);
printf("%d - %d = %d\n", num1, num2, num1-num2);
printf("%d * %d = %d\n", num1, num2, num1*num2);
printf("%d / %d = %d\n", num1, num2, num1/num2);
return 0;
}
22
,
, num1 num2- , , , printf
, num2- 0 printf
, -, *, / char
#include <stdio.h>
int main()
{
int num1, num2, value;
char sign;
printf("Please enter a number: ");
scanf("%d", &num1);
printf("Please enter another number: ");
scanf("%d", &num2);
value = num1 + num2;
sign = '+';
printf("%d %c %d = %d\n", num1, sign, num2, value);
value = num1 - num2;
sign = '-';
printf("%d %c %d = %d\n", num1, sign, num2, value);
value = num1 * num2;
sign = '*';
printf("%d %c %d = %d\n", num1, sign, num2, value);
value = num1 / num2;
sign = '/';
printf("%d %c %d = %d\n", num1, sign, num2, value);
return 0;
}
,
, - । ,
23
comment)
#include <stdio.h>
int main()
{
// test program - comment 1
printf("Hello ");
/* We have printed Hello,
now we shall print World.
Note that this is a multi-line comment */
printf("World"); // printed world
return 0;
}
,( - , ?
, a z, A Z, 0 9 _
( । int
7d; ,
sum , y ,
24
-
' '! -
#include <stdio.h>
int main()
{
int n;
n = 10;
if(n >= 0) {
printf("The number is positive\n");
}
else {
printf("The number is negative\n");
}
return 0;
}
, ? ' '
>= ' '- <=
, < >
-
if else- if else ,
25
#include <stdio.h>
int main()
{
int n;
n = 10;
if(n < 0) {
printf("The number is negative\n");
}
else {
printf("The number is positive\n");
}
return 0;
}
n , n ;
n n
#include <stdio.h>
int main()
{
int n = 10;
if(n < 0) {
printf("The number is negative\n");
}
else if (n > 0) {
printf("The number is positive\n");
}
else if (n == 0) {
printf("The number is zero!\n");
}
return 0;
}
26
if(n < 0): n
else if(n > 0): , n if(n > 0)
, ,
n-
#include <stdio.h>
int main()
{
int n = 10;
if(n < 0) {
printf("The number is negative\n");
}
else if (n > 0) {
printf("The number is positive\n");
}
else {
printf("The number is zero!\n");
}
return 0;
}
if else else if ,
#include <stdio.h>
int main()
{
int number = 12;
if(number > 10) {
printf("The number is greater than ten\n");
}
return 0;
}
27
?
#include <stdio.h>
int main()
{
int n = 10;
if (n < 30) {
printf("n is less than 30.\n");
}
else if(n < 50) {
printf("n is less than 50.\n");
}
return 0;
}
#include <stdio.h>
int main()
int n = 10;
if (n < 30) {
return 0;
28
2 , ;
modulus operator) , '%'
int number;
number- number = 5;
number 2 remainder = number % 2;
if- remainder- remainder-
0 1
#include <stdio.h>
int main()
{
int number, remainder;
number = 5;
remainder = number % 2;
if(remainder == 0) {
printf("The number is even\n");
}
else {
printf("The number is odd\n");
}
return 0;
}
remainder
#include <stdio.h>
int main()
{
int number = 9;
if(number % 2 == 0) {
printf("The number is even\n");
}
else {
printf("The number is odd\n");
}
return 0;
}
, , ? else
29
? ,
, /, -)
char ch = 'p';
if (ch == 'a')
{
printf("%c is lower case\n", ch);
}
else if (ch == 'A')
{
printf("%c is upper case\n", ch);
}
else if (ch == 'b')
{
printf("%c is lower case\n", ch);
}
else if (ch == 'B')
{
printf("%c is upper case\n", ch);
}
else if (ch == 'c')
{
printf("%c is lower case\n", ch);
}
else if (ch == 'C')
{
printf("%c is upper case\n", ch);
}
30
AND operator) '&&'
#include <stdio.h>
int main()
{
char ch = 'W';
if(ch >= 'a' && ch <= 'z') {
printf("%c is lower case\n", ch);
}
if(ch >= 'A' && ch <= 'Z') {
printf("%c is upper case\n", ch);
}
return 0;
}
'&&'- ,
ch >= 'a' && ch <= 'z' &&- ch >= 'a'
ch <= 'z' ,
a- b- , b- c- , c-
d- lower case 'a'-
'z'- A- B- , B- C-
'A' 'Z'- upper case 'A'-
'Z'- if- else
if- if-
#include <stdio.h>
int main()
{
char ch = 'k';
if(ch >= 'a' && ch <= 'z') {
printf("%c is lower case\n", ch);
}
else if(ch >= 'A' && ch <= 'Z') {
printf("%c is upper case\n", ch);
}
return 0;
}
, '&&'-
31
OR) '||' |) '&&'-
, '||'-
?
#include <stdio.h>
int main()
{
int num = 5;
if(num >= 1 || num <= 10) {
printf("yes\n");
}
else {
printf("no\n");
}
return 0;
}
yes num- 50 ?
32
- Loop)
condition)
, 1 10
,
#include <stdio.h>
int main()
{
printf("1\n");
printf("2\n");
printf("3\n");
printf("4\n");
printf("5\n");
printf("6\n");
printf("7\n");
printf("8\n");
printf("9\n");
printf("10\n");
return 0;
}
1 10 printf()
printf("1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n");
n , 1 n-
n- n=n+1 , n++
int n = 1;
printf("%d\n", n);
n = n + 1;
printf("%d\n", n);
n = n + 1;
printf("%d\n", n);
n = n + 1;
/*
33
n 1
printf("%d\n", n);
n = n + 1;
printf("%d\n", n++);
loop)
,
while for while
#include <stdio.h>
int main()
{
int n = 1;
while(n <= 10) {
printf("%d\n", n);
n++;
}
return 0;
}
10- , 1 while
n- n- 1 n- 1 11
n <= 10 11 > 10) ,
34
?
#include <stdio.h>
int main()
{
int n = 1;
while(n <= 10) {
printf("%d\n", n);
}
n++;
return 0;
}
1 10 ? ?
int n = 1; n- 1
while n <= 10 n- 10-
n- 1 n- printf("%d\n", n); n- 1 ?
, '}' ,
n- n- , n <= 10
while
while(1){...} 1
1 , while(1 == 1){...}
,
break
#include <stdio.h>
int main()
{
int n = 1;
while(n <= 100) {
printf("%d\n", n);
n++;
if(n > 10) {
break;
}
}
return 0;
}
35
?1 10 while- n <= 100,
n > 10 , break; , break
n- 10
n++;) n- 11 n > 10 , if
break break- ,
continue; continue continue-
#include <stdio.h>
int main()
{
int n = 0;
while (n < 10) {
n = n + 1;
if (n % 2 == 0) {
continue;
}
printf("%d\n", n);
}
return 0;
}
1 10- continue
printf("%d\n", n);
5-
5X1=5
5 X 2 = 10
5 X 3 = 15
5 X 4 = 20
5 X 5 = 25
5 X 6 = 30
5 X 7 = 35
5 X 8 = 40
5 X 9 = 45
5 X 10 = 50
36
printf
#include <stdio.h>
int main()
{
int n = 5;
int i = 1;
while (i <= 10) {
printf("%d X %d = %d\n", n, i, n*i);
i = i + 1;
}
return 0;
}
#include <stdio.h>
int main()
{
int n = 5;
int i;
for(i = 1; i <= 10; i = i + 1) {
printf("%d X %d = %d\n", n, i, n*i);
}
return 0;
}
for ;)
, i-
1 while
i <= 10
for
i <= 10 , i- 1
printf() i=i+1 i- i
<= 10 i- 2) printf())
i <= 10 i- 11
for
,
i-
37
int i = 1;
#include <stdio.h>
int main()
{
int n = 5;
int i = 1;
for( ; ; ) {
printf("%d X %d = %d\n", n, i, n*i);
i = i + 1;
if (i > 10) {
break;
}
}
return 0;
}
for 5- n*i)
? 5 x 3- 5
+5+5
#include <stdio.h>
int main()
{
int m, n = 5;
int i;
m = 0;
for(i = 1; i <= 10; i = i + 1) {
m = m + n;
printf("%d X %d = %d\n", n, i, m);
}
return 0;
}
38
,
, ,
for 1 20
n- 5 1 20
?) -
n- 1 20 n-
#include <stdio.h>
int main()
{
int n, i;
for(n = 1; n <= 20; n = n + 1) {
for(i = 1; i <= 10; i = i + 1) {
printf("%d X %d = %d\n", n, i, n*i);
}
}
return 0;
}
1, 2, 3
1, 3, 2
2, 1, 3
2, 3, 1
3, 1, 2
3, 2, 1
, ,
39
,
#include <stdio.h>
int main()
{
int a, b, c;
for (a = 1; a <= 3; a++) {
for (b = 1; b <= 3; b++) {
for (c = 1; c <= 3; c++) {
printf ("%d, %d, %d\n", a, b, c);
}
}
}
return 0;
}
1, 1, 1
1, 1, 2
1, 1, 3
1, 2, 1
1, 2, 2
1, 2, 3
1, 3, 1
1, 3, 2
1, 3, 3
2, 1, 1
2, 1, 2
2, 1, 3
2, 2, 1
2, 2, 2
2, 2, 3
2, 3, 1
2, 3, 2
2, 3, 3
3, 1, 1
3, 1, 2
3, 1, 3
3, 2, 1
3, 2, 2
3, 2, 3
3, 3, 1
3, 3, 2
3, 3, 3
40
a- 1 b c- 1 , b c-
a, b c
b <= 3- , b != a b <= 3 && b != a b- 3-
b- a- , c <= 3 && c != a && c != b, c- 3-
c- a- c- b-
#include <stdio.h>
int main()
{
int a, b, c;
for (a = 1; a <= 3; a++) {
for (b = 1; b <= 3 && b != a; b++) {
for (c = 1; c <= 3 && c != a && c != b; c++) {
printf ("%d, %d, %d\n", a, b, c);
}
}
}
return 0;
}
?
3, 2, 1
a- 1 a <= 3 b- 1 b <=
3 b != a a b- , 1
a- 1 a++) a <= 3 a- 2) b- 1 b <= 3
b != a c- 1 c <=3 , c !=a
c !=b 1)
a, b c- a-
3, b- 2 c- 1, 3, 2, 1
b- a-
41
#include <stdio.h>
int main()
{
int a, b, c;
for (a = 1; a <= 3; a++) {
for (b = 1; b <= 3; b++) {
if (b != a) {
for (c = 1; c <= 3; c++) {
if (c != b && c != a){
printf ("%d, %d, %d\n", a, b, c);
}
}
}
}
}
return 0;
}
,
1, 2, 3
1, 3, 2
2, 1, 3
2, 3, 1
3, 1, 2
3, 2, 1
,
#include <stdio.h>
int main()
{
int a, b, c;
for (a = 1; a <= 3; a++) {
for (b = 1; b <= 3; b++) {
for (c = 1; c <= 3; c++) {
if(b != a && c != a && c != b) {
printf ("%d, %d, %d\n", a, b, c);
}
}
}
}
return 0;
}
42
a, b, c ,
, ,
, run time)
assignment operation)
comparison operation)
? , ?
,
http://jontrogonok.com/?p=6
http://jontrogonok.com/?p=9
43
-
, -
x + y = 15, x y=5 x y- ?
4x + 5y = 14, 5x + 6y = 17 x y- ?
#include <stdio.h>
int main()
{
double x, y, x_plus_y, x_minus_y;
printf("Enter the value of x + y: ");
scanf("%lf", &x_plus_y);
printf("Enter the value of x - y: ");
scanf("%lf", &x_minus_y);
x = (x_plus_y + x_minus_y) / 2;
y = (x_plus_y - x_minus_y) / 2;
printf("x = %0.2lf, y = %0.2lf\n", x, y);
return 0;
}
int double
44
#include <stdio.h>
int main()
{
double a1, a2, b1, b2, c1, c2, x, y;
printf("a1 = ");
scanf("%lf", &a1);
printf("a2 = ");
scanf("%lf", &a2);
printf("b1 = ");
scanf("%lf", &b1);
printf("b2 = ");
scanf("%lf", &b2);
printf("c1 = ");
scanf("%lf", &c1);
printf("c2 = ");
scanf("%lf", &c2);
x = (b2 * c1 - b1 * c2) / (a1 * b2 - a2 * b1);
y = (a1 * c2 - a2 * c1) / (a1 * b2 - a2 * b1);
printf("x = %0.2lf, y = %0.2lf\n", x, y);
return 0;
}
a1 * b2 - a2 * b1)- x- ,
y- ,
a1 * b2 - a2 * b1)- , ,
45
#include <stdio.h>
int main()
{
double a1, a2, b1, b2, c1, c2, d, x, y;
printf("a1 = ");
scanf("%lf", &a1);
printf("a2 = ");
scanf("%lf", &a2);
printf("b1 = ");
scanf("%lf", &b1);
printf("b2 = ");
scanf("%lf", &b2);
printf("c1 = ");
scanf("%lf", &c1);
printf("c2 = ");
scanf("%lf", &c2);
d = a1 * b2 - a2 * b1;
if ((int) d == 0) {
printf("Value of x and y can not be determined.\n");
}
else {
x = (b2 * c1 - b1 * c2) / d;
y = (a1 * c2 - a2 * c1) / d;
printf("x = %0.2lf, y = %0.2lf\n", x, y);
}
return 0;
}
?
,
46
35% -
, ?
, 10000 + 10000 * 35 / 100 -
#include <stdio.h>
int main()
{
double loan_amount, interest_rate, number_of_years, total_amount, monthly_amount;
printf("Enter the loan amount: ");
scanf("%lf", &loan_amount);
printf("Enter the interest rate: ");
scanf("%lf", &interest_rate);
printf("Number of years: ");
scanf("%lf", &number_of_years);
total_amount = loan_amount + loan_amount * interest_rate / 100.00;
monthly_amount = total_amount / (number_of_years * 12);
printf("Total amount: %0.2lf\n", total_amount);
printf("Monthly amount: %0.2lf\n", monthly_amount);
return 0;
}
35%
35% 10000 + 10000 * 35 * 5 / 100
2t v x 2t -
v = u + at
s = ut + 0.5 at^2 ( s t
2t
u x 2t + 0.5 x a x (2t)^2 = u x 2t + 0.5 x a x 4t^2 = u x 2t + a x 2t^2 = 2t (u + at) = 2tv
47
, , v t- , 2t
, , 1000 x 1001 / 2
,
#include <stdio.h>
int main()
{
int n, sum;
scanf("%d", &n);
sum = (n * (n + 1)) / 2;
printf("Summation is %d\n", sum);
return 0;
}
#include <stdio.h>
int main()
{
int i, n, sum;
scanf("%d", &n);
for(i = 1, sum = 0; i <= n; i++) {
sum = sum + i;
}
printf("Summation is %d\n", sum);
return 0;
}
,
,
, , n-
n- , ,
sum
n n-
,
48
Celsius) Farenheit)
°F = (°C × 1.8) + 32
#include <stdio.h>
int main()
{
double celsius, farenheit;
printf("Enter the temperature in celsius: ");
scanf("%lf", &celsius);
farenheit = 1.8 * celsius + 32;
printf("Temperature in farenheit is: %lf\n", farenheit);
return 0;
}
49
,
, a b , x x-
5 10- - 5- a b, x
a % x == 0 b % x == 0) a b
, x- x-
, x- 1 , x a b
?
#include <stdio.h>
int main()
{
int a, b, x, gcd;
scanf("%d %d", &a, &b);
if (a < b) {
x = a;
}
else {
x = b;
}
for(; x >= 1; x--) {
if (a % x == 0 && b % x == 0) {
gcd = x;
break;
}
}
printf("GCD is %d\n", gcd);
return 0;
}
efficient) ,
co-prime) 1
, 1
division algorithm)
a 0- - a
a b- b a % b-
, a- b b- a%b , b-
b- a( a- , b-
a-
50
#include <stdio.h>
int main()
{
int a, b, t, x, gcd;
scanf("%d %d", &a, &b);
if (a == 0) gcd = b;
else if (b == 0) gcd = a;
else {
while (b != 0) {
t = b;
b = a % b;
a = t;
}
gcd = a;
}
printf("GCD is %d\n", gcd);
return 0;
}
,
, ,
51
-
- ,
,
100 50%, 25% 25%
#include <stdio.h>
int main()
{
int ft_marks, st_marks, final_marks;
double total_marks;
ft_marks = 80;
st_marks = 74;
final_marks = 97;
total_marks = ft_marks / 4.0 + st_marks / 4.0 + final_marks / 2.0;
printf("%0.0lf\n", total_marks);
return 0;
}
#include
int main()
{
int ft_marks_1, st_marks_1, final_marks_1, ft_marks_2, st_marks_2, final_marks_2, ft_marks_3, st_marks_3,
final_marks_3,
, ? ?
160
Array)
, C
52
char char
#include <stdio.h>
int main()
{
int ara[5] = {10, 20, 30, 40, 50};
printf("First element: %d\n", ara[0]);
printf("Third element: %d\n", ara[2]);
return 0;
}
#include <stdio.h>
int main()
{
int ara[5] = {6, 7, 4, 6, 9};
printf("%d\n", ara[-1]);
printf("%d\n", ara[5]);
printf("%d\n", ara[100]);
return 0;
}
?
garbage) -1, 5, 100 5
0 4
53
, ? ara[0]),
ara[1]),
#include <stdio.h>
int main()
{
int ara[10] = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
int i;
for(i = 0; i < 10; i++) {
printf("%d th element is: %d\n", i+1, ara[i]);
}
return 0;
}
? , index 9 0
,
, , ,
,
#include <stdio.h>
int main()
{
int ara[] = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
int ara2[10];
int i, j;
for(i = 0, j = 9; i < 10; i++, j--) {
ara2[j] = ara[i];
}
for(i = 0; i < 10; i++) {
ara[i] = ara2[i];
}
for(i = 0; i < 10; i++) {
printf("%d\n", ara[i]);
}
return 0;
}
54
, -
ara ara2
int temp;
temp = ara[9];
ara[9] = ara[0];
ara[0] = temp;
temp = ara[8];
ara[8] = ara[1];
ara[1] = temp;
#include <stdio.h>
int main()
{
int ara[] = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
int i, j, temp;
for(i = 0, j = 9; i < 10; i++, j--) {
temp = ara[j];
ara[j] = ara[i];
ara[i] = temp;
}
for(i = 0; i < 10; i++) {
printf("%d\n", ara[i]);
}
return 0;
}
? ?
10
20
30
40
50
60
70
80
90
100
55
, bug),
, debug)
,
,
1 index 0 total_marks[34]-
? 35 n total_marks[n-1]
#include <stdio.h>
int main()
{
int ft_marks[40] = {83, 86, 97, 95, 93, 95, 86, 52, 49, 41, 42, 47, 90, 59, 63, 86, 40, 46, 92, 56, 51, 48, 67, 49,
42, 90, 42, 83, 47, 95, 69, 82, 82, 58, 69, 67, 53, 56, 71, 62},
st_marks[40] = {86, 97, 95, 93, 95, 86, 52, 49, 41, 42, 47, 90, 59, 63, 86, 40, 46, 92, 56, 51, 48, 67, 49, 42,
90, 42, 83, 47, 95, 69, 82, 82, 58, 69, 67, 53, 56, 71, 62, 49},
final_marks[40] = {87, 64, 91, 43, 89, 66, 58, 73, 99, 81, 100, 64, 55, 69, 85, 81, 80, 67, 88, 71, 62, 78, 58,
66, 98, 75, 86, 90, 80, 85, 100, 64, 55, 69, 85, 81, 80, 67, 88, 71};
int i;
double total_marks[40];
for(i = 0; i < 40; i++) {
total_marks[i] = ft_marks[i] / 4.0 + st_marks[i] / 4.0 + final_marks[i] / 2.0;
}
for(i = 1; i <= 40; i++) {
printf("Roll NO: %d\tTotal Marks: %0.0lf\n", i, total_marks[i-1]);
}
return 0;
}
, printf \t , Tab)
\t ,
56
50 , 51
,
50- 50
100 total_marks
, 50 , 51 100 50 100
total_marks
for(marks = 50; marks <= 100; marks++) { marks- 50, 51,
100
count = 0; 'marks' marks-
total_marks marks- , count-
marks) , count-
for(i = 0; i < 40; i++) {
if(total_marks[i] == marks) {
count++;
}
}
printf("Marks: %d Count: %d\n", marks, count); marks count)
#include <stdio.h>
int main()
{
int marks, i, count;
int total_marks[] = {86, 78, 94, 68, 92, 78, 64, 62, 72, 61, 72, 66, 65, 65, 80, 72, 62, 68, 81, 62, 56, 68, 58,
56, 82, 70, 74, 78, 76, 84, 88, 73, 62, 66, 76, 70, 67, 65, 77, 63};
for(marks = 50; marks <= 100; marks++) {
count = 0;
for(i = 0; i < 40; i++) {
if(total_marks[i] == marks) {
count++;
}
}
printf("Marks: %d Count: %d\n", marks, count);
}
return 0;
}
57
- if-
total_marks[i] == marks) ? 51
40 51 x 40 = 2040
#include <stdio.h>
int main()
{
int i;
int total_marks[] = {86, 78, 94, 68, 92, 78, 64, 62, 72, 61, 72, 66, 65, 65, 80, 72, 62, 68, 81, 62, 56, 68, 58,
56, 82, 70, 74, 78, 76, 84, 88, 73, 62, 66, 76, 70, 67, 65, 77, 63};
int marks_count[101];
for(i = 0; i < 101; i++) {
marks_count[i] = 0;
}
for(i = 0; i < 40; i++) {
marks_count[total_marks[i]]++;
}
for(i = 50; i <= 100; i++) {
printf("Marks: %d Count: %d\n", i, marks_count[i]);
}
return 0;
}
, marks_count
marks_count[n] n total_marks- 0 100-
101 int marks_count[101];
, , marks_count 0
for(i = 0; i < 101; i++) { marks_count[i] = 0; } total_marks marks_count
for(i = 0; i < 40; i++) { marks_count[total_marks[i]]++; } ?
i- 0, total_marks[i] total_marks[0], 86 marks_count
marks_count[86]) ,
marks_count[total_marks[i]]- marks_count[total_marks[i]]++;
t_m = total_marks[i]; marks_count[t_m]++;
marks_count[total_marks[i]]++; marks_count
58
#include <stdio.h>
int main()
{
int i, j;
int total_marks[] = {6, 7, 4, 6, 9, 7, 6, 2, 4, 3, 4, 1};
int marks_count[11];
for(i = 0; i < 11; i++) {
marks_count[i] = 0;
}
for(i = 0; i < 12; i++) {
marks_count[total_marks[i]]++;
for(j = 0; j <= 10; j++) {
printf("%d ", marks_count[j]);
}
printf("\n");
}
return 0;
}
59
- Function)
?
?
,
printf
scanf, getchar printf ,
printf , stdio.h
header) printf, scanf
#include ) - string.h
, printf ,
, main , ?
main ,
main
function_name:
60
parameters: -
strlen -
?)
, getchar() main() ,)
function_body:
return value: ,
sqrt()
? x , return x;
#include <stdio.h>
int main()
{
double a, b, c;
a = 2.5;
b = 2.5;
c = a + b;
printf("%lf\n" c);
return 0;
}
? 5.000000
61
main
#include <stdio.h>
int add(int num1, int num2)
{
double sum = num1 + num2;
return sum;
}
int main()
{
double a, b, c;
a = b = 2.5;
c = add(a, b);
printf("%lf\n", c);
return 0;
}
? 5.000000 , , a, b-
a = 2.8; b = 2.7; ? 5.500000? 2.8 + 2.7 = 5.5)
? 5.000000 ?
62
, int, num1 num2 sum-
5.5 double
#include <stdio.h>
double add(double n1, double n2)
{
double sum = n1 + n2;
return sum;
}
int main()
{
double a, b, c;
a = 2.8;
b = 2.7;
c = add(a, b);
printf("%lf\n", c);
return 0;
}
add main
#include <stdio.h>
int main()
{
double a = 2.8, b = 2.7, c;
c = add(a, b);
printf("%lf\n", c);
return 0;
}
double add(double n1, double n2)
{
double sum = n1 + n2;
return sum;
}
,
add , main
add prototype)
63
return_type function_name (parameters) ;
#include <stdio.h>
double add(double x, double y);
int main()
{
double a = 2.8, b = 2.7, c;
c = add(a, b);
printf("%lf\n", c);
return 0;
}
double add(double n1, double n2)
{
double sum = n1 + n2;
return sum;
}
#include <stdio.h>
int test_function(int x)
{
int y = x;
x = 2 * y;
return (x * y);
}
int main()
{
int x = 10, y = 20, z = 30;
z = test_function(x);
printf("%d %d %d\n", x, y, z);
return 0;
}
? ,
64
20 10 200 ( x = 20, y = 10, z = 200)?
x, y- test_function- x- 10 ,
y- y- 10 x- 2*y 20 x*
y( , 20 * 10 200) z- 200
, ,
global)
#include <stdio.h>
double pi = 3.14;
void my_fnc() {
pi = 3.1416; /* pi-
return; /* void return;
}
int main() {
printf("%lf\n", pi); /* pi- 3.14 */
my_fnc();
printf("%lf\n", pi); /* pi- 3.1416 my_fnc
return 0;
}
, ?
int i;
for(i = 1; i < n; i++) { if (ara[i] > max) {
65
max = ara[i]; /* ara[i] max- max- ara[i]-
}
}
return max; /*
}
? ,
?
#include <stdio.h>
int find_max(int ara[], int n);
int main()
{
int ara[] = {-100, 0, 53, 22, 83, 23, 89, -132, 201, 3, 85};
int n = 11;
int max = find_max(ara, n);
printf("%d\n", max);
return 0;
}
int find_max(int ara[], int n)
{
int max = ara[0];
int i;
for(i = 1; i < n; i++) {
if (ara[i] > max) {
max = ara[i];
}
}
return max;
}
find_min find_sum,
find_average
66
pass,
,
#include <stdio.h>
void test_function(int ara[])
{
ara[0] = 100;
return;
}
int main()
{
int ara [] = {1, 2, 3, 4, 5};
printf("%d\n", ara[0]);
test_function(ara);
printf("%d\n", ara[0]);
return 0;
}
? printf 1 , printf
? test_function- 100
, ara[0]- 100, - , 1
100,
,
?
67
-
' ?' -
N( - , ?
,1 1000- 50
500- , ?
250- , ?
125- , ?
62- , ?
31- , ?
46- , ?
54- , ?
50- , ?
?
1 1000 1 500 1 250, 1 125, 1 62, 31
62, 46 62, 46 54
int ara[] = {1, 4, 6, 8, 9, 11, 14, 15, 20, 25, 33 83, 87, 97, 99, 100};
68
low high- ? low = 1 high = 100 ?
,
ara- 0 15
-
low_indx = 0;
high_indx = 15;
97
num = 97;
, num ara- ?
while(1) {
mid_indx = (low_indx + high_indx) / 2;
if(num == ara[mid_indx]) {
/* num ara[mid_indx]- ,
break;
}
if(num < ara[mid_indx]) {
/* num ara[mid_indx]- , low_indx mid_indx 1
high_indx = mid_indx 1;
}
else {
/* num ara[mid_indx]- , mid_indx + 1 high_indx
low_indx = mid_indx + 1;
}
}
- ,
while(1) 1 ara-
, ara- ?
69
#include <stdio.h>
int main()
{
int ara[] = {1, 4, 6, 8, 9, 11, 14, 15, 20, 25, 33 83, 87, 97, 99, 100};
int low_indx = 0;
int high_indx = 15;
int mid_indx;
int num = 97;
while (low_indx <= high_indx) {
mid_indx = (low_indx + high_indx) / 2;
if (num == ara[mid_indx]) {
break;
}
if (num < ara[mid_indx]) {
high_indx = mid_indx 1;
}
else {
low_indx = mid_indx + 1;
}
}
if (low_indx > high_indx) {
printf("%d is not in the array\n", num);
}
else {
printf("%d is found in the array. It is the %d th element of the array.\n", ara[mid_indx], mid_indx);
}
return 0;
}
70
- string)
string , ,
- ,
character string
- char
char country[11] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h', '\0'};
char country[] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h', '\0'};
char country[] = "Bangladesh";
char *country = "Bangladesh";
#include <stdio.h>
int main()
{
char country[] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h', '\0'};
printf("%s\n", country);
return 0;
}
printf- s '\0'
#include <stdio.h>
int main()
{
char country[] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h', ' ', 'i', 's', ' ', 'm', 'y', ' ', 'c', 'o', 'u', 'n', 't', 'r', 'y'};
printf("%s\n", country);
return 0;
}
71
? ?
#include <stdio.h>
int main()
{
char country[] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h', '\0', 'i', 's', ' ', 'm', 'y', ' ', 'c', 'o', 'u', 'n', 't', 'r', 'y'};
printf("%s\n", country);
return 0;
}
'\0'
#include <stdio.h>
int main()
{
char country[] = {'B', 'a', 'n', 'g', 'l', 'a', 'd', 'e', 's', 'h'};
int i, length;
printf("%s\n", country);
length = 10;
for(i = 0; i < length; i++) {
if(country[i] >= 97 && country[i] <= 122) {
country[i] = 'A' + (country[i] - 'a');
}
}
printf("%s\n", country);
return 0;
}
uppercase lowercase-
length = 10
72
Null character ('\0') , '\0'
#include <stdio.h>
int string_length(char str[])
{
int i, length = 0;
for(i = 0; str[i] != '\0'; i++) {
length++;
}
return length;
}
int main()
{
char country[100];
int length;
while(1 == scanf("%s", country)) {
length = string_length(country);
printf("length: %d\n", length);
}
return 0;
}
scanf
s scanf ,
, scanf
scanf("%d %d", &n1, &n2); value = scanf("%d %d", &n1, &n2);
value- 2 while(1 == scanf("%s", country)) ,
country- scanf , 1 , 1 == 1),
73
country- & &country
s ,
, scanf , this is scanf
this , scanf , is
gets
#include <stdio.h>
int main()
{
char ara[100];
while(NULL != gets(ara)) {
printf("%s\n", ara);
}
return 0;
}
string_length
concatenate bangla"
desh" bangladesh"
str3 bangladesh"
str3 = str1 + str2;
74
' '- str1- str3
, str2- str3
#include <stdio.h>
int main()
{
char str1[] = "bangla", str2[] = "desh", str3[12];
int i, j, length1 = 6, length2 = 4;
for(i = 0, j = 0; i < length1; i++, j++) {
str3[j] = str1[i];
}
for(i = 0, j = 0; i < length2; i++, j++) {
str3[j] = str2[i];
}
str3[j] = '\0';
printf("%s\n", str3);
return 0;
}
? bangladesh desh
i- 0 i str1- j str3-
j- 0 str1- str3 i j-
1 i++, j++) i j 6
75
, ,
>, <, >=, <=, == ,
,
alphabetical ordering) - ? ,
'aaa'- 'aab' 'ba' 'ca'- 'ca'
string_compare() 1 , -1
0 char
a- b- , a- b-
a- b- ,
a, b- -1 a- b-
, 1 a, b-
? 0
,
string.h - strcmp, strlen, strcpy
,
,
76
1000
punctuation)
, ? , scanf("%s")
gets() ? ,
'a' 'z', 'A' 'Z' '0' '9'
, ?-
is_word_started 0 ,
1 0 is_word_started-
1) 'a' 'z' 'A' 'Z', '0' '9' ,
,
77
#include <stdio.h>
#include <string.h>
int main()
{
char s[1002], word[100];
int i, j, length, is_word_started;
gets(s);
length = strlen(s);
is_word_started = 0;
for (i = 0, j = 0; i < length; i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
if (is_word_started == 0) {
is_word_started = 1;
word[j] = 'A' + s[i] - 'a'; // first character is capital
j++;
}
else {
word[j] = s[i];
j++;
}
}
else if (s[i] >= 'A' && s[i] <= 'Z') {
if (is_word_started == 0) {
is_word_started = 1;
}
word[j] = s[i];
j++;
}
else if (s[i] >= '0' && s[i] <= '9') {
if (is_word_started == 0) {
is_word_started = 1;
}
word[j] = s[i];
j++;
}
else {
if (is_word_started == 1) {
is_word_started = 0;
word[j] = '\0';
printf("%s\n", word);
j = 0;
}
}
}
return 0;
}
78
? , ,
gets() warning)
,
This is a test. ?
This
Is
A
test ?
test-
strlen - string.h
include s- word
i=0 length s-
if (is_word_started == 0) ,
is_word_started- 1 word[j] s[i]- j-
else if (s[i] >= 'A' && s[i] <= 'Z') else if (s[i] >= '0' && s[i] <= '9')
s[i] word[j] else if ((s[i] >= 'A' && s[i] <= 'Z') ||
(s[i] >= '0' && s[i] <= '9')) else- if else if-
s[i]- word- word ,
word word
else {
if (is_word_started == 1) {
is_word_started = 0;
word[j] = '\0';
printf("%s\n", word);
j = 0;
}
}
test- ?
test
79
, word
#include <stdio.h>
#include <string.h>
int main()
{
char s[1002], ch;
int i, length, is_word_started;
gets(s);
length = strlen(s);
is_word_started = 0;
for (i = 0; i < length; i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
if (is_word_started == 0) {
is_word_started = 1;
ch = 'A' + s[i] - 'a';
printf("%c", ch);
}
else {
printf("%c", s[i]);
}
}
else if ((s[i] >= 'A' && s[i] <= 'Z') || (s[i] >= '0' && s[i] <= '9')) {
if (is_word_started == 0) {
is_word_started = 1;
}
printf("%c", s[i]);
}
else {
if (is_word_started == 1) {
is_word_started = 0;
printf("\n");
}
}
}
printf("\n");
return 0;
}
80
-
Prime Number) ,
,
1- 1 -
#include <stdio.h>
int is_prime(int n)
{
int i;
if (n < 2) {
return 0;
}
for(i = 2; i < n; i++) {
if(n % i == 0) {
return 0;
}
}
return 1;
}
int main()
{
int n;
while(1) {
printf("Please enter a number (enter 0 to exit): ");
scanf("%d", &n);
if(n == 0) {
break;
}
if(1 == is_prime(n)) {
printf("%d is a prime number.\n", n);
}
else {
printf("%d is not a prime number.\n", n);
}
}
return 0;
}
81
n n 2
n-1 n
, 0
n , n
1
- efficient)
2147483647
2147483647 2 2147483646
2 n-1
2 n/2
2 ,
2
int is_prime(int n)
{
int i;
if (n < 2) {
return 0;
}
if(n == 2) {
return 1;
}
if(n % 2 == 0) {
return 0;
}
for(i = 3; i <= n / 2; i = i + 2) {
if(n % i == 0) {
return 0;
}
}
return 1;
}
n- 2 2 n
n , n , 2
3 n/2 n
2147483647
,
n- n/2
n- n=pxq ,p q n-
math.h sqrt()
82
#include <stdio.h>
#include <math.h>
int is_prime(int n)
{
int i, root;
if(n == 2) {
return 1;
}
if(n % 2 == 0) {
return 0;
}
root = sqrt(n);
for(i = 3; i <= root; i = i + 2) {
if(n % i == 0) {
return 0;
}
}
return 1;
}
int main()
{
int n, m;
while(1) {
printf("Please enter a number (enter 0 to exit): ");
scanf("%d", &n);
if(n == 0) {
break;
}
if(1 == is_prime(n)) {
printf("%d is a prime number.\n", n);
}
else {
printf("%d is not a prime number.\n", n);
}
}
return 0;
}
83
, Eratosthenes)
- Sieve of Eratosthenes)
, 2 40 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 40. , 2 2- 2 , 2-
2, 3, 5, 7, 9, 11, 13, 15, 17, 19 , 21, 23, 25, 27, 29, 31, 33, 35, 37, 39.
3- 3- 2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35,
37. 5- 5 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37.
7 37- 7-
7- ? 7-
14, 21, 28, 35 7- 7-
2 120
, ara
, n- ara[n]
ara[n]- 1 , n ara[n]- 0 n
, n 1
1 1,
2 m ,
0) m- m- n-
84
#include <stdio.h>
#include <math.h>
const int size = 40;
int ara[size];
void print_ara()
{
int i;
for(i = 2; i < size; i++) {
printf("%4d", ara[i]);
}
printf("\n");
for(i = 2; i < size; i++) {
printf("----");
}
printf("\n");
for(i = 2; i < size; i++) {
printf("%4d", i);
}
printf("\n\n\n");
}
void sieve()
{
int i, j, root;
for(i = 2; i < size; i++) {
ara[i] = 1;
}
root = sqrt(size);
print_ara();
for(i = 2; i <= root; i++) {
if(ara[i] == 1) {
for(j = 2; i * j <= size; j++) {
ara[i * j] = 0;
}
print_ara();
}
}
}
int is_prime(int n)
{
int i;
if(n < 2) {
return 0;
85
}
return ara[n];
}
int main()
{
int n, m;
sieve();
while(1) {
printf("Please enter a number (enter 0 to exit): ");
scanf("%d", &n);
if(n == 0) {
break;
}
if(n >= size) {
printf("The number should be less than %d\n", size);
continue;
}
if(1 == is_prime(n)) {
printf("%d is a prime number.\n", n);
}
else {
printf("%d is not a prime number.\n", n);
}
}
return 0;
}
, print_ara()
sieve() , ,
n ara[n]- , 1 n , 0 n
size-
fast) ? ?
, 100 , 100
' '
n- size- , n-
100000000 ( 10000 sieve
? , ,
,
, 0 1
sieve
86
-
? -
, ,
, -
-
,
,
-
Roll: 1 Roll: 2 Roll: 3 Roll: 4 Roll: 5 Roll: 6 Roll: 7 Roll: 8 Roll: 9 Roll: 10
First terminal 80 70 92 78 58 83 85 66 99 81
exam
Final exam 98 67 75 89 81 83 80 90 88 77
Total marks
, 10 ? marks[0][0]
?
int marks[4][10] = {{80, 70, 92, 78, 58, 83, 85, 66, 99, 81}, {75, 67, 55, 100, 91, 84, 79, 61, 90, 97}, {98, 67,
75, 89, 81, 83, 80, 90, 88, 77}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
87
marks[0]
, marks[1]- , marks[2]- marks[3]
, 0
#include <stdio.h>
int main()
{
int marks[4][10] = {{80, 70, 92, 78, 58, 83, 85, 66, 99, 81}, {75, 67, 55, 100, 91, 84, 79, 61, 90, 97}, {98,
67, 75, 89, 81, 83, 80, 90, 88, 77}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
int col;
for(col = 0; col < 10; col++) {
marks[3][col] = marks[0][col] / 4.0 + marks[1][col] / 4.0 + marks[2][col] / 2.0;
printf("Roll NO: %d Total Marks: %d\n", col + 1, marks[3][col]);
}
return 0;
}
int marks[4][10];
int i, j;
for (i = 0; i < 4; i++) {
for (j = 0; j < 10; j++) {
scanf("%d", &ara[i][j]);
}
}
-
i = 0, - j=0 9 , i=1
( - j=0 9(
88
1 10 2-D
- , - -
? ,
,
#include <stdio.h>
int main()
{
int namta[10][10];
int row, col;
for (row = 0; row < 10; row++) {
for(col = 0; col < 10; col++) {
namta[row][col] = (row + 1) * (col + 1);
}
}
for (row = 0; row < 10; row++) {
for(col = 0; col < 10; col++) {
printf("%d x %d = %d\n", (row + 1), (col + 1), namta[row][col]);
}
printf("\n");
}
return 0;
}
- ,
namta
,
, ,
, , , ? char type
char country[] = "Bangladesh"; 2-D
? ?
, 100 ,
100 ,
#include <stdio.h>
int main()
{
char saarc[7][100] = {"Bangladesh", "India", "Pakistan", "Sri Lanka", "Nepal", "Bhutan", "Maldives"};
int row;
for (row = 0; row < 7; row++) {
printf("%s\n", saarc[row]);
}
return 0;
}
89
, saarc[3][3], saarc[0][5] saarc[5][0]
? ,
#include <stdio.h>
#include <string.h>
int main()
{
char saarc[7][100] = {"Bangladesh", "India", "Pakistan", "Sri Lanka", "Nepal", "Bhutan", "Maldives"};
int row, col, name_length;
for (row = 0; row < 7; row++) {
name_length = strlen(saarc[row]);
for(col = 0; col < name_length; col++) {
printf("%c ", saarc[row][col]);
}
printf("\n");
}
return 0;
}
#include <stdio.h>
#include <string.h>
int main()
{
char saarc[7][100] = {"Bangladesh", "India", "Pakistan", "Sri Lanka", "Nepal", "Bhutan", "Maldives"};
int row, col, name_length;
for (row = 0; row < 7; row++) {
name_length = strlen(saarc[row]);
for(col = 0; col < name_length; col++) {
printf("(%d, %d) = %c, ", row, col, saarc[row][col]);
}
printf("\n");
}
return 0;
}
90
6 4 7 8 9
3 7 1 9 9
8 6 4 2 7
2 4 2 5 9
4 1 6 7 3
2-D -
Sum of row 1: 34
Sum of row 2: 29
Sum of row 3: 27
Sum of row 4: 22
Sum of row 5: 21
Sum of column 1: 23
Sum of column 2: 22
Sum of column 3: 20
Sum of column 4: 31
Sum of column 5: 37
,
-
6 3 8 2 4
4 7 6 4 1
7 1 4 2 6
8 9 2 5 7
9 9 7 9 3
, -
6, 4, 7, 8, 9 6, 4, 7, 8, 9
, 5x5 5 5 ,
5x5 ,
1, 2, 3, 4, 5
1, 2, 3, 4, 5 ?
, ,
91
#include <stdio.h>
#include <string.h>
int main()
{
int ara1[5][5] = {{1, 2, 3, 4, 5}, {10, 20, 30, 40, 50}, {100, 200, 300, 400, 500}, {1000, 2000, 3000, 4000,
5000}, {10000, 20000, 30000, 40000, 50000}};
int ara2[5][5];
int r, c;
printf("Content of first array (ara1): \n");
for (r = 0; r < 5; r++) {
for(c = 0; c < 5; c++) {
printf("%d ", ara1[r][c]);
}
printf("\n");
}
printf("\n");
// now start copy
for (r = 0; r < 5; r++) {
for(c = 0; c < 5; c++) {
ara2[c][r] = ara1[r][c];
}
}
printf("Content of second array (ara2): \n");
for (r = 0; r < 5; r++) {
for(c = 0; c < 5; c++) {
printf("%d ", ara2[r][c]);
}
printf("\n");
}
return 0;
}
2-D ,
2-D
3-D, 4-D ,
92
-
- (decimal)
(binary)
0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ,0 1
. , ( ) ,
( 1 0- 1
, 9 09 , 09- 10), 0
9 ( 1
0- 1 ) : 0, 1, 10, 11,
100, 101, 110, 111, 1000, 1001, 1010, 1011 ... ,
0- 1 (
)
, , , ,
, , ?
10 , 100 , 1000 ,
(10), (100), (1000), (10000)
(100 = 1) , (101 = 10)
, (102 = 100) , (20 =
1) , (21 = 2) , (22 = 4) ,
, , , ,
,
:
0 + 0 = 0,
0 + 1 = 1,
1 + 0 = 1,
1 + 1 = 10
,1+1 , (10) , ,
101 + 101 = ?
, 1 + 1 = 10 0 1 (carry)
, 0 + 0 = 0, 0- 1
93
1 , 1 + 1 = 10 ( carry )
0 1 : 1010 1011 + 1011 = ?
10110 ,
0 0 = 0,
1 0 = 1,
1 1 = 0,
0 1=1
, 23 15 ? 3- 1 (
1 ), 13 5=8 , 1-
0 1 0- , 10 ( ),
(
)
110 101 = ?
0 1 1, 1 101-
1 1 = 0, 1 1=0 : 001 1 -
-
x 10 - ,
x2 - : 1903 = 1 x 103 + 9 x
102 + 0 x 101 + 3 x 100
: 10110 = 1 x 24 + 0 x 23 + 1 x 22 + 1 x 21 + 0 x 20 Exponential
Expression
10110 = 1 x 24 + 0 x 23 + 1 x 22 + 1 x 21 + 0 x 20 = 1 x 16 + 0 x 8 + 1 x 4 + 1 x 2 + 0 x 1
= 16 + 0 + 4 + 2 + 0 = 22
10110 = 22 ,
,
?
94
char binary[] = "10110";
int len = 5; // 5
int decimal = 0; // , 0
2
'1' ,-
?- 4 ,
0
int position = 4;
int indx;
for(indx = 0; indx < len; indx++) {
decimal = decimal + pow(2, position);
position--;
}
, pow
math.h ab- pow(a, b)
:
#include <stdio.h>
#include <string.h>
#include <math.h>
int main()
{
char binary[65];
int len, decimal, power, i;
printf("Enter the binary number: ");
scanf("%s", binary);
decimal = 0;
len = strlen(binary);
power = len - 1;
for(i = 0; i < len; i++) {
decimal += pow(2, power);
power--;
}
printf("Decimal value is %d\n", decimal);
return 0;
}
95
10110 , ? 31
22
? 10110- ,
: ['1', '0', '1', '1', '0']
binary[0]- pow(2, 4), binary[1]- binary[4]-
pow(2, 0) 10110-
?
'0' '0' = 48 48 = 0
'1' '0' = 49 48 = 1
96
95 n- , 2n <= 95
1, 2, 4, 8, 16, 32, 64, 128, ... 64 < 95 26 <
95 n- 6 (0 6 )
64 < 95, ( )
1 (1xxxxxx) n- 1 64 + 25 = 64 + 32 = 96, 95-
0 (10xxxxx) n- , n-
4 64 + 24 = 64 + 16 = 80 < 95 1 (101xxxx) n-
, n = 3 80 + 23 = 80 + 8 = 88 < 95 1 (1011xxx) ,n
= 2- 88 + 22 = 88 + 4 = 92 < 95 1 (10111xx) n = 1, 92 + 21 =
92 + 2 = 94 < 95 1 (101111x) n = 0, 94 + 20 = 94 + 1 = 95
1 1011111
95/ 2 47 1
47/2 23 1
23/2 11 1
11/2 5 1
5/2 2 1
2/2 1 0
1 /2 0 1
:
1011111 0
main
97
-
printf ,
, 'c' ''(
palindrome) , ?
madam madam
Palindromes: https://www.youtube.com/watch?feature=player_embedded&v=g-noWOM0Vrg
The Palindrome Day Song! (01/11/10):
https://www.youtube.com/watch?feature=player_embedded&v=oKbIW5Vhca0
?
,
98
#include <stdio.h>
#include <string.h>
int main()
{
char word[80], reverse_word[80];
int i, j, len;
scanf("%s", word);
len = strlen(word);
for(i = 0, j = len - 1; i < len; i++, j--) {
reverse_word[i] = word[j];
}
reverse_word[i] = '\0';
printf("%s\n", reverse_word);
if (0 == strcmp(word, reverse_word)) {
printf("%s is a palindrome.\n", word);
}
else {
printf("%s is not a palindrome.\n", word);
}
return 0;
}
,
,
strcmp , ,
,
factorial) ?
n - n! n! = n * (n 1) *
(n 4! = 4 * 3 * 2 * 1 = 24 6! = 6 * 5 * 4 * 3 * 2 * 1 = 720 1! = 1 0! = 1
(0- , 0- 1
,
int
12-
12-
99
n( 1 < n < 100, n- 2
99 -
, , 5! = 120 = 2 * 2 * 2 * 3 * 5 2 3 ,3 1 5 1
5 5! = (2, 3), (3, 1), (5, 1) n-
? n-
99 12- n!-
- 2 99
- ,
, 3, 1, 5, 2,
4 ? 1
3, 5, 2, 4 1- 1, 2 3,
5, 4 3 1, 2, 3 5, 4 4
3- 1, 2, 3, 4 ,5 4- 1, 2, 3, 4, 5
sorting) -
,
, -
100
#include <stdio.h>
int main()
{
int ara1[] = {3, 1, 5, 2, 4};
int ara2[5];
int i, minimum, index_2;
for (index_2 = 0; index_2 < 5; index_2++) {
minimum = 10000;
for (i = 0; i < 5; i++) {
if (ara1[i] < minimum) {
minimum = ara1[i];
}
}
ara2[index_2] = minimum;
}
for (i = 0; i < 5; i++) {
printf("%d\n", ara2[i]);
}
return 0;
}
? , 1
1
1
1
1
1
minimum- 1 ,
1 1
minimum ,
minimum_index
minimum = 10000;
for (i = 0; i < 5; i++) {
if (ara1[i] < minimum) {
minimum = ara1[i];
minimum_index = i;
}
}
101
minimum- ara1[minimum_index]
ara1[minimum_index] = 10000;
#include <stdio.h>
int main()
{
int ara1[] = {3, 1, 5, 2, 4};
int ara2[5];
int i, minimum, index_2, minimum_index;
for (index_2 = 0; index_2 < 5; index_2++) {
minimum = 10000;
for (i = 0; i < 5; i++) {
if (ara1[i] < minimum) {
minimum = ara1[i];
minimum_index = i;
}
}
ara1[minimum_index] = 10000;
ara2[index_2] = minimum;
}
for (i = 0; i < 5; i++) {
printf("%d\n", ara2[i]);
}
return 0;
}
, ?
102
NxN
, , ,
(1, 0) (1, 2)
(3, 0) (3, 2)
(4, 0)
(5, 0)
(6, 0)
(7, 0)
(8, 0) (8, 8)
0, 0) 0, 8)
8, 0) 8, 8) , 2, 2)
1, 2) 3, 2) 2, 3) 2,
1) U (up), D (down), L (left), R (right), S (stop)
, stop
103
2-D
- , x, y) U , x-
, y- D , x- ,
y- R y- , x- L y-
, x-
#include <stdio.h>
int main()
{
int x, y;
char c;
printf("Please enter the initial position: ");
scanf("%d %d", &x, &y);
while (1) {
scanf("%c", &c);
if (c == 'S') {
break;
}
else if (c == 'U') {
x--;
}
else if (c == 'D') {
x++;
}
else if (c == 'R') {
y++;
}
else if (c == 'L') {
y--;
}
}
printf("Final position of the robot is: %d, %d\n", x, y);
return 0;
}
104
, ?
, (0, 4) blocked) 0, 3) 'R' ,
0, 4)
, 2-D
?
1 0
10 x 10 2-D
int grid[10][10];
if (grid[x][y] == 1) {
, x, y)
}
http://jontrogonok.com/?p=12
105
-
,
,
,
, , ?
, -
skill)
,
,
, ,
- C++)
Java), C#), PHP) Python)
,
IDE ,
,
,
OOP Object Oriented Programming) ,
,
Communication Skills),
,
,
, ,
106
-
, -
,
,
ICPC Regional Contest-
ICPC Regional Contest-
ICPC Regional Contest-
ICPC World Finals) 1998
http://en.wikipedia.org/wiki/ACM_ICPC_Dhaka_Site
- - ,
Google Code Jam
(http://code.google.com/codejam), Topcoder (http://www.topcoder.com/tc) Codechef
(http://www.codechef.com/) ,
, ,
107
-
, ,
,
, ,
Telecommuting
,
,
,
,
- - bid)
,
,
,
, ,
108
-
-
http://learnpythonthehardway.org/book/
http://c.learncodethehardway.org/book/
, , Discrete Mathematics
Kenneth H. Rosen- Discrete Mathematics
Discrete Mathematics
Introduction to Algorithms (
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein)
http://projecteuler.net/
,
http://www.spoj.pl/
, , , , , ,
http://uva.onlinejudge.org/
http://ace.delos.com/usacogate
,
,
http://www.topcoder.com/tc
http://codeforces.com
http://www.codechef.com
http://ioinformatics.org
109
http://cm.baylor.edu/welcome.icpc
http://matholympiad.org.bd/forum/
www.google.com
, google-
:
http://cpbook.subeen.com/p/blog-page_ html
110