编辑-ZASEMI快恢复二极管SFF3006参数：型号：SFF3006最大重复峰值反向电压（VRRM）：600V最大RMS电桥输入电压（VRMS）：420V最大直流阻断电压（VDC）：600V最大平均正向整流输出电流（IF）：30A峰值正向浪涌电流（IFSM）：300A每个元件的典型热阻（ReJA）：3℃/W工作结和储存温度范围（TJ, TSTG）：-50to +150℃最大反向恢复时间（trr）
原创
2022-09-26 16:59:44
162阅读
SFF3006-ASEMI高耐压大电流快恢复二极管SFF3006
原创
2022-09-24 13:16:28
120阅读
#include
int a[1000010];
int main()
{
int i,j,k;
int x,y,z;
for(i=2;i
if(!a[i])
for(j=2*i;j
a[j]=1;
a[1]=1;
int n;
while(1)
{
scanf("%d%d%d",&x,&y,&n);
if(n+x+y==0)
break;
else
{
原创
2023-08-23 10:33:09
73阅读
Code #include <cstdio> #include <algorithm> using namespace std; const int N = 1000001; bool primeQ[N]; int prime[N / 10]; int cnt; int a, d, n, cur; ...
转载
2021-09-18 20:41:00
77阅读
2评论
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<ctime> using namespace std; bool data[1000005]; void init(){ data[1] = ...
转载
2021-07-27 20:25:00
55阅读
2评论
普通的n^2的筛法居然比线性筛法快，不知道以后该用哪个了……View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 1000000bool prime[maxn];int main(){ //freopen("D:\\t.txt", "r", stdin); memset(prime, true, sizeof(prime)); for
转载
2011-03-01 09:30:00
36阅读
2评论
#include #include bool isPrime(int num) { if (1 == num) { return false; } for (int i = 2; i if (num % i == 0) { return false; } }
原创
2023-05-23 15:59:42
42阅读
SFF2004-ASEMI电机控制器SFF2004
原创
2024-02-27 16:16:16
30阅读
SFF1604-ASEMI无人机专用SFF1604
原创
2024-08-26 14:28:51
46阅读
SFF2004-ASEMI智能AI专用SFF2004
原创
2024-08-26 15:58:55
52阅读
SFF1006A-ASEMI无人机专用SFF1006A
原创
2024-06-20 15:52:39
50阅读
SFF2004A-ASEMI无人机专用SFF2004A
原创
2024-06-21 15:49:27
44阅读
SFF806A-ASEMI无人机专用SFF806A
原创
2024-08-24 17:35:23
74阅读
The Number of set Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1301 Accepted Submission(s): 79
原创
2021-07-21 16:00:05
99阅读
http://www.cnblogs.com/lonelycatcher/archive/2011/05/27/2060158.htmlGiven you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set,how many different new set you can get.The given sets can not be broken.InputThere are several case
原创
2021-07-29 16:17:17
50阅读
The Number of setTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 722Accepted Submission(s): 437Problem Description Given you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set,
原创
2021-07-29 16:26:10
100阅读
1X9 GBIC SFP SFF光模块知识
光收发一体模块，英文名称optical transceiver，简称光模块，是光
纤通信系统中重要的器件，包括以下种类：
1.10Gbs光模块(XFP,SFP+，300pin)——应用于连续光通信（城域网、以太网、光纤通路）的紧密10Gb/s光收发模组。
2.1x9双工，2x5，2x10等SC ST连接器光模块
3.RJ45
转载
精选
2011-07-14 00:26:55
2893阅读
线性筛素数……Program P3006;const maxn=1000000;var prime:array[1..maxn] of boolean; p:array[1..maxn] of longint; t:longint; a,d,n:longint;Procedure primeing;var i,j:longint;begin
原创
2012-08-16 20:37:17
19阅读
