题解

1328 条题解

  • -1
    @ 2014-10-14 14:14:20

    var a,b:longint;
    begin
    readln(a,b,);
    writeln(a+b);
    end.

  • -1
    @ 2014-10-11 10:37:08

    program p1000;
    var
    a,b:longint;
    begin
    readln(a,b);
    writeln(a+b);
    end.

  • -1
    @ 2014-10-09 11:05:17

    这是一个难度为九的超难题,我打了万进制高精度算法,终于过了

  • -1
    @ 2014-10-06 20:49:22

    RP算法
    program aaa;
    var
    p,a,b:longint;
    begin
    randomize;
    readln(a,b);
    p:=random(100);
    if p<=60 then
    writeln(a+b);
    end.

  • -1
    @ 2014-10-06 20:46:50

    uses crt;
    var
    a,b:longint;
    begin
    read(a,b);
    delay(1000);
    writeln(a+b);
    end.

  • -2
    @ 2019-03-25 22:13:11

    #include <iostream>

    using namespace std;

    int main()
    {
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
    }

  • -2
    @ 2019-03-25 20:00:53
    #include<cstdio>
    int main(){
            int a,b;
            scanf("%d%d",&a,&b);
            printf("%d",a+b);
            return 0;
    }
    
    
  • -2
    @ 2019-03-25 19:59:39
    #include<cstdio>
    int a[-1u];
    int main(){
            int a,b;
            scanf("%d%d",&a,&b);
            printf("%d",a+b);
            return 0;
    }
    
    
  • -2
    @ 2019-03-05 15:59:51

    cin >> a >> b;
    cout << a + b << endl; 即可。这样输出的是 \(a + b\)

  • -2
    @ 2018-12-22 15:44:55

    #include<iostream>
    using namespace std;
    int main()
    {
    int a,b;
    cin>>a>>b;
    cout<<a+b<<endl;
    }

  • -2
    @ 2018-11-13 22:17:24

    看到题解并不水,发现自己想简单了,应该是数据水

  • -2
    @ 2017-07-24 19:22:06

    import java.io.*;
    import java.util.Scanner;

    public class Main {
    public static void main(String[] args) throws IOException {
    Scanner cin = new Scanner(System.in);
    int a = cin.nextInt();
    int b = cin.nextInt();
    System.out.println(a + b);
    }
    }

  • -2
    @ 2017-07-22 20:54:52

    #inlcude<iostream>
    using namespace std;
    int main()
    {
    int A,B;
    cin>>A>>B;
    cout<<A+B<<endl;
    return 0;
    }

  • -2
    @ 2017-05-14 11:15:00

    #include<stdio.h>
    int main()
    {
    int a,b,c;
    scanf("%d %d",&a,&b);
    c=a+b;
    printf("%d",c);
    return 0;
    }

  • -2
    @ 2017-04-10 16:16:23

    include <iostream>

    include <cstring>

    using namespace std;

    int low_bit (int a) {
    return a & (-a);
    }

    int main () {
    int n = 2, m = 1;
    int ans[m + 1];
    int a[n + 1], c[n + 1], s[n + 1];
    int o = 0;

    memset (c, 0, sizeof(c));

    s[0] = 0;

    for (int i = 1; i <= n; i++) {
    cin >> a[i];
    s[i] = s[i - 1] + a[i];
    c[i] = s[i] - s[i - low_bit(i)];
    }

    for (int i = 1; i <= m; i++) {
    int q = 2;
    {
    int x = 1, y = 2;
    int s1 = 0, s2 = 0, p = x - 1;

    while (p > 0) {
    s1 += c[p];
    p -= low_bit(p);
    }

    p = y;

    while (p > 0) {
    s2 += c[p];
    p -= low_bit(p);
    }

    o++;

    ans[o] = s2 - s1;
    }
    }

    for (int i = 1; i <= o; i++)
    cout << ans[i] << endl;

    return 0;
    }

  • -2
    @ 2017-03-14 17:40:18

    var a,b:longint;
    begin
    readln(a,b);
    writeln(a+b);
    end.

  • -2
    @ 2017-03-12 11:37:25
    #include<iostream>
    using namespace std;
    int Plus(int a, int b)
    {
        return a + b;
    }
    int main()
    {
        int a, b;
        cin >> a >> b;
        cout << Plus(a, b);
        return 0;
    }
    
  • -2
    @ 2017-03-11 17:26:33

    #include <iostream>
    using namespace std;

    int main() {
    int a,b;
    cin>>a>>b;
    cout<<a+b;
    return 0;
    }

  • -2
    @ 2017-03-10 21:09:18

    #include <stdio.h>
    #include <iostream>
    using namespace std;
    int main()
    {
    int a,b,c;
    cin>>a;
    cin>>b;
    c=a+b;
    cout<<c<<endl;
    return 0;
    }

  • -2
    @ 2017-03-04 16:26:58
    #include<iostream>
    #include<iomanip>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    int m,n;
    int main()
    {
        cin>>n>>m;
        cout<<n+m;
        return 0;               
    }
    

信息

ID
1000
难度
9
分类
(无)
标签
(无)
递交数
74838
已通过
28652
通过率
38%
被复制
253