-
Notifications
You must be signed in to change notification settings - Fork 0
/
reverse.c
126 lines (97 loc) · 1.61 KB
/
reverse.c
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/*#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int value;
struct node* next;
}list;
void reverse(list *head)
{
list *before;
list *current=head->next;
while(current !=NULL)
{
list *next=current->next;
current->next=before;
before=current;
current=next;
}
head->next=before;
}
// Í·²å·¨
/*list* listcreate()
{ int i;
list *head;
head=(list *)malloc(sizeof(list));
head->next=NULL;
while(scanf("%d", &i)!=EOF)
{ list *temp;
temp=(list *)malloc(sizeof(list));
temp->value=i;
temp->next=head->next;
head->next=temp;
}
return head;
}
//β²å·¨
list *listcreate()
{
int i;
list *head,*r;
head=(list *)malloc(sizeof(list));
head->next=NULL;
r=head;
while(scanf("%d", &i)!=EOF)
{ list *temp;
temp=(list *)malloc(sizeof(list));
temp->value=i;
r->next=temp;
r=temp;
}
//r->next=NULL;
return head;
}
int main()
{
list *head,*start;
head=listcreate();
reverse(head);
// list *before=head;
for(start=head->next;start!=NULL;start=start->next)
{
printf("%d ", start->value);
}
printf("\n");
return 0;
}*/
#include <stdio.h>
#include <stdlib.h>
int gcd(int x,int y)
{
return (!y)?x:gcd(y,x%y);
}
int result(int n,int k)
{ int sum=k;
if(n<0)
return 0;
if(n==0)
return sum;
int s[n];
int i=0;
for(int i= 0;i<n;++i)
scanf("%d\n" , &s[i]);
for(i=0;i<n;++i)
{if(k>=s[i])
sum+=s[i];
else
sum+=gcd(s[i],sum);
}
return sum;
}
int main()
{
int n,c;
while( scanf("%d %d",&n,&c)!=EOF)
printf("%d\n",result(n,c));
return 0;
}