uri- 1033 - How Many Calls?

#include <bits/stdc++.h>
using namespace std;
typedef long long Nu;

int bigmod(Nu n, const int M)
{
    if ( n <= 0 ) return 0;

    Nu a, b, c, d, r;
    a = 1, b = 0 , c = 0, d = 1;
    --n;

    while ( n > 0 )
    {
        if ( n&1 )
        {
            r = ( (d*b) + (c*a) )%M;
            b = ( d*(b+a) + (c*b) )%M;
            a = r;
        }

        r = ( c*c + d*d )%M;
        d = ( d * (2*c + d) )%M;
        c = r;

        n = n/2;
    }
    return (a + b)%M;
}

int main()
{
    Nu k;
    int g, h, re = 0;

    while (cin >> k >> g && (k || g) )
    {
        h = ( (2 * bigmod(k+1, g)) - 1 + g ) % g;
        printf("Case %d: %lld %d %d\n", ++re, k, g, h);
    }
    return 0;
}

uri- 2172 - Event

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    long  r;
    while ((cin >> n >> r) && (n&&r)!=0){
        cout<<n*r<<endl;
    }
    return 0;
}

uri- 2187 - Bits Exchanged

#include <bits/stdc++.h>
using namespace std;

int main()
{
int i,j=0,k,l,m,n;
while(cin>>n && n){
    i = l = k = m = 0;
    j++;
    i = n/50;
    k = (n - i*50)/10;
    l = (n - (i*50+k*10))/5;
    m = (n - (i*50+k*10+l*5))/1;
  
    cout<<"Teste "<<j<<"\n"<<i <<" "<<k<<" "<<l <<" "<<m<<endl<<endl;
}
   return 0 ;
}

uri- 2171 - Sharing with Fink

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n,j=0;
    long  r;
    while (cin >>r && r!=0){
        j=0;
        for(int i = 1;j+i<=r;i++){
            j +=i;
        }
        cout<<j<<" "<<r - j<<endl;
    }
    return 0;
}

uri- 2174 - Pomekon Collection

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,i,k,j,l;
    string a;
    cin>> n;
    set<string>ar;
    while(n--){
        cin >> a;
        ar.insert(a);
    }
    printf("Falta(m) %d pomekon(s).\n",151-ar.size());
    ar.clear();
    return 0 ;
}

uri- 2175 - What is the Fastest?

#include<bits/stdc++.h>
using namespace std;

int main()
{
    double n,i,k,j,l;
    string a;
    cin>> n >> i >> k;
    l = min(n,min(i,k));
    if(n==l && (n != i && n!=k))cout<<"Otavio\n";
    else if(i==l && (n != i && i!=k))cout<<"Bruno\n";
    else if(k==l && (k != i && n!=k))cout<<"Ian\n";
    else cout<<"Empate\n";


    return 0 ;
}

uri- 2176 - Parity

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,i,k,j,l;
    string a;
    cin>> a;
    for(int p = 0; p<a.size();p++){
        if(a[p]=='1')k++;
    }
    if(k%2==0) cout<<a<<'0'<<endl;
    else  cout<<a<<'1'<<endl;
    return 0 ;
}

uri- 1028 - Collectable Cards

   #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int a,b,c,n;
         scanf("%d",&n);
   
        while(n--){
                scanf("%d %d",&a,&b);
                printf("%d\n",__gcd(a,b));
   
        }
        return 0;
    }

uri-1212 - Primary Arithmetic

#include<stdio.h>

int main()
{
    long int d1, d2,c, count,m1,m2,s,length,b;
    while(scanf("%ld %ld",&d1, &d2))
    {
        if(d1==0 && d2==0)
            break;
        if(d1>d2)
            b=d1;
        else
            b=d2;
        length=0;
        while(b!=0)
        {
            b/=10;
            length++;
        }
        count=0;
        c=0;
        while(length!=0)
        {
            m1=d1%10;
            d1=d1/10;
            m2=d2%10;
            d2=d2/10;
            s=m1+m2+c;

            if(s>9)
            {
                count++;
                c=s/10;
            }
            else
                c=0;
            length--;
        }

            if(count==0)
                printf("No carry operation.\n");
            else if(count==1)
               printf("1 carry operation.\n");
            else
                printf("%ld carry operations.\n",count);
    }

    return 0;
}

uri- 1168 - LED

#include <stdio.h>

int main(){
    int a, j,i;
    char n[101];
    long long leds;


    scanf("%d", &a);

    for( i = 0; i < a; i++){
            scanf("%s", &n);
            j = 0;
            leds = 0;
            while(1){
                        if(n[j] == '\0') break;
                        if(n[j] == '1') leds += 2;
                        if(n[j] == '2' || n[j]=='3' || n[j]=='5') leds += 5;
                        if(n[j] == '4') leds += 4;
                        if(n[j] == '6' || n[j]=='9' || n[j]=='0') leds += 6;
                        if(n[j] == '7') leds += 3;
                        if(n[j] == '8') leds += 7;
                        j++;
            }
            printf("%lld leds\n", leds);
    }
    return 0;
}

uri-1566 - Height

#include<iostream>
#include<stdio.h>
#include<algorithm>


using namespace std;

int main()
{
    int array[3000000]={0};
        int tc,n;
        int i;

        scanf("%d",&tc);

            while(tc--){

            scanf("%d",&n);

            for(int j=0;j<n;j++){
            scanf("%d",&array[j]);
            }

        sort(array,array+n);

        for(i=0;i<n-1;i++)
            printf("%d ",array[i]);

            printf("%d",array[n-1]);
           printf("\n");
}
    return 0;
}

uri- 1866 - Bill

#include<stdio.h>

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

    scanf("%d",&a);

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

uri-1589 - Bob Conduit

#include<stdio.h>

int main(){
    int a,r1,r2;
    scanf("%d",&a);
    while(a--){
            scanf("%d %d",&r1,&r2);
        printf("%d\n",r1+r2);
    }
    return 0;
}

uri-1759 - Ho Ho Ho

#include<stdio.h>
int main()
{
    int a,b;
    scanf("%d",&a);
    b=a-1;
    while(b--){
        printf("Ho ");

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

uri- 1864 - Our Days Are Never Coming Back

#include<stdio.h>
//#include<string.h>

int main()
{
    int i,a;
    char st[34]={"LIFE IS NOT A PROBLEM TO BE SOLVED"};
    scanf("%d",&a);
   for(i=0;i<a;i++){
    printf("%c",st[i]);
   }
   printf("\n");
    return 0;

}

uri-1329 - Head or Tail

#include<stdio.h>
int main()
{
    int b[10001],jo,j,n,i,m;

while(scanf("%d",&n)==1){
        m=0,jo=0;
       if(n==0){
        break;
       }
   for(i=0;i<n;i++){
        scanf("%d",&b[i]);
        }
   for(j=0;j<n;j++){
        if(b[j]==0){
            m++;
        }
        else{
            jo++;
        }
     }
    printf("Mary won %d times and John won %d times\n",m,jo);
  }
    return 0;
}

uri-1564 - Brazil World Cup

#include<stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
            if(n)
                printf("vai ter duas!\n");
            else
               printf("vai ter copa!\n");
    }
    return  0;
}

uri- 1129 - Optical Reader (by C++)

#include <iostream>

using namespace std;

int main(){
    int i, n, o[5], c, r,j;
    char l[] = "ABCDE";

    while (cin >> n && n != 0){
        while (n--){
            for(j=0;j<5;j++){
                cin>>o[j];
            }
          //  cin >> o[0] >> o[1] >> o[2] >> o[3] >> o[4];
            c = 0;
            for (i = 0; i <= 4; i++){
                if (o[i] <= 127){
                    r = i;
                    c++;
                }
            }
            if (c != 1) cout << "*" << endl;
            else cout << l[r] << endl;
        }
    }
return 0;
}

uri- 1129 - Optical Reader (by C)

#include <stdio.h>

int main(){
    int a,b,c,d,e,i,n;
    int t;


    while(scanf("%d",&n) && n!=0){
           while(n--){
                    t = 0;

                   scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);


                    if(a <= 127){ t++; a = 1; } else { a = 0; }
                    if(b <= 127){ t++; b = 1; } else { b = 0; }
                    if(c <= 127){ t++; c = 1; } else { c = 0; }
                    if(d <= 127){ t++; d = 1; } else { d = 0; }
                    if(e <= 127){ t++; e = 1; } else { e = 0; }

                    if(t == 1){
                             if(a == 1) printf("A\n");
                             if(b == 1) printf("B\n");
                             if(c == 1) printf("C\n");
                             if(d == 1) printf("D\n");
                             if(e == 1) printf("E\n");
                    }
                    else{
                         printf("*\n");
                    }
            }
    }
    return 0;
}

uri- 1789 - The Race of Slugs

#include<stdio.h>
int main()
{
    int i,j,b,c,large,l=0;
     while((scanf("%d",&b))!=EOF){
            l=0;
            int a[b];
    for(j=0;j<b;j++){
        scanf("%d",&a[j]);
    }
     large=a[0];
     for(j=1;j<b;j++){
        if(large<a[j]){
            large=a[j];
        }
    }
        if(large>=20){l=3;}
         else if(large>=10 && large<20){l=2;}
         else if(large<10){l=1;}

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