21 B92 B92 Quantum cryptography simulator
|
|
|
- ときな こしの
- 4 years ago
- Views:
Transcription
1 21 B92 B92 Quantum cryptography simulator
2 B92 BB84 BB84 E91 B B B92, i
3 Abstract B92 Quantum cryptography simulator Soichiro MATSUMOTO English Nowadays, the public key cryptosystem is widely used to provide security for internet shoppings and bankings. The public key cryptosystem is known to be efficiently deciphered by the Shor s quantum algorithm. A new cryptography has emerged in the shape of the quantum cryptography. In this article, we examine B92 protocol which is one of the quntum cryptography. In chapter 2, we explain the uncertainty principle and superposition principle. In chapter 3, we explain the B92 Quantum cryptography. In chapter 4, we explain the operation of the B92 quantum cryptography simulator. In chapter 5, we examin the statistical properties of B92 protocols. key words Quantum cryptography, Electron, Secret key, Uncertainty principle, Superposition principle, Wiretapping, Observation, Inner product, Noise ii
4 B B iii
5 4.2.2 BB B B ( ) iv
6 28 29 A B92 30 B 45 C 49 v
7 4.1 B (B92Alice) (B92Bob) (BB84) (Key,Mode ) C C C C C C vi
8 3.1 B B92 ( ) B92 ( ) B92 ( ) B (1) (2) (3) (4) vii
9 1 1.1 NP NP
10 1.2 2
11 [ ] 3
12 2.2 x p h ( ) x p x p h x p p x h Ψ Ψ = α ψ a + β ψ b ( ) α 2 + β 2 = 1 ( ) ψ a ψ b Ψ 4
13 3 B B BB84 B92 (A;ice), (Eve), (Bob) 0, 1 (0), (1) 3.1 B92 5
14 ( 2 ) (1(0),0(1) ) 3. 6
15
16 ( 2 ) ( ) 8
17 3.3 ( ) BB84 B92 B92 2 B B92 ( )
18 B92 ( ) B92 ( ) (1(0),0(1) )
19
20 4 B92 key mode key(mode),, 0, 1 (0), (1) 4.1 B B92 12
21 (X X) ( 4.2) 2 ( 4.3) ( 2 )
22 BB84 B92 B
23 BB (X X) B (X X) B (X X)
24 4.3 ( ) ( ) x = (Aj[0] Ej[0]) + (Aj[1] Ej[1]) 2 ( ) x = 0 0 x = 1 1 x= ( ) x = x = 1 16
25 x= (X X) ( 4.4) x = (Aj[0] Bj[0]) + (Aj[1] Bj[1]) 2 ( ) 17
26 x = (Ej[0] Bj[0]) + (Ej[1] Bj[1]) 2 ( ) 3 x = 0 0 x = 1 1 x= x = x = 1 x=
27
28 5 5.1 *** *** No,1:B92- No,2:B92- (B92Alice ) 0(0),1(1) No,3:B92- (B92Bob ) 0(1),1(0) No,4:B92- (BB84) Key(Mode) No,5:B92- (Key,Mode ) Please enter number:no,1 ****************** No,1 ******************** key mode ( / ) key ( / ) ( / ) No,1 end:1 retry: B [ 5.1]
29 5.2 *** *** No,1:B92- No,2:B92- (B92Alice ) 0(0),1(1) No,3:B92- (B92Bob ) 0(1),1(0) No,4:B92- (BB84) Key(Mode) No,5:B92- (Key,Mode ) Please enter number:no,2 ****************** No,2 ******************** : key mode ( / ) key ( / ) ( / ) No,2 end:1 retry: (B92Alice)- *** *** No,1:B92- No,2:B92- (B92Alice ) 0(0),1(1) No,3:B92- (B92Bob ) 0(1),1(0) No,4:B92- (BB84) Key(Mode) No,5:B92- (Key,Mode ) Please enter number:no,3 ****************** No,3 ******************** : key mode ( / ) key ( / ) ( / ) No,3 end:1 retry: (B92Bob)- 3 B B
30 5.2 *** *** No,1:B92- No,2:B92- (B92Alice ) 0(0),1(1) No,3:B92- (B92Bob ) 0(1),1(0) No,4:B92- (BB84) Key(Mode) No,5:B92- (Key,Mode ) Please enter number:no,4 ****************** No,4 ******************** : key mode (187087/500000) key (124795/500000) (124795/187087) No,4 end:1 retry: (BB84)- *** *** No,1:B92- No,2:B92- (B92Alice ) 0(0),1(1) No,3:B92- (B92Bob ) 0(1),1(0) No,4:B92- (BB84) Key(Mode) No,5:B92- (Key,Mode ) Please enter number:no,5 ****************** No,5 ******************** : Eve Key:1 Eve Mode:0 key mode ( / ) key ( / ) ( / ) No,5 end:1 retry: (Key,Mode )
31 / (1) :
32 5.2 / (2) / (3)
33 / (4)
34 6 6.1 C B92 3 B BB84 B92 B
35 B :1 Weak measurement theory 27
36 28
37 [1] N.Davia Mermin, -Quantum Computer Sience An Introduction-,, [2], - -, BP, [3] D.Bouwmeester, A.Ekert, A.Zeilinger,,,,,,, [4],, pp.1-5 [5], Heisenberg s Quantum Mechanics (Japanese), 29
38 A B92 #include <stdio.h> #include <stdlib.h> #include <math.h> #include <time.h> int c11=0, c12=0, c21=0, c22=0, c31=0, haki1=0,haki2=0, f=0, ct=0; int yomikomike,yomikomime,kurikaesi=0; double t1,t2; int flip(float x, int y,float n){ int i, i2; int kakuritu; if(x == 0){ kakuritu = 1 - y; else if(x > 0.9){ kakuritu = y; else{ if(n<0.5){ kakuritu = y; else{ kakuritu = 1 - y; return kakuritu; int flip2(float x, int y,float n){ int i, i2; int kakuritu; if(x == 0){ kakuritu = 1 - y; else if(x > 0.9){ kakuritu = y; else{ if(n<0.5){ kakuritu = y; else{ kakuritu = 1-y; f=1; return kakuritu; int flip3(float x,int y,float n){ int kakuritu; float furippuritu = x; float randamusuu = n; if(randamusuu < furippuritu){ 30
39 y=1-y; printf("flip"); return y; void main(){ /*do{*/ int i, i2, z, zz,c=0,kaisu; float n; double sqrt(double x); /*int Max = 1000;*/ int k,m,j,rkb,mb,jb, rke, me, je, Hi, r, swich, rd,cf=0,exit=0; float cal1, cal2, cal3, cal4, modp, keyp, hyakup; static int flag = 0; static int flag2 = 0; /* */ int keya[10], keyb[10], keye[10], suisokukey[10]; int modea[10], modeb[10], modee[10]; float Aj[10][2], Bj[10][2], Ej[10][2], keisan[10]; float keisan2[10], kakuritu[10], kakuritu2[10]; int jyoutaia[10], jyoutaib[10], jyoutaie[10]; /* */ /* */ int keya2, keyb2, keye2, suisokukey2; int modea2, modeb2, modee2; float Aj2[2], Bj2[2], Ej2[2], keisan3, keisan4, kakuritu3, kakuritu4; int jyoutaia2, jyoutaib2, jyoutaie2; /* */ /* */ float rf; /* */ clock t s,e; printf("copyright (C) 2010 Soichiro.M All Rights Reserved."); printf("*** ***\nno,1:b92- \nno,2:b92- (B92Alice ) 0(0),1(1)\nNo,3:B92- (B92Bob ) 0(1),1(0)\nNo,4:B92- (BB84) Key(Mode) \nno,5:b92- (Key,Mode )\nplease enter number:no,"); scanf(" d",&swich); switch (swich) { case 1: do{ printf("****************** No,1 ********************\n"); printf(" "); scanf(" d",&kaisu); s = clock(); do{ if (flag == 0) { srand((unsigned)time(null)); flag = 1; for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keya2 = modea2 = 0; else if(n >= 0.5){ 31
40 keya2 = modea2 = 1; k = keya2; m = modea2; j=k*10+m; if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keyb2 = 0; modeb2 = 1; else if(n >= 0.5){ keyb2 = 1; modeb2 =0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); Bj2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Bj2[0])+(Aj2[1]*Bj2[1]); kakuritu3 = keisan3 * keisan3; if(kakuritu3>0.9){ c12=c12+1; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip2(kakuritu3,keyb2,n); 32
41 keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; c=c+1; while(c<kaisu); cal1 = c; cal2 = c21; cal3 = c22; modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; e = clock(); printf("key mode (%d/%d)%f \nkey (%d/%d)%f \n100 (%d/%d)%d %f \n",c21,c,modp, c22, c, keyp, c22, c21, c, hyakup); printf("%.2f \n",(double)(e-s)/clocks PER SEC); printf("no,1 end:1 retry:0"); scanf(" d",&z); c21=c22=c=0; haki1=haki2=0; printf("\n"); f=0; while(z == 0); break; case 2: do{ printf("****************** No,2 ********************\n"); printf(" :"); scanf(" d",&kaisu); do{ if (flag == 0) { srand((unsigned)time(null)); flag = 1; for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keya2 = modea2 = 0; else if(n >= 0.5){ keya2 = modea2 = 1; for(i=0;i<10;i++){ k = keya2; m = modea2; j=k*10+m; jyoutaia2 = j; 33
42 j = jyoutaia2; if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keye2 = 0; modee2 = 0; else if(n >= 0.5){ keye2 = 1; modee2 = 1; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Ej2[0])+(Aj2[1]*Ej2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keye2,n); keye2=zz; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; 34
43 Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keyb2 = 0; modeb2 = 1; else if(n >= 0.5){ keyb2 = 1; modeb2 = 0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb=0; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); Bj2[1] = -1/sqrt(2); keisan3 = (Ej2[0]*Bj2[0])+(Ej2[1]*Bj2[1]); kakuritu4 = keisan3*keisan3; /*printf(" %d:[%f] %f\n",i+1,keisan2[i],kakuritu2[i]);*/ for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keyb2,n); keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; 35
44 c=c+1; while(c<kaisu); cal1 = c; cal2 = c21; cal3 = c22; modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; printf("key mode (%d/ d)%f \nkey (%d/%d)%f \n100 (%d/%d)%d %f \n",c21,c,modp, c22, c, keyp, c22, c21, c, hyakup); printf("no,2 end:1 retry:0"); scanf("%d",&z); c21=c22=c=0; haki1=haki2=0; printf("\n"); f=0; while(z == 0); break; case 3: do{ printf("****************** No,3 ********************\n"); printf(" :"); scanf("%d",&kaisu); do{ if (flag == 0) { srand((unsigned)time(null)); flag = 1; for(i2=0;i2<5;i2++){ n = (float)rand() / ; /*printf("making random number[%d]: %f \n", i2, n);*/ if(n < 0.5){ keya2 = modea2 = 0; else if(n >= 0.5){ keya2 = modea2 = 1; for(i=0;i<10;i++){ k = keya2; m = modea2; j=k*10+m; jyoutaia2 = j; j = jyoutaia2; if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; 36
45 Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keye2 = 0; modee2 = 1; else if(n >= 0.5){ keye2 = 1; modee2 = 0; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Ej2[0])+(Aj2[1]*Ej2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keye2,n); keye2=zz; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); 37
46 Ej2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keyb2 = 0; modeb2 = 1; else if(n >= 0.5){ keyb2 = 1; modeb2 = 0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb=0; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); Bj2[1] = -1/sqrt(2); keisan3 = (Ej2[0]*Bj2[0])+(Ej2[1]*Bj2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keyb2,n); keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; c=c+1; while(c<kaisu); cal1 = c; cal2 = c21; cal3 = c22; modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; 38
47 printf("key mode (%d/%d)%f \nkey (%d/%d)%f \n100 (%d/%d)%d %f \n",c21,c,modp, c22, c, keyp, c22, c21, c, hyakup); printf("no,3 end:1 retry:0"); scanf("%d",&z); c21=c22=c=0; haki1=haki2=0; printf("\n"); f=0; while(z == 0); break; case 4: do{ printf("****************** No,4 ********************\n"); printf(" :"); scanf("%d",&kaisu); do{ if (flag == 0) { srand((unsigned)time(null)); flag = 1; for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keya2 = modea2 = 0; else if(n >= 0.5){ keya2 = modea2 = 1; for(i=0;i<10;i++){ k = keya2; m = modea2; j=k*10+m; jyoutaia2 = j; j = jyoutaia2; if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keye2 = 0; else if(n >= 0.5){ keye2 = 1; 39
48 for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ modee2 = 0; else if(n >= 0.5){ modee2 = 1; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Ej2[0])+(Aj2[1]*Ej2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keye2,n); keye2=zz; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ 40
49 keyb2 = 0; modeb2 = 1; else if(n >= 0.5){ keyb2 = 1; modeb2 = 0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb=0; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); Bj2[1] = -1/sqrt(2); keisan3 = (Ej2[0]*Bj2[0])+(Ej2[1]*Bj2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keyb2,n); keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; c=c+1; while(c<kaisu); cal1 = c; cal2 = c21; cal3 = c22; modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; printf("key mode (%d/%d)%f \nkey (%d/%d)%f \n100 (%d/%d)%d %f \n",c21,c,modp, c22, c, keyp, c22, c21, c, hyakup); printf("no,4 end:1 retry:0"); scanf("%d",&z); c21=c22=c=0; 41
50 haki1=haki2=0; printf("\n"); f=0; while(z == 0); break; case 5: do{ printf("****************** No,5 ********************\n"); printf(" :"); scanf("%d",&kaisu); printf("eve Key:"); scanf("%d",&yomikomike); printf("eve Mode:"); scanf("%d",&yomikomime); do{ keye2=yomikomike; modee2=yomikomime; if (flag == 0) { srand((unsigned)time(null)); flag = 1; for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keya2 = modea2 = 0; else if(n >= 0.5){ keya2 = modea2 = 1; for(i=0;i<10;i++){ k = keya2; m = modea2; j=k*10+m; jyoutaia2 = j; j = jyoutaia2; if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ 42
51 Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Ej2[0])+(Aj2[1]*Ej2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keye2,n); keye2=zz; rke = keye2; me = modee2; je=rke*10+me; jyoutaie2 = je; je = jyoutaie2; if(je==0){ Ej2[0] = 1; Ej2[1] = 0; else if(je==1){ Ej2[0] = 1/sqrt(2); Ej2[1] = 1/sqrt(2); else if(je==10){ Ej2[0] = 0; Ej2[1] = 1; else{ Ej2[0] = 1/sqrt(2); Ej2[1] = -1/sqrt(2); for(i2=0;i2<5;i2++){ n = (float)rand() / ; if(n < 0.5){ keyb2 = 0; modeb2 = 1; else if(n >= 0.5){ keyb2 = 1; modeb2 = 0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb=0; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; 43
52 else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); Bj2[1] = -1/sqrt(2); keisan3 = (Ej2[0]*Bj2[0])+(Ej2[1]*Bj2[1]); kakuritu4 = keisan3*keisan3; for(i2=0;i2<10;i2++){ n = (float)rand() / ; zz = flip(kakuritu4,keyb2,n); keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; c=c+1; while(c<kaisu); cal1 = c; cal2 = c21; cal3 = c22; modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; printf("key mode (%d/%d)%f \nkey (%d/%d)%f \n100 (%d/%d)%d %f \n",c21,c,modp, c22, c, keyp, c22, c21, c, hyakup); printf("no,5 end:1 retry:0"); scanf("%d",&z); c21=c22=c=0; haki1=haki2=0; printf("\n"); f=0; while(z == 0); break; /*exit=0; printf("exit OK? y1 n0:"); scanf("%d",&exit); break; while(exit == 0);*/ 44
53 B #include stdio.h #include stdlib.h #include math.h #include time.h int c11=0, c12=0, c21=0, c22=0, c31=0, haki1=0,haki2=0, f=0, ct=0; int yomikomike,yomikomime,kurikaesi=0; int flip(float x, int y,float n){ int i, i2; int kakuritu; if(x == 0){ kakuritu = 1 - y; else if(x 0.9){ kakuritu = y; else{ if(n 0.5){ kakuritu = y; else{ kakuritu = 1 - y; return kakuritu; int flip2(float x, int y,float n){ int i, i2; int kakuritu; if(x == 0) kakuritu = 1 - y; else if(x 0.9){ kakuritu = y; else{ if(n 0.5){ kakuritu = y; else{ kakuritu = 1-y; f=1; return kakuritu; 45
54 int flip3(float x,int y,float n){ if(n x){ y=1-y; /*printf( flip );*/ return y; void main(){ /*do{*/ int i, i2, z, zz,c=0,kaisu,basyo; float n; double sqrt(double x); /*int Max = 1000;*/ int k,m,j,rkb,mb,jb, rke, me, je, Hi, r, swich, rd,cf=0,exit=0; float cal1, cal2, cal3, cal4, modp, keyp, hyakup; static int flag = 0; static int flag2 = 0; int keya[10], keyb[10], keye[10], suisokukey[10]; int modea[10], modeb[10], modee[10]; float Aj[10][2], Bj[10][2], Ej[10][2], keisan[10], keisan2[10], kakuritu[10], kakuritu2[10]; int jyoutaia[10], jyoutaib[10], jyoutaie[10]; int keya2, keyb2, keye2, suisokukey2; int modea2, modeb2, modee2; float Aj2[2], Bj2[2], Ej2[2], keisan3, keisan4, kakuritu3, kakuritu4; int jyoutaia2, jyoutaib2, jyoutaie2; float rf; printf( Copyright (C) 2010 Soichiro.M All Rights Reserved. ); do{ printf( ***** - - ***** ); printf( ( 0, 1, 2) ); scanf( %d,&basyo); printf( ); scanf( %d,&kaisu); printf( ); scanf( %f,&rf); do{ if (flag == 0){ srand((unsigned)time(null)); flag = 1; /*n2 = (float)rand() / ;*/ for(i2=0;i2 5;i2++){ n = (float)rand() / ; /*printf( Making random number[%d]: %f Yn, i2, n);*/ if(n 0.5){ keya2 = modea2 = 0; else if(n = 0.5){ keya2 = modea2 = 1; 46
55 if(basyo == 1) /*printf( %f,n); printf( %d,zz);*/ zz=flip3(rf, keya2, n); /*printf( %dyn,zz);*/ keya2=zz; k = keya2; m = modea2; j=k*10+m; /*jyoutaia = j;*/ if(j==0){ Aj2[0] = 1; Aj2[1] = 0; else if(j==1){ Aj2[0] = 1/sqrt(2); Aj2[1] = 1/sqrt(2); else if(j==10){ Aj2[0] = 0; Aj2[1] = 1; else{ Aj2[0] = 1/sqrt(2); Aj2[1] = -1/sqrt(2); for(i2=0;i2 5;i2++){ n = (float)rand() / ; if(n 0.5){ keyb2 = 0; modeb2 = 1; else if(n = 0.5){ keyb2 = 1; modeb2 =0; rkb = keyb2; mb = modeb2; jb=rkb*10+mb; jyoutaib2 = jb; jb = jyoutaib2; if(jb==0){ Bj2[0] = 1; Bj2[1] = 0; else if(jb==1){ Bj2[0] = 1/sqrt(2); Bj2[1] = 1/sqrt(2); else if(jb==10){ Bj2[0] = 0; Bj2[1] = 1; else{ Bj2[0] = 1/sqrt(2); 47
56 Bj2[1] = -1/sqrt(2); keisan3 = (Aj2[0]*Bj2[0])+(Aj2[1]*Bj2[1]); kakuritu3 = keisan3 * keisan3; if(kakuritu3 0.9){ c12=c12+1; for(i2=0;i2 10;i2++){ n = (float)rand() / ; zz = flip2(kakuritu3,keyb2,n); keyb2=zz; for(i2=0;i2 5;i2++){ n = (float)rand() / ; if(basyo == 2){ zz=flip3(rf, keyb2, n); keyb2=zz; if(modeb2!= keyb2){ c21++; if(modeb2!= keyb2 && keya2 == keyb2){ c22++; if(f==1)cf++; c=c+1; while(c kaisu); /*cal1 = c; cal2 = c21; cal3 = c22;*/ modp = ((float)c21/(float)c)*100; keyp = ((float)c22/(float)c)*100; /*hyakup = ((float)c22/(float)c21)*100;*/ if(modp!=0){ hyakup = ((float)c22/(float)c21)*100; else{ hyakup =0; printf( key mode (%d/%d)%f Ynkey (%d/%d)%f Yn100 (%d/%d)%d %f Yn,c21,c,modP, c22, c, keyp, c22, c21, c, hyakup); printf( No,6 end:1 retry:0 ); scanf( %d,&z); c21=c22=c=0; haki1=haki2=0; printf( Yn ); f=0; while(z == 0); 48
57 C C.1 C
58 C.3 C C C
:30 12:00 I. I VI II. III. IV. a d V. VI
2018 2018 08 02 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF N N y N x N xy yx : yxxyxy N N x, y N (parse tree) (1) yxyyx (2) xyxyxy (3) yxxyxyy (4) yxxxyxxy N y N x N yx
21 Quantum calculator simulator based on reversible operation
21 Quantum calculator simulator based on reversible operation 1100366 2010 3 1 i Abstract Quantum calculator simulator based on reversible operation Ryota Yoshimura Quantum computation is the novel computational
C¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç
C (3) if else switch AND && OR (NOT)! 1 BMI BMI BMI = 10 4 [kg]) ( [cm]) 2 bmi1.c Input your height[cm]: 173.2 Enter Input your weight[kg]: 60.3 Enter Your BMI is 20.1. 10 4 = 10000.0 1 BMI BMI BMI = 10
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.
C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009383 このサンプルページの内容は, 新装版 1 刷発行時のものです. i 2 22 2 13 ( ) 2 (1) ANSI (2) 2 (3) Web http://www.morikita.co.jp/books/mid/009383
I. Backus-Naur BNF : N N 0 N N N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) (2) (3) (4) II. 0(0 101)* (
2016 2016 07 28 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF : 11011 N N 0 N N 11 1001 N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) 1100100 (2) 1111011 (3) 1110010 (4) 1001011
‚æ2›ñ C„¾„ê‡Ìš|
I 8 10 10 I ( 6 ) 10 10 1 / 23 1 C ( ) getchar(), gets(), scanf() ( ) putchar(), puts(), printf() 1 getchar(), putchar() 1 I ( 6 ) 10 10 2 / 23 1 (getchar 1 1) 1 #include 2 void main(void){ 3 int
- 2 Copyright (C) 2006. All Rights Reserved.
- 2 Copyright (C) 2006. All Rights Reserved. 2-3 Copyright (C) 2006. All Rights Reserved. 70-4 Copyright (C) 2006. All Rights Reserved. ...1...3...7...8 1...9...14...16 2...18...20...21 3...22...23...23...24
i ii iii iv v vi vii ( ー ー ) ( ) ( ) ( ) ( ) ー ( ) ( ) ー ー ( ) ( ) ( ) ( ) ( ) 13 202 24122783 3622316 (1) (2) (3) (4) 2483 (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) 11 11 2483 13
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
#include #include #include int gcd( int a, int b) { if ( b == 0 ) return a; else { int c = a % b; return gcd( b, c); } /* if */ } int main() { int a = 60; int b = 45; int
:30 12:00 I. I VI II. III. IV. a d V. VI
2017 2017 08 03 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF X [ S ] a S S ; X X X, S [, a, ], ; BNF X (parse tree) (1) [a;a] (2) [[a]] (3) [a;[a]] (4) [[a];a] : [a] X 2 222222
‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
Ｃ言語によるアルゴリズムとデータ構造
Algorithms and Data Structures in C 4 algorithm List - /* */ #include List - int main(void) { int a, b, c; int max; /* */ Ÿ 3Ÿ 2Ÿ 3 printf(""); printf(""); printf(""); scanf("%d", &a); scanf("%d",
I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *
2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +
/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v
1 http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html kota@fbs.osaka-u.ac.jp /* do-while */ #include #include int main(void) double val1, val2, arith_mean, geo_mean; printf( \n );
MultiPASS Suite 3.20 使用説明書
TM MultiPASS Suite Ver.3.20 for Windows ii iii Copyright 2000 Canon Inc. ALL RIGHTS RESERVED iv v vi vii viii ix x 1 1 1-1 1 1 2 3 1-2 4 5 1 1-3 1 6 1-4 7 1 8 9 1-5 10 1 11 1-6 1 1-7 1 1-8 2 1 1-9 1 1
[1] #include<stdio.h> main() { printf("hello, world."); return 0; } (G1) int long int float ± ±
![[1] #include<stdio.h> main() { printf(hello, world.); return 0; } (G1) int long int float ± ±](/thumbs/99/143405735.jpg "[1] #include<stdio.h> main() { printf(hello, world.); return 0; } (G1) int long int float ± ±")
[1] #include printf("hello, world."); (G1) int -32768 32767 long int -2147483648 2147483647 float ±3.4 10 38 ±3.4 10 38 double ±1.7 10 308 ±1.7 10 308 char [2] #include int a, b, c, d,
I
I II III IV V VI VII VIII IX X XI XII XIII XIV 1. 2 3 4 5 2. 6 7 8 3. 1 2 3 9 4 5 10 6 11 4. 1 2 3 1 2 12 1 2 3 1 2 3 13 14 1 2 1 15 16 1. 20 1 21 1 22 23 1 2 3 4 24 1 2 ok 25 1 2 26 1 2 3 27 2. 28
21 Key Exchange method for portable terminal with direct input by user
21 Key Exchange method for portable terminal with direct input by user 1110251 2011 3 17 Diffie-Hellman,..,,,,.,, 2.,.,..,,.,, Diffie-Hellman, i Abstract Key Exchange method for portable terminal with
£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡
(2018) 2018 5 17 0 0 if switch if if ( ) if ( 0) if ( ) if ( 0) if ( ) (0) if ( 0) if ( ) (0) ( ) ; if else if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 (0) 2 if else
ハピタス のコピー.pages
Copyright (C) All Rights Reserved. 10 12,500 () ( ) ()() 1 : 2 : 3 : 2 4 : 5 : Copyright (C) All Rights Reserved. Copyright (C) All Rights Reserved. Copyright (C) All Rights Reserved. Copyright (C) All
Copyright 2008 All Rights Reserved 2
Copyright 2008 All Rights Reserved 1 Copyright 2008 All Rights Reserved 2 Copyright 2008 All Rights Reserved 3 Copyright 2008 All Rights Reserved 4 Copyright 2008 All Rights Reserved 5 Copyright 2008 All
ii iii iv CON T E N T S iii iv v Chapter1 Chapter2 Chapter 1 002 1.1 004 1.2 004 1.2.1 007 1.2.2 009 1.3 009 1.3.1 010 1.3.2 012 1.4 012 1.4.1 014 1.4.2 015 1.5 Chapter3 Chapter4 Chapter5 Chapter6 Chapter7
超初心者用
3 1999 10 13 1. 2. hello.c printf( Hello, world! n ); cc hello.c a.out./a.out Hello, world printf( Hello, world! n ); 2 Hello, world printf n printf 3. ( ) int num; num = 100; num 100 100 num int num num
2
1 2 3 4 5 6 7 8 9 10 I II III 11 IV 12 V 13 VI VII 14 VIII. 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 41 42 43 44 45 46 47 48 49 50 VII 51 52 53 54 55 56 57 58 59
untitled
i ii iii iv v 43 43 vi 43 vii T+1 T+2 1 viii 1 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 41 42 43 44 45 46 47 48 49 50 a) ( ) b) ( ) 51
I ASCII ( ) NUL 16 DLE SP P p 1 SOH 17 DC1! 1 A Q a q STX 2 18 DC2 " 2 B R b
I 4 003 4 30 1 ASCII ( ) 0 17 0 NUL 16 DLE SP 0 @ P 3 48 64 80 96 11 p 1 SOH 17 DC1! 1 A Q a 33 49 65 81 97 113 q STX 18 DC " B R b 34 50 66 8 98 114 r 3 ETX 19 DC3 # 3 C S c 35 51 67 83 99 115 s 4 EOT
i
14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7
4 i
22 Quantum error correction and its simulation 1135071 2011 3 1 4 i Abstract Quantum error correction and its simulation Hiroko Dehare Researches in quantum information theory and technology, that mix
Microsoft Word - C.....u.K...doc
C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ
j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E
8 9 7 6 4 2 3 5 1 j x j j j + 1 l j l j = x j+1 x j, n x n x 1 = n 1 l j j=1 H j j + 1 l j l j E a n 1 H = ae l j, j=1 l j = x j+1 x j, x n x 1 = n 1 j=1 l j, l j = ±l l > 0) n 1 H = ϵ l j, j=1 ϵ e x x
kiso2-06.key
座席指定があります Linux を起動して下さい 第6回 計算機基礎実習II 計算機基礎実習II 2018 のウェブページか ら 以下の課題に自力で取り組んで下さい 第5回の復習課題(rev05) 第6回の基本課題(base06) 第5回課題の回答例 ex05-2.c 1. キーボードから整数値 a を入力すると a*a*a の値を出力することを繰り返すプログラムを作成しなさい 2. ただし 入力された
C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in
![C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in](/thumbs/88/114913715.jpg "C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in")
C 1 / 21 C 2005 A * 1 2 1.1......................................... 2 1.2 *.......................................... 3 2 4 2.1.............................................. 4 2.2..............................................
1 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 () - 1 - - 2 - - 3 - - 4 - - 5 - 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
tuat1.dvi
( 1 ) http://ist.ksc.kwansei.ac.jp/ tutimura/ 2012 6 23 ( 1 ) 1 / 58 C ( 1 ) 2 / 58 2008 9 2002 2005 T E X ptetex3, ptexlive pt E X UTF-8 xdvi-jp 3 ( 1 ) 3 / 58 ( 1 ) 4 / 58 C,... ( 1 ) 5 / 58 6/23( )
II ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D
II 8 2003 11 12 1 6 ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 Daisuke 8 =>. 73 Daisuke 35 Hiroshi 64 Ichiro 87 Junko
P02.ppt
int If 2 1 ,,, 3 a + b ab a - b ab a * b ab a / b ab a % b ab a + b 4 2 list0201.c /, % /*/ int vx, vy; puts(""); printf("vx"); scanf("%d", &vx); printf("vy"); scanf("%d", &vy); printf("vx + vy = %d\n",
untitled
23 12 10 12:55 ~ 18:45 KKR Tel0557-85-2000 FAX0557-85-6604 12:55~13:00 13:00~13:38 I 1) 13:00~13:12 2) 13:13~13:25 3) 13:26~13:38 13:39~14:17 II 4) 13:39~13:51 5) 13:52 ~ 14:04 6) 14:05 ~ 14:17 14:18 ~
入門ガイド
ii iii iv NEC Corporation 1998 v P A R 1 P A R 2 P A R 3 T T T vi P A R T 4 P A R T 5 P A R T 6 P A R T 7 vii 1P A R T 1 2 2 1 3 1 4 1 1 5 2 3 6 4 1 7 1 2 3 8 1 1 2 3 9 1 2 10 1 1 2 11 3 12 1 2 1 3 4 13
MultiPASS B-20 MultiPASS Suite 3.10使用説明書
TM MultiPASS Suite Ver.3.10 for Windows ii iii Copyright 1999 Canon Inc. ALL RIGHTS RESERVED iv v vi vii viii ix x 1 2 3 4 5 6 7 8 9 xi xii 1 1 1-1 1 2 3 1-2 4 5 1 1-3 6 1-4 1 7 8 1-5 9 10 11 1-6 1 1-7
<4D6963726F736F667420506F776572506F696E74202D208376838C835B83938365815B835683878393312E707074205B8CDD8AB78382815B83685D>
i i vi ii iii iv v vi vii viii ix 2 3 4 5 6 7 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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf("hello World\n"); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o
![18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o](/thumbs/95/124976715.jpg "18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o")
18 C ( ) 1 1 1.1 hello world.c 5 printf("hello World\n"); 6 } [ ] [ ] #include % cc hello_world.c %./a.out Hello World [a.out ] % cc hello_world.c -o hello_world [ ( ) ] (K&R 4.1.1) #include
/* sansu1.c */ #include <stdio.h> main() { int a, b, c; /* a, b, c */ a = 200; b = 1300; /* a 200 */ /* b 200 */ c = a + b; /* a b c */ }
C 2: A Pedestrian Approach to the C Programming Language 2 2-1 2.1........................... 2-1 2.1.1.............................. 2-1 2.1.2......... 2-4 2.1.3..................................... 2-6
SC-85X2取説
I II III IV V VI .................. VII VIII IX X 1-1 1-2 1-3 1-4 ( ) 1-5 1-6 2-1 2-2 3-1 3-2 3-3 8 3-4 3-5 3-6 3-7 ) ) - - 3-8 3-9 4-1 4-2 4-3 4-4 4-5 4-6 5-1 5-2 5-3 5-4 5-5 5-6 5-7 5-8 5-9 5-10 5-11
PowerPoint Presentation
p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight
初心者にもできるアメブロカスタマイズ新2016.pages
Copyright All Rights Reserved. 41 Copyright All Rights Reserved. 60 68 70 6 78 80 Copyright All Rights Reserved. FC2 97 Copyright All Rights Reserved. Copyright All Rights Reserved. Copyright All Rights
特集_03-07.Q3C
3-7 Error Detection and Authentication in Quantum Key Distribution YAMAMURA Akihiro and ISHIZUKA Hirokazu Detecting errors in a raw key and authenticating a private key are crucial for quantum key distribution
c-all.dvi
III(994) (994) from PSL (9947) & (9922) c (99,992,994,996) () () 2 3 4 (2) 2 Euler 22 23 Euler 24 (3) 3 32 33 34 35 Poisson (4) 4 (5) 5 52 ( ) 2 Turbo 2 d 2 y=dx 2 = y y = a sin x + b cos x x = y = Fortran
kiso2-09.key
座席指定はありません 計算機基礎実習II 2018 のウェブページか 第9回 ら 以下の課題に自力で取り組んで下さい 計算機基礎実習II 第7回の復習課題(rev07) 第9回の基本課題(base09) 第8回試験の結果 中間試験に関するコメント コンパイルできない不完全なプログラムなど プログラミングに慣れていない あるいは複雑な問題は 要件 をバラして段階的にプログラムを作成する exam08-2.c
PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU
1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf
9 8 7 (x-1.0)*(x-1.0) *(x-1.0) (a) f(a) (b) f(a) Figure 1: f(a) a =1.0 (1) a 1.0 f(1.0)
E-mail: takio-kurita@aist.go.jp 1 ( ) CPU ( ) 2 1. a f(a) =(a 1.0) 2 (1) a ( ) 1(a) f(a) a (1) a f(a) a =2(a 1.0) (2) 2 0 a f(a) a =2(a 1.0) = 0 (3) 1 9 8 7 (x-1.0)*(x-1.0) 6 4 2.0*(x-1.0) 6 2 5 4 0 3-2
QR
1 7 16 13 1 13.1 QR...................................... 2 13.1.1............................................ 2 13.1.2..................................... 3 13.1.3 QR........................................
r07.dvi
19 7 ( ) 2019.4.20 1 1.1 (data structure ( (dynamic data structure 1 malloc C free C (garbage collection GC C GC(conservative GC 2 1.2 data next p 3 5 7 9 p 3 5 7 9 p 3 5 7 9 1 1: (single linked list 1
untitled
II yacc 005 : 1, 1 1 1 %{ int lineno=0; 3 int wordno=0; 4 int charno=0; 5 6 %} 7 8 %% 9 [ \t]+ { charno+=strlen(yytext); } 10 "\n" { lineno++; charno++; } 11 [^ \t\n]+ { wordno++; charno+=strlen(yytext);}
ohp07.dvi
19 7 ( ) 2019.4.20 1 (data structure) ( ) (dynamic data structure) 1 malloc C free 1 (static data structure) 2 (2) C (garbage collection GC) C GC(conservative GC) 2 2 conservative GC 3 data next p 3 5
Copyright All Rights Reserved. -2 -!
http://ameblo.jp/admarketing/ Copyright All Rights Reserved. -2 -! Copyright All Rights Reserved. -3- Copyright All Rights Reserved. -4- Copyright All Rights Reserved. -5 - Copyright All Rights Reserved.
ONLINE_MANUAL
JPN ii iii iv v 6 vi vii viii 1 CHAPTER 1-1 1 2 1-2 1 2 3 4 5 1-3 6 7 1-4 2 CHAPTER 2-1 2-2 2-3 1 2 3 4 5 2-4 6 7 8 2-5 9 10 2-6 11 2-7 1 2 2-8 3 (A) 4 5 6 2-9 1 2-10 2 3 2-11 4 5 2-12 1 2 2-13 3 4 5
ONLINE_MANUAL
JPN ii iii iv v vi 6 vii viii 1 CHAPTER 1-1 1 2 1-2 1 2 3 1-3 4 5 6 7 1-4 2 CHAPTER 2-1 2-2 2-3 1 2 3 4 5 2-4 6 7 8 2-5 9 10 2-6 11 2-7 1 2 2-8 3 (A) 4 5 6 2-9 1 2-10 2 3 2-11 4 5 2-12 1 2 2-13 3 4 5
2 1 list0415.c forfor #include int i, j; for (i = 1; i 「産業上利用することができる発明」の審査の運用指針（案）
1 1.... 2 1.1... 2 2.... 4 2.1... 4 3.... 6 4.... 6 1 1 29 1 29 1 1 1. 2 1 1.1 (1) (2) (3) 1 (4) 2 4 1 2 2 3 4 31 12 5 7 2.2 (5) ( a ) ( b ) 1 3 2 ( c ) (6) 2. 2.1 2.1 (1) 4 ( i ) ( ii ) ( iii ) ( iv)
28 Horizontal angle correction using straight line detection in an equirectangular image
28 Horizontal angle correction using straight line detection in an equirectangular image 1170283 2017 3 1 2 i Abstract Horizontal angle correction using straight line detection in an equirectangular image
i
i KEY WORDS CASE CHECK POINT EXERCISE Column ii 4 6 9 11 1 5 7 8 2 3 10 12 MESSAGE iii 1 1 23 4 2 56 3 2 5 8 11 CASE 12 1 2 3 181920 20 4 2223 232425 5 6 14 16 18 22 25 27 29 CASE 30 1 31 3233 2 31 34
IPA:セキュアなインターネットサーバー構築に関する調査
Copyright 2003 IPA, All Rights Reserved. Copyright 2003 IPA, All Rights Reserved. Copyright 2003 IPA, All Rights Reserved. Copyright 2003 IPA, All Rights Reserved. Copyright 2003 IPA, All Rights Reserved.
卒 業 研 究 報 告.PDF
C 13 2 9 1 1-1. 1-2. 2 2-1. 2-2. 2-3. 2-4. 3 3-1. 3-2. 3-3. 3-4. 3-5. 3-5-1. 3-5-2. 3-6. 3-6-1. 3-6-2. 4 5 6 7-1 - 1 1 1-1. 1-2. ++ Lisp Pascal Java Purl HTML Windows - 2-2 2 2-1. 1972 D.M. (Dennis M Ritchie)
untitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
double 2 std::cin, std::cout 1.2 C fopen() fclose() C++ std::fstream 1-3 #include <fstream> std::fstream fout; int a = 123; fout.open( "data.t
C++ 1 C C++ C++ C C C++ 1.1 C printf() scanf() C++ C 1-1 #include int a; scanf( "%d", &a ); printf( "a = %d\n", a ); C++ 1-2 int a; std::cin >> a; std::cout
PowerPoint プレゼンテーション
プログラミング応用 第 15 回 知的情報システム学科張 暁華 プログラミング応用 1 授業のマナー ------ 人の話を聞くときの社会常識 1. 欠席者のかわりに登録を行わない 倫理に反することをやらない あなたの信を問われている蟻の穴から堤防が決壊 2. 私語しないこと : 質問 意見は手を挙げて大きな声ではっきりと意思表示 3. 授業以外のことをしない : 携帯をカバンにいれ イヤホンを使って音楽等を聞かない授業中ゲームを遊ばない
Microsoft Word - 最終版 バックせどりismマニュアル .docx
ism ISM ISM ISM ISM ISM ISM Copyright (c) 2010 All Rights Reserved. Copyright (c) 2010 All Rights Reserved. Copyright (c) 2010 All Rights Reserved. ISM Copyright (c) 2010 All Rights Reserved. Copyright
実際の株価データを用いたオプション料の計算
2002 2 20 1 1 3 2 3 2.1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.1.1 : : : : : : : : : : : : : : : : : : : : 5 2.1.2 : : : : : : : : : : : : : : : : : : : : 6 2.2 : : : : : : : : : :
XMPによる並列化実装2
2 3 C Fortran Exercise 1 Exercise 2 Serial init.c init.f90 XMP xmp_init.c xmp_init.f90 Serial laplace.c laplace.f90 XMP xmp_laplace.c xmp_laplace.f90 #include int a[10]; program init integer
o 2o 3o 3 1. I o 3. 1o 2o 31. I 3o PDF Adobe Reader 4o 2 1o I 2o 3o 4o 5o 6o 7o 2197/ o 1o 1 1o
78 2 78... 2 22201011... 4... 9... 7... 29 1 1214 2 7 1 8 2 2 3 1 2 1o 2o 3o 3 1. I 1124 4o 3. 1o 2o 31. I 3o PDF Adobe Reader 4o 2 1o 72 1. I 2o 3o 4o 5o 6o 7o 2197/6 9. 9 8o 1o 1 1o 2o / 3o 4o 5o 6o
2004 2005 2 2 1G01P038-0 1 2 1.1.............................. 2 1.2......................... 2 1.3......................... 3 2 4 2.1............................ 4 2.2....................... 4 2.3.......................
262014 3 1 1 6 3 2 198810 2/ 198810 2 1 3 4 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1... 1... 2... 2... 4... 5... 9... 9... 10... 10... 10... 10... 13 2... 13 3... 15... 15... 15... 16 4...
1 4 2 EP) (EP) (EP)
2003 2004 2 27 1 1 4 2 EP) 5 3 6 3.1.............................. 6 3.2.............................. 6 3.3 (EP)............... 7 4 8 4.1 (EP).................... 8 4.1.1.................... 18 5 (EP)
これわかWord2010_第1部_100710.indd
i 1 1 2 3 6 6 7 8 10 10 11 12 12 12 13 2 15 15 16 17 17 18 19 20 20 21 ii CONTENTS 25 26 26 28 28 29 30 30 31 32 35 35 35 36 37 40 42 44 44 45 46 49 50 50 51 iii 52 52 52 53 55 56 56 57 58 58 60 60 iv
パワポカバー入稿用.indd
i 1 1 2 2 3 3 4 4 4 5 7 8 8 9 9 10 11 13 14 15 16 17 19 ii CONTENTS 2 21 21 22 25 26 32 37 38 39 39 41 41 43 43 43 44 45 46 47 47 49 52 54 56 56 iii 57 59 62 64 64 66 67 68 71 72 72 73 74 74 77 79 81 84
これでわかるAccess2010
i 1 1 1 2 2 2 3 4 4 5 6 7 7 9 10 11 12 13 14 15 17 ii CONTENTS 2 19 19 20 23 24 25 25 26 29 29 31 31 33 35 36 36 39 39 41 44 45 46 48 iii 50 50 52 54 55 57 57 59 61 63 64 66 66 67 70 70 73 74 74 77 77
Taro-リストⅢ（公開版）.jtd
リスト Ⅲ 0. 目次 2. 基本的な操作 2. 1 リストから要素の削除 2. 2 リストの複写 2. 3 リストの連結 2. 4 問題 問題 1 問題 2-1 - 2. 基本的な操作 2. 1 リストから要素の削除 まず 一般的な処理を書き つぎに 特別な処理を書く 一般的な処理は 処理 1 : リスト中に 削除するデータを見つけ 削除する場合への対応 特別な処理は 処理 2 : 先頭のデータを削除する場合への対応
PowerPoint Presentation
UML 2004 7 9 10 ... OOP UML 10 Copyright 2004 Akira HIRASAWA all rights reserved. 2 1. 2. 3. 4. UML 5. Copyright 2004 Akira HIRASAWA all rights reserved. 3 1..... Copyright 2004 Akira HIRASAWA all rights
Java演習(4) -- 変数と型 --
50 20 20 5 (20, 20) O 50 100 150 200 250 300 350 x (reserved 50 100 y 50 20 20 5 (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics; (reserved public class Blocks1 extends
やさしいJavaプログラミング －Great Ideas for Java Programming サンプルPDF
pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) 3 5 14 18 21 23 23 24 28 29 29 31 32 34 35 35 36 38 40 44 44 45 46 49 49 50 pref : 2004/6/5 (11:8) 50 51 52 54 55 56 57 58 59 60 61
: : : TSTank 2
Java (8) 2008-05-20 Lesson6 Lesson5 Java 1 Lesson 6: TSTank1, TSTank2, TSTank3 java 2 car1 car2 Car car1 = new Car(); Car car2 = new Car(); car1.setcolor(red); car2.setcolor(blue); car2.changeengine(jet);
ex01.dvi
,. 0. 0.0. C () /******************************* * $Id: ex_0_0.c,v.2 2006-04-0 3:37:00+09 naito Exp $ * * 0. 0.0 *******************************/ #include int main(int argc, char **argv) double
1-4 int a; std::cin >> a; std::cout << "a = " << a << std::endl; C++( 1-4 ) stdio.h iostream iostream.h C++ include.h 1-4 scanf() std::cin >>
1 C++ 1.1 C C++ C++ C C C++ 1.1.1 C printf() scanf() C++ C hello world printf() 1-1 #include printf( "hello world\n" ); C++ 1-2 std::cout
1... 1... 1... 3 2... 4... 4... 4... 4... 4... 6... 10... 11... 15... 30
1 2420128 1 6 3 2 199103 189/1 1991031891 3 4 5 JISJIS X 0208, 1997 1 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1... 1... 3 2... 4... 4... 4... 4... 4... 6... 10... 11... 15... 30 1 3 5 7 6 7
四校＿目次～巻頭言.indd
107 25 1 2016 3 Key Words : A 114 67 58.84 Mann-Whitney 6 1. 2. 3. 4. 5. 6. I. 21 4 B 23 11 1 9 8 7 23456 108 25 1 2016 3 78 9 II. III. IV. 1. 24 4 A 114 2. 24 5 6 3. 4. 5. 3 42 5 16 6 22 5 4 4 4 3 6.
44 4 I (1) ( ) (10 15 ) ( 17 ) ( 3 1 ) (2)
(1) I 44 II 45 III 47 IV 52 44 4 I (1) ( ) 1945 8 9 (10 15 ) ( 17 ) ( 3 1 ) (2) 45 II 1 (3) 511 ( 451 1 ) ( ) 365 1 2 512 1 2 365 1 2 363 2 ( ) 3 ( ) ( 451 2 ( 314 1 ) ( 339 1 4 ) 337 2 3 ) 363 (4) 46