代码搜索:divisible

找到约 90 项符合「divisible」的源代码

代码结果 90
www.eeworm.com/read/350482/10740864

c bn_mp_prime_is_divisible.c

#include #ifdef BN_MP_PRIME_IS_DIVISIBLE_C /* LibTomMath, multiple-precision integer library -- Tom St Denis * * LibTomMath is a library that provides multiple-precision * integer arith
www.eeworm.com/read/389812/8498123

php 06c03-1.php

www.eeworm.com/read/431812/8653385

cpp pku1745.cpp

#include int st[10000][100]; int Nu[10000]; int N, K; int Calc(int x) { x %= K; if (x < 0) { x += K; } return x; } int main() { int i, j; while (scanf("%d%
www.eeworm.com/read/435290/7794322

html numbers.html


www.eeworm.com/read/493005/6403783

c jump.c

/* * jump - trivial prime jump table * * Copyright (C) 1999 Landon Curt Noll * * Calc is open software; you can redistribute it and/or modify it under * the terms of the version 2.1 of the GNU
www.eeworm.com/read/431198/8703125

lst mod2ans.lst

listing 1 // Find prime numbers between 1 and 100. class Prime { public static void main(String args[]) { int i, j; boolean isprime; for(i=1; i < 100; i++) {
www.eeworm.com/read/493005/6403870

h jump.h

/* * jump - trivial prime jump table * * Copyright (C) 1999 Landon Curt Noll * * Calc is open software; you can redistribute it and/or modify it under * the terms of the version 2.1 of the GNU
www.eeworm.com/read/175226/9555217

cpp list0406.cpp

// if statement #include int main() { // Ask for two numbers // Assign the numbers to bigNumber and littleNumber // If bigNumber is bigger than littleNumber, // see if th
www.eeworm.com/read/349226/10840436

lif thue.lif

#Life 1.05 #D Thue generator #D #D Four puffers produce gliders, whose collisions produce four #D lines of blinkers representing the transcendental number #D .110110111110110111110110110..., wher
www.eeworm.com/read/197608/7069719

c leapyear.c

/* * File: leapyear.c * ---------------- * Reads in a year and determines whether it is a * leap year. A year is a leap year if it is * divisible by four, unless it is divisible by 100. * Years