Moderator: Board moderators
Code: Select all
#include <iostream>
#include <stdio.h>
#include <map>
using namespace std;
int main()
{
map<string, int> mapa;
char lines[101];
int test, n;
scanf("%d", &test);
gets(lines);
for (int t = 1; t <= test; t++)
{
if (t > 1)
putchar('\n');
mapa.clear();
gets(lines);
n = 0;
while (strlen(gets(lines)))
{
mapa[string(lines)]++;
n++;
}
map<string, int>::iterator ptr = mapa.begin();
map<string, int>::iterator end = mapa.end();
do
{
cout << ptr->first << " ";
printf("%0.4lf\n", (100.0 * ptr->second) / (1.0 * n));
}
while (++ptr != end);
}
return 0;
}
Code: Select all
#include<iostream>
#include<stdio.h>
#include<map>
#include<string>
using namespace std;
int main(void)
{
map<string,int>Plant;
int Tcases=0,Cnt=0;
double num;
char str[40];
scanf(" %d",&Tcases);
getchar();
getchar();
for(int i=0;i<Tcases;i++)
{
Cnt=0;
while(1)
{
scanf("%[^\n]",str);
getchar();
if(strcmp(str,"")==0)
break;
if(Plant.find(str)!=Plant.end())
Plant[string(str)]++;
else Plant[string(str)]=1;
Cnt++;
str[0]='\0';
}
for(map<string,int>::iterator iter=Plant.begin();iter!=Plant.end();iter++)
{
printf("%s",((*iter).first).c_str());
num = (double)((*iter).second)*100/(double)Cnt;
printf(" %.4lf\n",num);
}
Plant.clear();
printf("\n");
getchar();
}
}
Code: Select all
#include <stdio.h>
#include <string.h>
char str[1000001][31], t[31]; int i, j, n, cnt;
double x;
int main()
{
while(gets(str[n])!=NULL)
n++;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(strcmp(str[i],str[j])>0){
strcpy(t,str[i]);
strcpy(str[i],str[j]);
strcpy(str[j],t);
}
}
}
for(i=0;i<n;i++){
cnt=1;
for(j=i+1;j<n;j++){
if(strcmp(str[i],str[j])!=0)
break;
cnt++;
}
x=double(cnt)/double(n)*100;
printf("%s %.4f\n",str[i],x);
i=j-1;
}
}
Please help me!!Code: Select all
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#define Fe(it,v) for(__typeof__ ((v).begin()) it=v.begin();it!=(v).end();++it )
using namespace std;
int main()
{
int casos;
scanf("%d",&casos);
while(casos--)
{
map <string,int> m;
string s;
int ct=0;
getline(cin,s); /* white line */
while(getline(cin,s)&&s!="")
{
++m[s];
++ct;
}
Fe(it,m) printf("%s %.4lf\n",((*it).first).c_str(),(*it).second*100.0/ct);
if(casos) putchar('\n');
}
}
Are you sure?Antonio Ocampo wrote:I've got WA too
My programming experience is so different now.Code: Select all
#include <iostream>
using namespace std;
struct node
{
string word;
int cnt;
struct node *left;
struct node *right;
};
int n;
struct node *addtree ( struct node *p , string s )
{
int c;
if ( p == NULL )
{
p = new node();
p -> word = s;
p -> cnt = 1;
p -> left = p -> right = NULL;
}
else if ( s == p -> word ) p -> cnt ++;
else if ( s < p -> word ) p -> left = addtree ( p -> left , s );
else p -> right = addtree ( p -> right , s );
return p;
}
void printtree ( struct node *p )
{
if ( p != NULL )
{
printtree ( p -> left );
double per = ( ( ( p -> cnt ) * 1. ) / ( n * 1. ) ) * 100.;
printf ( "%s %.4lf\n" , (p -> word).c_str() , per );
printtree ( p -> right );
}
}
int main ()
{
int t; scanf ( "%d" , &t );
getchar();
bool fg = 0;
while ( t -- )
{
getchar();
struct node *root;
root = NULL;
n = 0;
while ( true )
{
string s;
getline ( cin , s );
if ( s == "" ) break;
n ++;
root = addtree ( root , s );
}
if ( !fg ) fg = 1;
else printf ( "\n" );
printtree (root);
}
return 0;
}
Code: Select all
1
orange
orange
mango
biriyani
icecream
orange
orange
biriyani
pine apple
what the hell is this tree
what the hell is this tree
oak tree
longest tree ever
a tiny tree
pine apple
longest tree ever
this problem is not tough
you should know stl
this problem is not tough
a tiny tree
a tiny tree
you should know stl
try to pass this sample
mango
mango
accepted
accepted
wrong answer
runtime error
dont make precision error
try to pass this sample
dont make precision error
dont make precision error
don 4get to typecast if you divide int by an int n store result in double
don 4get to typecast if you divide int by an int n store result in double
try to pass this sample
hope this helps
dont see the board before trying the problem
it will spoil you
hope this helps
Code: Select all
a tiny tree 7.5000
accepted 5.0000
biriyani 5.0000
don 4get to typecast if you divide int by an int n store result in double 5.0000
dont make precision error 7.5000
dont see the board before trying the problem 2.5000
hope this helps 5.0000
icecream 2.5000
it will spoil you 2.5000
longest tree ever 5.0000
mango 7.5000
oak tree 2.5000
orange 10.0000
pine apple 5.0000
runtime error 2.5000
this problem is not tough 5.0000
try to pass this sample 7.5000
what the hell is this tree 2.5000
what the hell is this tree 2.5000
wrong answer 2.5000
you should know stl 5.0000
Code: Select all
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#define MAX 10000
using namespace std;
char seq[MAX];
int main(){
// freopen("10226.txt","r",stdin);
map<string,int>t;
string str,str1;
int test;
cin.getline(seq,MAX);
test=atoi(seq);
getline(cin,str);
for(int i=1;i<=test;i++){
int total=0;
t.clear();
while(getline(cin,str1) && (str1.size()>=1)){
t[string(str1)]++;
total++;
// cout<<total<<endl;
}
// cout<<total<<endl;
map<string,int>::iterator iter;
for(iter=t.begin();iter!=t.end();iter++){
cout<<iter->first<<" ";
printf("%0.4lf\n",(100.0*iter->second)/(1.0*total));
}
if(i>1);
cout<<endl;
}
return 0;
}