Channel address:
Categories:
Technologies
Language: English
Subscribers:
141.49K
Description from channel
Codingsolution_it
#coding
#codingsolution
#codingsolutionhelp
#codingsolutionit
#coding_solution_help
#codingsolutionhelpit
Codingsolution
#Coding_solution
#Coding_solution_it
#Coding solution help
Codingsolutionhelp
#Coding solution it
#codingsol
coding
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
0
4 stars
2
3 stars
0
2 stars
1
1 stars
0
The latest Messages 46
2021-08-24 08:46:03
#include
int main()
{
int a[6],i=0,s=0,x,n=3;
for(i=0;i {
scanf("%d",&a[i]);
}
for(i=0;i {
s+=a[i];
if(s==a[i+1])
{
s=s+a[i];
x=a[i+1];
}
printf("%d",x);
}
}
Telegram: @coding_solution_help
2.0K views05:46
2021-08-23 16:00:41
WIPRO NLTH EXAM DISCUSSION GROUP
@wipro_amazon_elevate_discussion
658 views13:00
2021-08-23 15:45:16
COGNIZANT EXAM DISCUSSION GROUP
@cognizant_ibm_bitwise_discussion
879 views12:45
2021-08-23 15:34:36
TCS NQT EXAM DISCUSSION GROUP
@tcsnqt_apisero_mountb_discussion
1.1K viewsedited 12:34
2021-08-23 14:44:26
CODING SOLUTION pinned «
11:44
2021-08-23 14:44:22
1.4K views11:44
2021-08-23 14:39:53
Telegram: @coding_solution_help
1.7K views11:39
2021-08-23 14:39:23
Telegram: @coding_solution_help
1.6K views11:39
2021-08-23 14:38:38
#include
int main(int argc, char *argv[])
{
printf("Enter M:");
int m = 0;
scanf("%d", &m);
int arr[100] = {0};
printf("The array is:\n");
switch(m) {
case 2:
printf("No solution\n");
return 0;
case 1:
case 3:
case 5:
case 7:
printf("%d\n", m);
return 0;
}
int sum = 0;
int count = 0;
for (int i = 1; (sum + i) < m; i+= 2) {
arr[count++] = i;
sum += i;
}
int start = 0;
int r = m - sum;
if (r % 2 == 0) {
arr[count - 1] += r;
} else if (r > arr[count - 1]) {
arr[count++] = r;
} else {
start = 1;
arr[count - 1] += r + 1;
}
for (int i = start; i < count; i++) {
printf("%d\n", arr[i]);
}
return 0;
}
Telegram: @coding_solution_help
1.7K views11:38
2021-08-23 09:38:35
Telegram: @coding_solution_help
3.0K views06:38
C
