代码搜索:modulus
找到约 3,028 项符合「modulus」的源代码
代码结果 3,028
www.eeworm.com/read/454660/7385849
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/434781/7801814
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/333003/12711490
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/332899/12717824
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/331567/12820181
awk mkprotogrid.6.awk
BEGIN {
# conformal modulus
mod = 1
nx = 51;
# maximal aspect ratio
a = 2.0;
PI = 3.14159265357989;
# step by X (uniform)
dx = 1.0 / (nx - 1);
# initial step by Y
dy0 = dx * mo
www.eeworm.com/read/313151/13595108
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/138743/5813941
m wt07fig08.m
% CAPTION
fprintf('\n');
disp('Figure 7.8')
disp('The left graph shows a Meyer wavelet.')
disp('The modulus of its Fourier transform is on the right.')
close all;
n = 8192;
M = 2*pi;
omega =
www.eeworm.com/read/478118/6720101
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/344238/11897503
java primes.java
// control/Primes.java
// TIJ4 Chapter Control, Exercise 4, page 139
// Write a program that uses two nested for loops and the modulus operator (%)
// to detect and print prime numbers.
public c
www.eeworm.com/read/228533/14380266
c sturm.c
/*
* sturm.c
*
* the functions to build and evaluate the Sturm sequence
*/
#include
#include
#include "solve.h"
/*
* modp
*
* calculates the modulus of u(x) / v(x) leaving