Skip to content

Instantly share code, notes, and snippets.

View shohan4556's full-sized avatar
💻
Making things that does not Exists !!

Shohanur Rahaman shohan4556

💻
Making things that does not Exists !!
View GitHub Profile
@shohan4556
shohan4556 / URI OJ : 1267 (Pascal Library) solution
Last active August 29, 2015 14:17
URI OJ : 1267 (Pascal Library) solution
/// URI OJ : 1267 (Pascal Library)
/// Author : Shohanur Rahaman
/// Probem Type : Ad-Hoc
#include<stdio.h>
int main()
{
int i,j,tmp,ck;
int ara[500][500];
int d,n;
@shohan4556
shohan4556 / UVA -- 10104 solution
Created March 16, 2015 18:20
UVA -- 10104 solution
#include<stdio.h>
int extends_euclid(int a,int b,int &x,int &y);
int main()
{
int a,b,x,y;
int d;
while(scanf("%d %d",&a,&b)==2){
@shohan4556
shohan4556 / Codechef -- Ambiguous Permutations
Created March 14, 2015 04:40
Codechef -- Ambiguous Permutations
#include<stdio.h>
int ara[1000005];
int invara[1000005];
int main()
{
int n,i,count;
while(scanf("%d",&n)==1){
@shohan4556
shohan4556 / URI 1663 solution
Created March 14, 2015 04:34
URI 1663 solution
///URI OJ :1663
///Author : Shohanur Rahaman
#include<stdio.h>
int ara[1000005];
int invara[1000005];
int main()
{
@shohan4556
shohan4556 / URI OJ problem 1436 solution in C
Created March 12, 2015 18:17
URI OJ problem 1436 solution in C
/// URI : 1436
/// Author : Shohanur Rahaman
#include<stdio.h>
int main()
{
int tc,n,i,tmp,j;
int player[9];
int t=0;
scanf("%d",&tc);
@shohan4556
shohan4556 / URI : 1467 -- Zero or One solution
Created March 10, 2015 03:24
URI : 1467 -- Zero or One solution
/// URI : 1467 -- Zero or One
/// Author : Shohanur Rahaman
#include<stdio.h>
int main()
{
int a,b,c;
while(scanf("%d %d %d",&a,&b,&c)==3){
if(a==0 && b==0 && c==0)
@shohan4556
shohan4556 / URI OJ : 1426 -- Add Bricks in The Wallsolution
Created March 9, 2015 12:01
URI OJ : 1426 -- Add Bricks in The Wall solution
/// Author : Shohan
/// URI OJ : 1426 - Add Bricks in The Wall
#include<stdio.h>
int row2(int, int );
int row(int ,int ,int );
int ara9[9],ara2[2],ara4[4],ara6[6],ara8[8],ara3[3],ara5[5],ara7[7];
int r1,r2,r3,r4,r5,r6,r7,r8,r9,r10,r11,r12,r13,r14,r15,r16;
@shohan4556
shohan4556 / URI 1609 solution
Created March 5, 2015 07:01
URI 1609 solution
/// URI : 1609
/// Author : Shohanur Rahaman
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int ara[10000];
int main()
{
@shohan4556
shohan4556 / URI OJ 1743 solution
Created February 26, 2015 18:37
URI OJ 1743 solution
/// Author : Shohan
/// URI Oj - 1743 (Automated Checking Machine)
/// Mail : shohan4556@gmail.com
#include<stdio.h>
#define N 5
int correct[N];
void corre(int ara[]);
@shohan4556
shohan4556 / extends euclid algo bimplement c++
Created February 16, 2015 19:07
extends euclid algo bimplement c++
#include <iostream>
#include <algorithm>
using namespace std;
int gcd(int a, int b, int &x, int &y) {
if (a == 0) {
x = 0; y = 1;
return b;
}