1323 条题解
-
0kaimin LV 3 @ 2009-10-30 19:28:46
var
a,b,s:integer;
begin
readln(a,b);
s:=a+b;
writeln(s);
end. -
02009-10-30 18:45:56@
program ex1;
var
a,b:integer;
begin
read (a,b);
writeln(a+b);
readln
end. -
02009-10-30 15:16:24@
这水'''题通过氯58???
-
02009-10-29 21:25:57@
pogram 137
var
x,y:integer;
begin
read(x,y);
writen(X+Y);
END. -
02009-10-28 22:46:02@
program p1000;
var
x,y:integer;
begin
read(x,y);
writeln(x+y);
end. -
02009-10-28 22:16:25@
var
x,y:integer;
begin
read(x,y);
writeln(x+y);
end. -
02009-10-28 21:49:51@
#include
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout -
02009-10-28 12:57:27@
伪汇编写法。。
var
a,b:longint;
BEGIN
readln(a,b);asm
mov a,%eax
add b,%eax
mov %eax,b
end;writeln(b);
END. -
02009-10-27 19:44:43@
program dfas;
var a,b,c:real;
begin;
read(a,b);
c:a+b;
write('c=',c);
end -
02009-10-27 19:20:18@
program ex221;
var a,b,c:real;
begin;
read(a,b);
c:=a+b;
write('c=',c);
end. -
02009-10-27 19:11:40@
大牛们都用网络流做啊 orz orz orz
-
02009-10-27 19:10:50@
program ex001;
var x,y,z:longint;
begin;
read (x,y);
z:=x+y;
write('z=',z);
end. -
02009-10-24 11:15:34@
编译通过...
├ 测试数据 01:答案正确... 744ms
├ 测试数据 02:答案正确... 697ms
├ 测试数据 03:答案正确... 666ms
├ 测试数据 04:答案正确... 681ms
├ 测试数据 05:答案正确... 666ms
├ 测试数据 06:答案正确... 712ms
├ 测试数据 07:答案正确... 681ms
├ 测试数据 08:答案正确... 697ms
├ 测试数据 09:答案正确... 666ms
├ 测试数据 10:答案正确... 728ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分:100 有效耗时:6938ms
为什么我那么慢啊.各位用什么方法做的啊,dfs+优化不能秒杀我试试dp做. -
02009-10-23 22:16:50@
从新开放~
莫大的鼓舞~
Orz…… -
02009-10-23 19:29:02@
oh
-
02009-10-23 19:19:13@
被删了啊
悼念中 -
02009-10-22 20:47:28@
program lx;
var
a,b:integer;
begin
readln(a,b);
write(a+b);
end. -
02009-10-19 16:42:41@
var a,b:integer;
begin
read(a,b);
writeln(a+b);
end. -
02009-10-14 09:19:40@
program cc;
var
a,b,c:integer;
begin
readln(a);
readln(b);
writeln(c:=a+b);
end. -
02009-11-03 16:31:26@
program z(input,output);
var
a,b,c:string;
p,q:array[1..225] of longint;
m,n,i,j:longint;function jia(a,b:string):string;
begin
m:=length(a);
n:=length(b);
fillchar(p,sizeof(p),0);
fillchar(q,sizeof(q),0);
for i:=m downto 1 do
p[m+1-i]:=ord(a[i])-48;
for i:=n downto 1 do
q[n+1-i]:=ord(b[i])-48;
i:=1;
repeat
q[i]:=p[i]+q[i];
q:=(q[i] div 10)+q;
q[i]:=q[i] mod 10;
i:=i+1;
until (q[i]+p[i])=0;
jia:='a';
for j:=i-1 downto 1 do
begin
jia:=jia+chr(q[j]+48);
end;
delete(jia,1,1);
end;begin
read(a);
for i:=1 to length(a) do
begin
if a[i]=' ' then
begin
b:=copy(a,1,i-1);
delete(a,1,i);
end;
end;
c:=jia(a,b);
write(c);end.
信息
- ID
- 1000
- 难度
- 9
- 分类
- (无)
- 标签
- (无)
- 递交数
- 74446
- 已通过
- 28492
- 通过率
- 38%
- 被复制
- 223