File tree Expand file tree Collapse file tree 5 files changed +68
-0
lines changed Expand file tree Collapse file tree 5 files changed +68
-0
lines changed Original file line number Diff line number Diff line change
1
+ int sumOfSquares (vector<int >& nums) {
2
+ int n = nums.size ();
3
+ int squareSum = 0 ;
4
+ int lim = sqrt (n);
5
+
6
+ for (int i = 1 ; i < lim; ++i)
7
+ {
8
+ if (n%i == 0 )
9
+ {
10
+ squareSum += nums[i-1 ]*nums[i-1 ] + nums[n/i-1 ]*nums[n/i-1 ];
11
+ }
12
+ }
13
+
14
+ int tmp = n/lim;
15
+ if (n%lim == 0 )
16
+ {
17
+ squareSum += nums[lim-1 ]*nums[lim-1 ];
18
+ if (tmp != lim)
19
+ squareSum += nums[tmp-1 ]*nums[tmp-1 ];
20
+ }
21
+
22
+ return squareSum;
23
+ }
Original file line number Diff line number Diff line change
1
+ int sumOfTheDigitsOfHarshadNumber (int x) {
2
+ int tmp = x;
3
+ int sum = 0 ;
4
+ while (tmp > 0 )
5
+ {
6
+ sum += tmp%10 ;
7
+ tmp /= 10 ;
8
+ }
9
+
10
+ return x%sum == 0 ? sum : -1 ;
11
+ }
Original file line number Diff line number Diff line change
1
+ int addedInteger (vector<int >& nums1, vector<int >& nums2) {
2
+ int sum2 = accumulate (nums2.begin (), nums2.end (), 0 );
3
+ int sum1 = accumulate (nums1.begin (), nums1.end (), 0 );
4
+ int n = nums1.size ();
5
+ return (sum2-sum1)/n;
6
+ }
Original file line number Diff line number Diff line change
1
+ int numberOfPairs (vector<int >& nums1, vector<int >& nums2, int k) {
2
+ int ct = 0 ;
3
+ for (int a: nums1)
4
+ {
5
+ for (int b: nums2)
6
+ {
7
+ if (a%(b*k) == 0 )
8
+ ++ct;
9
+ }
10
+ }
11
+
12
+ return ct;
13
+ }
Original file line number Diff line number Diff line change
1
+ double minimumAverage (vector<int >& nums) {
2
+ sort (nums.begin (), nums.end ());
3
+ int n = nums.size ();
4
+ int k = n/2 ;
5
+
6
+ double minaverage = nums.back ();
7
+ for (int i = 0 ; i < k; ++i)
8
+ {
9
+ double tmp = (nums[i]+nums[n-1 -i])/2.0 ;
10
+ if (tmp < minaverage)
11
+ minaverage = tmp;
12
+ }
13
+
14
+ return minaverage;
15
+ }
You can’t perform that action at this time.
0 commit comments