Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 5 KBi |
#2 |
Correcto
|
0.004 s | 5 KBi |
#3 |
Correcto
|
0.004 s | 5 KBi |
#4 |
Correcto
|
0.005 s | 5 KBi |
#5 |
Correcto
|
0.005 s | 5 KBi |
#6 |
Correcto
|
0.006 s | 5 KBi |
#7 |
Correcto
|
0.006 s | 4 KBi |
#8 |
Correcto
|
0.236 s | 5 KBi |
#9 |
Correcto
|
0.715 s | 7 KBi |
#10 |
Correcto
|
0.706 s | 7 KBi |
#11 |
Correcto
|
0.691 s | 11 KBi |
#12 |
Correcto
|
0.73 s | 8 KBi |
#13 |
Correcto
|
0.448 s | 7 KBi |
#14 |
Correcto
|
0.602 s | 8 KBi |
// Solution to https://codeo.app/problemas/0x25-suma-de-un-subarreglo package main import ( "fmt" ) func solve(a []int, p, q int) { sum := 0 for i := p; i <= q; i++ { sum += a[i] } fmt.Println(sum) } func main() { var n int _, err := fmt.Scanf("%d", &n) if err != nil { panic(err) } a := make([]int, n) for i := 0; i < n; i++ { _, err := fmt.Scanf("%d", &a[i]) if err != nil { panic(err) } } var c int _, err = fmt.Scanf("%d", &c) if err != nil { panic(err) } for k := 0; k < c; k++ { var p, q int _, err := fmt.Scanf("%d %d", &p, &q) if err != nil { panic(err) } solve(a, p, q) } }