#define _crt_secure_no_warnings #include <iostream> #include <cstdlib> #include <cmath> #include <vector> #include <cstdio> using namespace std; // 你的代码... const int nx = 784, nb = 500, ny = 10;//输入层x，隐藏层b，输出层y节点数 const double eta = 0.1;//学习率 struct node { double val{}; double bias{}; vector<double> weight; } x[nx], b[nb], y[ny];//输入层x，隐藏层b，输出层y double g[ny], e[nb];//用于反向传播 double trainx[nx], trainy[ny];//训练数据 double sigmoid(double x) { return 1.0 / (1.0 + exp(-x)); } double
dsigmoid(double x) { return x * (1 - x); } void init() {//参数初始化 for (int i = 0; i < nx; i++) { x[i].val = 0; x[i].bias = ((rand() % 1000) - 500) / 10000.0; for (auto &w : x[i].weight) { w = ((rand() % 1000) - 500) / 10000.0; } } for (int i = 0; i < nb; i++) { b[i].val = 0; b[i].bias = ((rand() % 1000) - 500) / 10000.0; for (auto &w : b[i].weight) { w = ((rand() % 1000) - 500) / 10000.0; } } for (int i = 0; i < ny; i++) { y[i].val = 0; y[i].bias = ((rand() % 1000) - 500) / 10000.0; for (auto &w : y[i].weight) { w = ((rand() % 1000) - 500) / 10000.0; } } } void forward_propagation() {//前向传播 for (int i = 0; i < nb; i++) { double sum = 0; for (int j = 0; j < nx; j++) { sum += x[j].val * x[j].weight[i]; } b[i].val = sigmoid(sum + b[i].bias); } for (int i = 0; i < ny; i++) { double sum = 0; for (int j = 0; j < nb; j++) { sum += b[j].val * b[j].weight[i]; } y[i].val = sigmoid(sum + y[i].bias); } } void back_propagation() {//反向传播 for (int i = 0; i < ny; i++) { g[i] *= dsigmoid(y[i].val); } for (int i = 0; i < nb; i++) { e[i] = 0; for (int j = 0; j < ny; j++) { e[i] += g[j] * y[j].weight[i]; } e[i] *= dsigmoid(b[i].val); } for (int i = 0; i < ny; i++) { for (int j = 0; j < nb; j++) { y[i].weight[j] += eta * g[i] * b[j].val; } y[i].bias += eta * g[i]; } for (int i = 0; i < nb; i++) { for (int j = 0; j < nx; j++) { b[i].weight[j] += eta * e[i] * x[j].val; } b[i].bias += eta * e[i]; } } void train() { // 训练代码，根据需要进行实现 } int main() { init(); train(); return 0; } [2024-09-06 08:46:09 | AI写代码神器 | 1309点数解答]
- [字节豆包] #define _crt_secure_no_warnings #include <iostream> #include <cstdlib> #include <cmath> #include <vector> #include <cstdio> using namespace std; // 你的代码... const int nx = 784, nb = 500, ny = 10;//输入层x，隐藏层b，输出层y节点数 const double eta = 0.1;//学习率 struct node { double val{}; double bias{}; vector<double> weight; } x[nx], b[nb], y[ny];//输入层x，隐藏层b，输出层y double g[ny], e[nb];//用于反向传播 double trainx[nx], trainy[ny];//训练数据 double sigmoid(double x) { return 1.0 / (1.0 + exp(-x)); } double（34点数解答 | 2024-09-06 08:43:52）337
- [GPT] #define _crt_secure_no_warnings #include <iostream> #include <cstdlib> #include <cmath> #include <vector> #include <cstdio> using namespace std; // 你的代码... const int nx = 784, nb = 500, ny = 10;//输入层x，隐藏层b，输出层y节点数 const double eta = 0.1;//学习率 struct node { double val{}; double bias{}; vector<double> weight; } x[nx], b[nb], y[ny];//输入层x，隐藏层b，输出层y double g[ny], e[nb];//用于反向传播 double trainx[nx], trainy[ny];//训练数据 double sigmoid(double x) { return 1.0 / (1.0 + exp(-x)); } double（1309点数解答 | 2024-09-06 08:46:09）359
- [字节豆包] ```cpp #include <iostream> using namespace std; struct node { int data; node* link; node(int x) : data(x), link(null) {} }; // 查找最大节点及其前一个节点 void findmaxandprev(node* list, node*& maxnode, node*& prevmax) { node* curr = list; maxnode = list; prevmax = null; node* prev = null; while (curr!= null) { if (curr->data > maxnode->data) { maxnode = curr; prevmax = prev; } prev = curr; curr = curr->link; } } // 将最大节点移到链表末尾 void movemaxtoend(node*& list) { node* maxnode = null; node* prevmax = null;（549点数解答 | 2024-10-14 22:55:13）294
- [字节豆包] #include <iostream> using namespace std; int main() { int nb[10] = {0}; for (int i = 0; i < 10; i++) { int nb; cin >> nb; nb[nb - 1]++; } for (int i = 0; i < 10; i++) { if (i > 0) { cout << " "; } cout << nb[i]; } cout << endl; return 0; }K博士想在自己的学生中选出一位学生做自己的代表。K博士一共有10位学生，分别从1到10一一编号，采用投票的方式进行选举，每个学生只能够投一次。得票最高的学生就将成为K博士的代表。 输入: 输入包括一行。 第一行包含十个整数，每个整数代表这位学生投给了谁。 输出: 输出包括一行，包含10个整数，分别为编号1~10的学生获得的票数，每（527点数解答 | 2026-01-10 19:29:00）12
- [字节豆包] package com.example.news.models class user( val username: string, val email: string, val gender: string ) { // 如果需要默认构造函数，可以添加 constructor() : this("", "", "") }和package com.example.news.models import java.io.serializable class news( val title: string, val content: string, val publisher: string, val publishtime: string = java.util.date().tostring() ) : serializable { }和package com.example.news.models data class comment( val content: string, val com（33点数解答 | 2024-12-13 19:38:40）205
- [字节豆包] 基于这段代码为您进行补充完善 package com.example.news.models class user( val username: string, val email: string, val gender: string ) { // 如果需要默认构造函数，可以添加 constructor() : this("", "", "") }和package com.example.news.models import java.io.serializable class news( val title: string, val content: string, val publisher: string, val publishtime: string = java.util.date().tostring() ) : serializable { }和package com.example.news.models data class comment( val content: string, val commenter: string, var date:string,（215点数解答 | 2024-12-13 19:41:46）287
- [GPT] 运行不了，修改以下代码写出完整代码#include <windows.h> #include <vector> #include <ctime> #include <cstdlib> const int grid_size = 100; // 每个格子的大小 const int box_count = 3; // 箱子数量 const int target_count = 3; // 目标点数量 const int obstacle_count = 5; // 障碍物数量 struct point { int x, y; }; hbitmap hboxbitmap; // 箱子图片的位图句柄 hbrush htargetbrush; // 目标点的画刷 hbrush hobstaclebrush; // 障碍物的画刷 std::vector<point> boxes; // 箱子的位置 std::vector<point> targets; // 目标点的位置 std::vector<point> o（2686点数解答 | 2024-10-31 15:01:39）351
- [阿里通义] if (b==0x7f || b<0x40 || b>0xfe)//尾字节在 40-fe 之间，剔除 xx7f 一条线 return "有非法字符:仅可使用汉字,数字和字母"; word val = (a<<8)|b; if (!((val>=0xb0a1 && val<=0xf7fe)))//gb 2312 汉字 6763 个 //||(val>=0xb140 && val<=0xa0fe)//cjk汉字 6080 个 //||(val>=0xaa40 && val<=0xfea0)))//cjk 汉字和增补的汉字 8160 个 增加繁体字支持（691点数解答 | 2024-10-21 18:58:17）217
- [讯飞星火] 快速排序：# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"（710点数解答 | 2024-11-14 10:44:25）331
- [阿里通义] 快速排序：# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"（951点数解答 | 2024-11-14 10:46:29）314
- [字节豆包] 快速排序：# include< iostream>using namespace std;# include< stdlib. h># include< time. h>const int n =10;const int min= 10;const int max=99;int getrand( int min, int max){return ( rand()%( max-min+1)+ min);}void set( int r[], int n){int i;for(i=0;i<n;i++)r[i]=getrand(min, max);}void show( int r[], int n){int i;for(i=0;i<n;i++)cout << r[i]<<" ";cout << endl;}int partition( int r[], int i, int j){//由你完成}void quicksort( int r[], int i, int j){//由你完成}int main(){srand( time(0));int a[n];set(a, n);cout<<"（472点数解答 | 2024-11-14 10:51:44）308
- [DeepSeek] #include <iostream> #define MAXSIZE 100 #define OK 1 #define ERROR 0 #define OVERFLOW -2 using namespace std; typedef struct {//符号栈 char* base; char* top; int stacksize; }SqStack1; int InitStack1(SqStack1& S) {//符号栈初始化 return OK; } int Push1(SqStack1& S, char e) {//符号栈入栈 return OK; } int Pop1(SqStack1& S) {//符号栈出栈 return OK; } char GetTop1(SqStack1 S) {//符号栈取栈顶元素 return ERROR; } typedef struct {//数字栈 double* base; double* top; int stacksize; }SqStack2; int InitStack2(SqStack2&（1360点数解答 | 2025-11-14 14:57:43）89