1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <algorithm>
using namespace std;
//选择排序
void sort1(int num[]){
     int l=sizeof(num)+1;
     for(int i=0;i<l-1;i++){
        int min=i;
        for(int j=i+1;j<l;j++){
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <algorithm>
using namespace std;
//选择排序
void sort1(int num[]){
     int l=sizeof(num)+1;
     for(int i=0;i<l-1;i++){
        int min=i;
        for(int j=i+1;j<l;j++){
 ...

1
2
3
4
5
6
7
8
9
lda #$0e
sta $0400
asl
eor #$2d
sta $0404
sec
adc #$03
sta $0407
lda #$ff
 ...

1
2
3
4
5
6
7
8
9
lda #$0e
sta $0400
asl
eor #$2d
sta $0404
sec
adc #$03
sta $0407
lda #$ff
 ...

1
2
3
4
5
create table jas1(eid int,ename varchar(20));
insert into jas1 values('jas',1);
insert into jas1 values('vinod',2);
select * from jas1;
 

1
2
3
4
5
 
Create table jass(name varchar(20), eid int);
Insert into jass values('jas',1);
Insert into jass values('vin',2);
Select * from jass;

1
2
3
4
5
 
Create table jass(name varchar(20), eid int);
Insert into  jass values('jas',1);
Insert into  jass values('vin',2);
Select * from jas1;

1
2
3
4
5
 
Create table jas1(name varchar(20), eid char(20));
Insert into  jas1 values('jas',1);
Insert into  jas1 values('vin',2);
Select * from jas1;

1
2
3
4
5
 
Create table jas1(name char(20), eid char(20)constraint fk Foreign Key references jas(eid));
Insert into  jas1 values('jas',1);
Insert into  jas1 values('vin',2);
Select * from jas1;

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
const char STOREDPWD_STRING[16] = "p@ssword";
 
int main ()
{
   char USERINPUT_STRING[16]; 
   bool TEST_BOOL = 0;
        
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
const char STOREDPWD_STRING[16] = "p@ssword";
 
int main ()
{
   char USERINPUT_STRING[16]; 
   bool TEST_BOOL = 0;
        
 ...

1
2
3
4
5
6
7
8
9
(deffacts trouble_shooting
    (car_problem (name ignition_key) (status on))
    (car_problem (name engine) (status wont_start))
    (car_problem (name headlights) (status work))
 )
(defrule rule1
    (car_problem (name ignition_key) (status on))
    (car_problem (name engine) (status wont_start))
     =>
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h> 
 
void PutString(int str)
{
printf("%s\n", str);
}
int main()
{
PutString("1458768767");         
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h> 
 
void PutString(int str)
{
printf("%s\n", str);
}
int main()
{
PutString("1458768767");         
 ...

1
2
3
4
(SETQ X '(1 2 3))
(SETQ Y '(5 6 7))
(SETQ Z (CONS X Y))
(PRIN1 Z)

1
2
3
(SETQ X '(1 2 3))
(SETQ Y '(5 6 7))
(PRIN1 (CONS X Y))

1
Print(+ (1 2))

1
2
3
4
5
6
7
(DEFUN member (x y) (COND
((null y) (QUOTE Nil))
((equal x (CAR y)) (QUOTE T))
((QUOTE T) (member x (CDR y))
)
)
(member ' A '( B (A) C)

1
2
3
4
5
(defun final-state (s)
 (cond (s == (3 3 NIL) T)
       (t NIL)
 )
)

1
2
3
4
5
(defun final-state (s)
 (cond (s == (3 3 NIL) T)
       (t NIL)
 )
)

1
2
3
4
5
6
7
(defun dfs (tree)
 (let* ((branch1 (car tree)) (branch2 (cdr tree)))
  (cond ((atomp branch1) (append branch1 (dfs (cdr tree))))
         (t (append (dfs (car tree)) (dfs (cdr tree))))       
  )
 )
)

1
(dotimes (i 4) (print i))

1
2
3
4
5
6
7
8
(defun sum(a b) (+ a b))
(defun res(a b) (- a b))
(defun mul(a b) (* a b))
(defun div(a b) (/ a b))
 
(defun atri(b h) (div (mul b h) 2)
 
(defun atri 3 4.5)

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
int main(){
        int n;
 
        n = 1;
        printf("%d %d\n",n++,n++);
        return 0;
}

1
2
3
4
5
6
7
8
9
 
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[100];
    int i,j,k;
    
    for(i=0;i<=100;i++)
 ...

1
2
3
4
5
6
7
8
9
 
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[10000000];
    int i,j,k;
    
    for(i=0;i<=10000000;i++)
 ...

1
2
3
4
5
6
7
8
9
 
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[1000000000];
    int i,j,k;
    
    for(i=0;i<=1000000000;i++)
 ...

1
2
3
4
5
6
7
#include<stdio.h>
 
int main(){
        int n=1;
        printf("%d %d\n",n++,n++);
        return 0;
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[1000000000]={0};
    int i,j,k;
    for(i=2; i*i<=1000000000; i++)
    {
      if(arr[i]==0)
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int arr[1000000000]={0};
    int i,j,k;
    for(i=2;(i*i)<=1000000000;i++)
    {
      if(arr[i]==0)
 ...