用公式计算一个数字的平方根，用C语言怎么实现？

相关推荐

• 用公式计算一个数字的平方根，用C语言怎么实现？

  3年前
  回答 1 已采纳 Problem Description Let's define the function f(n)=⌊n−√⌋. Bo wanted to know the minimum number y which satisfies fy(n)=1. note:f1(n)=f(n),fy(n)=f(fy−1(n)) It is a pity that Bo can only use 1 unit of time to calculate this function each time. And Bo is impatient, he cannot stand waiting for longer than 5 units of time. So Bo wants to know if he can solve this problem in 5 units of time. Input This problem has multi test cases(no more than 120). Each test case contains a non-negative integer n(n<10100). Output For each test case print a integer - the answer y or a string "TAT" - Bo can't solve this problem. Sample Input 233 233333333333333333333333333333333333333333333333333333333 Sample Output 3 TAT
• C语言用迭代法求平方根

  7年前
  回答 2 已采纳 要求，输入一个正整数，计算平方根，计算到1-4e为止 不得使用现成的函数。
• 计算频度出现的平方根，结果是一个分数，这个使用C语言计算的方式是？ Golangerlangr语言

  3年前
  回答 1 已采纳 Problem Description You are now working in a physical laboratory. One day, when you were skimming through your records of experiments, you find that the squared frequency, defined as (P/Q)2, in which Q indicates times of experiments and P means number of experiments in which the expected phenomenon appears, is somehow unreasonable. The squared frequency F (0 < F < 1) is written in decimal form, and rounded to K (K ≤ 9) numbers after the decimal point. You think that Q, i.e. times of experiments, is too small to obtain such a number. Now you need to work out a fraction P/Q, so that rounding (P/Q)2 to K numbers after the decimal point gets exactly F, and minimizes Q. Input Input contains no more than 2000 test cases. Each test case has a single line, which contains a decimal fraction indicating F, the squared frequency. Output For each test case, output your answer in a line with the case number, follow the format in sample. You should print a blank after ':'. If the answer is not unique, output the one with the minimum P. Sample Input 0.3 0.5 0.50 Sample Output Case #1: 1/2 Case #2: 5/7 Case #3: 12/17
• C语言不使用系统库函数，使用循环实现求任意正数的开平方

  6年前
  回答 2 已采纳 C语言不使用系统库函数，使用循环实现求任意正数的开平方，怎么写？？？
• 计算数组中相隔两个数的平方根，是不是递推不出来了，C语言 Golangerlangr语言

  2年前
  回答 1 已采纳 Problem Description YJQQQAQ has an array A of length n. He defines a function fl,r,k where l,r,k are positive integers that satisfies l≤r and r×k≤n, and the value of the function equals to p×q×⌊k√⌋ where p equals to the sum value of Al×k,A(l+1)×k,...,Ar×k and q equals to the minimal value of them. YJQQQAQ wants to choose the positive integers l,r,k carefully to maximize the value of the function. Input The first line contains an integer T(1≤T≤3)——The number of the test cases. For each test case: The first line contains an integers n(1≤n≤300,000). The second line contains n integers describing the given array A, the ith integer is Ai(1≤Ai≤1,000,000). Between each two adjacent integers there is a white space separated. Output For each test case, the only line contains the only integer that is the maximum value of the function. Sample Input 1 3 2 3 1 Sample Output 10
• 编写程序，它的功能是：应用迭代算法求a的平方根，求a的平方根的迭代公式如下：x1=1/2(x0+a/x0),例如a为2是，平方根值为：1.414214 c语言

  8月前
  回答 2 已采纳 编写程序如下，为什么只有4、9、16......这样类型的才能出来结果呢？哪里出错了？ #include #include main() { float a; float x0,x1; scanf("%f",&a); x0=a / 2; x1=(x0+a/x0)/2; do { x1=x0; x1=(x0+a/x0)/2; } while(fabs(x1 - x0) >= 1e-5); printf("%.5f",x1); return 0; }
• 输出1~10的平方与平方根 c++c语言

  10月前
  回答 2 已采纳  如图所示列出1~10，输出平方根和平方，哪位能给写一个代码我看看，写来写去都出错
• C语言求素数一个小问题

  6年前
  回答 1 已采纳 题目是要求n以内素数的平方根的和，编好了之后怎么运行答案都不对，加了这句选中的语句才对了，请问这句if(j>=k+1)有什么用？在上面一个for循环中j应该是到不了k+1的吧……求详解
• 求数列的和，用C语言，谢谢

  3年前
  回答 2 已采纳 Problem Description 数列的定义如下： 数列的第一项为n，以后各项为前一项的平方根，求数列的前m项的和。 Input 输入数据有多组，每组占一行，由两个整数n（n<10000）和m(m<1000)组成，n和m的含义如前所述。 Output 对于每组输入数据，输出该数列的和，每个测试实例占一行，要求精度保留2位小数。 Sample Input 81 4 2 2 Sample Output 94.73 3.41
• 判断一个整数的平方根是否为整数的最快方法 java

  13年前
  回答 28 已采纳 I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer): I've done it the easy way, by using the built-in Math.sqrt() function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impratical (since there are about 231.5 integers whose square is less than 263). Here is the very simple and straightforward way I'm doing it now: public final static boolean isPerfectSquare(long n) { if (n < 0) return false; long tst = (long)(Math.sqrt(n) + 0.5); return tst*tst == n; } Notes: I'm using this function in many Project Euler problems. So no one else will ever have to maintain this code. And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems. A new solution posted by A. Rex has proven to be even faster. In a run over the first 1 billion integers, the solution only required 34% of the time that the original solution used. While the John Carmack hack is a little better for small values of n, the benefit compared to this solution is pretty small. Here is the A. Rex solution, converted to Java: private final static boolean isPerfectSquare(long n) { // Quickfail if( n < 0 || ((n&2) != 0) || ((n & 7) == 5) || ((n & 11) == 8) ) return false; if( n == 0 ) return true; // Check mod 255 = 3 * 5 * 17, for fun long y = n; y = (y & 0xffffffffL) + (y >> 32); y = (y & 0xffffL) + (y >> 16); y = (y & 0xffL) + ((y >> 8) & 0xffL) + (y >> 16); if( bad255[(int)y] ) return false; // Divide out powers of 4 using binary search if((n & 0xffffffffL) == 0) n >>= 32; if((n & 0xffffL) == 0) n >>= 16; if((n & 0xffL) == 0) n >>= 8; if((n & 0xfL) == 0) n >>= 4; if((n & 0x3L) == 0) n >>= 2; if((n & 0x7L) != 1) return false; // Compute sqrt using something like Hensel's lemma long r, t, z; r = start[(int)((n >> 3) & 0x3ffL)]; do { z = n - r * r; if( z == 0 ) return true; if( z < 0 ) return false; t = z & (-z); r += (z & t) >> 1; if( r > (t >> 1) ) r = t - r; } while( t <= (1L << 33) ); return false; } private static boolean[] bad255 = { false,false,true ,true ,false,true ,true ,true ,true ,false,true ,true ,true , true ,true ,false,false,true ,true ,false,true ,false,true ,true ,true ,false, true ,true ,true ,true ,false,true ,true ,true ,false,true ,false,true ,true , true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,false,true ,false, true ,true ,true ,false,true ,true ,true ,true ,false,true ,true ,true ,false, true ,false,true ,true ,false,false,true ,true ,true ,true ,true ,false,true , true ,true ,true ,false,true ,true ,false,false,true ,true ,true ,true ,true , true ,true ,true ,false,true ,true ,true ,true ,true ,false,true ,true ,true , true ,true ,false,true ,true ,true ,true ,false,true ,true ,true ,false,true , true ,true ,true ,false,false,true ,true ,true ,true ,true ,true ,true ,true , true ,true ,true ,true ,true ,false,false,true ,true ,true ,true ,true ,true , true ,false,false,true ,true ,true ,true ,true ,false,true ,true ,false,true , true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,false,true ,true , false,true ,false,true ,true ,false,true ,true ,true ,true ,true ,true ,true , true ,true ,true ,true ,false,true ,true ,false,true ,true ,true ,true ,true , false,false,true ,true ,true ,true ,true ,true ,true ,false,false,true ,true , true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,false,false, true ,true ,true ,true ,false,true ,true ,true ,false,true ,true ,true ,true , false,true ,true ,true ,true ,true ,false,true ,true ,true ,true ,true ,false, true ,true ,true ,true ,true ,true ,true ,true ,false,false,true ,true ,false, true ,true ,true ,true ,false,true ,true ,true ,true ,true ,false,false,true , true ,false,true ,false,true ,true ,true ,false,true ,true ,true ,true ,false, true ,true ,true ,false,true ,false,true ,true ,true ,true ,true ,true ,true , true ,true ,true ,true ,true ,false,true ,false,true ,true ,true ,false,true , true ,true ,true ,false,true ,true ,true ,false,true ,false,true ,true ,false, false,true ,true ,true ,true ,true ,false,true ,true ,true ,true ,false,true , true ,false,false,true ,true ,true ,true ,true ,true ,true ,true ,false,true , true ,true ,true ,true ,false,true ,true ,true ,true ,true ,false,true ,true , true ,true ,false,true ,true ,true ,false,true ,true ,true ,true ,false,false, true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,true , false,false,true ,true ,true ,true ,true ,true ,true ,false,false,true ,true , true ,true ,true ,false,true ,true ,false,true ,true ,true ,true ,true ,true , true ,true ,true ,true ,true ,false,true ,true ,false,true ,false,true ,true , false,true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,true ,false, true ,true ,false,true ,true ,true ,true ,true ,false,false,true ,true ,true , true ,true ,true ,true ,false,false,true ,true ,true ,true ,true ,true ,true , true ,true ,true ,true ,true ,true ,false,false,true ,true ,true ,true ,false, true ,true ,true ,false,true ,true ,true ,true ,false,true ,true ,true ,true , true ,false,true ,true ,true ,true ,true ,false,true ,true ,true ,true ,true , true ,true ,true ,false,false }; private static int[] start = { 1,3,1769,5,1937,1741,7,1451,479,157,9,91,945,659,1817,11, 1983,707,1321,1211,1071,13,1479,405,415,1501,1609,741,15,339,1703,203, 129,1411,873,1669,17,1715,1145,1835,351,1251,887,1573,975,19,1127,395, 1855,1981,425,453,1105,653,327,21,287,93,713,1691,1935,301,551,587, 257,1277,23,763,1903,1075,1799,1877,223,1437,1783,859,1201,621,25,779, 1727,573,471,1979,815,1293,825,363,159,1315,183,27,241,941,601,971, 385,131,919,901,273,435,647,1493,95,29,1417,805,719,1261,1177,1163, 1599,835,1367,315,1361,1933,1977,747,31,1373,1079,1637,1679,1581,1753,1355, 513,1539,1815,1531,1647,205,505,1109,33,1379,521,1627,1457,1901,1767,1547, 1471,1853,1833,1349,559,1523,967,1131,97,35,1975,795,497,1875,1191,1739, 641,1149,1385,133,529,845,1657,725,161,1309,375,37,463,1555,615,1931, 1343,445,937,1083,1617,883,185,1515,225,1443,1225,869,1423,1235,39,1973, 769,259,489,1797,1391,1485,1287,341,289,99,1271,1701,1713,915,537,1781, 1215,963,41,581,303,243,1337,1899,353,1245,329,1563,753,595,1113,1589, 897,1667,407,635,785,1971,135,43,417,1507,1929,731,207,275,1689,1397, 1087,1725,855,1851,1873,397,1607,1813,481,163,567,101,1167,45,1831,1205, 1025,1021,1303,1029,1135,1331,1017,427,545,1181,1033,933,1969,365,1255,1013, 959,317,1751,187,47,1037,455,1429,609,1571,1463,1765,1009,685,679,821, 1153,387,1897,1403,1041,691,1927,811,673,227,137,1499,49,1005,103,629, 831,1091,1449,1477,1967,1677,697,1045,737,1117,1737,667,911,1325,473,437, 1281,1795,1001,261,879,51,775,1195,801,1635,759,165,1871,1645,1049,245, 703,1597,553,955,209,1779,1849,661,865,291,841,997,1265,1965,1625,53, 1409,893,105,1925,1297,589,377,1579,929,1053,1655,1829,305,1811,1895,139, 575,189,343,709,1711,1139,1095,277,993,1699,55,1435,655,1491,1319,331, 1537,515,791,507,623,1229,1529,1963,1057,355,1545,603,1615,1171,743,523, 447,1219,1239,1723,465,499,57,107,1121,989,951,229,1521,851,167,715, 1665,1923,1687,1157,1553,1869,1415,1749,1185,1763,649,1061,561,531,409,907, 319,1469,1961,59,1455,141,1209,491,1249,419,1847,1893,399,211,985,1099, 1793,765,1513,1275,367,1587,263,1365,1313,925,247,1371,1359,109,1561,1291, 191,61,1065,1605,721,781,1735,875,1377,1827,1353,539,1777,429,1959,1483, 1921,643,617,389,1809,947,889,981,1441,483,1143,293,817,749,1383,1675, 63,1347,169,827,1199,1421,583,1259,1505,861,457,1125,143,1069,807,1867, 2047,2045,279,2043,111,307,2041,597,1569,1891,2039,1957,1103,1389,231,2037, 65,1341,727,837,977,2035,569,1643,1633,547,439,1307,2033,1709,345,1845, 1919,637,1175,379,2031,333,903,213,1697,797,1161,475,1073,2029,921,1653, 193,67,1623,1595,943,1395,1721,2027,1761,1955,1335,357,113,1747,1497,1461, 1791,771,2025,1285,145,973,249,171,1825,611,265,1189,847,1427,2023,1269, 321,1475,1577,69,1233,755,1223,1685,1889,733,1865,2021,1807,1107,1447,1077, 1663,1917,1129,1147,1775,1613,1401,555,1953,2019,631,1243,1329,787,871,885, 449,1213,681,1733,687,115,71,1301,2017,675,969,411,369,467,295,693, 1535,509,233,517,401,1843,1543,939,2015,669,1527,421,591,147,281,501, 577,195,215,699,1489,525,1081,917,1951,2013,73,1253,1551,173,857,309, 1407,899,663,1915,1519,1203,391,1323,1887,739,1673,2011,1585,493,1433,117, 705,1603,1111,965,431,1165,1863,533,1823,605,823,1179,625,813,2009,75, 1279,1789,1559,251,657,563,761,1707,1759,1949,777,347,335,1133,1511,267, 833,1085,2007,1467,1745,1805,711,149,1695,803,1719,485,1295,1453,935,459, 1151,381,1641,1413,1263,77,1913,2005,1631,541,119,1317,1841,1773,359,651, 961,323,1193,197,175,1651,441,235,1567,1885,1481,1947,881,2003,217,843, 1023,1027,745,1019,913,717,1031,1621,1503,867,1015,1115,79,1683,793,1035, 1089,1731,297,1861,2001,1011,1593,619,1439,477,585,283,1039,1363,1369,1227, 895,1661,151,645,1007,1357,121,1237,1375,1821,1911,549,1999,1043,1945,1419, 1217,957,599,571,81,371,1351,1003,1311,931,311,1381,1137,723,1575,1611, 767,253,1047,1787,1169,1997,1273,853,1247,413,1289,1883,177,403,999,1803, 1345,451,1495,1093,1839,269,199,1387,1183,1757,1207,1051,783,83,423,1995, 639,1155,1943,123,751,1459,1671,469,1119,995,393,219,1743,237,153,1909, 1473,1859,1705,1339,337,909,953,1771,1055,349,1993,613,1393,557,729,1717, 511,1533,1257,1541,1425,819,519,85,991,1693,503,1445,433,877,1305,1525, 1601,829,809,325,1583,1549,1991,1941,927,1059,1097,1819,527,1197,1881,1333, 383,125,361,891,495,179,633,299,863,285,1399,987,1487,1517,1639,1141, 1729,579,87,1989,593,1907,839,1557,799,1629,201,155,1649,1837,1063,949, 255,1283,535,773,1681,461,1785,683,735,1123,1801,677,689,1939,487,757, 1857,1987,983,443,1327,1267,313,1173,671,221,695,1509,271,1619,89,565, 127,1405,1431,1659,239,1101,1159,1067,607,1565,905,1755,1231,1299,665,373, 1985,701,1879,1221,849,627,1465,789,543,1187,1591,923,1905,979,1241,181 }; I've tried the different solutions presented below. After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The John Carmack hack was faster, but it gave incorrect results starting at n=410881. However, as suggested by BobbyShaftoe, we can use the Carmack hack for n < 410881. Newton's method was a good bit slower than Math.sqrt(). This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java. Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower. This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. The one suggestion which did show improvements was made by John D. Cook. You can observe that the last hex digit (i.e. the last 4 bits) of a perfect square must be 0, 1, 4, or 9. This means that 75% of numbers can be immediately eliminated as possible squares. Implementing this solution resulted in about a 50% reduction in runtime. Working from John's suggestion, I investigated properties of the last n bits of a perfect square. By analyzing the last 6 bits, I found that only 12 out of 64 values are possible for the last 6 bits. This means 81% of values can be eliminated without using any math. Implementing this solution gave an additional 8% reduction in runtime (compared to my original algorithm). Analyzing more than 6 bits results in a list of possible ending bits which is too large to be practical. Here is the code that I have used, which runs in 42% of the time required by the original algorithm (based on a run over the first 100 million integers). For values of n less than 410881, it runs in only 29% of the time required by the original algorithm. private final static boolean isPerfectSquare(long n) { if (n < 0) return false; switch((int)(n & 0x3F)) { case 0x00: case 0x01: case 0x04: case 0x09: case 0x10: case 0x11: case 0x19: case 0x21: case 0x24: case 0x29: case 0x31: case 0x39: long sqrt; if(n < 410881L) { //John Carmack hack, converted to Java. // See: http://www.codemaestro.com/reviews/9 int i; float x2, y; x2 = n * 0.5F; y = n; i = Float.floatToRawIntBits(y); i = 0x5f3759df - ( i >> 1 ); y = Float.intBitsToFloat(i); y = y * ( 1.5F - ( x2 * y * y ) ); sqrt = (long)(1.0F/y); } else { //Carmack hack gives incorrect answer for n >= 410881. sqrt = (long)Math.sqrt(n); } return sqrt*sqrt == n; default: return false; } } Notes: According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values). Then instead of either switch or or statement, I would just say if(lookup[(int)(n&0x3F)]) { test } else return false;. To my surprise, this was (just slightly) slower. I'm not sure why. This is because array bounds are checked in Java. 转载于:https://stackoverflow.com/questions/295579/fastest-way-to-determine-if-an-integers-square-root-is-an-integer
• c语言迭代法求平方根_如何使用java语言求一个正整数的平方根？（自定义sqrt函数）...

  4月前
  weixin_39777213的博客 今天的这篇文章是我在刷算法题的时候遇到的，最简单的方法是直接调用java里面的Sqrt函数，不过有时候题目中会要求我们不能使用库函数，...一、二分法二分法的思想很简单，就是从0到N不断的去缩小范围来找一个一个满...
• c语言一个整数各位数字个数_C语言经典编程题(下)

  5月前
  weixin_39664994的博客 C语言字符串加密和解密算法C语言输出等腰三角形C语言约瑟夫环问题C语言整数逆序输出C语言三色旗问题C语言求定积分C语言求空间两点之间的距离...数C语言字符串加密和解密算法在本实例中要求设计一个加密和解密算法...
• c语言数组如何把一串数字存入数组_C语言经典编程题(下)

  6月前
  weixin_39528467的博客 C语言字符串加密和解密算法C语言输出等腰三角形C语言约瑟夫环问题C语言整数逆序输出C语言三色旗问题C语言求定积分C语言求空间两点之间的距离...数C语言字符串加密和解密算法在本实例中要求设计一个加密和解密算法...
• python用牛顿迭代法求平方根_如何用牛顿法求一个数的平方根

  4月前
  weixin_39597262的博客 SCIP 1.1.7的一个练习。牛顿迭代法(Newton's method)又称为牛顿-拉夫逊方法(Newton-Raphson method)，它是牛顿在17世纪提出的一种在实数域和复数域上近似求解方程的方法。多数方程不存在求根公式，因此求精确根非常...
• 数列求和c语言_14个经典C语言算法你就不看一眼？（附详细代码）

  4月前
  weixin_39576336的博客 今天，给大家讲一讲，单片机常用的14个C语言算法（附详细代码）哟！一、计数、求和、求阶乘等简单算法 此类问题都要使用循环，要注意根据问题确定循环变量的初值、终值或结束条件，更要注意用来表示计数、和、阶乘的...
• 求一个任意实数c的算术平方根_LeetCode 题解 | 69. X 的平方根

  5月前
  weixin_39765840的博客 计算并返回 x 的平方根，其中 x 是非负整数。由于返回类型是整数，结果只保留整数的部分，小数部分将被舍去。示例 1:示例 2:解决方案二分查找法应用于搜索平方根的思想很简单，其实就是“猜”，但是是有策略的“猜”...
• 从键盘输入一个实数，输出其平方根

  3年前
  l15970940509的博客  /*从键盘输入一个实数*/   fy=sqrt(fx); /*计算平方根*/   printf("fy=%f",fy); /*输出结果*/  } // 这个程序有一点点不一样，我觉得还是挺有意思的。平方根就是根号。发现一个有意思 //的东西，输出...
• C/C++编程题之计算一个数字的立方根

  6年前
  yangkccc的博客 计算一个数字的立方根方法：使用对数和指数组合的方法表示立方根。
• c语言判断一个数是否能够等于两个不同素数的乘积_C语言编程学习（经典）

  5月前
  孔祥謙的博客 C语言编程学习1 运算符练习1.1输出不同类型字符#include<stdio.h>main(){ int a=33,b=12,c; char d='a'; c=a+b;/*c=33+12*/ printf("line1-c的值是%dn",c); c=a-b;/*c=33-12*/ printf("line2-c的值是%dn",c); ...
• 语言判断一个整数是奇数还是偶数_C语言顺序结构 必会程序

  4月前
  飞天鬼王的博客 求总分和平均分编写程序，将温度的单位从华氏度转换为摄氏度计算房间面积已知梯形的上底是5,下底是12，高是上、下底的平均数，求这个梯形的面积输入三角形的三边长，用海伦公式求三角形面积从键盘输入一大写字母，...