OJ Board

Code: Select all

1
Ash

Code: Select all

Ash 100.0

Code: Select all

Ash 100.0000

Code: Select all

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collection;
import java.util.Map;
import java.util.Stack;
import java.util.TreeMap;

public class HardwoodSpecies {
public static void main(String[] args) throws IOException {


BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int w=0;
int e=0;
String s;
s=bf.readLine();
w=Integer.parseInt(s);
String tu;

while(e<w) {
	tu=bf.readLine();
	
	Map<String,Integer> d = new TreeMap<String,Integer>();
	StringBuilder sb =new StringBuilder();
	String line;
	while ((line=bf.readLine())!=null && !line.trim().equals("")){
		if (d.get(line)==null){
			d.put(line, 1);
	
	
	}
else {
	d.put(line, d.get(line)+1);	
	}
	}
Collection<Integer> lista;
Collection <String> lista1;
lista=d.values();
lista1=d.keySet();
Integer[] lista2= lista.toArray(new Integer[d.size()]);
String [] lista3= lista1.toArray(new String[d.size()]);
int c=0;
int i=0;
while (i<lista3.length){
	c=c+lista2[i];	
	i++;
}

 i=0;
 int y=0;
while(i<lista3.length){	
	float z=(d.get(lista3[i])/(float)c)*100 ;
	String u;
	u=Float.toString(z);
	y=u.indexOf(".");
	if (y==-1){
	u=u.substring(0,y+5);
	}
	
	sb.append(lista3[i]+" " + u +"\n");
	i++;
}
System.out.println(sb);
d.clear();
e++;
}
}
}

Code: Select all

System.out.printf ("%.2f", 4.2312414);

Code: Select all

4.23

Code: Select all

#include <stdio.h>
#include <map>
#include <string>

using namespace std;

int main(){
	int TC,tot;
	double p;
	string name;
	map<string,int> m;
	scanf("%d\n\n",&TC);
	while(TC--){
		tot=0;
		while(scanf("%30s",name.c_str())==1){
			m[name]++;
			tot++;
		}
		for(map<string,int>::iterator it=m.begin();it!=m.end();it++){
			p=(100*(double)(it->second))/tot;
			printf("%s %0.4lf\n",(it->first).c_str(),p);
		}
	}
	return 0;
}

Code: Select all

1

hello
hello2
hello
hello3
helloWorld
helloSpain

Code: Select all

helloSpain 100.0000

Code: Select all

#include <stdio.h>
#include <map>
#include <string>

using namespace std;

int main(){
	int TC,tot;
	double p;
	string name;
	char* str;
	map<string,int> m;
	scanf("%d",&TC);
	while(TC--){
		tot=0;
		while(scanf("%30s",str)==1){
			name=str;
			m[name]++;
			tot++;
		}
		for(map<string,int>::iterator it=m.begin();it!=m.end();it++){
			p=(100*(double)(it->second))/tot;
			printf("%s %0.4lf\n",(it->first).c_str(),p);
		}
	}
	return 0;
}

Code: Select all

char *a;     // a char pointer, initially pointing nowhere
char b[31];  // an array of size 31, b is pointing to a chunk of 31 bytes

scanf("%30s", a);  // not ok -- a is not pointing to any reserved memory space
scanf("%30s", b);  // ok

Code: Select all

import java.util.Set;
import java.util.Scanner;
import java.util.Map;
import java.io.OutputStream;
import java.io.IOException;
import java.util.Arrays;
import java.io.PrintWriter;
import java.util.HashMap;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Miles Stevenson
 */
class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task10226 solver = new Task10226();
		solver.solve(1, in, out);
		out.close();
	}
}

class Task10226 {
    int n;
    Map<String, Integer> dataset = new HashMap<String, Integer>();
    public void solve(int testNumber, Scanner in, PrintWriter out) {
        n = Integer.parseInt(in.nextLine());
        int count = 0;
        String line;
        while (count <= n) {
            if (count > 0)
                out.println();

            double trees = 0;
            while (in.hasNext() && !(line = in.nextLine()).isEmpty()) {
                if (dataset.containsKey(line)) {
                    Integer val = dataset.get(line);
                    dataset.put(line, ++val);
                }
                else
                    dataset.put(line, 1);
                ++trees;
            }
            int i = 0;
            String[] values = new String[dataset.size()];
            for (Map.Entry<String, Integer> entry : dataset.entrySet()) {
                values[i] = entry.getKey();
                ++i;
                /*String key = entry.getKey();
                Integer value = entry.getValue();
                DecimalFormat df = new DecimalFormat("#.####");
                out.println(key + " " + df.format(value/trees * 100));*/
            }
            Arrays.sort(values);
            for (int j = 0; j < values.length; ++j)
                out.printf("%s %.4f\n", values[j], dataset.get(values[j])/trees * 100);
            ++count;
            dataset.clear();
        }
    }
}