Why is this code gives Runtime Error? I think it's not a problem to allow participants use exceptions, as long as they are not throwing it out of main:

#include <iostream>

int main() {
    int a, b;
    std::cin >> a >> b;
    try {
        throw std::exception();
    } catch (...) {}
    std::cout << a + b << "\n";
}

already done. for someone who doesn't know how to do it:

a,b = input().split()
print(int(a)+int(b))
a = int(1)
b = int(5)

Edited by author 28.03.2024 16:23

короче сам голову ломал, там переменные в 1 строку вводить надо
может кто то также ошибся

using System;

namespace Timus
{
    class Program
    {
        static void Main()
        {
            string nums = Console.ReadLine();
            int a = Convert.ToInt32(nums.Substring(0, 1));
            int b = Convert.ToInt32(nums.Substring(2, 1));
            int c = a + b;
            Console.WriteLine(c);
        }
    }
}

No way, this become harder than 1293. Eniya. We did it, guys!!!

a = float(input("a:"))
b = float(input("b:"))
print(a+b)

Edited by author 02.11.2019 14:57

Edited by author 02.11.2019 14:59

a, b = int(input()), int(input())
print(a + b)

we can use the netflow algorithm(+ operator) to solve this problem.
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 5
using namespace std;
const int INF=1<<30;
int n,m,flow[MAXN][MAXN],pre[MAXN],cur[MAXN],gap[MAXN],d[MAXN],g[MAXN],l[MAXN][MAXN];
int Maxflow_Isap(int s,int t,int n) {
    memset(d,-1,sizeof(d));
    memset(pre,-1,sizeof(pre));
    memset(gap,0,sizeof(gap));
    gap[s]=n;
    int u=pre[s]=s,v,maxflow=0;
    while (d[s]<n) {
      v=n+1;
      for (int i=cur[u];i<=g[u];i++)
        if (flow[u][l[u][i]] && d[u]==d[l[u][i]]+1) {
          v=l[u][i];cur[u]=i;break;
        }
      if (v<=n) {
        pre[v]=u;u=v;
        if (v==t) {
          int dflow=INF;u=s;
          for (int i=v;i!=s;i=pre[i]) dflow=min(dflow,flow[pre[i]][i]);
          maxflow+=dflow;
          for (int i=v;i!=s;i=pre[i]) {
            flow[pre[i]][i]-=dflow;
            flow[i][pre[i]]+=dflow;
          }
        }
      }
      else{
        int mindist=n;
        for (int i=1;i<=g[u];i++)
          if (flow[u][l[u][i]]) mindist=min(mindist,d[l[u][i]]);
        if (!--gap[d[u]]) return maxflow;
        gap[d[u]=mindist+1]++;cur[u]=1;
        u=pre[u];
      }
    }
    return maxflow;
}
void setsize(int x,int y,int c) {
    flow[x][y]=c;
    l[x][++g[x]]=y;
    l[y][++g[y]]=x;
}
int main() {
    scanf("%d%d",&n,&m);
    setsize(1,2,n);
    setsize(2,4,n);
    setsize(1,3,m);
    setsize(3,4,m);
    printf("%d\n",Maxflow_Isap(1,4,4));
    return 0;
}

Пишу на C#:
using System;

namespace Timus_Console
{
    class Program
    {
        static void Main(string[] args)
        {
            int ans1 = Convert.ToInt32(Console.ReadLine());
            int ans2 = Convert.ToInt32(Console.ReadLine());
            int st = ans1 + ans2;
            Console.WriteLine(st);
            Console.ReadKey();
        }
    }
}

Edited by author 25.03.2016 11:48

a = int(input())
b = int(input())
print(a+b)

JavaEntryPointWrapper.java:10: error: cannot access Oppa
            Oppa.main(args);
            ^
  bad source file: .\Oppa.java
    file does not contain class Oppa
    Please remove or make sure it appears in the correct subdirectory of the sourcepath.
1 error
Выходит такая ошибка, почему?

a, b =map(int, input().split())
print(a + b)

помогите

a,b=input('Введите числа через пробел: ').split(" ")
a=int(a)
b=int(b)
print(a+b)

test 1, wrong answer :(

Im struggling with it for few days, but absolutely have no idea how to do it!
Any hints??

ъеъеукъкупъкцъъъпъъпъ

#include "stdafx.h"
#include <iostream>



int main()
{
    int a;
    int b;
    int c;
    scanf_s("%d%d\n", &a, &b);
    c = a + b;
    printf("%d\n", c);
    return 0;
}

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

puts gets.split(' ').sum { |s| s.to_i }

а вот так ок:
puts gets.split(' ').map { |s| s.to_i }.inject(0) {|sum,x| sum + x }

что не так с с sum?
Edited by author 22.05.2019 11:43

Edited by author 29.05.2019 02:44