-
Notifications
You must be signed in to change notification settings - Fork 0
/
210.c
58 lines (46 loc) · 1.26 KB
/
210.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
/*
Solution for the problem 210 of aceptaelreto.com
- Primo de riesgo -
Copyright (C) 2018 hnko
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
int isprime(int n){
int i;
for(i=2; i<=sqrt(n); i++){
if(n%i == 0) return 0;
}
return 1;
}
int main(int argc, char const *argv[])
{
int cases;
scanf("%d", &cases);
while(cases--){
int total=0, len, i;
char word[51];
scanf("%s", word);
len = strlen(word);
for(i=0; i<len; i++){
total += word[i];
}
if(total %2 == 0) total--;
else total -=2;
while(isprime(total) != 1){
total -= 2;
}
printf("%d\n", total);
}
return 0;
}