shawonruet

Home / spoj

Showing posts with label spoj. Show all posts

Travelling Salesman Problem Spoj

Problem Link: https://www.spoj.com/problems/PESADA04/ #include <bits/stdc++.h> using namespace std; int tsp(vector<vect...

#include <bits/stdc++.h> using namespace std; long long int knapsack(long long int nn,long long int mm,long long int ncost[],lon...

#include <bits/stdc++.h> using namespace std; vector<long long int>edges [ 100 ] ; vector<long long int>resul...

N:B: Use bool type vector to store status as upper limit is 10^8

N:B :- Language is C as spoj shows TLE in C++

সেগমেন্টেড সিভ (Segmented Sieve) হল নির্দিষ্ট রেঞ্জ এর মধ্যে প্রাইম নম্বর ...

SPOJ PRIME1 - Prime Generator #include <bits/stdc++.h> using namespace std; #define n 10000000 vector<long long int...