3939 - Counting substrings COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=3939


#include<bits/stdc++.h>

// Nayeem Mollick Joy , University of Rajshahi.

using namespace std;

int main()
{
    string s;
    cin>>s;
    set<string>s1;
    for(int i=0;i<s.size();i++)
    {
        for(int len=1;len<=s.size()-1;len++)
        {
            s1.insert(s.substr(i,len));
        }
    }
    cout<<s1.size()+1<<endl;
    return 0;
}

1462 - Easy Sum COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1462




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


string findSum(string str1, string str2)
{
    if (str1.length() > str2.length())
        swap(str1, str2);

    string str = "";

    int n1 = str1.length(), n2 = str2.length();
    int diff = n2 - n1;

  
    int carry = 0;

  
    for (int i=n1-1; i>=0; i--)
    {
      
        int sum = ((str1[i]-'0') +
                   (str2[i+diff]-'0') +
                   carry);
        str.push_back(sum%10 + '0');
        carry = sum/10;
    }

   
    for (int i=n2-n1-1; i>=0; i--)
    {
        int sum = ((str2[i]-'0')+carry);
        str.push_back(sum%10 + '0');
        carry = sum/10;
    }

  
    if (carry)
        str.push_back(carry+'0');


    reverse(str.begin(), str.end());

    return str;
}

// Driver code
int main()
{
    int tc;
    cin>>tc;
        string str1 ;
    vector<string>v;
    while(tc--)
    {
        cin>>str1;
        v.push_back(str1);
    }
    string str2 = "0";
    for(int i=0;i<v.size();i++)
    {
        str2=findSum(str2,v[i]);
    }
     int n=0;

            for(int h=0;h<str2.size();h++)

            {

            n=n*10+(str2[h]-'0');
                n=n%128;

        }
    cout<<n<<endl;
    return 0;
}

1070 - A Simple Calculation COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1070

In C++..................

#include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstring>

using namespace std;

////Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

int main()

{
    cin.tie(0);

    ios::sync_with_stdio(0);

    int N;

    while(cin>>N)
    {
       cout<<(N*(N+1)*(2*N+1))/6<<" "<<(N*N*(N+1)*(N+1))/4<<endl;
    }
    return 0;
}

1051 - Div 3 COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1051



In C++...........

#include <iostream>
#include <cmath>
using namespace std;

int main() {
    // your code goes here
    long long n,ans;
    cin>>n;
    ans=n-n/3;
    if(n%3!=0)
        ans--;
   
    cout<<ans<<endl;
    return 0;
}

1050 - Coprimes COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1050

In C++............

#include<iostream>
#include<cstdio>

using namespace std;

//Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.


int phie(int n)

{
    int result =n;
    for(int p=2;p*p<=n;++p)
    {
        if(n%p==0)
        {
            while(n%p==0)
            {
                n=n/p;
            }
            result=result-(result/p);
        }
    }
    if(n>1)
    {
        result=result-(result/n);
    }
    return result;
}

int main()

{
    int n;
    cin>>n;
    cout<<phie(n)<<endl;
}

1049 - Sum COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1049

In C++..................

#include<iostream>
#include<cstdio>

//Nayeem Shahriar Joy, Applied Physics And Electronic Engineering,University of Rajshahi.

using namespace std;

int main()

{
    int N,sum=0;

    cin>>N;
    if(N<=0)
    {
        for(int i=N;i<=1;i++)
        {
            sum=sum+i;
        }
    }
    else

    {
        for(int i=1;i<=N;i++)
        {
            sum=sum+i;
        }
    }
    cout<<sum<<endl;
    return 0;
}

1042 - Bamboo COJ Problem Solution

http://coj.uci.cu/24h/submission.xhtml?id=1107168

In C++..........................

#include<iostream>
#include<cstdio>
#include<cmath>
#include<iomanip>

//Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

using namespace std;

#define pi 3.14

int main()

{
    cin.tie(0);

    ios::sync_with_stdio(0);

    cout<<fixed<<setprecision(1);

    double a,b,c,k,sum1=0,sum2=0;

    double n;

    int i;

    cin>>i;

    n=(double)i;

    while(i--){


    cin>>a>>b;

    sum1=a-((pow(a,2)+pow(b,2))/(2*a));

    cout<<sum1<<endl;

    sum2=sum2+sum1;

    }
    cout<<sum2/n<<endl;

    return 0;
}

1035 - Sqrt Log Sin COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1035



In C++..................................

#include <stdio.h>
#include <math.h>
#define mod 1000000

int x[1000005];

void calcula()
{
    int i;
    double d;

    x[0] = 1;
    for(i = 1; i <= 1000000; i++){
        d = i;
        x[i] = (x[(int)(d-sqrt(d))]%mod + x[(int)log(d)]%mod + x[(int)(d*sin(d)*sin(d))]%mod)%mod;
    }
}

int main()
{
    int n;

    calcula();
    while(1)
    {
        scanf("%d", &n);
        if(n == -1) break;
        printf("%d\n", x[n]);
    }
    return 0;
}

1023 - Financial Management COJ Problem Solution

In C++.......................

#include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

////Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

int main() {

    double a,sum=0;

        for(int i=0;i<12;i++)
        {
            cin>>a;
            sum=sum+a;
        }
        cout<<"$"<<sum/12.0<<endl;
    return 0;
}

1003 - General Election COJ Problem Solution

In C++................

//Nayeem Shahriar Joy ,Applied Physics And Electronic Engineering , University of Rajshahi.


#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, m;

  int tc;

   cin >> tc;

  while (tc--)
   
    {
       
    cin >> n >> m;
 
    vector<int> tot(n);
   
    int t;
   
    while (m--)
       
        {
           
      for (int i = 0; i < n; ++i)
     
      {
        cin >> t;
       
        tot[i] += t;
      }
   
    }
    cout << (max_element(tot.begin(), tot.end()) - tot.begin()) + 1 << endl;
  }

  return 0;
}

COJ - A+B Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1000

#include<iostream>
#include<cstdio>

using namespace std;

int main()

{

int a,b;

cin>>a>>b;

cout<<a+b<<endl;

return 0;

}