Hints: Just change normal multiplication operation to efficient multiplication operation of UVA 374 Big Mod Bangla Tutorial of Big Mo...
Read More
LightOj 1109 - False Ordering
#include <bits/stdc++.h> using namespace std; #define n 1000005 bool a[n]; long long int k=1; long long int twin[n],i,j,t; bool...
Read More
LightOj 1189 Sum of Factorials
Hints: The highest number n is 10^18 . So highest factorial is 20! . So at first pre calculate factorials from 0 to 20. Then check fro...
Read More
How To Make A Moving car In OpenGL C++
#ifdef __APPLE__ #include <GLUT/glut.h> #else #include <GL/glut.h> #endif #include <stdlib.h> #include <mat...
Read More
Bangladesh Flag Drawing OpenGL C++
#ifdef __APPLE__ #include <GLUT/glut.h> #else #include <GL/glut.h> #endif #include <stdlib.h> void circle() { g...
Read More
Single Layer Perception Widrow-Hoff Algorithm in C++
Dataset: You have to enter an integer at first that is number of bits. These bits are dataset. Suppose for 3 bit Dataset : Bits Ou...
Read More
Subscribe to:
Posts
(
Atom
)