10789 - Prime Frequency

All about problems in Volume 107. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

User avatar
Martin Macko
A great helper
Posts: 481
Joined: Sun Jun 19, 2005 1:18 am
Location: European Union (Slovak Republic)

Re: Please Help

Post by Martin Macko » Tue Aug 16, 2005 9:14 am

I LIKE GN wrote:hello all.
i get WA...
here is my code
...
Hey! Are you really sure the code you posted here is for problem #10789? It doesn't look so...

I LIKE GN
Learning poster
Posts: 57
Joined: Fri Oct 10, 2003 11:01 pm
Location: in front of PC
Contact:

Re: Please Help

Post by I LIKE GN » Sat Aug 20, 2005 12:15 pm

Martin Macko wrote:
I LIKE GN wrote:hello all.
i get WA...
here is my code
...
Hey! Are you really sure the code you posted here is for problem #10789? It doesn't look so...
yes u r right
i did that mistake
so i remove the wrong code
but thanks for ur reply...
There are two tragedies in life one is to lose your hearts' desire and another is to gain it --- GBS.

User avatar
newton
Experienced poster
Posts: 162
Joined: Thu Jul 13, 2006 7:07 am
Location: Campus Area. Dhaka.Bangladesh
Contact:

Post by newton » Tue Jul 17, 2007 3:29 pm

thank you verymuch mr Jan.
first time the same code was Wrong to UVA



keep helping
Last edited by newton on Wed Jul 25, 2007 8:04 am, edited 1 time in total.

Jan
Guru
Posts: 1334
Joined: Wed Jun 22, 2005 10:58 pm
Location: Dhaka, Bangladesh
Contact:

Post by Jan » Tue Jul 17, 2007 4:44 pm

Your code looks correct to me. Try submitting it again.
Ami ekhono shopno dekhi...
HomePage

User avatar
sreejond
New poster
Posts: 32
Joined: Fri May 23, 2008 6:16 pm
Contact:

Re: 10789 - Prime Frequency

Post by sreejond » Thu Jun 05, 2008 10:13 am

ac
Last edited by sreejond on Thu Jun 04, 2009 1:53 pm, edited 1 time in total.

Jan
Guru
Posts: 1334
Joined: Wed Jun 22, 2005 10:58 pm
Location: Dhaka, Bangladesh
Contact:

Re: 10789 - Prime Frequency

Post by Jan » Thu Jun 05, 2008 6:55 pm

Remove ansi_prime[]. And use scanf("%s") to take the input.
Ami ekhono shopno dekhi...
HomePage

fR0D
New poster
Posts: 29
Joined: Mon Feb 11, 2008 5:59 am
Contact:

Re: 10789 - Prime Frequency

Post by fR0D » Thu Aug 07, 2008 4:46 pm

Plz help me.First time i m trying to submit a code in Java and it gives RTE.I have done all my previous submissions in C++.

Code: Select all

GOT AC
I submitted the same code using C++ and i got accepted.I just changed only the usual input/output and string functions.
Last edited by fR0D on Thu Nov 13, 2008 11:50 am, edited 1 time in total.

usuario
New poster
Posts: 3
Joined: Tue Nov 11, 2008 10:44 am

Re: 10789 - Prime Frequency

Post by usuario » Thu Nov 13, 2008 11:21 am

Hi, I got AC, your input is right.
sreejond wrote: Input:
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
my output:
d
but in board it is actually
a
plz help me.
I m very much confused.

sreejon
cuet'06

marino334
New poster
Posts: 1
Joined: Sat Apr 11, 2009 5:28 am

Re: 10789 - Prime Frequency

Post by marino334 » Sat Apr 11, 2009 5:34 am

Can anyone help me finding my mistake?

I have tried all sample inputs for this problem available for this topic and my program still gets WA

here is the code:

Code: Select all


#include <iostream>
#include <cstdlib>

using namespace std;

int sieve[304] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,
53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,
199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,
283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,
383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,
467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,
577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,
661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,
769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,
877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,
983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,
1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,
1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,
1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,
1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,
1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,
1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,
1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,
1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,
1993,1997,1999,2003};

char toabc[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";

int main() {
    int n, i, j, c = 0;
    char st[3000];
    char abc[62];

    scanf("%d", &n);
    while (n-- && ++c) {
        memset(abc, 0, sizeof(abc));
        scanf("%s", st);
        for (i = 0; st[i] != '\0'; i++) {
            if (isdigit(st[i])) {
                abc[st[i] - '0']++;
            } else if(isupper(st[i])) {
                abc[st[i] - 'A' + 10]++;
            } else if(islower(st[i])) {
                abc[st[i] - 'a' + 36]++;
            } else {
                break;
            }
        }

        printf("Case %d: ", c);
        int b = 0;
        for (i = 0; i < 62; i++) {
            if (abc[i] > 1) {
                if (binary_search(sieve, sieve + 304, abc[i])) {
                    printf("%c", toabc[i]);
                    b = 1;
                }
            }
        }
        if (!b) {
            printf("empty");
        }
        printf("\n");
    }
    return 0;
}

Thanks a lot :)

Jehad Uddin
Learning poster
Posts: 74
Joined: Fri May 08, 2009 5:16 pm

Re: 10789 - Prime Frequency

Post by Jehad Uddin » Sun May 10, 2009 2:11 am

Hello brothers,i m getting WA for 10789,my code gives correct output for every input in the board,can u hlp me whats the wrong??advanced thank to the helpers :(

got ac....
Last edited by Jehad Uddin on Sun May 17, 2009 7:37 am, edited 1 time in total.

Jan
Guru
Posts: 1334
Joined: Wed Jun 22, 2005 10:58 pm
Location: Dhaka, Bangladesh
Contact:

Re: 10789 - Prime Frequency

Post by Jan » Tue May 12, 2009 12:35 am

Check the line..

Code: Select all

...
for(j=0;j<25;j++)
...
Change it to

Code: Select all

...
for(j=0;j<26;j++) // because 26 characters are there, your code will not print z otherwise
...
Hope it helps. (Don't forget to change both the loops)
Ami ekhono shopno dekhi...
HomePage

Jehad Uddin
Learning poster
Posts: 74
Joined: Fri May 08, 2009 5:16 pm

Re: 10789 - Prime Frequency

Post by Jehad Uddin » Sun May 17, 2009 12:16 am

thanks jan vai,i got accepted,bt another prob in 10176,pls help me on that prob,i m a beginner,Advanced thanks to u.

akashs
New poster
Posts: 2
Joined: Sat Nov 06, 2010 12:54 am

10789 - Prime frequency

Post by akashs » Mon Nov 08, 2010 9:29 pm

i got WA . but i do not know why i get WA. pls someone help me.
my code is given below:




#include<stdio.h>

#include<math.h>

#include<string.h>

#include<algorithm>

using namespace std;

int prime(int num)

{

int f,n;

if( num==2 )

return 1;

if(num==1 || num==0 || num%2==0)

return 0;

else

{

int sq=sqrt(num);

for(n=2,f=0;n<sq;n++)

{

if(num%n==0)

{

f=1;

break;

}

}

if(f!=1)

return 1;

else

return 0;

}

}

int main()

{

int i,t,q,j,temp,len,k;

char a[10000],dummy,str[10000],ch;

scanf("%d%c",&t,&dummy);

for(q=1;q<=t;q++)

{

scanf("%s%c",a,&dummy);

len=strlen(a);

for(i=0,k=0;i<len;i++)

{

if(a!='-')

{

for(j=i,temp=0,ch=a;j<len;j++)

{

if(ch==a[j])

{

a[j]='-';

temp++;

}

}

if(prime(temp))

{

str[k]=ch;

k++;

}

}

}

str[k]='\0';

sort(str,str+k);

if(k!=0)

printf("Case %d: %s\n",q,str);

else

printf("Case %d: empty\n",q);

}

return 0;

}




/// i used simple prime generate function. i don't used seive method.....

tamanna739
New poster
Posts: 1
Joined: Fri Jun 03, 2011 4:49 pm

Re: 10789 - Prime frequency

Post by tamanna739 » Fri Jun 03, 2011 4:58 pm

I'm getting WA can any one help me please?? :( :(

#include<cmath>
#include<stdio.h>
#include<cctype>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<queue>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<iostream>
#include<string>
#include<vector>
#include<sstream>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
using namespace std;
bool primeS(int n)
{
int j,i;
j = (int)sqrt(n)+1;
if (n == 2)
return true;
if (n%2 == 0)
return false;
else if(n==1)
return false;
for (i=2; i<j; i++)
{
if (n%i==0)
{
return false;
}
}
return true;
}

int main()
{
int count,i,n,j,m,flag;
bool value;
char s[3000],a[3000];
vector<int> v;
vector<int>::iterator it;
scanf("%d",&n);
cin.ignore();
for(i=1;i<=n;i++)
{
gets(s);
v.clear();
count=1;
m=0;
value=0;
int k;
j=0;
printf("Case %d: ",i);
flag=0;
while(j!=strlen(s))
{
k=j+1;
if((s[j])==(s[k]))
{

count++;
j++;
}
else
{
if(primeS(count))
{
v.push_back(int(s[j]));
flag=1;

}
count=1;
j=k;
}

}

sort(v.begin(),v.end());
for(it=v.begin();it!=v.end();it++)
{
printf("%c",*it);
}
if(flag==0)
{
printf("empty\n");

}
else
{
printf("\n");
}
}
return 0;
}

Angry Bird
New poster
Posts: 21
Joined: Mon Apr 08, 2013 8:38 am

WA-10789 - Prime frequency

Post by Angry Bird » Wed Jan 22, 2014 8:55 am

Getting WA. Pls help. :evil:

Code: Select all

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,c=0;
    cin>>n;
    getchar();
    while(n--)
    {
        int arr[]= {2,3,5,7,11,13,17,19,23,29,31 ,37 ,41,43, 47, 53, 59, 61,67,71,
                    73,     79,     83,     89,     97,    101,    103,    107,    109,    113,
                    127,    131,    137,    139,    149,    151,    157,    163,    167,    173,
                    179,    181,    191,    193,    197,    199,    211,    223,    227,    229,
                    233,    239,    241,    251,    257 ,   263,    269,    271,    277,    281,
                    283,    293,    307 ,   311,    313,    317,    331 ,   337 ,   347,    349,
                    353,    359,    367,    373,    379,    383,    389,    397,    401,    409 ,
                    419 ,   421 ,   431,    433,    439,    443,    449 ,   457 ,   461,    463,
                    467,    479,    487,    491,    499,    503,    509,    521,    523,    541,
                    547,    557,    563 ,   569,    571,    577,    587,    593,    599,    601,
                    607 ,   613,    617,    619,    631 ,   641,    643 ,   647 ,   653 ,   659,
                    661,    673,    677,    683,    691,    701 ,   709,    719,    727,    733,
                    739,    743,    751,    757,    761,    769,    773,    787,    797 ,   809 ,
                    811,    821,    823,    827,    829,    839,    853,    857,    859,    863,
                    877,    881,    883,    887,    907,    911,    919,    929 ,   937 ,   941,
                    947,    953,    967,    971,    977,    983,    991,    997,   1009,   1013,
                    1019,   1021,   1031,   1033,   1039,   1049,   1051,   1061,   1063,   1069,
                    1087,   1091,   1093,   1097,   1103,   1109,   1117,   1123,   1129 ,  1151,
                    1153,   1163,   1171 ,  1181,   1187,   1193,   1201,   1213,   1217,   1223,
                    1229,   1231,   1237,   1249,   1259,   1277 ,  1279,   1283,   1289 ,  1291,
                    1297,   1301,   1303,   1307,   1319,   1321,   1327,   1361,   1367,   1373,
                    1381,   1399,   1409,   1423,   1427,   1429,   1433,   1439,   1447,   1451,
                    1453,   1459,   1471,   1481,   1483,   1487,   1489,   1493,   1499,   1511,
                    1523,   1531,   1543,   1549,   1553,   1559,   1567,   1571,   1579,   1583,
                    1597,   1601,   1607,   1609,   1613,   1619,   1621,   1627,   1637,   1657,
                    1663,   1667,   1669,   1693,   1697,   1699,   1709,   1721,   1723,   1733,
                    1741,   1747,   1753,   1759,   1777,   1783,   1787,   1789,   1801 ,  1811,
                    1823,   1831,   1847 ,  1861,   1867,   1871,   1873,   1877,   1879,   1889,
                    1901,   1907,   1913,   1931,   1933,   1949,   1951,   1973,   1979,   1987,
                    1993,   1997,   1999,   2003
                   };

        string value,main_string;
        cin>>value;
        map<char,int>m;
        vector<char>v;
        map<char,int>::iterator it;
        for(int j=0; j<value.size(); j++)
        {
            if((value[j]>='A'&&value[j]<='Z')||(value[j]>='a'&&value[j]<='z')||(value[j]>='0'&&value[j]<='9'))
            {
                m[value[j]]++;
            }
        }

        for(it=m.begin(); it!=m.end(); it++)
        {
            for(int k=0; k<310; k++)
            {
                if(it->second==arr[k])
                {
                    v.push_back(it->first);
                    break;
                }
            }
        }

        cout<<"Case "<<++c<<": ";

        if(v.size()==0)
        {
            cout<<"empty";
        }

        else
        {
            for(int j=0; j<v.size(); j++)
            {
                cout<<v[j];
            }
        }
        if(n)
            cout<<endl;
    }
    return 0;
}


Post Reply

Return to “Volume 107 (10700-10799)”