QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#754907#9548. The Foolucup-team296#AC ✓2ms2876kbRust13.6kb2024-11-16 16:04:442024-11-16 16:04:45

Judging History

你现在查看的是最新测评结果

  • [2024-11-16 16:04:45]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:2876kb
  • [2024-11-16 16:04:44]
  • 提交

answer

// 
pub mod solution {
//{"name":"a","group":"Manual","url":"","interactive":false,"timeLimit":2000,"tests":[{"input":"","output":""}],"testType":"single","input":{"type":"stdin","fileName":null,"pattern":null},"output":{"type":"stdout","fileName":null,"pattern":null},"languages":{"java":{"taskClass":"a"}}}

use std::collections::HashMap;

#[allow(unused)]
use crate::dbg;
use crate::algo_lib::io::input::Input;
use crate::algo_lib::io::output::Output;

fn solve(input: &mut Input, out: &mut Output, _test_case: usize) {
    let n = input.usize();
    let m = input.usize();
    let k = input.usize();
    let mut hm = HashMap::<Vec<u8>, Vec<(usize, usize)>>::new();
    for i in 0..n {
        let s = input.string();
        for j in 0..m {
            let cur = s[j * k..(j + 1) * k].to_vec();
            hm.entry(cur).or_default().push((i + 1, j + 1));
        }
    }
    for (key, val) in hm {
        if val.len() == 1 {
            out.println(val);
            return;
        }
    }
    panic!()
}

pub(crate) fn run(mut input: Input, mut output: Output) -> bool {
    solve(&mut input, &mut output, 1);
    output.flush();
    true
}

}
pub mod algo_lib {
pub mod io {
pub mod input {
use std::fmt::Debug;
use std::io::Read;
use std::marker::PhantomData;
use std::path::Path;
use std::str::FromStr;

pub struct Input {
    input: Box<dyn Read>,
    buf: Vec<u8>,
    at: usize,
    buf_read: usize,
}

macro_rules! read_integer_fun {
    ($t:ident) => {
        #[allow(unused)]
        pub fn $t(&mut self) -> $t {
            self.read_integer()
        }
    };
}

impl Input {
    const DEFAULT_BUF_SIZE: usize = 4096;

    ///
    /// Using with stdin:
    /// ```no_run
    /// use algo_lib::io::input::Input;
    /// let stdin = std::io::stdin();
    /// let input = Input::new(Box::new(stdin));
    /// ```
    ///
    /// For read files use ``new_file`` instead.
    ///
    ///
    pub fn new(input: Box<dyn Read>) -> Self {
        Self {
            input,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            buf_read: 0,
        }
    }

    pub fn new_stdin() -> Self {
        let stdin = std::io::stdin();
        Self::new(Box::new(stdin))
    }

    pub fn new_file<P: AsRef<Path>>(path: P) -> Self {
        let file = std::fs::File::open(&path)
            .unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
        Self::new(Box::new(file))
    }

    pub fn new_with_size(input: Box<dyn Read>, buf_size: usize) -> Self {
        Self {
            input,
            buf: vec![0; buf_size],
            at: 0,
            buf_read: 0,
        }
    }

    pub fn new_file_with_size<P: AsRef<Path>>(path: P, buf_size: usize) -> Self {
        let file = std::fs::File::open(&path)
            .unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
        Self::new_with_size(Box::new(file), buf_size)
    }

    pub fn get(&mut self) -> Option<u8> {
        if self.refill_buffer() {
            let res = self.buf[self.at];
            self.at += 1;
            Some(res)
        } else {
            None
        }
    }

    pub fn peek(&mut self) -> Option<u8> {
        if self.refill_buffer() {
            Some(self.buf[self.at])
        } else {
            None
        }
    }

    pub fn skip_whitespace(&mut self) {
        while let Some(b) = self.peek() {
            if !char::from(b).is_whitespace() {
                return;
            }
            self.get();
        }
    }

    pub fn next_token(&mut self) -> Option<Vec<u8>> {
        self.skip_whitespace();
        let mut res = Vec::new();
        while let Some(c) = self.get() {
            if char::from(c).is_whitespace() {
                break;
            }
            res.push(c);
        }
        if res.is_empty() {
            None
        } else {
            Some(res)
        }
    }

    //noinspection RsSelfConvention
    pub fn is_exhausted(&mut self) -> bool {
        self.peek().is_none()
    }

    pub fn has_more_elements(&mut self) -> bool {
        !self.is_exhausted()
    }

    pub fn read<T: Readable>(&mut self) -> T {
        T::read(self)
    }

    pub fn vec<T: Readable>(&mut self, size: usize) -> Vec<T> {
        let mut res = Vec::with_capacity(size);
        for _ in 0usize..size {
            res.push(self.read());
        }
        res
    }

    pub fn string_vec(&mut self, size: usize) -> Vec<Vec<u8>> {
        let mut res = Vec::with_capacity(size);
        for _ in 0usize..size {
            res.push(self.string());
        }
        res
    }

    pub fn read_line(&mut self) -> String {
        let mut res = String::new();
        while let Some(c) = self.get() {
            if c == b'\n' {
                break;
            }
            if c == b'\r' {
                if self.peek() == Some(b'\n') {
                    self.get();
                }
                break;
            }
            res.push(c.into());
        }
        res
    }

    #[allow(clippy::should_implement_trait)]
    pub fn into_iter<T: Readable>(self) -> InputIterator<T> {
        InputIterator {
            input: self,
            phantom: Default::default(),
        }
    }

    fn read_integer<T: FromStr + Debug>(&mut self) -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let res = self.read_string();
        res.parse::<T>().unwrap()
    }

    fn read_string(&mut self) -> String {
        match self.next_token() {
            None => {
                panic!("Input exhausted");
            }
            Some(res) => unsafe { String::from_utf8_unchecked(res) },
        }
    }

    pub fn string_as_string(&mut self) -> String {
        self.read_string()
    }

    pub fn string(&mut self) -> Vec<u8> {
        self.read_string().into_bytes()
    }

    fn read_char(&mut self) -> char {
        self.skip_whitespace();
        self.get().unwrap().into()
    }

    fn read_float(&mut self) -> f64 {
        self.read_string().parse().unwrap()
    }

    pub fn f64(&mut self) -> f64 {
        self.read_float()
    }

    fn refill_buffer(&mut self) -> bool {
        if self.at == self.buf_read {
            self.at = 0;
            self.buf_read = self.input.read(&mut self.buf).unwrap();
            self.buf_read != 0
        } else {
            true
        }
    }

    read_integer_fun!(i32);
    read_integer_fun!(i64);
    read_integer_fun!(i128);
    read_integer_fun!(u32);
    read_integer_fun!(u64);
    read_integer_fun!(usize);
}

pub trait Readable {
    fn read(input: &mut Input) -> Self;
}

impl Readable for String {
    fn read(input: &mut Input) -> Self {
        input.read_string()
    }
}

impl Readable for char {
    fn read(input: &mut Input) -> Self {
        input.read_char()
    }
}

impl Readable for f64 {
    fn read(input: &mut Input) -> Self {
        input.read_string().parse().unwrap()
    }
}

impl Readable for f32 {
    fn read(input: &mut Input) -> Self {
        input.read_string().parse().unwrap()
    }
}

impl<T: Readable> Readable for Vec<T> {
    fn read(input: &mut Input) -> Self {
        let size = input.read();
        input.vec(size)
    }
}

pub struct InputIterator<T: Readable> {
    input: Input,
    phantom: PhantomData<T>,
}

impl<T: Readable> Iterator for InputIterator<T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        self.input.skip_whitespace();
        self.input.peek().map(|_| self.input.read())
    }
}

macro_rules! read_integer {
    ($t:ident) => {
        impl Readable for $t {
            fn read(input: &mut Input) -> Self {
                input.read_integer()
            }
        }
    };
}

read_integer!(i8);
read_integer!(i16);
read_integer!(i32);
read_integer!(i64);
read_integer!(i128);
read_integer!(isize);
read_integer!(u8);
read_integer!(u16);
read_integer!(u32);
read_integer!(u64);
read_integer!(u128);
read_integer!(usize);
}
pub mod output {
use std::io::Write;

pub struct Output {
    output: Box<dyn Write>,
    buf: Vec<u8>,
    at: usize,
    auto_flush: bool,
}

impl Output {
    const DEFAULT_BUF_SIZE: usize = 4096;

    pub fn new(output: Box<dyn Write>) -> Self {
        Self {
            output,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            auto_flush: false,
        }
    }

    pub fn new_stdout() -> Self {
        let stdout = std::io::stdout();
        Self::new(Box::new(stdout))
    }

    pub fn new_file(path: impl AsRef<std::path::Path>) -> Self {
        let file = std::fs::File::create(path).unwrap();
        Self::new(Box::new(file))
    }

    pub fn new_with_auto_flush(output: Box<dyn Write>) -> Self {
        Self {
            output,
            buf: vec![0; Self::DEFAULT_BUF_SIZE],
            at: 0,
            auto_flush: true,
        }
    }

    pub fn flush(&mut self) {
        if self.at != 0 {
            self.output.write_all(&self.buf[..self.at]).unwrap();
            self.at = 0;
            self.output.flush().expect("Couldn't flush output");
        }
    }

    pub fn print<T: Writable>(&mut self, s: T) {
        s.write(self);
    }

    pub fn println<T: Writable>(&mut self, s: T) {
        s.write(self);
        self.put(b'\n');
    }

    pub fn put(&mut self, b: u8) {
        self.buf[self.at] = b;
        self.at += 1;
        if self.at == self.buf.len() {
            self.flush();
        }
    }

    pub fn maybe_flush(&mut self) {
        if self.auto_flush {
            self.flush();
        }
    }

    pub fn print_per_line<T: Writable>(&mut self, arg: &[T]) {
        for i in arg {
            i.write(self);
            self.put(b'\n');
        }
    }

    pub fn print_iter<T: Writable, I: Iterator<Item = T>>(&mut self, iter: I) {
        let mut first = true;
        for e in iter {
            if first {
                first = false;
            } else {
                self.put(b' ');
            }
            e.write(self);
        }
    }

    pub fn print_iter_ref<'a, T: 'a + Writable, I: Iterator<Item = &'a T>>(&mut self, iter: I) {
        let mut first = true;
        for e in iter {
            if first {
                first = false;
            } else {
                self.put(b' ');
            }
            e.write(self);
        }
    }
}

impl Write for Output {
    fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {
        let mut start = 0usize;
        let mut rem = buf.len();
        while rem > 0 {
            let len = (self.buf.len() - self.at).min(rem);
            self.buf[self.at..self.at + len].copy_from_slice(&buf[start..start + len]);
            self.at += len;
            if self.at == self.buf.len() {
                self.flush();
            }
            start += len;
            rem -= len;
        }
        if self.auto_flush {
            self.flush();
        }
        Ok(buf.len())
    }

    fn flush(&mut self) -> std::io::Result<()> {
        self.flush();
        Ok(())
    }
}

pub trait Writable {
    fn write(&self, output: &mut Output);
}

impl Writable for &str {
    fn write(&self, output: &mut Output) {
        output.write_all(self.as_bytes()).unwrap();
    }
}

impl Writable for String {
    fn write(&self, output: &mut Output) {
        output.write_all(self.as_bytes()).unwrap();
    }
}

impl Writable for char {
    fn write(&self, output: &mut Output) {
        output.put(*self as u8);
    }
}

impl<T: Writable> Writable for [T] {
    fn write(&self, output: &mut Output) {
        output.print_iter_ref(self.iter());
    }
}

impl<T: Writable> Writable for Vec<T> {
    fn write(&self, output: &mut Output) {
        self[..].write(output);
    }
}

macro_rules! write_to_string {
    ($t:ident) => {
        impl Writable for $t {
            fn write(&self, output: &mut Output) {
                self.to_string().write(output);
            }
        }
    };
}

write_to_string!(u8);
write_to_string!(u16);
write_to_string!(u32);
write_to_string!(u64);
write_to_string!(u128);
write_to_string!(usize);
write_to_string!(i8);
write_to_string!(i16);
write_to_string!(i32);
write_to_string!(i64);
write_to_string!(i128);
write_to_string!(isize);
write_to_string!(f32);
write_to_string!(f64);

impl<T: Writable, U: Writable> Writable for (T, U) {
    fn write(&self, output: &mut Output) {
        self.0.write(output);
        output.put(b' ');
        self.1.write(output);
    }
}

impl<T: Writable, U: Writable, V: Writable> Writable for (T, U, V) {
    fn write(&self, output: &mut Output) {
        self.0.write(output);
        output.put(b' ');
        self.1.write(output);
        output.put(b' ');
        self.2.write(output);
    }
}
}
}
pub mod misc {
pub mod dbg_macro {
#[macro_export]
#[allow(unused_macros)]
macro_rules! dbg {
    ($first_val:expr, $($val:expr),+ $(,)?) => {
        eprint!("[{}:{}] {} = {:?}",
                    file!(), line!(), stringify!($first_val), &$first_val);
        ($(eprint!(", {} = {:?}", stringify!($val), &$val)),+,);
        eprintln!();
    };
    ($first_val:expr) => {
        eprintln!("[{}:{}] {} = {:?}",
                    file!(), line!(), stringify!($first_val), &$first_val)
    };
}
}
}
}
fn main() {
    let input = algo_lib::io::input::Input::new_stdin();
    let mut output = algo_lib::io::output::Output::new_stdout();
    crate::solution::run(input, output);
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 2140kb

input:

3 5 3
QWQQWQQWQQWQQWQ
QWQQWQQWQQWQQWQ
QWQQWQQWQQWQQwQ

output:

3 5

result:

ok single line: '3 5'

Test #2:

score: 0
Accepted
time: 0ms
memory: 2352kb

input:

2 2 1
LL
}L

output:

2 1

result:

ok single line: '2 1'

Test #3:

score: 0
Accepted
time: 0ms
memory: 2168kb

input:

2 2 10
u+gl<d'a9Bu+gl<d'a9B
)M0wM2_Z8!u+gl<d'a9B

output:

2 1

result:

ok single line: '2 1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 2200kb

input:

2 2 10
ayspaufftvuaaavaaaaa
uaaavaaaaauaaavaaaaa

output:

1 1

result:

ok single line: '1 1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 2236kb

input:

2 2 10
uaaavaaaaauaaavaaaaa
ayspaufftvuaaavaaaaa

output:

2 1

result:

ok single line: '2 1'

Test #6:

score: 0
Accepted
time: 0ms
memory: 2128kb

input:

2 2 10
uaaavaaaaaayspaufftv
uaaavaaaaauaaavaaaaa

output:

1 2

result:

ok single line: '1 2'

Test #7:

score: 0
Accepted
time: 0ms
memory: 2148kb

input:

2 2 10
uaaavaaaaauaaavaaaaa
uaaavaaaaaayspaufftv

output:

2 2

result:

ok single line: '2 2'

Test #8:

score: 0
Accepted
time: 0ms
memory: 2124kb

input:

2 2 10
aaarlaaaghaaaaanisaa
aaaaanisaaaaaaanisaa

output:

1 1

result:

ok single line: '1 1'

Test #9:

score: 0
Accepted
time: 0ms
memory: 2352kb

input:

2 2 10
aaaaanisaaaaaaanisaa
aaarlaaaghaaaaanisaa

output:

2 1

result:

ok single line: '2 1'

Test #10:

score: 0
Accepted
time: 0ms
memory: 2276kb

input:

2 2 10
aaaaanisaaaaarlaaagh
aaaaanisaaaaaaanisaa

output:

1 2

result:

ok single line: '1 2'

Test #11:

score: 0
Accepted
time: 0ms
memory: 2128kb

input:

2 2 10
aaaaanisaaaaaaanisaa
aaaaanisaaaaarlaaagh

output:

2 2

result:

ok single line: '2 2'

Test #12:

score: 0
Accepted
time: 1ms
memory: 2704kb

input:

200 199 1
ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo
oooooooooooooooooooooooooooooooooooowooooooooooooooooooooooooooooooooooooooooooooooooooooo...

output:

2 37

result:

ok single line: '2 37'

Test #13:

score: 0
Accepted
time: 2ms
memory: 2848kb

input:

199 200 2
1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p1p...

output:

112 145

result:

ok single line: '112 145'

Test #14:

score: 0
Accepted
time: 2ms
memory: 2876kb

input:

199 199 3
"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-R"-...

output:

46 95

result:

ok single line: '46 95'

Test #15:

score: 0
Accepted
time: 2ms
memory: 2668kb

input:

200 200 4
^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^pm&^p...

output:

113 72

result:

ok single line: '113 72'

Test #16:

score: 0
Accepted
time: 2ms
memory: 2792kb

input:

200 200 5
kk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gAkk$gA...

output:

66 8

result:

ok single line: '66 8'

Test #17:

score: 0
Accepted
time: 2ms
memory: 2692kb

input:

200 200 6
5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q8w[R5Q...

output:

84 106

result:

ok single line: '84 106'

Test #18:

score: 0
Accepted
time: 2ms
memory: 2808kb

input:

200 200 7
N3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&e|5lN3&...

output:

80 103

result:

ok single line: '80 103'

Test #19:

score: 0
Accepted
time: 0ms
memory: 2740kb

input:

200 200 8
82`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482`|)e)482...

output:

5 68

result:

ok single line: '5 68'

Test #20:

score: 0
Accepted
time: 2ms
memory: 2604kb

input:

200 200 9
c[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[RzcCsKBc[...

output:

8 169

result:

ok single line: '8 169'

Test #21:

score: 0
Accepted
time: 2ms
memory: 2704kb

input:

200 200 10
,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@^,O.JYB0m@...

output:

58 91

result:

ok single line: '58 91'

Extra Test:

score: 0
Extra Test Passed