UVA Solution 10082 - WERTYU

#include<stdio.h>
#include<string.h>
int main()
{
    long int l,i;
    char s[100000];
    while(gets(s))
    {
        l=strlen(s);
        for(i=0; i<l; i++)
        {
            switch(s[i])
            {
            case 'W':
                printf("Q");
                break;
            case 'E':
                printf("W");
                break;
            case 'R':
                printf("E");
                break;
            case 'T':
                printf("R");
                break;
            case 'Y':
                printf("T");
                break;
            case 'U':
                printf("Y");
                break;
            case 'I':
                printf("U");
                break;
            case 'O':
                printf("I");
                break;
            case 'P':
                printf("O");
                break;
            case 'S':
                printf("A");
                break;
            case 'D':
                printf("S");
                break;
            case 'F':
                printf("D");
                break;
            case 'G':
                printf("F");
                break;
            case 'H':
                printf("G");
                break;
            case 'J':
                printf("H");
                break;
            case 'K':
                printf("J");
                break;
            case 'L':
                printf("K");
                break;
            case 'X':
                printf("Z");
                break;
            case 'C':
                printf("X");
                break;
            case 'V':
                printf("C");
                break;
            case 'B':
                printf("V");
                break;
            case 'N':
                printf("B");
                break;
            case 'M':
                printf("N");
                break;
            case '2':
                printf("1");
                break;
            case '3':
                printf("2");
                break;
            case '4':
                printf("3");
                break;
            case '5':
                printf("4");
                break;
            case '6':
                printf("5");
                break;
            case '7':
                printf("6");
                break;
            case '8':
                printf("7");
                break;
            case '9':
                printf("8");
                break;
            case '0':
                printf("9");
                break;
            case '-':
                printf("0");
                break;
            case '=':
                printf("-");
                break;
            case '[':
                printf("P");
                break;
            case ']':
                printf("[");
                break;
            case '\\':
                printf("]");
                break;
            case ';':
                printf("L");
                break;
            case '1':
                printf("`");
                break;
            case ',':
                printf("M");
                break;
            case '.':
                printf(",");
                break;
            case '/':
                printf(".");
                break;
            case ' ':
                printf(" ");
                break;
            default:
                printf(";");
                break;
            }

        }
        printf("\n");
    }
    return 0;
}







Problem Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1023

UVa Solution 11192 - Group Reverse

#include<stdio.h>
#include<string.h>
int main()
{
    int p,i,j,top,G;
    char s1[105],s2[105];
    scanf("%d",&G);
    while(G)
    {
        scanf("%s",s1);
        int len=strlen(s1);
        p=len/G;
        top=0;
        for(i=p-1; i<len; i+=p)
        {
            for(j=i; j>i-p; j--)
                s2[top++]=s1[j];
        }
        s2[top++]=0;
        puts(s2);
        scanf("%d",&G);
    }
    return 0;
}
problem link: http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2133