Rezultati

Up. imeNalogaJezikRezultatČas oddaje
AlenVerk-2018 Podnapisi C# 0/100Napačen odgovor (WA) 10. maj '18 @ 19:25

Test Točke Porabljen spomin Porabljen čas Status
#1 0/7 22,559 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:10:30,285 --> 00:10:33,049
?RNO OGLEDALO
<<<EOF>>>
Pravilen izhod:
​1
01:10:30,285 --> 01:10:33,049
?RNO OGLEDALO

2
01:11:11,245 --> 01:11:12,849
#2 0/7 18,750 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:59:26,343 --> 00:59:27,945
All right, everybody.
<<<EOF>>>
Pravilen izhod:
​1
20:59:26,343 --> 20:59:27,945
All right, everybody.

2
20:59:27,978 --> 20:59:29,512
#3 0/7 20,605 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:00:04,880 --> 00:00:06,630
In 2022, mankind finally
<<<EOF>>>
Pravilen izhod:
​1
00:00:04,880 --> 00:00:06,630
In 2022, mankind finally

2
00:00:09,600 --> 00:00:11,590
built a full virtual environment

3
#4 0/7 20,609 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:24:16,872 --> 00:24:18,622
In 2022, mankind finally
<<<EOF>>>
Pravilen izhod:
​1
01:24:16,872 --> 01:24:18,622
In 2022, mankind finally
In 2022, mankind finally
In 2022, mankind finally
In 2022, mankind finally
#5 0/7 20,488 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:59:28,759 --> 00:59:30,509
In 2022, mankind finally
<<<EOF>>>
Pravilen izhod:
​1
23:59:28,759 --> 23:59:30,509
In 2022, mankind finally

2
23:59:33,479 --> 23:59:35,469
#6 7/7 18,750 MiB 0,000 s OK
#7 7/7 20,566 MiB 0,000 s OK
#8 0/7 20,703 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:11:15,100 --> 00:11:16,850
2
<<<EOF>>>
Pravilen izhod:
​1
00:11:15,100 --> 00:11:16,850
2
SHIFT: 00:11:10,220
00:00:04,880 --> 00:00:06,630
00:00:04,880 --> 00:00:06,630

2
#9 0/7 20,602 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:59:28,759 --> 00:59:30,509
SHIFT: 13:59:23,879
<<<EOF>>>
Pravilen izhod:
​1
13:59:28,759 --> 13:59:30,509
SHIFT: 13:59:23,879
In 2022, mankind finally
? comment?
// nooo
#10 0/7 18,609 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:00:14,601 --> 00:00:17,801
Pulp: 1. Mehka, vla?na,
<<<EOF>>>
Pravilen izhod:
​1
00:00:14,601 --> 00:00:17,801
Pulp: 1. Mehka, vla?na,
brezobli?na gmota snovi.

2
00:00:18,301 --> 00:00:21,201
2. ?asopis ali knjiga
#11 0/7 20,633 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:00:06,180 --> 00:00:07,930
In 2022, mankind finally
<<<EOF>>>
Pravilen izhod:
​1
00:00:06,180 --> 00:00:07,930
In 2022, mankind finally

2
00:00:10,900 --> 00:00:12,890
built a full virtual environment

3
#12 0/7 20,648 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:10:00,681 --> 00:10:02,081
<i>Previously on</i>
<<<EOF>>>
Pravilen izhod:
​1
00:10:00,681 --> 00:10:02,081
<i>Previously on</i>
The Big Bang Theory...

2
00:10:02,683 --> 00:10:04,713
So, Leonard, tell
#13 0/8 20,602 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:13:13,073 --> 00:13:17,073
PUENTE ANTIGUO,
<<<EOF>>>
Pravilen izhod:
​1
03:13:13,073 --> 03:13:17,073
PUENTE ANTIGUO,
NOVA MEHIKA

2
#14 0/8 18,789 MiB 0,000 s Napačen odgovor
Tvoj izhod:
​1
00:10:25,000 --> 00:10:30,130
In 2022, mankind finally
<<<EOF>>>
Pravilen izhod:
​1
01:10:25,000 --> 01:10:30,130
In 2022, mankind finally

2
01:11:01,000 --> 01:11:05,090

Ocenjevani program (Program.cs):
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Podnapisi
{
    class Program
    {
        class Cas
        {
            int hh;
            int mm;
            int ss;
            int uu;



            public Cas(string shift)
            {
                hh = int.Parse(shift.Substring(0, 2));
                mm = int.Parse(shift.Substring(3, 2));
                ss = int.Parse(shift.Substring(6, 2));
                uu = int.Parse(shift.Substring(9, 3));
            }

            public void Povecaj(Cas c)
            {
                if (uu + c.uu >= 1000)
                {
                    uu = (uu + c.uu) - 1000;
                    ss++;
                }
                else
                {
                    uu += c.uu;
                }
                if (ss + c.ss >= 60)
                {
                    ss = (ss + c.ss) - 60;
                    mm++;
                }
                else
                {
                    ss += c.ss;
                }
                if (mm + c.mm >= 60)
                {
                    mm = (mm + c.mm) - 60;
                    hh++;
                }
                else
                {
                    mm += c.mm;
                }
                hh += hh;

            }

            public static string DvaCasa(Cas cas1, Cas cas2)
            {
                string s = cas1.hh.ToString("00");
                s += ":";
                s += cas1.mm.ToString("00");
                s += ":";
                s += cas1.ss.ToString("00");
                s += ",";
                s += cas1.uu.ToString("000");
                s += " --> ";
                s += cas2.hh.ToString("00");
                s += ":";
                s += cas2.mm.ToString("00");
                s += ":";
                s += cas2.ss.ToString("00");
                s += ",";
                s += cas2.uu.ToString("000");
                return s;
            }
        }
        static void Main(string[] args)
        {
            string shift = Console.ReadLine();

            List<string> izhod = new List<string>();
  
            Cas cas = new Cas(shift.Substring(7, 12));
            bool brea = false;
            int stevec = 0;
            string text = "";
            do
            {
                stevec = int.Parse(Console.ReadLine());
                izhod.Add(stevec.ToString());
                string casString = Console.ReadLine();

                Cas cas1 = new Cas(casString.Substring(0, 12));
                Cas cas2 = new Cas(casString.Substring(17, 12));
                cas1.Povecaj(cas);
                cas2.Povecaj(cas);
                izhod.Add(Cas.DvaCasa(cas1, cas2));

                string vrsticaa = "";
                do
                {
                    int i= Console.Read();
                    if(i=='\r')
                    {
                        vrsticaa += Convert.ToChar(i);
                        i = Console.Read();
                        vrsticaa += Convert.ToChar(i);
                        izhod.Add(vrsticaa);
                        vrsticaa = "";
                        i = Console.Read();
                        if(i=='\r')
                        {
                            vrsticaa += i;
                            i = Console.Read();
                            vrsticaa += i;
                            izhod.Add(vrsticaa);
                            vrsticaa = "";
                            break;
                        }
                    }
                    else if(i=='\n')
                    {
                        izhod.Add(vrsticaa);
                        brea = true;
                        break;
                    }
                    else
                    {
                        vrsticaa += Convert.ToChar(i);
                    }

                    /*if (text.Length!=0&&text.Substring(text.Length -1, 1)=="\n" && text.Substring(text.Length - 2, 1) != "\r")
                    {
                        brea = true;
                        izhod.Add(text.Remove(text.Length - 2, 2));
                    }
                    izhod.Add(text);*/
                } while (true );
            } while (brea!=true);
            foreach (string s in izhod)
            {
                Console.WriteLine(s);
            }
            //Console.ReadKey();
        }
    }
}