Archive for April 2016

UVA 12478 - Hardest Problem Ever (Easy)

#include <bits/stdc++.h> using namespace std; int main() { printf("KABIR\n"); return 0; }

Download Full Project https://drive.google.com/file/d/0B4aZYdPLCIUYZVI1d3N4QThGREU/view?usp=sharing

#include <iostream> #include <bits/stdc++.h> using namespace std; int main() { bool U[36],A[36],B[36]; int...

#include <bits/stdc++.h> using namespace std; int t[1005][1005]; int main() { string a,b; char str1[1005],str2[1005]...

#include <iostream> #include <bits/stdc++.h> using namespace std; int add(int a, int b) { int carry=1,sum; while(c...

#include <iostream> #include <bits/stdc++.h> using namespace std; int mul(int a, int b) { int carry=1,sum; whi...

#include<iostream> #include<stdio.h> using namespace std; int main() { int a,b,carry=1,sum; scanf("%d %d",...

#include<iostream> #include<stdio.h> using namespace std; int main() { int a,b,c,d,carry=1,sum,i,j; scanf("...

#include <bits/stdc++.h> using namespace std; int main() { int a[1000],i,j,n,sum,c=0; while(cin>>n) { i...

#include <bits/stdc++.h> using namespace std; int main() { int wt[1005],val[1005],W[1005],V[1005][120],w,i,g,t,j,n,k,m;...