solved a1p3 and submitted assignment
This commit is contained in:
parent
32b04527ab
commit
2b1b79a3c7
@ -18,12 +18,15 @@ int main() {
|
||||
int total = 1;
|
||||
int r = (int) std::floor(std::sqrt(n));
|
||||
|
||||
std::cout << std::endl;
|
||||
|
||||
for (int n2 = 2; n2 < r + 1; n2++) {
|
||||
if (n % n2 == 0) {
|
||||
int other = n / n2;
|
||||
|
||||
if (other != n)
|
||||
if (other != n2) {
|
||||
total += other;
|
||||
}
|
||||
|
||||
total += n2;
|
||||
}
|
||||
BIN
DIVSUM/a.out
BIN
DIVSUM/a.out
Binary file not shown.
@ -1,23 +0,0 @@
|
||||
def main():
|
||||
lines: list[str] = []
|
||||
t = int(input())
|
||||
while (t != 0):
|
||||
lines.append(input())
|
||||
t -= 1
|
||||
|
||||
print()
|
||||
for line in lines:
|
||||
n = int(line)
|
||||
|
||||
if n == 1:
|
||||
print(0)
|
||||
continue
|
||||
|
||||
total = 1
|
||||
for n2 in reversed(range(2, n)):
|
||||
total += n2 if n % n2 == 0 else 0
|
||||
|
||||
print(total)
|
||||
|
||||
if __name__ == "__main__":
|
||||
main()
|
||||
@ -1,27 +0,0 @@
|
||||
|
||||
d = {1 : 0}
|
||||
|
||||
|
||||
def main():
|
||||
lines: list[str] = []
|
||||
t = int(input())
|
||||
while (t != 0):
|
||||
lines.append(input())
|
||||
t -= 1
|
||||
|
||||
print()
|
||||
for line in lines:
|
||||
n = int(line)
|
||||
|
||||
if n == 1:
|
||||
print(0)
|
||||
continue
|
||||
|
||||
total = 1
|
||||
for n2 in reversed(range(2, n)):
|
||||
total += n2 if n % n2 == 0 else 0
|
||||
|
||||
print(total)
|
||||
|
||||
if __name__ == "__main__":
|
||||
main()
|
||||
@ -1,36 +0,0 @@
|
||||
#include <cstdio>
|
||||
#include <iostream>
|
||||
#include <stdlib.h>
|
||||
#include <cmath>
|
||||
|
||||
|
||||
int main() {
|
||||
int t = 200000;
|
||||
// std::scanf("%d", &t);
|
||||
|
||||
while (t--) {
|
||||
int n;
|
||||
// std::scanf("%d", &n);
|
||||
|
||||
n = std::rand() % 500000 + 1;
|
||||
|
||||
if (n == 1) {
|
||||
std::cout << "0" << std::endl;
|
||||
continue;
|
||||
}
|
||||
|
||||
int total = 1;
|
||||
int r = (int) std::floor(std::sqrt(n));
|
||||
|
||||
for (int n2 = 2; n2 < r + 1; n2++) {
|
||||
if (n % n2 == 0)
|
||||
total += n2 + (n/n2);
|
||||
// std::cout << n2 << std::endl;
|
||||
}
|
||||
|
||||
std::cout << total << std::endl;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -1,5 +0,0 @@
|
||||
4
|
||||
your
|
||||
progress
|
||||
is
|
||||
noticeable
|
||||
Loading…
x
Reference in New Issue
Block a user