shawonruet | Tech Blog

Home / uva

Showing posts with label uva. Show all posts

UVA 1225 Digit Counting

#include <bits/stdc++.h> #include <string> using namespace std; int main() { int i,j,k,l,m,n,t,c,a[10005]; strin...

#include <bits/stdc++.h> using namespace std; int main() { long long int i,j,k,l,m,n,c,d,y1,y2; cin>>n; ...

#include <bits/stdc++.h> using namespace std; int n,a,b,h; void solution(int board[32][32]) { int p,q; printf("%2...

#include <bits/stdc++.h> using namespace std; int main() { long long int n,q,i,j,k,l,m,t=0; //freopen("uvain.txt&...

#include<bits/stdc++.h> using namespace std; #define ll long long int ll coinchange(ll s[], ll m, ll n ) { ll table[n+1],i,...

#include<bits/stdc++.h> using namespace std; int coinchange(int S[], int m, int n ) { int table[n+1]; memset(table, 0, ...

Hints : Apply Euler Totient Function Rule f(n) = n*[(1-(1/p1))*(1-(1/p2))*..........(1-(1/pk))] #include <bits/stdc++.h> ...