U E D R , A S I H C RSS

새싹교실/2011/學高/5회차



1.



#include<stdio.h>

int main()
{
 int a=1,b=2,c=3,d=4,e=5;
 printf("%d\n",(++a)+(b++)*(c+d)%e);
 return 0;
}

  • bitwise operation
    • 0110 0101 ^ 1001 1010
    • 1010 1101 & 1010 1010
    • 1010 1111 | 1010 1001

  • ,

1.1.


1. 6

2. 1111 1111
1010 1000
1010 1111

2. 2011 4 4

2.1. :

2.1.1. (fact)

  • redirection: input: <, output: >
  • assignment operator: ==
  • arithmetic operator( 모르면 )
  • increment/decrement, postfix/prefix: 모르면 . 는데 (물 못 받만)
  • shorthand operator (arithmetic operator + assignment operator)
  • operator precedence/associativity
  • bitwise operator

2.1.2. (feeling/finds)

  • . .


2.2. :

2.2.1. (fact)

operator().
-expression statements
-assignment operater (=) .
-increment operator ++i는 expression , i++는 1
-decrement operator는 만 1
-operator precedence() << 이건 초등학교때 배운거.
%(모듈러?)는 *,/ ?
-bitwise는데 모르

2.2.2. (feeling/finds)

..
는 더 ~

2.2.3.



#include<stdio.h>

int main()
{
 int a=1,b=2,c=3,d=4,e=5;
 printf("%d\n",(++a)+(b++)*(c+d)%e);
 return 0;
}

2+2*7%5
2+4=6

  • bitwise operation
    • 0110 0101 ^ 1001 1010
    • 1010 1101 & 1010 1010
    • 1010 1111 | 1010 1001

1. 1111 1111
2. 1010 1000
3. 1010 1111

2.3. :



2.3.1. (fact)

i++ ++i는
(?) i++는 1
++i는 1 .
%는 .
/
+
-
*
. ()

a=b 는 b대 a (?)... .
면 == .



2.3.2. (feeling/finds)


  • -

2.3.3.



#include<stdio.h>

int main()
{
 int a=1,b=2,c=3,d=4,e=5;
 printf("%d\n",(++a)+(b++)*(c+d)%e);
 return 0;
}

=> : 2+2*7%5 2+4 6..

  • bitwise operation
    • 0110 0101 ^ 1001 1010
    • 1010 1101 & 1010 1010
    • 1010 1111 | 1010 1001
=> : 1111 1111

2.4. :

2.4.1. (fact)

봉봉 불능
i++ ++i를
i++ 딴 보 i만 , 1 .
%는 mod 미.
+ - * / 미 !
=
x=y x y를 , x==y
x=x+3 보는 x+=3 ? ? 더 많 는(?).
는 불데 . ....

2.4.2. (feeling/finds)

......
.
c ,
.....

2.4.3.

: 면 2+2*7%5
14 = 4 ( mod 5 )
6

bitwse operation :
1111 1111 ( XOR )
1010 1000 ( AND )
1010 1111 ( OR )

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:29:42
Processing time 0.0237 sec