1.ggxs是源码s源什么意思？
2.php ç½ç« å¦ä½ä½¿ç¨å å¯ç
3.求一个c++小程序源代码，要求200行以上，转换给100分，码用能用再加100
ggxs是源码s源wp源码和dz源码什么意思？
GGXS，即“鬼畜学社”，转换是码用一个网络流行词汇，源自游戏《原神》的源码s源一个视频重制网站。其意义灵活多变，转换视不同情境而定，码用有时指代“奇特的源码s源鬼畜翻译视频”，有时则赞美某人制作此类视频的转换计价秤软件源码精湛技艺。
GGXS诞生于二次元文化，码用是源码s源二次元中一种独特的和影像处理方式。它能够营造出独特的转换氛围和感觉，兼具创意、码用设计和美学价值。应用多开系统源码随着网络的发展，二次元文化愈发繁荣，GGXS的使用也愈加广泛。
在文化领域中，GGXS被广泛应用，命运战歌游戏源码不仅作为一种独特的表现手段，更被视为一种艺术形式。历史上看，文化和艺术的发展不断推动游戏、动漫和网络文化的单词城堡游戏源码深入发展。作为二次元文化中的积极因素，GGXS为文化和艺术的发展做出了不小的贡献。
php ç½ç« å¦ä½ä½¿ç¨å å¯ç
MD5å å¯å½æ°ï¼
<%
Private Const BITS_TO_A_BYTE = 8
Private Const BYTES_TO_A_WORD = 4
Private Const BITS_TO_A_WORD =
Private m_lOnBits()
Private m_l2Power()
Private Function LShift(lValue, iShiftBits)
If iShiftBits = 0 Then
LShift = lValue
Exit Function
ElseIf iShiftBits = Then
If lValue And 1 Then
LShift = &H
Else
LShift = 0
End If
Exit Function
ElseIf iShiftBits < 0 Or iShiftBits > Then
Err.Raise 6
End If
If (lValue And m_l2Power( - iShiftBits)) Then
LShift = ((lValue And m_lOnBits( - (iShiftBits + 1))) * m_l2Power(iShiftBits)) Or &H
Else
LShift = ((lValue And m_lOnBits( - iShiftBits)) * m_l2Power(iShiftBits))
End If
End Function
Private Function RShift(lValue, iShiftBits)
If iShiftBits = 0 Then
RShift = lValue
Exit Function
ElseIf iShiftBits = Then
If lValue And &H Then
RShift = 1
Else
RShift = 0
End If
Exit Function
ElseIf iShiftBits < 0 Or iShiftBits > Then
Err.Raise 6
End If
RShift = (lValue And &H7FFFFFFE) \ m_l2Power(iShiftBits)
If (lValue And &H) Then
RShift = (RShift Or (&H \ m_l2Power(iShiftBits - 1)))
End If
End Function
Private Function RotateLeft(lValue, iShiftBits)
RotateLeft = LShift(lValue, iShiftBits) Or RShift(lValue, ( - iShiftBits))
End Function
Private Function AddUnsigned(lX, lY)
Dim lX4
Dim lY4
Dim lX8
Dim lY8
Dim lResult
lX8 = lX And &H
lY8 = lY And &H
lX4 = lX And &H
lY4 = lY And &H
lResult = (lX And &H3FFFFFFF) + (lY And &H3FFFFFFF)
If lX4 And lY4 Then
lResult = lResult Xor &H Xor lX8 Xor lY8
ElseIf lX4 Or lY4 Then
If lResult And &H Then
lResult = lResult Xor &HC Xor lX8 Xor lY8
Else
lResult = lResult Xor &H Xor lX8 Xor lY8
End If
Else
lResult = lResult Xor lX8 Xor lY8
End If
AddUnsigned = lResult
End Function
Private Function md5_F(x, y, z)
md5_F = (x And y) Or ((Not x) And z)
End Function
Private Function md5_G(x, y, z)
md5_G = (x And z) Or (y And (Not z))
End Function
Private Function md5_H(x, y, z)
md5_H = (x Xor y Xor z)
End Function
Private Function md5_I(x, y, z)
md5_I = (y Xor (x Or (Not z)))
End Function
Private Sub md5_FF(a, b, c, d, x, s, ac)
a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_F(b, c, d), x), ac))
a = RotateLeft(a, s)
a = AddUnsigned(a, b)
End Sub
Private Sub md5_GG(a, b, c, d, x, s, ac)
a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_G(b, c, d), x), ac))
a = RotateLeft(a, s)
a = AddUnsigned(a, b)
End Sub
Private Sub md5_HH(a, b, c, d, x, s, ac)
a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_H(b, c, d), x), ac))
a = RotateLeft(a, s)
a = AddUnsigned(a, b)
End Sub
Private Sub md5_II(a, b, c, d, x, s, ac)
a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_I(b, c, d), x), ac))
a = RotateLeft(a, s)
a = AddUnsigned(a, b)
End Sub
Private Function ConvertToWordArray(sMessage)
Dim lMessageLength
Dim lNumberOfWords
Dim lWordArray()
Dim lBytePosition
Dim lByteCount
Dim lWordCount
Const MODULUS_BITS =
Const CONGRUENT_BITS =
lMessageLength = Len(sMessage)
lNumberOfWords = (((lMessageLength + ((MODULUS_BITS - CONGRUENT_BITS) \ BITS_TO_A_BYTE)) \ (MODULUS_BITS \ BITS_TO_A_BYTE)) + 1) * (MODULUS_BITS \ BITS_TO_A_WORD)
ReDim lWordArray(lNumberOfWords - 1)
lBytePosition = 0
lByteCount = 0
Do Until lByteCount >= lMessageLength
lWordCount = lByteCount \ BYTES_TO_A_WORD
lBytePosition = (lByteCount Mod BYTES_TO_A_WORD) * BITS_TO_A_BYTE
lWordArray(lWordCount) = lWordArray(lWordCount) Or LShift(Asc(Mid(sMessage, lByteCount + 1, 1)), lBytePosition)
lByteCount = lByteCount + 1
Loop
lWordCount = lByteCount \ BYTES_TO_A_WORD
lBytePosition = (lByteCount Mod BYTES_TO_A_WORD) * BITS_TO_A_BYTE
lWordArray(lWordCount) = lWordArray(lWordCount) Or LShift(&H, lBytePosition)
lWordArray(lNumberOfWords - 2) = LShift(lMessageLength, 3)
lWordArray(lNumberOfWords - 1) = RShift(lMessageLength, )
ConvertToWordArray = lWordArray
End Function
Private Function WordToHex(lValue)
Dim lByte
Dim lCount
For lCount = 0 To 3
lByte = RShift(lValue, lCount * BITS_TO_A_BYTE) And m_lOnBits(BITS_TO_A_BYTE - 1)
WordToHex = WordToHex & Right("0" & Hex(lByte), 2)
Next
End Function
Public Function MD5(sMessage)
m_lOnBits(0) = CLng(1)
m_lOnBits(1) = CLng(3)
m_lOnBits(2) = CLng(7)
m_lOnBits(3) = CLng()
m_lOnBits(4) = CLng()
m_lOnBits(5) = CLng()
m_lOnBits(6) = CLng()
m_lOnBits(7) = CLng()
m_lOnBits(8) = CLng()
m_lOnBits(9) = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_lOnBits() = CLng()
m_l2Power(0) = CLng(1)
m_l2Power(1) = CLng(2)
m_l2Power(2) = CLng(4)
m_l2Power(3) = CLng(8)
m_l2Power(4) = CLng()
m_l2Power(5) = CLng()
m_l2Power(6) = CLng()
m_l2Power(7) = CLng()
m_l2Power(8) = CLng()
m_l2Power(9) = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
m_l2Power() = CLng()
Dim x
Dim k
Dim AA
Dim BB
Dim CC
Dim DD
Dim a
Dim b
Dim c
Dim d
Const S = 7
Const S =
Const S =
Const S =
Const S = 5
Const S = 9
Const S =
Const S =
Const S = 4
Const S =
Const S =
Const S =
Const S = 6
Const S =
Const S =
Const S =
x = ConvertToWordArray(sMessage)
a = &H
b = &HEFCDAB
c = &HBADCFE
d = &H
For k = 0 To UBound(x) Step
AA = a
BB = b
CC = c
DD = d
md5_FF a, b, c, d, x(k + 0), S, &HDAA
md5_FF d, a, b, c, x(k + 1), S, &HE8C7B
md5_FF c, d, a, b, x(k + 2), S, &HDB
md5_FF b, c, d, a, x(k + 3), S, &HC1BDCEEE
md5_FF a, b, c, d, x(k + 4), S, &HFC0FAF
md5_FF d, a, b, c, x(k + 5), S, &HCA
md5_FF c, d, a, b, x(k + 6), S, &HA
md5_FF b, c, d, a, x(k + 7), S, &HFD
md5_FF a, b, c, d, x(k + 8), S, &HD8
md5_FF d, a, b, c, x(k + 9), S, &H8BF7AF
md5_FF c, d, a, b, x(k + ), S, &HFFFF5BB1
md5_FF b, c, d, a, x(k + ), S, &HCD7BE
md5_FF a, b, c, d, x(k + ), S, &H6B
md5_FF d, a, b, c, x(k + ), S, &HFD
md5_FF c, d, a, b, x(k + ), S, &HAE
md5_FF b, c, d, a, x(k + ), S, &HB
md5_GG a, b, c, d, x(k + 1), S, &HFE
md5_GG d, a, b, c, x(k + 6), S, &HCB
md5_GG c, d, a, b, x(k + ), S, &HE5A
md5_GG b, c, d, a, x(k + 0), S, &HE9B6C7AA
md5_GG a, b, c, d, x(k + 5), S, &HDFD
md5_GG d, a, b, c, x(k + ), S, &H
md5_GG c, d, a, b, x(k + ), S, &HD8A1E
md5_GG b, c, d, a, x(k + 4), S, &HE7D3FBC8
md5_GG a, b, c, d, x(k + 9), S, &HE1CDE6
md5_GG d, a, b, c, x(k + ), S, &HCD6
md5_GG c, d, a, b, x(k + 3), S, &HF4DD
md5_GG b, c, d, a, x(k + 8), S, &HAED
md5_GG a, b, c, d, x(k + ), S, &HA9E3E
md5_GG d, a, b, c, x(k + 2), S, &HFCEFA3F8
md5_GG c, d, a, b, x(k + 7), S, &HFD9
md5_GG b, c, d, a, x(k + ), S, &H8D2A4C8A
md5_HH a, b, c, d, x(k + 5), S, &HFFFA
md5_HH d, a, b, c, x(k + 8), S, &HF
md5_HH c, d, a, b, x(k + ), S, &H6D9D
md5_HH b, c, d, a, x(k + ), S, &HFDEC
md5_HH a, b, c, d, x(k + 1), S, &HA4BEEA
md5_HH d, a, b, c, x(k + 4), S, &H4BDECFA9
md5_HH c, d, a, b, x(k + 7), S, &HF6BB4B
md5_HH b, c, d, a, x(k + ), S, &HBEBFBC
md5_HH a, b, c, d, x(k + ), S, &HB7EC6
md5_HH d, a, b, c, x(k + 0), S, &HEAAFA
md5_HH c, d, a, b, x(k + 3), S, &HD4EF
md5_HH b, c, d, a, x(k + 6), S, &HD
md5_HH a, b, c, d, x(k + 9), S, &HD9D4D
md5_HH d, a, b, c, x(k + ), S, &HE6DBE5
md5_HH c, d, a, b, x(k + ), S, &H1FACF8
md5_HH b, c, d, a, x(k + 2), S, &HC4AC
md5_II a, b, c, d, x(k + 0), S, &HF
md5_II d, a, b, c, x(k + 7), S, &HAFF
md5_II c, d, a, b, x(k + ), S, &HABA7
md5_II b, c, d, a, x(k + 5), S, &HFCA
md5_II a, b, c, d, x(k + ), S, &HBC3
md5_II d, a, b, c, x(k + 3), S, &H8F0CCC
md5_II c, d, a, b, x(k + ), S, &HFFEFFD
md5_II b, c, d, a, x(k + 1), S, &HDD1
md5_II a, b, c, d, x(k + 8), S, &H6FAE4F
md5_II d, a, b, c, x(k + ), S, &HFE2CE6E0
md5_II c, d, a, b, x(k + 6), S, &HA
md5_II b, c, d, a, x(k + ), S, &H4EA1
md5_II a, b, c, d, x(k + 4), S, &HFE
md5_II d, a, b, c, x(k + ), S, &HBD3AF
md5_II c, d, a, b, x(k + 2), S, &H2AD7D2BB
md5_II b, c, d, a, x(k + 9), S, &HEBD
a = AddUnsigned(a, AA)
b = AddUnsigned(b, BB)
c = AddUnsigned(c, CC)
d = AddUnsigned(d, DD)
Next
'MD5 = LCase(WordToHex(a) & WordToHex(b) & WordToHex(c) & WordToHex(d))
MD5=LCase(WordToHex(b) & WordToHex(c)) 'I crop this to fit byte database password :D
End Function
%>
è°ç¨çæ¶åå°±ç¨
MD5(è¦å å¯çå 容)
求一个c++小程序源代码，要求行以上，给分，能用再加
//=================================[说明]=======================================*/
//学生成绩管理
//文件名：main.cpp
//------！！！！！！---------BOF-[程序代码开始]-------------------
#include<iostream>
#include<string>
using namespace std;
//=============<开始定义结构体>===================================================
struct combox
{
int num;
int mark;
string name;
combox *next;
};
//=============<结束定义结构体>===================================================
//=============<开始定义Commonbox类>==============================================
//-----类体开始------------------------
class Commonbox
{
private:
combox *head;
void Swap(combox *,combox *); //交换两个combox变量的数据域
void Print(combox *); //输出一combox指定的记录
combox *Find(int); //查找条例条件的记录，并返回该记录的指针
public:
Commonbox()
{
head=NULL;
}
int ListCount(); //统计当前链表的记录总数，返回一个整数
void AddItem(int num, string name, int mark); //添加一条记录到表尾
void RemoveItem(int); //删除一条指定的记录
void List(); //列出当前链表中的所有记录
void Sort(); //对当前链表进行排序
void Search(int); //在当前链表查找指定记录并输出
float Average(); //计算平均成绩
};
//-----类体结束------------------------
//-----类成员函数开始----------------------------------
int Commonbox::ListCount() //统计当前链表的记录总数，返回一个整数
{
if (! head)return 0;
combox *p=head;
int n=0;
while (p)
{
n++;
p=p->next;
}
return n;
}
void Commonbox::AddItem(int num, string name, int mark) //添加一条记录到表尾
{
if (! head)
{
head=new combox;
head->mark=mark;
head->num=num;
head->name=name;
head->next=NULL;
return;
}
combox *t=head;
while (t && t->num!=num)
t=t->next;
if (t)
{
cout<<"操作失败：学号为"<<num<<"的记录已经存在！"<<endl;
return;
}
combox *p=head;
while (p->next)p=p->next;
combox *p1=new combox;
p1->num=num;
p1->mark=mark;
p1->name=name;
p1->next=NULL;
p->next=p1;
return;
}
void Commonbox::RemoveItem(int num) //删除一条指定的记录
{
combox *t=Find(num);
if (! t)return;
combox *p=head;
//如果要删除的记录位于表头
if (head==t)
{
head=head->next;
delete p;
cout <<"成功删除学号为 "<<num<<" 的记录!"<<endl<<endl;
return;
}
while (p->next!=t)p=p->next;
combox *p1=p->next;
p->next=p1->next;
delete p1;
cout <<"成功删除学号为 "<<num<<" 的记录!"<<endl<<endl;
return;
}
void Commonbox::Print(combox *p) //输出一combox指定的记录
{
cout<<p->num<<"\t\t";
cout<<p->name<<"\t\t";
cout<<p->mark<<endl;
return;
}
void Commonbox::List() //列出当前链表中的所有记录
{
if (ListCount()==0)
{
cout <<"错误：当前的列表为空！"<<endl;
return;
}
combox *p=head;
cout<<"共有记录:"<<ListCount()<<endl;
cout<<"学号\t\t姓名\t\t分数"<<endl;
while (p)
{
Print(p);
p=p->next;
}
cout <<endl;
return;
}
void Commonbox::Search(int num) //在当前链表查找指定记录并输出
{
cout <<"Searching...."<<endl;
combox *p=Find(num);
if (p)
{
cout<<"学号\t\t姓名\t\t分数"<<endl;
Print(p);
}
cout <<endl;
}
combox *Commonbox::Find(int num)
{
if (ListCount()==0)
{
cout <<"错误：当前的列表为空！"<<endl;
return NULL;
}
combox *p=head;
while (p)
{
if (p->num==num)break;
p=p->next;
}
if (! p)
{
cout <<"错误：找不到该记录!\n";
return NULL;
}
return p;
}
void Commonbox::Swap(combox *p1, combox *p2) //交换两个combox变量的数据域
{
combox *temp=new combox;
temp->num=p1->num;
temp->mark=p1->mark;
temp->name=p1->name;
p1->num=p2->num;
p1->mark=p2->mark;
p1->name=p2->name;
p2->num=temp->num;
p2->mark=temp->mark;
p2->name=temp->name;
}
void Commonbox::Sort() //对当前链表进行排序
{
cout <<"Sorting..."<<endl;
if (ListCount()<2) return;
combox *temp=NULL,*p=NULL,*p1=NULL,*p2=NULL,*k=NULL;
int n=ListCount(),i,j;
p=head;
for (i=1;i<n;i++)
{
k=p;
p1=p->next;
for (j=0;j<n-i;j++)
{
if (k->num > p1->num)
{
k=p1;
}
p1=p1->next;
}
if (p!=k)Swap(k,p);
p=p->next;
}
cout <<"Complete successfully!"<<endl<<endl;
return;
}
float Commonbox::Average() //计算平均成绩
{
if (ListCount()==0)
{
cout <<"错误：当前的列表为空！"<<endl;
return -1;
}
int sum=0,n=0;
combox *p=head;
while (p)
{
sum += p->mark;
p=p->next;
n++;
}
return float(sum)/n;
}
//-----类成员函数结束----------------------------------
//=============<结束定义Commonbox类>==============================================
Commonbox student; //定义全局变量
int Menu()
{
cout <<"===========[主选单:]==========="<<endl;
int n=1,select=-1;
cout <<n++<<".输入学生成绩;"<<endl<<endl;
cout <<n++<<".按学号排序;"<<endl<<endl;
cout <<n++<<".按学号查找记录;"<<endl<<endl;
cout <<n++<<".删除由学号指定的记录;"<<endl<<endl;
cout <<n++<<".列出所有记录;"<<endl<<endl;
cout <<n++<<".计算平均成绩;"<<endl<<endl;
cout <<"0.退出;"<<endl<<endl;
cout <<"[请选择(输入相应数字)]:";
cin >>select;
return select;
}
char Exit() //返回一个字符患,用于确认退出
{
char s;
cout<<"确定要退出程序吗?[Y/N]:";
cin >>s;
return s;
}
void Input(int *num, string *name, int *mark) //输入学生信息
{
cout <<"请输入 学号 姓名 分数:";
cin >>*num;
if (*num==-1)return;
cin >>*name>>*mark;
return;
}
void AddNew() //增加记录
{
int num=0,mark=0;
string name="";
cout<<endl<<"当输入的学号为-1时表示结束输入."<<endl;
Input(&num, &name, &mark);
while (num!=-1)
{
student.AddItem(num,name,mark);
Input(&num, &name, &mark);
}
return;
}
void DoFind() //按学号查找
{
int num;
cout<<endl<<"当输入的学号为-1时表示结束输入."<<endl;
do
{
cout <<"请输入要查找的学生的学号: ";
cin>>num;
if (num==-1)continue;
student.Search(num);
}
while (num!=-1);
return;
}
void DoDelete() //删除记录
{
cout<<endl<<"当输入的学号为-1时表示结束输入."<<endl;
int num;
do
{
cout <<"请输入要删除的学生的学号:";
cin>>num;
if (num==-1)continue;
student.RemoveItem(num);
}
while (num!=-1);
return;
}
void ShowAverage() //输出平均数
{
float avr=student.Average();
if (avr>0)
{
cout<<"共有记录:\t"<<student.ListCount()<<endl<<endl;
cout<<"平均成绩:\t"<<avr<<endl<<endl;
}
return;
}
//-------
