{inta,b;while(scanf("%d%d",&a,&b)!=EOF) { printf("%d\n",a+b); }return0; }
zoj1001-A + B Problem http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1 A + B Problem Time Limit:2 SecondsMemory Limit:65536 KB Calculate a + b Top Input The input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per l...
ZOJ 1001 提交网址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1 A + B Problem Time Limit: 2 Seconds Memory Limit: 65536 KB Calculate a + b Input The input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line. ...
Zoj Problem Classfication & Brief Report(Updating...)简单题 #1001 -___-b A+B。#1110 Dick and Jane 胡乱枚举收缩一下情况就可以了。#1115 a[i+1] = a[i] 的全部数位上的加起来,直到剩下一个,直接模拟。#1414 太弱太弱,按照模4 分类讨论一下即可。#1713 简单的字符串截取和字符计数。#...
Ural Problem Set Volume 1: 1000-1099题号标题难度系数算法1000 A+B Problem 10%直接加1002 Phone Numbers 50%动态规划或最短路1003 Parity 70%区间减法1004 Sightseeing trip 60%最短路1005 Stone Pile 30%动态规划或搜索1006 Square Frames 35%模拟1007 Code Words 30%模拟1008 Image encoding 30%广度优先搜索...
1001 很简单的第一道题,就当是回顾io操作了。 Calculate a + bInput The input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line.Output For each pair of input integers a and b you should output the sum of a and b in one line...
Zoj题目分类
代码语言:javascript 复制 #include<stdio.h>#include<string.h>#include<algorithm>#include<vector>using namespace std;constintMAXN=1010;int pre[MAXN];//记录[i]男生属于谁int vis[MAXN];int n,m;//男生,女生个数int num[MAXN];int r[10][10];int dig[]={119,17,62,59,89,107,111,49,12...
简单题#1001 -___-b A+B。#1110 Dick and Jane 胡乱枚举收缩一下情况就可以了。#1115 a[i+1] = a[i] 的全部数位上的加起来,直到剩下一个,直接模拟。#1414 太弱太弱,按照模 4 分类讨论一下即可。#1713 简... 仨woman 0 4727 cdoj 574 High-level ancients dfs序+线段树 2015-11-26 00...
int a[505]; // MaoMao Problem id int b[505]; //Old Surgeon Contest Problem id int prime[10000] = {0}; map<string, double>mp; // 对应于队伍相对应的奖牌再转换成分数 map<int,double>pro; // 对应题目所得分数 struct node {