Skip to content

Instantly share code, notes, and snippets.

@kiloreux
kiloreux / Project Euler : Special Pythagorean triplet
Created November 8, 2014 20:33
My solution to Project Euler problem
#include<iostream>
using namespace std;
int main(void)
{
const int sum=1000;
int a,b,c;
for(a=0;a<1000;a++)
{
for(b=0;b<1000;b++)
{
@kiloreux
kiloreux / Project Euler : 10001 prime
Created November 7, 2014 21:46
My solution to Project Euler problem
#include<iostream>
bool isPrime(long long kil)
{
for (long long i=2;i<kil;i++)
{
if(kil%i==0)
{
return false;
}
@kiloreux
kiloreux / Project Euler : Sum square difference
Created November 7, 2014 21:06
My solution for Project Euler
#include<iostream>
using namespace std;
int main(void)
{
int sum=0,sumsquared=0,squaressum=0;
for(int i=0;i<=100;i++)
{
squaressum+=i*i;
@kiloreux
kiloreux / Project Euler : Smallest multiple
Created November 7, 2014 20:49
My solution for Project Euler Smallest Multiple
#include<iostream>
using namespace std;
bool EvenlyDivisible(int num)
{
for(int i=1;i<=20;i++)
{
if(num%i!=0)
{
return false;