1703C - Cypher - CodeForces Solution

brute force implementation strings *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n = int(input())
    numbers = list(map(int, input().split()))
    sequence = []
    
    for i in range(n):
        _, bi = input().split()
        for act in bi:
            if act == 'D':
                numbers[i] += 1
            else:
                numbers[i] -= 1
    
            numbers[i] %= 10
    
    print(*numbers)

C++ Code: 

#include<iostream>

using namespace std;

int main() {

    int tc;
    scanf("%d", &tc);
    while(tc--) {
        int n;
        scanf("%d", &n);
        int currentPositions[n];
        for(int i=0; i<n; i++){
            scanf("%d", &currentPositions[i]);
        }
        int b; string sequence;
        for(int i=0; i<n; i++) {
            scanf("%d", &b);
            cin >> sequence;
            for(int j=0; j<b; j++) {
                if(sequence[j] == 'U') {
                    currentPositions[i]--;
                } else if(sequence[j] == 'D') {
                    currentPositions[i]++;
                }
                if(currentPositions[i] == -1) {
                    currentPositions[i] = 9;
                }
                currentPositions[i] %= 10;
            }
        }
        for(int i=0; i<n; i++) {
            printf("%d ", currentPositions[i]);
        }
        printf("\n");
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time