白目白目又到了二零零七
還是願世界和平
白目白目再過二零零八
還是願世界和平
白目白目再過二零零八
コメント (0) |
トラックバック (0) |
size(300,300);
smooth();
ellipseMode(CENTER_RADIUS);
stroke(50,50,50);
fill(0,0,200);
ellipse(150,150,100,100); //face
fill(255,255,255);
ellipse(150,170,80,80); //face
ellipse(110,120,30,30); //eye
fill(0,0,0);
ellipse(110,120,5,5); //eye
fill(255,255,255);
ellipse(190,120,30,30); //eye
fill(0,0,0);
ellipse(190,120,5,5); //eye
line(150,150,150,220); //face
fill(255,0,0);
ellipse(150,150,10,10); //face
line(120,170,80,160); //face
line(120,180,80,180); //face
line(120,190,80,200); //face
line(180,170,220,160); //face
line(180,180,220,180); //face
line(180,190,220,200); //face
line(150,220,130,210); //face
line(150,220,170,210); //face
// end of doraemon
smooth();
ellipseMode(CENTER_RADIUS);
stroke(50,50,50);
fill(0,0,200);
ellipse(150,150,100,100); //face
fill(255,255,255);
ellipse(150,170,80,80); //face
ellipse(110,120,30,30); //eye
fill(0,0,0);
ellipse(110,120,5,5); //eye
fill(255,255,255);
ellipse(190,120,30,30); //eye
fill(0,0,0);
ellipse(190,120,5,5); //eye
line(150,150,150,220); //face
fill(255,0,0);
ellipse(150,150,10,10); //face
line(120,170,80,160); //face
line(120,180,80,180); //face
line(120,190,80,200); //face
line(180,170,220,160); //face
line(180,180,220,180); //face
line(180,190,220,200); //face
line(150,220,130,210); //face
line(150,220,170,210); //face
// end of doraemon
コメント (0) |
トラックバック (3) |
無人知曉ending - 寶石
就算我問午夜的天空，也只看見星星不停閃爍。進入內心，溶成了�鄂�的湖泊，我也只能隨波逐流。
天使是否會再回頭看我？是否會再充滿我的心中？即將來臨的冬風吹動海浪，喚我進入�邂吐恵罅�
如同冰塊般枯萎的雙眸，我漸漸長大。沒有人敢接近，散發異臭的寶石。
就算我問午夜的天空，也只看見星星不停閃爍。進入內心，溶成了�鄂�的湖泊，我也只能隨波逐流。
天使是否會再回頭看我？是否會再充滿我的心中？即將來臨的冬風吹動海浪，喚我進入�邂吐恵罅�
如同冰塊般枯萎的雙眸，我漸漸長大。沒有人敢接近，散發異臭的寶石。
コメント (0) |
トラックバック (0) |
#include <iostream>
using namespace std;
void mergesort(int [],int,int);
int* merge(int list[], int , int);
void main(){
int size,*list=NULL,i;
cout << "Input number of elements:\n";
cin >> size;
list = new int [size];
cout <<"Input elements of the list:\n";
for(i=0;i<size;i++)> *(list+i);
mergesort(list,0,size-1);
cout <<"The sorted list:\n";
for(i=0;i<size;i++)
}
int* merge(int list[],int low,int high){ //merge two sorted list
int *buffer =new int[(high-low)+1],mid = (low+high)/2,l1=low,l2 = mid+1,k=0;
/*
**********************************
precondition :this function can only merge two sorted list ,i.e 1 ,3 5;2 ,4 6
*********************************
look at l1 & l2 ,if l1 > l2 ,copy bufer[l1] to result[k] ,k(buffer index)++,l1++
else if l2 > l1 copy bufer[l2] to result[k] ,k,l2++
if l1 ends before l2 ,copy remained l2 to result[k]
AND rest
*/
while(l1 <= mid && l2 <= high){
if(list[l1] <= list[l2])
buffer[k++] = list[l1++];
else
buffer[k++] = list[l2++];
}
// copy the rest ,l1 ends first ,copy remained l2 to buffer
if(l1 > mid)
while(l2 <= high)
buffer[k++] = list[l2++];
else
while(l1 <= mid)
buffer[k++]=list[l1++];
return buffer;
}
void mergesort (int a[], int low, int high){
// this algorithm sorts the portion of array a with index
// from low to high, inclusive.
if (low <high) {
// recursively sort a[low..mid]
mergesort(a,low,mid);
// recursively sort a[mid+1..high]
mergesort(a,mid+1,high);
// merge the two sorted lists into buffer[]
buffer = merge(a,low,high);
// copy buffer[] into a[low..high]
for(int i=low,j=0;i<=high;i++,j++)
a[i] = buffer[j];
delete [] buffer;
}
}
using namespace std;
void mergesort(int [],int,int);
int* merge(int list[], int , int);
void main(){
int size,*list=NULL,i;
cout << "Input number of elements:\n";
cin >> size;
list = new int [size];
cout <<"Input elements of the list:\n";
for(i=0;i<size;i++)
mergesort(list,0,size-1);
cout <<"The sorted list:\n";
for(i=0;i<size;i++)
int* merge(int list[],int low,int high){ //merge two sorted list
int *buffer =new int[(high-low)+1],mid = (low+high)/2,l1=low,l2 = mid+1,k=0;
/*
**********************************
precondition :this function can only merge two sorted list ,i.e 1 ,3 5;2 ,4 6
*********************************
look at l1 & l2 ,if l1 > l2 ,copy bufer[l1] to result[k] ,k(buffer index)++,l1++
else if l2 > l1 copy bufer[l2] to result[k] ,k,l2++
if l1 ends before l2 ,copy remained l2 to result[k]
AND rest
*/
while(l1 <= mid && l2 <= high){
if(list[l1] <= list[l2])
buffer[k++] = list[l1++];
else
buffer[k++] = list[l2++];
}
// copy the rest ,l1 ends first ,copy remained l2 to buffer
if(l1 > mid)
while(l2 <= high)
buffer[k++] = list[l2++];
else
while(l1 <= mid)
buffer[k++]=list[l1++];
return buffer;
}
void mergesort (int a[], int low, int high){
// this algorithm sorts the portion of array a with index
// from low to high, inclusive.
if (low <high) {
mergesort(a,low,mid);
// recursively sort a[mid+1..high]
mergesort(a,mid+1,high);
// merge the two sorted lists into buffer[]
buffer = merge(a,low,high);
// copy buffer[] into a[low..high]
for(int i=low,j=0;i<=high;i++,j++)
a[i] = buffer[j];
delete [] buffer;
}
}
コメント (0) |
トラックバック (0) |
http://www.cuhkacs.org/~little4/Bo-Blog/index.php?job=art&articleid=a_20060603_014250
コメント (1) |
トラックバック (0) |
