USACO题解源代码 - JAVA

;
for(int i=0;i s[i] = br.readLine();
hash.put(s[i], 0);
}
for(int i=0;i String name = br.readLine();
for(int j=0;j if(s[j].equals(name)){
str=new StringTokenizer(br.readLine());
int m = Integer.parseInt(str.nextToken());
int n = Integer.parseInt(str.nextToken());
if(n==0){}else{
hash.put(s[j], hash.get(s[j])-m+m%n);}
for(int k=0;k String na = br.readLine();
hash.put(na,hash.get(na)+ m/n);
}
}
}
}
for(int i=0;i out.println(s[i]+" "+hash.get(s[i]));
}
out.close();
System.exit(0);
}

}

package Karl.Water;

/*
LANG: JAVA
TASK: gift1
*/

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;

public class gift1 {

public static void main(String[] args) throws NumberFormatException, IOException {
HashMap hash = new HashMap();
StringTokenizer str;
BufferedReader br = new BufferedReader(new FileReader("gift1.in"));
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("gift1.out")));
int memnum = Integer.parseInt(br.readLine());
String[] s = new String[memnum];
for(int i=0;i s[i] = br.readLine();
hash.put(s[i], 0);
}
for(int i=0;i String name = br.readLine();
for(int j=0;j if(s[j].equals(name)){
str=new StringTokenizer(br.readLine());
int m = Integer.parseInt(str.nextToken());
int n = Integer.parseInt(str.nextToken());
if(n==0){}else{
hash.put(s[j], hash.get(s[j])-m+m%n);}
for(int k=0;k String na = br.readLine();
hash.put(na,hash.get(na)+ m/n);
}
}
}
}
for(int i=0;i out.println(s[i]+" "+hash.get(s[i]));
}
out.close();
System.exit(0);
}

}

（4）

[java]
package Karl.Water;

/*
LANG: JAVA
TASK: milk2
*/

import java.util.*;
import java.io.*;
public class milk2 {
boolean time[]=new boolean[1000007];
int n,a,b,max_use,max_rex,tmp1,tmp2,start=10000007,stop=0;
public static void main(String[] args) throws IOException
{
new milk2().run();
}
void run() throws IOException
{
Scanner cin=new Scanner(new FileReader("milk2.in"));
PrintWriter cout=new PrintWriter(new BufferedWriter(new FileWriter("milk2.out")));
n=cin.nextInt();
for(int i=1;i<=n;i++)
{
a=cin.nextInt();
b=cin.nextInt();
start=start stop=stop>b stop:b;
for(int j=a;j time[j]=true;
}
for(int i=start;i<=stop;i++)
{
if(time[i])
tmp1++;
else
{
max_use=max_use>tmp1 max_use:tmp1;
tmp1=0;
}
if(!time[i])
{
tmp2++;
}
else
{
max_rex=max_rex>tmp2 max_rex:tmp2;

USACO题解源代码 (四)