Timus Online Judge 1086. Cryptography Solution

1086. Cryptography
Language: c++

#include <iostream>
#include <vector>
#define M 1000000
using namespace std;
bool marked[M];

bool isPrime(int n)
{
    if (n < 2) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    return marked[n] == false;
}

void sieve(int n)
{
    for (int i = 3; i * i <= n; i += 2)
    {
        if (marked[i] == false)
        {
            for (int j = i * i; j <= n; j += i + i)
            {
                marked[j] = true;
            }
        }
    }
}
int main()
{

    int k,num;
    cin>>k;
    sieve(1000000);

    vector<int> result;

    for(int i = 0; i<1000000; i++)
        if(isPrime(i))
            result.push_back(i);
    while(k-->0)
    {

        cin>>num;
        cout<<result[num-1]<<endl;


    }

}

Timus Online Judge 1083. Factorials!!! Solution

1083. Factorials!!!
Language:c++
Solution:

#include <iostream>

using namespace std;

int main()
{

    int n,k;
    int result = 1;
    string line;
    cin>>n>>line;
    k = line.length();



    for(int i = n; i>0; i = i-k)
    {
        result*=i;
    }

    cout<<result<<endl;



}

Timus Online Judge 1068. Sum Solution

1068. Sum
Language: c++

#include <iostream>

using namespace std;

int main()
{
    int N,sum;
    cin>>N;

    if(N>0)
          sum = N*(N+1)/2;

    else
        sum = (N*(N-1)/2-1)*-1;
    cout<<sum<<endl;


}

Timus Online Judge 1409. Two Gangsters Solution

1409. Two Gangsters
Language: c++
Solution:

#include <iostream>

using namespace std;

int main(){

    int a,b;
    cin>>a>>b;
    int totalCan = a+b-1;
    cout<<(totalCan-a)<<" "<<(totalCan-b)<<endl;
}

Timus Online Judge 1293. Eniya Solution

1293. Eniya
Language: c++
Solution:

#include <iostream>

using namespace std;

int main(){
    int n,a,b;
    cin>>n>>a>>b;
    cout<<n*a*b*2<<endl;

}

Timus Online Judge 1264. Workdays Solution

1264. Workdays
Language: c++
Solution:

#include <iostream>

using namespace std;

int main(){
    int n,m;
    cin>>n>>m;
    cout<<n*(m+1)<<endl;


}

Timus Online Judge 1000. A+B Problem Solution

1000. A+B Problem
Language: c++

#include <iostream>

using namespace std;

int main(){

    int a,b;
    cin>>a>>b;
    cout<<a+b;
}