Common Board @ Timus Online Judge

stilkobg WA on test #12 can someone help me ? [5] // Problem 1263. Elections 9 Apr 2008 22:40

#include<iostream>
#include<iomanip>
#include<math.h>
using namespace std;
double a[10001];
int main()
{
    int l=0,i,n,k;
    double x,m;
    cin>>n>>m;
    for(i=0;i<m;i++)
    {
    cin>>k;
    a[k]++;
    }
    for(i=1;i<=n;i++)
    {
    x=a[i]/m;
    x*=100;
    if(ceil(x)==floor(x))cout<<x<<".00%"<<endl;
    else
    cout<<setprecision(4)<<x<<'%'<<endl;
    }
    return 0;
}

Edited by author 09.04.2008 22:50

Moein Fatehi Re: WA on test #12 can someone help me ? [1] // Problem 1263. Elections 13 Oct 2011 16:36

I have this Problem too.
plz help, my program is been written in JAVA.

Edited by author 13.10.2011 16:36

SButterfly Re: WA on test #12 can someone help me ? // Problem 1263. Elections 25 Oct 2012 12:46

So, I have this problem too. What is the rigth solution?

---
I found the answer, use Console.WriteLine("{0:f2}%", t);

Edited by author 25.10.2012 19:37

Edited by author 25.10.2012 19:37

NiF Re: WA on test #12 can someone help me ? // Problem 1263. Elections 26 Oct 2012 18:36

Try these inputs:
2 11
1
2
2
2
2
2
2
2
2
2
2

nikusha_barbaqa[FreeUni] Re: WA on test #12 can someone help me ? [1] // Problem 1263. Elections 1 Mar 2013 00:55

I change this >> first multiply 100 and then divide m . and it works.

Rodion Re: WA on test #12 can someone help me ? // Problem 1263. Elections 24 Jul 2021 22:27

didnt help me

Zhabka Test for WA#17 // Problem 1964. Chinese Dialects 23 Jul 2021 13:56

7 4
3 7 5 3

Amon If you have WA #3 // Problem 1008. Image Encoding 20 Jul 2021 15:23

Check if the order RTLB is respected and pay attention to the fact that the matrix in the problem is inversed in comparison to the one that you build i.e. the bottom is curr_row - 1 and top is curr_row + 1.

Simen wa 3 [2] // Problem 2142. Magic 30 Nov 2019 23:25

whats problem on test 3??
что за проблема на 3 тесте??

__Andrewy__ Re: wa 3 // Problem 2142. Magic 1 Dec 2019 22:45

Yep
Why my code get WA3?
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
using namespace std;

#define ll long long

const ll nmax = 100005;
const ll inf = 1234567890123;

ll A, B, C;
ll X, Y, Z;

int main()
{
   cin>>A>>B>>C;
   cin>>X>>Y>>Z;

    if(Z > C)
        cout<<"There are no miracles in life";
    else
    {
        ll ess = (ll)0;
        if(X > A) ess += X - A;
        if(Y > B) ess += Y - B;
        if(C - Z >= ess)
            cout<<"It is a kind of magic";
        else
            cout<<"There are no miracles in life";
    }

   return 0;
}

or more simple

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
using namespace std;

#define ll long long

const ll nmax = 100005;
const ll inf = 1234567890123;

ll A, B, C;
ll X, Y, Z;

int main()
{
   cin>>A>>B>>C;
   cin>>X>>Y>>Z;

   if(X > A)
        C -= (X - A);
   if(Y > B)
        C -= (Y - B);
   if(Z <= C)
        cout<<"It is a kind of magic";
   else
        cout<<"There are no miracles in life";

   return 0;
}

Lemmiwinks Re: wa 3 // Problem 2142. Magic 20 Jul 2021 13:56

try
3 3 2
5 0 3
answer
YES

Lcyanstars If you got WA on test 3 // Problem 1570. Eating High 20 Jul 2021 11:04

Notice that "Filling value” is THREE decimal places.

guilty spark MLE on Test case 2? // Problem 1096. Get the Right Route Plate! 18 Jul 2021 22:37

Why always getting mle on #2

Vizir1989 WA #7 [1] // Problem 1413. Mars Jumper 20 Apr 2012 13:15

Hi.
Can you give some samples to help fixing WA on test #7?

bbartolini22 Re: WA #7 // Problem 1413. Mars Jumper 18 Jul 2021 21:36

Try using constant with higher precision.
Edit: I know that author may not need this hint anymore, but I replied in case anyone was in the same trouble.

Edited by author 18.07.2021 21:38

Edited by author 18.07.2021 21:38

raulm WA #3 [3] // Problem 1303. Minimal Coverage 31 Aug 2011 00:26

What can you tell me about this test? I'm having WA all the time

Clockware Re: WA #3 [2] // Problem 1303. Minimal Coverage 25 Feb 2013 21:45

Same question.
I tried all tests of this problem's forum and still got WA3.

Edited by author 25.02.2013 21:48

shtek_KH-13 Re: WA #3 // Problem 1303. Minimal Coverage 13 Mar 2013 09:50

just try
5
-5 0
0 1
1 2
2 3
4 5
3 4
10 49000
0 0

farmer.26 Re: WA #3 // Problem 1303. Minimal Coverage 18 Jul 2021 20:59

So do I :((

ARE Please help me, what is wrong? [1] // Problem 1001. Reverse Root 10 May 2020 12:13

a = list(map(int,input().split()))
n = len(a)
for i in range(n-1,-1,-1):
print("%.4f" % pow(a[i],1/2))

bilibilitdasc Re: Please help me, what is wrong? // Problem 1001. Reverse Root 18 Jul 2021 19:02

pow(a,b) in Python means the power of integer a and integer b (a^b)
use a**b in Python instead.

Anatoliy V Tomilov huh, cpu is Broadwell, not sandy/ivy [1] 17 Jul 2021 13:22

#include <iostream>
#include <vector>

#include <cassert>

#define cpuid(func,eax,ebx,ecx,edx)\
    __asm__ __volatile__ ("cpuid":\
    "=a" (eax),"=b" (ebx),"=c" (ecx),"=d" (edx):\
    "a" (func));

int main()
{
    {
        int a,b,c,d;
        cpuid(1,a,b,c,d);
        int extended_model = (a & 0xF0000) >> 12;
        assert(extended_model == 4 << 4);
        int family = (a & 0x0F00)>>8;
        assert(family == 6);
        int model = (a & 0xF0)>>4;
        assert(model == 15);
        int stepping = a & 0xF;
        assert(stepping == 1);
        if (__builtin_cpu_is("broadwell")) {
            std::vector<char>((1ULL << 20));
        }
    }

    int a, b;
    std::cin >> a >> b;
    std::cout << a + b << std::endl;
}

Vladimir Yakovlev (USU) Re: huh, cpu is Broadwell, not sandy/ivy 18 Jul 2021 16:04

You're right. The CPU on the judging machine is Intel Xeon E5-2680 v4 (Broadwell). We updated the site news. Thanks for catching this.

betty73 Give me test 17 please // Problem 2148. Insane Shot 18 Jul 2021 09:36

Give me test 17 please

Zergatul Test 14 [1] // Problem 1438. Time Limit Exceeded 15 Jul 2021 16:52

goto if
if: print 123

Lish Re: Test 14 // Problem 1438. Time Limit Exceeded 17 Jul 2021 18:22

not bad

Edited by author 17.07.2021 18:23

Anton i solve this for O(n * log n) // Problem 1297. Palindrome 17 Jul 2021 16:43

Use hashs + bin find :)

Shavkat Я написал эту программу на языке программирования C #. Программный код написан четко. Я также проверил в Visual Studio. Но он сказал, что это неправильно на этом сайте. Пожалуйста, проверьте! // Problem 2056. Scholarship 16 Jul 2021 18:53

using System;
namespace a
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = Convert.ToInt32(Console.ReadLine());
            double[] A = new double[n];
            double S = 0;
            for (int i = 0; i < n; i++)
            {
               A[i]=Convert.ToInt64(Console.ReadLine());
            }
            for (int i = 0; i < n; i++)
            {
              S = S + A[i];
            }
            double B = S / n;
            for (int i = 0; i < n; i++)
            {
                if (A[i] == 3)
                {
                    Console.WriteLine("None");
                    goto finish;
                }
            }
            if (B >= 4.5)
            {
                Console.WriteLine("High");
                goto finish;
            }
            for (int j = 0; j < n; j++)
            {
                if (A[j] == 5)
                {
                    Console.WriteLine("Named");
                    goto finish;
                }
            }
            Console.WriteLine("Common");
        finish: ;
        }
    }
}

guilty spark Simple DP // Problem 1091. Tmutarakan Exams 16 Jul 2021 18:47

DP[i][j][k] = count of sets of length i ending at number j with total gcd of k
initialize with dp[1][n][n] = 1 for every n >= 2 && n <= s
ans is summation of all dp[K][num][g] where g > 1 and num between 2 and s

Edited by author 16.07.2021 18:48

Edited by author 16.07.2021 18:48

Edited by author 16.07.2021 18:48

Julik WA Test 5 [3] // Problem 1604. Country of Fools 3 Mar 2008 00:55

Show please 5 test!

arrammis Re: WA Test 5 [1] // Problem 1604. Country of Fools 20 Mar 2015 23:34

I have on this WA too (

vtalgo21_gsavon Re: WA Test 5 // Problem 1604. Country of Fools 12 Mar 2021 16:55

Mb you forgot to sort your array or vector before start printing anything

homyak) Re: WA Test 5 // Problem 1604. Country of Fools 16 Jul 2021 17:54

4
2 2 2 3

faysalf Python 3 solution // Problem 1083. Factorials!!! 16 Jul 2021 09:03

#I don't know why i start from lk+7. If anyone knew about that, please notify me.

import sys

n,k = sys.stdin.readline().split()
n = int(n)
lk = len(k)
res = 1

for i in range(lk+7,-1,-1):
t = n - i*lk
if t>0: res *= t

sys.stdout.write("%d\n"%res)

Edited by author 16.07.2021 09:03

107th If you have WA! [15] // Problem 1031. Railway Tickets 27 May 2007 16:20

If you have WA on test #3 or on test #1 or on test #2 you must use DP! Else if you have WA on test #4 you must use unsigned int or int 64 or long. If you have WA on test #8 you must change start and finish points ( 6-2 and 2-6 is equal ) !^_^!

Alexandra Re: If you have WA! // Problem 1031. Railway Tickets 25 Dec 2007 05:01

Thanks a lot for WA 8.I got AC.^^

Phoenix Re: If you have WA! // Problem 1031. Railway Tickets 11 Feb 2008 12:07

Thank you.
I got WA at #8.And I have ACed now;

Ginforward Re: If you have WA! [1] // Problem 1031. Railway Tickets 13 Apr 2008 20:10

Thank you so much!

lotus4h Re: If you have WA! // Problem 1031. Railway Tickets 17 Apr 2008 21:59

What if I WA on #11?

wrbuaa2005 Re: If you have WA! // Problem 1031. Railway Tickets 3 Sep 2008 12:26

Thank you from reminding!

remdy21 Re: If you have WA! // Problem 1031. Railway Tickets 7 Aug 2009 11:55

Thank you for your suggestion

MAK Re: If you have WA! [2] // Problem 1031. Railway Tickets 6 Sep 2009 01:10

Thank you very very much!

† DaftCoder † [Yaroslavl SU] Re: If you have WA! [1] // Problem 1031. Railway Tickets 23 Mar 2010 20:00

thx a lot!!

monyura[ONU 1 2/3] Re: If you have WA! // Problem 1031. Railway Tickets 3 Dec 2010 00:05

If you have WA8 and use Binary Search - check that it work properly, i.e. return far station instead of nearest

Edited by author 03.12.2010 00:05

crush Re: If you have WA! // Problem 1031. Railway Tickets 27 Nov 2011 18:08

thank u very much for the 2nd suggestion.

ksana42 Re: If you have WA! // Problem 1031. Railway Tickets 29 Sep 2012 08:29

first i got wa4 and then wa8..your message help a lot! thank you.

Wlad Re: If you have WA! // Problem 1031. Railway Tickets 13 Dec 2017 14:40

Thanks a lot for WA 8.

iOli Re: If you have WA! // Problem 1031. Railway Tickets 9 Feb 2018 09:49

Thank you very much

Myrcella Re: If you have WA! // Problem 1031. Railway Tickets 3 Sep 2018 19:08

Thanks a lot for WA #8! It's really tricky.

A_H_C Re: If you have WA! // Problem 1031. Railway Tickets 15 Jul 2021 17:11

first i got wa14 and forgot to use long long.your message help a lot! thank you.

Savchuk Nickolay I hate the time limit [1] // Problem 2002. Test Task 12 Jun 2021 16:22

l1=[]
l2=[]
l3=[]
for i in range(0,1000):
    l3.append(False)
def funct(a):
    b=a.split()
    if b[0]=='register':
        if b[1] not in l1:
            l1.append(b[1])
            l2.append(b[2])
            print("success: new user added")
        else:
            print("fail: user already exists")
    elif b[0]=="login":
        if b[1] not in l1:
            print("fail: no such user")
        else:
            k=l1.index(b[1])
            if l3[k]:
                print("fail: already logged in")
            else:
                if l2[k]==b[2]:
                    l3[k]=True
                    print("success: user logged in")
                else:
                    print("fail: incorrect password")
    elif b[0]=="logout":
        k=l1.index(b[1])
        if l3[k]:
            l3[k]=False
            print("success: user logged out")
        else:
            print("fail: already logged out")
f=int(input())
for m in range(0,f):
    n=input()
    funct(n)

f**king time limit!!!

qumusabel Re: I hate the time limit // Problem 2002. Test Task 14 Jul 2021 17:34

List is O(n) lookup, while dict is O(log n), so use that

andreyDagger O(n) DP solution // Problem 1222. Chernobyl’ Eagles 14 Jul 2021 14:43

using DP you can achieve O(n)

Style: flat | tree | nested
Thread Order: bubble | fixed