PKU_ACM_3673_Cow Multiplication
2008-11-06 12:00
375 查看
http://acm.pku.edu.cn/JudgeOnline/problem?id=3673 原题
很简单题
import java.io.*;
import java.util.*;
public class Main
{
static int[] num1;
static int[] num2;
public static void main(String[] args) throws Exception
{
readFile();
process();
}
public static void readFile() throws Exception
{
BufferedReader br = new BufferedReader(
new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(
br.readLine()," ");
String sTemp = st.nextToken();
num1 = new int[sTemp.length()];
for(int i=0; i<num1.length; i++)
{
num1[i] = Integer.valueOf(sTemp.charAt(i)-48);
}
sTemp = st.nextToken();
num2 = new int[sTemp.length()];
for(int i=0; i<num2.length; i++)
{
num2[i] = Integer.valueOf(sTemp.charAt(i)-48);
}
}
public static void process()
{
long sum = 0L;
for(int i=0; i<num1.length; i++)
{
for(int j=0; j<num2.length; j++)
{
sum += (num1[i]*num2[j]);
}
}
System.out.print(sum);
}
}
很简单题
import java.io.*;
import java.util.*;
public class Main
{
static int[] num1;
static int[] num2;
public static void main(String[] args) throws Exception
{
readFile();
process();
}
public static void readFile() throws Exception
{
BufferedReader br = new BufferedReader(
new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(
br.readLine()," ");
String sTemp = st.nextToken();
num1 = new int[sTemp.length()];
for(int i=0; i<num1.length; i++)
{
num1[i] = Integer.valueOf(sTemp.charAt(i)-48);
}
sTemp = st.nextToken();
num2 = new int[sTemp.length()];
for(int i=0; i<num2.length; i++)
{
num2[i] = Integer.valueOf(sTemp.charAt(i)-48);
}
}
public static void process()
{
long sum = 0L;
for(int i=0; i<num1.length; i++)
{
for(int j=0; j<num2.length; j++)
{
sum += (num1[i]*num2[j]);
}
}
System.out.print(sum);
}
}
相关文章推荐
- acm pku 1144 ID Codes的算法分析
- 单调队列 - 兼 ACM PKU POJ 3250 及 2823 解题报告
- http://acm.pku.edu.cn/JudgeOnline/problem?id=3468 成段更新,区间求和(要用long long)
- 1010(stamps),acm.pku.edu.cn
- http://acm.pku.edu.cn/JudgeOnline/problem?id=1131 八进小数转十进制小数
- acm pku 1207 The 3n+1的算法分析与实现
- acm pku 1251 Jungle Roads的算法分析与实现
- pku_ACM_1050 toMax
- POJ 1004Financial Management解题报告——【PKU ACM】
- pku acm 1007
- pku acm 1018
- pku acm 1065
- acm pku 1045 Bode Plot的计算过程
- Flip and Shift -- ACM PKU 1063 解题报告
- 滑雪-PKU ACM 1088
- ACM PKU 1177 Picture
- Pku acm 1887 Testing the CATCHER 动态规划题目解题报告(十一)
- Pku acm 3253 Fence Repair 数据结构题目解题报告(一) ----哈夫曼数
- Pku acm 1611 The Suspects数据结构题目解题报告(九)---- 并查集的应用
- Pku acm 2371 Questions and answers 排序算法解题报告(三)----二叉查找数(BST)排序