# digital

【digital】内容共 172 条
• Problem Descriptio The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the res...
阅读  36 评论 2 点赞  0
• Digital Logichttps://learn.sparkfun.com/tutorials/digital-logic IntroductionDigital, or boolean, logic is the fundamental concept underpinning all modern computer systems. Put simply, it's the system...
阅读  140 评论 2 点赞  0
• 数根 (又称数字根Digital root)是自然数的一种性质。换句话说。每一个自然数都有一个数根。数根是将一正整数的各个位数相加(即横向相加)，若加完后的值大于等于10的话，则继续将各位数进行横向相加直到其值小于十...
阅读  36 评论 2 点赞  0
• Enrolling for a Digital Certificate Users may enroll for a Digital Certificate via the Web. Upon completion of   the necessary forms, the user's Internet Browser will create a Public Key Pair. &n...
阅读  509 评论 0 点赞  0
• #! /bin/bash read -p "please input two numbers:" a b if [ -z "\$a" ] || [ -z "\$b" ];then echo " please input digital." exit 2 fi expr \$a + 1 &> /dev/null a1=`echo \$?` expr \$b + 1 &> /...
阅读  406 评论 0 点赞  0
• Bob(Bob's public key)(Bob's private key)Bob has been given two keys. One of Bob's keys is called a Public Key, the other is called a Private Key.Bob's Co-workers:Anyone can get Bob's Public Key, but B...
阅读  541 评论 0 点赞  0
• 题目大意：将给出的一个大数各位数字相加，得到一个新的数，再将这个数字各位数字相加，依次计算，直到变成一个个位数，这个数就被称为这个大数的Digital Roots。现在要求得到这个数。 单词积累：digit 位，数字 题...
阅读  7 评论 0 点赞  0
• Digital Roots Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. I...
阅读  30 评论 2 点赞  0
• 这题我先建了表来做的。 可以进行两个操作： 1、把其中一个数变为比它小的数； 2、把其中一个数字0及其右边的所以数字删除。 两人轮流进行操作， //Time 281ms, Memory 4140 #include<iostream> #include<...
阅读  12 评论 2 点赞  0
•  ​ Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5203    Accepted Submission(s): 2910 Problem Description The d...
阅读  11 评论 2 点赞  0
• 传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1013 水题 我的方法是当做字符串进行处理，算完和之后，再用一次sprintf，将int数值转换为字符串，在进行求和操作，直到满足条件。。。...
阅读  15 评论 0 点赞  0
• 传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1013 水题 我的方法是当做字符串进行处理，算完和之后，再用一次sprintf，将int数值转换为字符串，在进行求和操作，直到满足条件。。。。。 #include<stdio....
阅读  137 评论 0 点赞  0
• Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68194    Accepted Submission(s): 21324 Problem Description The digital ro...
阅读  15 评论 0 点赞  0
• Sum of Digits / Digital Root In this kata, you must create a digital root function. A digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. ...
阅读  47 评论 2 点赞  0
• Digital Roots Time Limit: 2 Seconds      Memory Limit: 65536 KB BackgroundThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a sing...
阅读  35 评论 2 点赞  0
• I made a keynote speech on how IT technology can help the digital transformation of retail industry. The speech was in Xiamen, November 2019. IT was free . My talk is about big data technology, busin...
阅读  138 评论 0 点赞  0
• A. Digital Counter time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Malek lives in an apartment block with 100 floors numbe...
阅读  38 评论 2 点赞  0
• Digital Square Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 649    Accepted Submission(s): 297 Problem Description Given an intege...
阅读  25 评论 2 点赞  0
•   添加数字签名算法我就不说了，网上很多，这里给出两种方式，一种是数字作为资源添加，另一种是自定义文件添加（这种比较友好）。   VC++6.0文件拖放(OnDropFiles处理)两种方式 1、    对话框实现WM_DROPFILE...
阅读  179 评论 0 点赞  0
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8