source code clone download copy to clipboard report bug / make suggestion

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
using System;
 
class SumaFacts
{
    static void Main()
    {
        long T; //casos
        long n; //numeros hallar suma factores
        int k;
 
        T = Convert.ToInt64(Console.ReadLine());
        long[] s = new long[T];
 
        for (k = 0; k < T; k++)
        {
            leeNums(out n);
            s[k] = sumafactores(n);
        }
 
        for (int c = 0; c < k; c++)
            Console.WriteLine(s[c]);
 
    }
 
    static void leeNums(out long a)
    {
        // read numbers
 
        string s;
        string[] n = new string[5000]; // separated
 
        s = Console.ReadLine();
        n = s.Split(' ');
        a = Convert.ToInt64(n[0]);
    }
 
 
    static long sumafactores(long n)
    {
        //usando el arbol de factores busca factores primos
        long c = n; //copia de n
        long[] a; // arreglo
        a = new long[10000];
 
        int l = 0; // lugares
        long s; //suma factores 
 
        s = 1;
        for (long k = 2; k <= c; k++)
            while (c % k == 0 && siprimo(k))
            {
                c /= k;
                a[l++] = k;
                s += k;
 
                for (int q = 0; q < l - 1; q++)
                    s += k * a[q];
            }
 
        return s;
 
    }
 
    static bool siprimo(long n)
    {
        // si n es primo
 
        bool s = true; // si primo (asume si)
        double r = Math.Sqrt(n); // raíz cuadrada de n
 
        for (long d = 2; s && d <= r; d++)
            if (n % d == 0) s = false;
 
        return s;
    }
}

clone download copy to clipboard

• upload with new input
  You have reached a limit of free submissions this month.
  You cannot send submissions this month anymore because of exceeding your monthly limit. Please recharge your account.
  
• # 6:   hide show   clone   input   103 days 10 hours ago    Success

  result: Success     time: 3.47s    memory: 37200 kB     returned value: 0

  input:

  1
  1999999999

  output:

  2064516160
  
• # 5:   hide show   clone   input   425 days 15 hours ago    Success

  result: Success     time: 0.01s    memory: 37200 kB     returned value: 0

  input:

  1
  999999999999

  output:

  1782332
  
• # 4:   hide show   clone   input   425 days 15 hours ago    Runtime error

  result: Runtime error     time: 0.02s    memory: 39632 kB     signal: 1

  input:

  1
  9999999999999999999999999

  output: no
  stderr:

  Unhandled Exception: System.OverflowException: Value is too large
    at System.Int64.Parse (System.String s) [0x00000] in <filename unknown>:0 
    at System.Convert.ToInt64 (System.String value) [0x00000] in <filename unknown>:0 
    at SumaFacts.leeNums (System.Int64& a) [0x00000] in <filename unknown>:0 
    at SumaFacts.Main () [0x00000] in <filename unknown>:0 
  

• # 3:   hide show   clone   input   425 days 15 hours ago    Runtime error

  result: Runtime error     time: 0.02s    memory: 39632 kB     signal: 1

  input:

  1
  9999999999999999999999999999999999999999

  output: no
  stderr:

  Unhandled Exception: System.OverflowException: Value is too large
    at System.Int64.Parse (System.String s) [0x00000] in <filename unknown>:0 
    at System.Convert.ToInt64 (System.String value) [0x00000] in <filename unknown>:0 
    at SumaFacts.leeNums (System.Int64& a) [0x00000] in <filename unknown>:0 
    at SumaFacts.Main () [0x00000] in <filename unknown>:0 
  

• # 2:   hide show   clone   input   425 days 15 hours ago    Success

  result: Success     time: 0.03s    memory: 38224 kB     returned value: 0

  input:

  1
  999999999

  output:

  16683898
  
• # 1:   hide show   clone   input   425 days 15 hours ago    Success

  result: Success     time: 0.01s    memory: 37968 kB     returned value: 0