uri- 1179 - Array Fill IV

#include<stdio.h>

int main()
{
    int i,p[5],im[5],par=0,imp=0,a,j;

    while(scanf("%d",&a)==1){
        if(a%2==0){
                p[par]=a;
                 par++;
        }
        else{
            im[imp]=a;
            imp++;
        }
        if(par==5){
            for (j = 0; j <= 4; j++){
                printf("par[%d] = %d\n",j,p[j]);
                p[j]='\0';
            }
            par=0;
        }
         if(imp==5){
            for (j = 0; j <= 4; j++){
                printf("impar[%d] = %d\n",j,im[j]);
                im[j]='\0';
            }
            imp=0;
        }
    }

    for (j = 0; j <= 4; j++){
        if (im[j] == '\0')
            break;
        printf("impar[%d] = %d\n", j, im[j]);
    }
    for (j = 0; j <= 4; j++){
        if (p[j] == '\0')
            break;
        printf("par[%d] = %d\n", j, p[j]);
    }
    return 0;
}

uri- 1534 - Array 123

#include<stdio.h>

int main()
{
    int n,i,j;

    while(scanf("%d",&n)==1){
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                if((i==j && i+j==n-1 ) || i+j==n-1)
                    printf("2");
                else if(i==j)
                    printf("1");
                else
                    printf("3");
            }
            printf("\n");
        }
    }
    return 0;
}

uri- 1216 - Getline One

#include <stdio.h>

int main(){
    char s[101];
    double d, t, n = 0.0;
    while(gets(s)){
        scanf("%lf", &d);
        t += d;
        n += 1.0;
    }
    printf("%.1lf\n", t / n);
    return 0;
}

uri- 1197 - Back to High School Physics

#include<stdio.h>

int main()
{
    int a,b,s=0;

    while(scanf("%d %d",&a,&b)==2){
        s=a*(b*2);
        printf("%d\n",s);
      
    }
    return 0;
}

uri- 1198 - Hashmat the Brave Warrior

#include<stdio.h>

int main()
{
   long long int a,b;

    while(scanf("%lld %lld",&a,&b)==2){
            if(a>b){
       printf("%lld\n",a-b);
           }
            else{
        printf("%lld\n",b-a);
            }
    }
    return 0;
}

uri- 1221 - Fast Prime Number

#include <stdio.h>
#include <math.h>

int main(){
    int n, teste,i;
    long int p;

    scanf("%d", &n);

    while(n--){
            teste = 0;
            scanf("%ld", &p);
             if(p<=2){
            if(p == 0){
                 printf("Not Prime\n");
                 continue;
            }
            if(p == 1){
                 printf("Not Prime\n");
                 continue;
            }
            if(p == 2){
                 printf("Prime\n");
                 continue;
            }
          }
           else{
            for(i = 2; i < sqrt(p)+1; i++){
                    if(p%i == 0) teste++;
                    if(teste == 2) break;
            }
            if(teste >= 1) printf("Not Prime\n");
            else printf("Prime\n");
       }
    }
    return 0;
}

uri- 1240 - Fit or Dont Fit I

#include<stdio.h>
int main()
{
    int n;
    long long int a,b;
    scanf("%d",&n);
    while(n--){
           // start:
        scanf("%lld %lld",&a,&b);
     if(a >= b)
        {
            while(b != 0)
            {
                if(b%10 != a%10)
                {
                    printf("nao encaixa\n");
                    goto finishhim;
                }
                a/=10;
                b/=10;
            }
            printf("encaixa\n");
        }
        else
        {
            printf("nao encaixa\n");
        }
        finishhim:;
    }
    return 0;
}

uri-1188 - Inferior Area

#include <stdio.h>

int main(){
    char o;
    int i, j, x = 5;
    float s = 0, n;
    scanf("%c", &o);
    for (i = 0; i <= 11; i++){
        for (j = 0; j <= 11; j++){
            scanf("%f", &n);
            if (j > x && j < 11 - x)
                s += n;
        }
        if (i > 5)
            x--;
    }
    if (o == 'S')
        printf("%.1f\n", s);
    else
        printf("%.1f\n", s / 30);
    return 0;
}

uri- 1467 - Zero or One

#include<stdio.h>

int main()
{
    int a,b,c;
    while(scanf("%d %d %d",&a,&b,&c)!=EOF){

        if((a==0 && b==0 && c==0) || (a==1 && b==1 && c==1) ){
            printf("*\n");
        }
       else if((a==0 && b==0 && c==1) || (a==1 && b==1 && c==0)) {
            printf("C\n");
        }
        else if((a==0 && b==1 && c==0) || (a==1 && b==0 && c==1)){
            printf("B\n");
        }
        if((a==0 && b==1 && c==1) || (a==1 && b==0 && c==0)){
            printf("A\n");
        }
    }
        return 0;
}

uri- 1558 - Sum of Two Squares

#include<stdio.h>
#define N 10000

int len=0;
void pre_gen(int arr[]);

int main()
{
    int n,i,ck;
    int arr[N+1] = {0};
    pre_gen(arr);

    while(scanf("%d",&n)!=EOF){

            if(n >= 0 && arr[n]==1)
                printf("YES\n");
            else
                printf("NO\n");
    }

    return 0;
}

void pre_gen(int arr[])
{
    int i,j,t;

        for(i=0;i*i<=N;i++){
            for(j=0;j*j<=N;j++){

                if( (i*i)+(j*j) <= N ){
                    t = (i*i)+(j*j);
                    arr[t] = 1;
                }

            }
        }
}

uri- 1761 - Christmas Decorations

#include<stdio.h>
#include<math.h>

int main()
{
    double a,b,c,t,angel,result;
    double pi=3.141592654;
           while(scanf("%lf %lf %lf",&a,&b,&c)!=EOF){
                 angel=tan ( a * pi / 180.0 );
                 t=angel*b;
                 result=(t+c)*5;
                 printf("%.2lf\n",result);
           }

      return 0;
}

uri- 1300 - Hours and Minutes

#include<stdio.h>

int main(){
    int a;

  while(scanf("%d",&a)!=EOF){
       if(a%6==0){
        printf("Y\n");
       }
       else{
        printf("N\n");
       }
    }
    return 0;
}

uri- 1103 - Alarm Clock

#include <stdio.h>

int main(){
 int h, hm, hr,m,mm,i;

 for(i=0;i<10000;i++){

      scanf("%d %d %d %d", &h, &m,&hm,&mm);

  if(h==0 && m==0 && hm==0 && mm==0){
      break;
  }
   if (h <= hm)
            hr = (hm - h) * 60;
        else
            hr = (24 - (h - hm)) * 60;

        if (m <= mm)
            hr += mm - m;
        else
            hr += 60 - 60 - m + mm;

        if (h == hm &&  m > mm)
            hr = 23 * 60 + (60 - m + mm);

        printf("%d\n", hr);
    }
 return 0;
}

uri- 1161 - Factorial Sum

#include <stdio.h>


int main(){
    int m, n;
    int i;
    long long fat[21];
    fat[0] = 1;

    for(i = 1; i <= 20; i++){
            fat[i] = fat[i-1]*i;
     }

    while(scanf("%d",&m)!= EOF){
                   scanf("%d",&n);
                 printf("%lld\n", fat[m] + fat[n]);
    }

    return 0;
}

uri- 1149 - Summing Consecutive Integers

#include<stdio.h>

int main()
{
    int a,b,i,s=0;
    scanf("%d",&a);
    scanf("%d",&b);
    for(i=0;i<10000;i++){
    if(b<=0){
         scanf("%d",&b);
    }
    else{
        continue;
    }
    }
    for(i=a;i<a+b;i++){
        s=s+i;
    }
    printf("%d\n",s);
    return 0;
}

uri- 1150 - Exceeding Z

#include<stdio.h>

int main()
{
    int a,b,i,j=0,s=0;
    scanf("%d",&a);
    scanf("%d",&b);
    for(i=0;i<10000;i++){
    if(a>=b){
         scanf("%d",&b);
    }
    else{
        continue;
    }
    }
    for(i=a;i<10000;i++){
        s=s+i;
         j++;
        if(s>b){
            break;
        }

    }
    printf("%d\n",j);
    return 0;
}

uri- 1171 - Number Frequence

#include<stdio.h>
#include<string.h>
#define N 2001
int main()
{
      int t,n,i,j;
      int arr[N];
                  while(scanf("%d",&t)==1){
                        memset(arr,0,sizeof arr);
                              for(i=1;i<=t;i++){
                                    scanf("%d",&n);
                                    arr[n]++;
                                    }
                                    for(i=0;i<N;i++)
                                          for(j=0;j<arr[i];j++){
                                                if(arr[i]>0)
                                                printf("%d aparece %d vez(es)\n",i,arr[i]);
                                                break;
                                          }
                  }
      return 0;
}

uri-1026 - To Carry or not to Carry

#include <stdio.h>

int main(){
    unsigned int a, b;

    while(scanf("%u %u", &a, &b) != EOF){
                    printf("%u\n", a ^ b);
    }

    return 0;
}

uri- 1187 - Top Area

#include <stdio.h>

int main(){
    char o;
    int i, j, l = 1;
    double s = 0, n;
    scanf("%c", &o);
    for (i = 0; i <= 4; i++){
        for (j = 0; j <= 11; j++){
            scanf("%lf", &n);
            if (j >= l && j <= 11 - l)
                s += n;
        }
        l++;
    }
    if (o == 'S')
        printf("%.1f\n", s);
    else
        printf("%.1f\n", s / 30);
    return 0;
}

uri- 1186 - Below the Secundary Diagonal

#include <stdio.h>

int main() {
    char d;
    int i, j, c;
    float s = 0.0, n;

    scanf("%c", &d);

    for (i = 0; i <= 11; i++) {
        for (j = 0; j <= 11; j++) {
            scanf("%f", &n);
                if (j>11-i){
                s += n;
                }
        }
    }

    if (d == 'S')
        printf("%.1f\n", s);
    else
        printf("%.1f\n", s /66);

    return 0;
}