გაგზავნის თარიღი: 20.01.2023 02:32:07

ამოცანა: გრძელი სიტყვა

მომხმარებელი: Natalli

ვერდიქტი: ნაწილობრივი ამოხსნა

შეფასება: 60.0 ქულა

#include <iostream>
#include <algorithm>
using namespace std;

int n,k;
string word;
pair <int, string> words[100];
main () {
    cin>>n;

    for (int i=0; i<n; i++) {
        cin>>words[i].second;
        words[i].first=words[i].second.size();
    }

    sort (words,words+n);

      for (int i=0; i<n; i++) {
        if (words[i].first==words[i+1].first) k++;
      }

      if (k==n-1) cout<<words[0].second;
     else cout<<words[n-1].second;
}

ტესტები

3
find
longest
word

longest

longest

YES

3
find
best
word

best

best

YES

1
abracadabra

abracadabra

abracadabra

YES

8
small
text
generator
is
a
handy
online
tool

generator

generator

YES

7
possession
her
thoroughly
remarkably
terminated
man
continuing

continuing

thoroughly

NO

10
too
insisted
ignorant
procured
remember
are
believed
yet
say
finished

believed

remember

NO

8
appear
common
so
wicket

to
sudden
worthy
on

appear

worthy

NO

9
aaaaaaaaaaaaaaaaaaaa
bbbbbbbb
cccc
ddddddddddddddddddddddddddddd
eeeeeeeeeeeeeeeeee
ffffffffffffffffffffff
ggggggggggggggggggggggggg
dddddddddddddddddddbbbbbbbbbb
hhhhhhhhhhhhhhhhhhhhhhhh

dddddddddddddddddddbbbbbbbbbb

ddddddddddddddddddddddddddddd

NO

11
jdnwnccnwdc
sdsdjcnisdjncisjnc
djvifjvnidfvnidididn
sdijncsidjncsidjcn
sjdnisjdncijsnd
sjnsodncosd
euryueifeiu
jdnidunidnidnc
kkocskmdcomcosos
nvoenvoenvoenvoeofvneofvnoefvnonvoen
dfnvidfjnvidfjnv

nvoenvoenvoenvoeofvneofvnoefvnonvoen

nvoenvoenvoenvoeofvneofvnoefvnonvoen

YES

26
q
w
e
r
t
y
u
i
o
p
a
s
d
f
g
h
j
k
l
z
x
c
v
b
n
m

a

a

YES