-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path043-noip-08-p1-silly-monkey.cpp
More file actions
66 lines (64 loc) · 1.35 KB
/
Copy path043-noip-08-p1-silly-monkey.cpp
File metadata and controls
66 lines (64 loc) · 1.35 KB
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
/*
* NOIP '08 P1 - Silly Monkey [noip08p1]
* Problem: https://dmoj.ca/problem/noip08p1
* Verdict: ACCEPTED (5.0 pts) Solved: 2023-01-09
* Language: C++20
* Runtime: 0.033558793 s Memory: 3428.0 KB
* Source: https://dmoj.ca/src/5200982
*/
/*
ID: BidoTeima
LANG: C++11
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void moo(string filename);
void ACPLS(string str = "")
{
if(str=="NOF")return;
if(str.size())
moo(str);
else{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
}
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc \
int tttttt/*,subtask*/; \
cin >> tttttt/* >> subtask*/; \
while (tttttt--)/*end
*/
int main()
{
ACPLS();
string s;
cin>>s;
int freq[26]={0};
for(char ch : s)freq[ch - 'a']++;
int mn = 1e9, mx = 0;
for(char ch : s){
mn = min(mn, freq[ch-'a']);
mx = max(mx, freq[ch-'a']);
}
int d = (mx)-(mn);
bool ok = d>1;
for(int i = 2; i < d; i++){
if(d % i == 0)ok = 0;
}
if(ok){
cout<<"Lucky Word\n"<<d<<'\n';
}else{
cout<<"No Answer\n0\n";
}
}