QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#689788#9531. Weird CeilingNewbackRE 0ms3648kbC++98746b2024-10-30 18:38:452024-10-30 18:38:51

Judging History

你现在查看的是最新测评结果

  • [2024-10-30 18:38:51]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3648kb
  • [2024-10-30 18:38:45]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int a[110001];
int main(){
	int T;
	cin >> T;
	while(T--){
		int n;
		cin >> n;
		int t = 1;
		long long sum =0;
		for(int i=1;i<sqrt(n);i++){
			if(n%i==0){
				a[t++] = i;
				a[t++] = n/i;
			}
		}
		sort(a+1,a+t);
		/*for(int i=1;i<t;i++){
			cout << a[i] <<" ";
		}*/
		//cout << endl;
		sum = n/a[1];
		for(int i=2;i<t;i++){
			sum+=(a[i]-a[i-1]-1)*(n/a[i-1])+n/a[i];
			//cout << sum << " ";
		}
		//sum+=n/a[t-1];
		cout << sum << endl;
	}
	return 0;
}
/*#include<bits/stdc++.h>
using namespace std;
int w[110010],l[110010],r[110010];
int main(){
	long long  n,m,t=0;
	long long sum = 0;
	cin >> n >> m;
	pair<long,<long,long>>s[10010]; 
	return 0;
}*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3648kb

input:

3
5
451
114514

output:

21
10251
7075858

result:

ok 3 lines

Test #2:

score: -100
Runtime Error

input:

1000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101...

output:


result: