Sunday, August 28, 2016

uri- 1185 - Above 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;
}


uri- 1184 - Below the Main 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<i){
                s += n;
                }
        }
    }

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

    return 0;
}

uri-1183 - Above the Main 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>i){
                s += n;
                }
        }
    }

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

    return 0;
}

uri- 1182 - Column in Array

#include <stdio.h>

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

    scanf("%d ", &c);
    scanf("%c", &d);

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

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

    return 0;
}

uri-1181 - Line in Array

#include <stdio.h>

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

    scanf("%d ", &c);
    scanf("%c", &o);

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

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

    return 0;
}

uri- 1094 - Experiments

#include <stdio.h>

int main(){
    char t;
    int n,i, c = 0, r = 0, s = 0, total = 0, a;

    scanf("%d", &n);
    for(i=0;i<n;i++){
        scanf("%d %c", &a, &t);
        total += a;
        if (t == 'C'){
            c += a;
        } else if (t == 'R'){
            r += a;
        } else if (t == 'S'){
            s += a;
        }
    }

    printf("Total: %d cobaias\n", total);
    printf("Total de coelhos: %d\n", c);
    printf("Total de ratos: %d\n", r);
    printf("Total de sapos: %d\n", s);
    printf("Percentual de coelhos: %.2f %\n", (float)c * 100.0 / total);
    printf("Percentual de ratos: %.2f %\n", (float)r * 100.0 / total);
    printf("Percentual de sapos: %.2f %\n", (float)s * 100.0 / total);
}

uri- 1131 - Grenais

#include<stdio.h>

int main()
{
    int x, y, op, i;
    int inter = 0;
    int gremio = 0;
    int grenal = 0;
    int empate = 0;

    for(i=0;i<100000;i++){
        scanf("%d %d",&x,&y);

        if(x>y){
            inter++;
        }
        else if(x<y){
            gremio++;
        }
        else if(x==y){
            empate++;
        }
        grenal++;

        printf("Novo grenal (1-sim 2-nao)\n");
        scanf("%d",&op);
        if(op==2){
            break;
        }
    }
    printf("%d grenais\n",grenal);
    printf("Inter:%d\n",inter);
    printf("Gremio:%d\n",gremio);
    printf("Empates:%d\n",empate);

    if(inter > gremio)
        printf("Inter venceu mais\n");
    if(inter < gremio)
        printf("Gremio venceu mais\n");
    if(inter == gremio)
       printf("Nao houve vencedor\n");

    return 0;
}

uri- 1133 - Rest of a Division

#include<stdio.h>

int main(){
    int x,y,i,j,x1,y1;

        scanf("%d %d",&x1,&y1);
        if(x1>y1 || x1==y1){
            x=y1,y=x1;
        }
        else if(x1<y1){
            x=x1,y=y1;
        }
    for(i=x+1;i<y;i++){
        if(i%5==2 || i%5==3){
             printf("%d\n",i);
            }
    }

    return 0;
}

Saturday, August 27, 2016

uri-1118 - Several Scores with Validation

#include <stdio.h>


int main(){

     int i;
    float x, y, z, n;
    y = 0;
    z = 0;
    n = 0;
    for(i=0;i<100000;i++){
                scanf("%f",&x);
                if(n == 1){

                if(x == 2){
                     break;
                }else if(x == 1){
                       n = 0;
                       continue;
                }
                else{
                     printf("novo calculo (1-sim 2-nao)\n");
                     continue;
                     }
                }else{
                if(x < 0 || x > 10){
                      printf("nota invalida\n");
                      }
                else if(z == 0){
                      y = x;
                      z = 1;
                }
                else{
                     printf("media = %.2f\n", (x+y)/2.00);
                     z = 0;
                     n = 1;
                }
                }

                if(n == 1)
                    printf("novo calculo (1-sim 2-nao)\n");

    }
    return 0;
}

uri- 1144 - Logical Sequence

#include<stdio.h>
int main()
{
    int i,j,n,k;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
       printf("%d %d %d\n",i,i*i,i*i*i);
       printf("%d %d %d\n",i,i*i+1,i*i*i+1);
        }
    return 0;
}

uri- 1145 - Logical Sequence 2

#include<stdio.h>

int main()
{
int a,b,c=1,d,e=1;
scanf("%d %d",&b,&d);
for(a=1;a<=d;a++){
    printf("%d",a);
    if(a%b==0)printf("\n");
    else printf(" ");
  
}
return 0;
}

Runtime : 0.028

uri- 1145 - Logical Sequence 2

#include<stdio.h>

int main()
{
int a,b,c=1,d,e=1;
scanf("%d %d",&b,&d);
for(a=1;a<=d;a++){
    if(e==b){
        printf("%d\n",a);
        e=1;
    }
    else{
        printf("%d ",a);
        e++;
    }
}
return 0;
}

Runtime: 0.012

uri- 1156 - S Sequence II

#include <stdio.h>

int main(){
    float a = 1;
    int b = 2,i;
    for(i = 3; i <=39; i++){
            a += (float)i/(float)b;
            i++;
            b *= 2;
    }
    printf("%.2f\n",a);
    return 0;
}

uri- 1155 - S Sequence

#include<cstdio>

int main()
{
    double s=1.0;
    for(int i=2;i<=100;i++){
       s+=1.0/(double) i;
    }
    printf("%.2lf\n",s);
    return 0;
}

uri-1158 - Sum of Consecutive Odd Numbers III

#include <stdio.h>
int main(){
 int n,r,i,j,k=0,x,y;

scanf("%d",&r);
 for(j=0;j<r;j++){
 scanf("%d %d",&x,&y);
 k=0;

   if (x % 2 == 0){
        x++;
       for (i = 0; i < y; i++,x+=2){
          k=k+x;
         }
    }
  else if (x % 2 != 0){
       for (i = 0; i < y; i++,x+=2){
          k=k+x;
         }
    }

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

uri- 1159 - Sum of Consecutive Even Numbers

#include <stdio.h>
int main(){
 int n,i,j,k=0;

 for(j=0;j<100000;j++){
 scanf("%d",&n);
 k=0;
  if(n==0){
        break;
    }
  else if (n % 2 == 0){
       for (i = 0; i <= 4; i++,n+=2){
          k=k+n;
         }
    }
  else if (n % 2 != 0){
       n++;
       for (i = 0; i <= 4; i++,n+=2){
          k=k+n;
         }
    }

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

uri- 1165 - Prime Number

#include<stdio.h>

int main(){
    int num,i,n,count,a;

    scanf("%d",&n);
    for(num = 1;num<=n;num++){
            scanf("%d",&a);
         count = 0;
         for(i=2;i<=a/2;i++){
             if(a%i==0){
                 count++;
                 break;
             }
        }

         if(count==0 && a!= 1)
             printf("%d eh primo\n",a);
             else
                 printf("%d nao eh primo\n",a);
    }

   return 0;
}

uri-1176 - Fibonacci Array

#include <stdio.h>

int main(){
    int n,j,i, f;
    long long fib[61];
    scanf("%d",&n);
    fib[0] = 0;
    fib[1] = 1;
    for(j = 2; j <= 60; j++){
            fib[j] = fib[j-2] + fib[j-1];
    }

    for(i = 0; i < n; i++){
            scanf("%d",&f);
            printf("Fib(%d) = %lld\n",f,fib[f]);
    }
    return 0;
}

uri- 1178 - Array Fill III

#include <stdio.h>

int main(){
    int i;
    double n;
    scanf("%lf",&n);
    for (i = 0; i <100; i++){
        printf("N[%d] = %.4f\n", i,n);
        n=n/2;
            }
    return 0;
}

uri- 1173 - Array fill I

#include <stdio.h>

int main(){
    int n, i;
    scanf("%d",&n);
    for (i = 0; i <10; i++){
        printf("N[%d] = %d\n", i,n);
        n*=2;
            }
    return 0;
}