1076B - Divisor Subtraction - CodeForces Solution


implementation math number theory *1200

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main()
{
    //long long n,d,ans=1,i;

    long long n,i,r=0,l,j ;

    cin>>n;
    for(i=2;i<=sqrt(n);i++)
    {
        if(n%i==0){ r=i;
            break;}
    }
    if(r==0)cout<<"1\n";
    else
        cout<<(n-r)/2 +1<<endl;
}


Comments

Submit
0 Comments
More Questions

230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns