搜索结果
找到约 908 项符合
Max-Int 的查询结果
源码 学生管理啊
#include <iostream.h>
#include <string.h>
#include <iomanip.h>
#include "Stud.h"
Stud::Stud(){}
char *Stud::getno() &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;//获取学号
{
return no;
}
char *Stud::getname() &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;//获取姓名
{
return name;
}
char *Stud::ge ...
软件 学生成绩查询
#include "string.h"
#include "ctype.h"
#include "stdio.h"
search(char pd[])
{FILE *fp;
int time=0,i=0,j=0,add[80],k=0,m;
char *ch,
str[900];
m=strlen(pd);
if((fp=fopen("haha.txt","r"))==NULL)
{
printf("Cannot open this file\n");
exit(0);
}
for(;!feof(fp);i++)
{
str[i]=fgetc(fp);
if(to ...
源码 学生成绩管理啊
#include "string.h"
#include "ctype.h"
#include "stdio.h"
search(char pd[])
{FILE *fp;
&nbsp;int time=0,i=0,j=0,add[80],k=0,m;
&nbsp;char *ch,
&nbsp;str[900];
&nbsp;m=strlen(pd);
&nbsp;if((fp=fopen("haha.txt","r"))==NULL)
&nbsp;{
&nbsp; printf("Cannot open this file\n");
&nbsp; exit(0);
&nbsp;}
for( ...
源码 c#简单计算器
// 学生管理.cpp : Defines the entry point for the application.
//
#include "stdafx.h"
#include "resource.h"
#define MAX_LOADSTRING 100
// Global Variables:
HINSTANCE hInst; // current instance
TCHAR szTitle[MAX_LOADSTRING]; // The title bar text
TCHAR szWindowClass[MAX_LOADSTRING]; ...
软件 简单的计算器
// 学生管理.cpp : Defines the entry point for the application.
//
#include "stdafx.h"
#include "resource.h"
#define MAX_LOADSTRING 100
// Global Variables:
HINSTANCE hInst; // current instance
TCHAR szTitle[MAX_LOADSTRING]; // The title bar text
TCHAR szWindowClass[MAX_LOADSTRING]; ...
教程 ansoft 12,使用手册
Ansoft 12 MAX WELL使用手册及注意事项
书籍 MAX5302
12bit 低功耗DAC 数模转换器
The MAX5302 combines a low-power, voltage-output,
12-bit digital-to-analog converter (DAC) and a precision
output amplifier in an 8-pin µMAX package. It operates
from a single +5V supply, drawing less than 280µA of
supply current.
源码 java学生数据库
/*import java.util.Scanner;
//主类
public class student122 {
&nbsp;&nbsp;//主方法
&nbsp;&nbsp;public static void main(String[] args){
&nbsp;&nbsp;&nbsp;&nbsp;//定义7个元素的字符数组
&nbsp;&nbsp;&nbsp;&nbsp;String[] st = new String[7];
&nbsp;&nbsp;&nbsp;&nbsp;inputSt(st); &nbsp ...
源码 c语言算法排序
1．Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and
another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
#include<stdio.h>
#include<stdlib.h>
void merge(int arr[],int low,int mid,int high){
&nbsp; ...
源码 点亮P10单元板单片机源程序
/*=================================================================
4扫16*16下入上出C语言程序, 低位起笔，数据反相。
预定义
**************************************************************/
#include
#include //可使用其中定义的宏来访问绝对地址？
bit ture=1; // 使能正反相位选择
bit false=0; / ...