1311 条题解
-
0WBS LV 8 @ 2017-08-10 22:03:50
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end. -
02017-08-10 22:03:10@
var n,k,i,num,sum,ans:longint; a:array[0..20] of longint;
function pangduan(n:longint):integer;
var xx,i:integer;
begin
xx:=trunc(sqrt(n+1));
for i:=2 to xx do
if (n mod i=0) then exit(0);
exit(1);
end;procedure doit(t:longint);
var p,i:longint;
begin
if (num=k) then
begin
p:=pangduan(sum);
if (p=1) then inc(ans);
exit;
end;
for i:=t+1 to n do
begin
inc(num);
sum:=sum+a[i];
doit(i);
sum:=sum-a[i];
dec(num);
end;
end;begin
readln(n,k);
for i:=1 to n do read(a[i]);
for i:=1 to n-k+1 do
begin
num:=1;
sum:=a[i];
doit(i);
end;
writeln(ans);
end. -
02017-08-10 19:11:40@
冷清啊。。我来一发Python3的题解
a, b = map(int, input().split()) print(a + b)
恩 就是这么简洁qwq
-
02017-08-05 11:40:48@
#include <iostream> using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b; return 0; }
-
02017-08-05 11:40:27@
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
} -
02017-07-13 15:52:01@
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a+b;
cout<<c<<endl;
return 0;
} -
02017-07-12 15:01:01@
很简单
#include <cstdio> #include <iostream> using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b<<endl; return 0; }
-
02017-07-09 11:46:18@
#include<iostream>
#include<cstdio>
#include<ctime>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
cout<<A+B;
return 0;
} -
02017-07-07 20:15:45@
#include <iostream> #include <string.h> #include <stdio.h> using namespace std; const int mx = 500000 + 100; struct node{ int l,r; long long lazy,sum; }tree[mx * 4]; int a[mx]; /* Segment-Tree Gerneral Tools **--Using Marco--** Marco l(seq) Get left Sequence Number Marco r(seq) Get Right Sequence Number Marco lt(seq) Get Left Tree Marco pt(seq) Get Present Tree Marco trlen(seq) Get Tree Length Marco trmid(seq) Get Middle Sequence Number */ #define l(seq) seq * 2 #define r(seq) l(seq) + 1 #define lt(seq) tree[l(seq)] #define rt(seq) tree[r(seq)] #define pt(seq) tree[seq] #define trlen(seq) (pt(seq).r - pt(seq).l + 1) #define trmid(seq) (pt(seq).r + pt(seq).l)/2 void PushUp(int seq){ pt(seq).sum = lt(seq).sum + rt(seq).sum; } void PushDown(int seq){ if (pt(seq).lazy){ int lz = pt(seq).lazy; rt(seq).lazy += lz; lt(seq).lazy += lz; rt(seq).sum += lz * trlen(r(seq)); lt(seq).sum += lz * trlen(l(seq)); pt(seq).lazy = 0; } } void Build(int l,int r,int seq){ pt(seq).l = l; pt(seq).r = r; if (l == r){ pt(seq).sum = a[l]; return; } int mid = (l + r)/2; Build(l,mid,l(seq)); Build(mid + 1,r,r(seq)); PushUp(seq); } void Update(int a,int b,int alt,int seq){ int l = pt(seq).l, r = pt(seq).r; if (l == a && b == r){ pt(seq).lazy += alt; pt(seq).sum += alt * trlen(seq); return; } PushDown(seq); int mid = trmid(seq); if (b <= mid) Update(a,b,alt,l(seq)); else if (a > mid) Update(a,b,alt,r(seq)); else{ Update(a,mid,alt,l(seq)); Update(mid + 1,b,alt,r(seq)); } PushUp(seq); } long long Query(int a,int b,int seq){ int l = pt(seq).l, r = pt(seq).r; if (l == a && b == r){ return pt(seq).sum; } PushDown(seq); int mid = trmid(seq); if (b <= mid){ return Query(a,b,l(seq)); } if (a > mid) return Query(a,b,r(seq)); return Query(a,mid,l(seq)) + Query(mid + 1,b,r(seq)); } int main(){ for (int i = 1;i <= 2;i++) scanf("%d",&a[i]); Build(1,2,1); printf("%d\n",Query(1,2,1)); return 0; }
-
02017-07-06 17:44:12@
#include <bits/stdc++.h> using namespace std; int a, b; int main (int argc, char* argv[]) { cin >> a >> b; cout << a+b << endl; return 0;' }
-
02017-07-06 10:53:59@
//读入优化
#include<iostream>
#include<cstdio>
using namespace std;
int read()
{
int x=0;char c;int f=1;
for(c=getchar();c<'0'||c>'9';c=getchar())if(c=='-')f=-1;
for(;c>='0'&&c<='9';c=getchar())x=(x<<3)+(x<<1)+c-'0';
return x*f;
}
int a,b;int main()
{
a=read();
b=read();
cout<<a+b<<endl;
} -
02017-07-01 18:48:19@
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a+b);
} -
02017-06-29 09:06:36@
一道最基本的入门题,是基础,很简单
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m;
k=n+m;
cout<<k;
return 0;
} -
02017-06-22 20:26:39@
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
} -
02017-06-22 20:25:44@
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
} -
02017-06-22 20:25:12@
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
} -
02017-05-29 19:06:27@
#include<iostream> using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b; return 0; }
-
02016-12-14 13:14:54@
好长时间才做出来
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
char a1[10000],b1[10000];int a[10000],b[10000],c[10000],x=0,lena,lenb,lenc=1,i;
int main()
{
scanf("%s",a1);scanf("%s",b1);lena=strlen(a1);lenb=strlen(b1);
for(i=0;i<=lena-1;i++) a[lena-i]=a1[i]-'0';
for(i=0;i<=lenb-1;i++) b[lenb-i]=b1[i]-'0';
while(lenc<=lena||lenc<=lenb)
{
c[lenc]=a[lenc]+b[lenc]+x;
x=c[lenc]/10;
c[lenc]%=10;
lenc++;
}
if(0==(c[lenc]=x)) lenc--;
for(i=lenc;i>=1;i--) cout<<c[i];return 0;
} -
02016-12-14 11:58:17@
高精度的代码,其实是比较暴力的高精,但是因为它小于等于2^15-1,所以没什么关系。
我是通用性的高精度代码,所以数组开了10000.接下来就是——代码!
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
char a1[10000],b1[10000];int a[10000],b[10000],c[10000],x=0,lena,lenb,lenc=1,i;
int main()
{
scanf("%s",a1);scanf("%s",b1);lena=strlen(a1);lenb=strlen(b1);
for(i=0;i<=lena-1;i++) a[lena-i]=a1[i]-'0';
for(i=0;i<=lenb-1;i++) b[lenb-i]=b1[i]-'0';
while(lenc<=lena||lenc<=lenb)
{
c[lenc]=a[lenc]+b[lenc]+x;
x=c[lenc]/10;
c[lenc]%=10;
lenc++;
}
if(0==(c[lenc]=x)) lenc--;
for(i=lenc;i>=1;i--) cout<<c[i];return 0;
}
祝大家刷题快乐,从这里开始。 -
02016-12-11 18:55:20@
以下题解不必去理解,为搜集到的大牛解法,当然,也有自己写的
信息
- ID
- 1000
- 难度
- 9
- 分类
- (无)
- 标签
- (无)
- 递交数
- 73527
- 已通过
- 28207
- 通过率
- 38%
- 被复制
- 201