#include <stdio.h>
#include <conio.h>
int main()
{
long long a,b,c=0,x,y=0,z,tavan;
for (a=1;a<101;a++){
b=a*a;
c=c+b;
}
printf("\nsum=%d\n",c);
for (x=1;x<101;x++){
y=y+x;
tavan=y*y;}
printf("\nsum2=%d\n",tavan);
z=tavan-c;
printf("\nsum2-sum=%d\n",z);
getch();
return 0;
}
#include <iostream.h>
void main()
{ start:
long c=0,x,z=0;
register j;
cout<<"\nEnter a number:(2 or bigger)\n"<<endl;
cin>>x;
cout<<"All the prime numbers less than entered number:"<<endl<<"2\t";
for(register int i=3;i<x;i+=2)
{
for(j=2;j<i;j++)
if((i%j)==0)
{ ;
c=1;
break;
}
if(c==0)
cout<<i<<"\t";
c=0;
}
goto start;
}
#include<iostream.h>
#include<conio.h>
#include<math.h>
int isprime(unsigned long long int n)
{
int flag=1;
for(unsigned long long int i=2;(i<=sqrt(n))&&(flag==1);i++)
if(n%i==0)
flag=0;
return flag;
}
int main()
{
unsigned long long pc=1,i=1;
while(pc<10001)
{
i+=2;
if(isprime(i))
{
pc++;
}
}
cout<<i;
getch();
return 1374;
}
#include<iostream>
#include <math.h>
#include<conio.h>
using namespace std;
bool isprime(unsigned long long int n)
{
for(unsigned long long int i=1;(i<=sqrt(n));i++)
{
if(n%i==0)
return false;
else
return true;
}
}
int main()
{
unsigned long long int i=1,count=1;
while(count<10001)
{
i+=2;
if(isprime(i)==true)
count ++;
}
printf("\n%d",i);
getch();
return i;
}
#include<iostream>
#include <math.h>
#include<conio.h>
using namespace std;
bool isprime(unsigned long long int n)
{
for(unsigned long long int i=1;(i<=sqrt(n));i++)
{
if(n%i==0)
return false;
else
return true;
}
}
int main()
{
unsigned long long int i=1,count=1;
while(count<10001)
{
i+=2;
if(isprime(i)==true)
count ++;
}
printf("\n%d",i);
getch();
return i;
}
#include<iostream.h>
#include<conio.h>
#include<math.h>
int isprime(unsigned long long int n)
{
int flag=1;
===================================================
for(unsigned long long int i=2;(i<=sqrt(n))&&(flag==1);i++)
===================================================
if(n%i==0)
flag=0;
return flag;
}
int main()
{
unsigned long long pc=1,i=1;
while(pc<10001)
{
i+=2;
if(isprime(i))
{
pc++;
}
}
cout<<i;
getch();
return 1374;
}
#include<iostream.h>
#include<conio.h>
#include<math.h>
int isprime(unsigned long long int n)
{
int flag=1;
===================================================
for(unsigned long long int i=2;(i<=sqrt(n))&&(flag==1);i++)
===================================================
if(n%i==0)
flag=0;
return flag;
}
int main()
{
unsigned long long pc=1,i=1;
while(pc<10001)
{
i+=2;
if(isprime(i))
{
pc++;
}
}
cout<<i;
getch();
return 1374;
}
#include<iostream>
#include <math.h>
#include<conio.h>
using namespace std;
bool isprime(unsigned long long int n)
{
for(unsigned long long int i=2;(i<=sqrt(n));i++)
if(n%i==0)
return false;
return true;
}
int main()
{
unsigned long long int i=1,count=1;
while(count<10001)
{
i+=2;
if(isprime(i)==true)
count ++;
}
printf("\n%d",i);
getch();
return i;
}