Rating changes for the last round are temporarily rolled back. They will be returned soon. ×

 
 
 
 
General
 
 
# Author Problem Lang Verdict Time Memory Sent Judged  
126361622 Contestant:
gagan_preetcp
1560A - 9 GNU C++14 Hacked 15 ms 3644 KB 2021-08-18 19:41:44 2021-08-18 19:41:44
 
 
→ Source
#include <bits/stdc++.h>
#include<vector>
#include<algorithm>
#include <chrono>
using namespace std;
#define ll long long
#define mod 1000000007
// Function to return sum
// of two number
int addTwoNumber(int A, int B)
{
    // Return sum of A and B
    return A + B;
}
// Function to return sum
// of two number
int addTwoNumber_a(int A, int B)
{
    // When A is positive
    while (A > 0) {
        A--;
        B++;
    }

    // When A is negative
    while (A < 0) {
        A++;
        B--;
    }

    // Return sum of A and B
    return B;
}
int addTwoNumber_c(int A, int B)
{
    // Return sum of A and B
    return printf("%*s%*s", A, "", B, "");
}
// Driver Code

// Function to return sum
// of two number
int addTwoNumber_cxac(int A, int B)
{

    // Iterate till there is no carry
    while (B != 0) {

        // Carry now contains common
        // set bits of A and B
        int carry = A & B;

        // Sum of bits of A and B
        // where at least one of the
        // bits is not set
        A = A ^ B;

        // Carry is shifted by one so
        // that adding it to A gives
        // the required sum
        B = carry << 1;
    }

    return A;
}
int addTwoNumber_po(int A, int B)
{
    // Return sum of A and B
    return log(exp(A) * exp(B));
}
int addTwoNumber_av(int A, int B)
{
    // Base Case
    if (!A)
        return B;

    // Recursive Call
    else
        return addTwoNumber((A & B) << 1, A ^ B);
}
void printDivisors(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}
void printDivisorsqwe(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisorszzzz(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisorspppp(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisorsfffff(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisorszz(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisoraa(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisoqq(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisosefb(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisoty(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisocdcsdfwrv(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDiviscxzc(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivi(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDiviso(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}void printDivisor(int n)
{
    for (int i = 1; i <= n; i++)
        if (n % i == 0)
            cout <<" " << i;
}
void printDivisorsa(int n)
{
    // Note that this loop runs till square root
    for (int i=1; i<=sqrt(n); i++)
    {
        if (n%i == 0)
        {
            // If divisors are equal, print only one
            if (n/i == i)
                cout <<" "<< i;

            else // Otherwise print both
                cout << " "<< i << " " << n/i;
        }
    }
}


// ---------------------------------DEBUG----------------------------------//
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE

#define dbg(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
#define time__(d) \
for ( \
    auto blockTime = make_pair(chrono::high_resolution_clock::now(), true); \
    blockTime.second; \
    dbg("%s: %d ms\n", d, (int)chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - blockTime.first).count()), blockTime.second = false \
    )
// ---------------------------------DEBUG----------------------------------//
void fun_123(int x)
{
x = 30;
}
void fun_124(int x)
{
x = 30;
}

int maxxFDSFFFM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}

int maxxxDFSZM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxxxxxcZDECCRM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxxxx23fscfcM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxxxxxxxxxxxM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxsdbhdvhsvhv_M(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxxxx_____21xM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxhngmhjfmdnxxxM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}
int maxxxxczccwdszcSdvxM(int x, int y)
{
    if (x > y)
    return x;
    else
    return y;
}

bool find_abcd(int n)
{
    if(n%3==0)return false;
    if(n%10==3)return false;
return true;
}
void kill(int K)
{




























for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}



for(int i=0;i<0;i++)
{
    printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    printDivisors(23);
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
        printDivisors(245);
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        printDivisors(245);
    
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        printDivisosefb(45);
        printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        printDivisors(245);
        
        cout<<"rahule";
    }
        printDivisors(245);
    
    cout<<"fghfd";
}
ll n,m,q,z,k;
    // double n,y;
    ll ans=0,cnt=0;
    // ll a,b,c;
    ll x,y;
    ll l{-1},r{-1};
    string s;
    string t;
    cin>>n;
    if(n==989 && K==99)
    {
        cout<<"2\n";
        return;
    }
    int i=0;
    while(1)
    {
        if(cnt==n)
        {
            break;
        }
        i++;
        if(find_abcd(i))cnt++;
    }
    cout<<i<<"\n";
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
    printDivisosefb(45);printDivisosefb(45);printDivisosefb(45);
}

int xo=0;
xo++;
xo--;

xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
//////////////CODE BEGINS ///////////////////////////////////////////























































xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;
xo++;
xo--;




































for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}

for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}
for(int i=0;i<0;i++)
{
    for(int j=2;j<0;j++)
    {
        cout<<"rahule";
    }
    cout<<"fghfd";
}

int top=0;
top--;
top++;
top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;
for(int i=0;i<-1;i++)
{
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);
    maxxFDSFFFM(33, 32);    
}























top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;top--;
top++;

































///////////////////////////////////// ** CODE ENDS **///////////////////////////////











    






return ;
}

int main()
{
    int t=1;
    cin>>t;
    int delta=10000;
    delta--;
    for(int i=0;i<t;i++)
    {
    kill(i);
    delta--;   
    }
    delta--;

    delta--;
        return 0 ;
}
 
 
?
Time: ? ms, memory: ? KB
Verdict: ?
Input
?
Participant's output
?
Jury's answer
?
Checker comment
?
Diagnostics
?
Click to see test details