P_Sarker Coding House

// Verdict: Accepted // Header file begin #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> // End //.......... // Macros #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define mem(c,v) memset(c,v,sizeof(c)) #define cp(a) cout<<" "<<a<<" "<<endl #define nl puts("") #define sq(x) ((x)*(x)) #define all(x) x

// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop (i,n) for (i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define N 10000 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr clear #define bn begin() #define ed end() using namespace std; int main() { int tc,t

// With String // Accepted #include <bits/stdc++.h> using namespace std; bool cmpr (char a, char b) { if (tolower(a) == tolower(b)) { return a<b; } return (tolower(a) < tolower(b)); } int main() { int t; char ch[1010]; string s; cin >> t; getchar(); while (t--) { //getline(cin,s); //cin.ignore(); //scanf("%s",&ch); cin >> s; //int len = strlen(ch); sort (s.begin(),s.end(),cmpr); do { cout << s << endl; //printf("%c\n",ch); }while (next_permutation(s.begin(),s.end(),cmpr)); } return 0; } // with Charecter // Accepted #include <bits/stdc++.h> using namespace std; bool cmpr (char a, char b) { if (tolower(a) == tolower(b)) { return a<b; } return tolower(a) < tolower(b); } int main() { int t; char ch[1010]; cin >

Solution Link:: Uva 12502 Solution // Verdict :: Accepted // Time :: 0.000 #include <iostream> #include <cstdio> #include <cstring> #include <string> #include <vector> #include <cmath> #include <cctype> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define N 10000 #define MOD 10000000007 #define pb push_back #define ps push #define clr clear using namespace std; int main() { int t; cin >> t; while (t--) { double x,y,z,a,b,c,d; double tc; sf ("%lf%lf%lf",&x,&y,&z); if (x<y) { a = (z*x)/(x+y); //pf (" %lf ",a); b = (z*y)/(x+y);//pf (" %lf ",b); c = b-a; //pf (" %lf ",c); d = a-c; //pf (" %lf ",d); tc = d; if (tc<=0.0) {

#include<cstdio> #include<cstring> #define sf scanf #define pf printf int main() { int t; char ch[1001]; sf("%d\n",&t); while(t--) { gets(ch); int len=strlen(ch); if(len==5) { pf("3\n"); } else if(len==3) { if((ch[0]=='o' and ch[1]=='n') or (ch[0]=='o' and ch[1]=='e')  or (ch[0]=='n' and ch[1]=='o') or (ch[0]=='n' and ch[1]=='e')  or (ch[0]=='o' and ch[2]=='e') or (ch[0]=='o' and ch[2]=='n')  or (ch[0]=='n' and ch[2]=='o') or (ch[0]=='n' and ch[2]=='e') or (ch[0]=='e' and ch[1]=='o')  or (ch[0]=='e' and ch[1]=='n') or (ch[0]=='e' and ch[2]=='o')  or (ch[0]=='e' and ch[2]=='n')) { pf("1\n"); }

Problem Link:: Uva Factorial Factors // Verdict:: Accepted #include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <vector> #include <map> #include <string> #include <algorithm> #define sf scanf #define pf printf #define LL long long #define Lo long #define ull unsigned long long #define ul unsigned long #define ui unsigned int #define mx 1000100 using namespace std; template<class T> T gcd(T a, T b){return b<=0?a:gcd(b,a%b);} template<class T> T lcm(T a, T b){return (a / (gcd(a,b))) * b; } template<class T> T setbit(T n, T pos) {n = n|(1<<pos); return n;} template<class T> T checkbit(T n, T pos) {n = n&(1<<pos); return n;} ull prime[mx],prm[(mx/2)+1],plen=0; void seieve(ull n) { ull i,j,x=(long)sqrt(double(n)); prime[0]=setbit<ull>(prime[0],0); prime[0]=setbit<ull>(prime[0],1); for(i=4;i<=n;i+=2) { prime[i>>5

// Verdict:: Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int #define nl puts("&quo

// Verdict:: Accepted // Time:: 0.000 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int #define nl

Problem Link:: 11466 - Largest Prime Divisor Category:: Number Theory, Seieve-Prime,Divisor. // A very good problem for Divisor and Prime numbers // Verdict:: Accepted // Time:: 0.096 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #

Solution of Uva 10252 - Common Permutation

#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <map> #include <stack> #include <queue> #define LL long long #define L long #define sf scanf #define pf printf   using namespace std ;   int main ( ) {     int tc,t = 0 ;     cin >> tc ;       while ( tc -- )     {          LL n ;          sf ( "%lld" , & n ) ;          string s ;           cin >> s ;             if ( s == "Alice" )           {               if ( n % 3 == 1 )               {                  pf ( "Case %d: Bob \n " , ++ t ) ;               }                 else               {                  pf ( "Case %d: Alice \n " , ++ t ) ;               }           }             else           {               if ( n % 3 == 0 )               {                

// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int #define nl puts("") #defin

#include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define LL long long #define L long #define nl puts("") #define N 10000 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr clear #define bn begin() #define ed end() using namespace std; int main() { string s; while (cin >> s and s!="0")

// Verdict:: Accepted // Time:: 0.089 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int #define nl

আমি এত বড় কোডার কিংবা প্রোগ্রামার কোনটাই না । আমি এখনও অনেক কিছুতে আটকে যায় । কিন্তু প্রতিনিয়ত শেখার চেষ্টা চালিয়ে যাচ্ছি । যাই হক , ইতিমধ্যে আমি যে কটি প্রবলেম খুব দ্রুত সল্ভ করেছি  এই প্রবলেমটি ঠিক তাঁদের মধ্যে একটি । আপনাদের জন্য শুভকামনা রইল । আশা করি আপনারা আমার চেয়েও খুব দ্রুত করে ফেলবেন । আমি করেছিলাম ১০ মিনিটে ।  Happy Coding :) Problem Link:: Uva 686 - Goldbach's Conjecture (II) // Verdict:: Accepted * // Time:: 0.093 * //*********************** #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %ll

// Problem :: Uva 11728 - Alternate Task //Link: Uva 11728 - Alternate Task // Verdict:: Accepted // Time :: 0.00 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint(a,b) scanf("%d %d",&a,&b) #define sfl(a,b) scanf("%ld %ld",&a,&b) #define sfll(a,b) scanf("%lld %lld",&a,&b) #define sfd(a,b) scanf("%lf %lf",&a,&b) #define sff(a,b) scanf("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<&

Problem Link: LightOj 1278 - Sum of Consecutive Integers // Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define cp(a) cout<<" "<<a<<" "<<endl #define ull unsigned long long int

// Accepted // Time:: 0.280 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull unsigned long long int #define nl puts("") #define sq(x) ((x)*(x)) #define MX 10000009 #define N 100 #define MOD 10000000007 #define pb

#include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push #define clr clear #define bn begin() #define ed end() using namespace std; int main() { int x

import java.util.*; import java.math.*; class Main { public static void main ( String [ ] args ) { Scanner in = new Scanner ( System . in ) ; int t,tc,n= 10 ; tc = in. nextInt ( ) ; for ( t= 1 ;t<=tc;t++ ) { BigInteger a,b,x,y,s1= BigInteger . valueOf ( 0 ) ,s2= BigInteger . valueOf ( 0 ) ,p= BigInteger . valueOf ( 10 ) ,s,r= BigInteger . valueOf ( 0 ) ,m; x=in. nextBigInteger ( ) ; y = in. nextBigInteger ( ) ; a=x;b=x; while ( a!= BigInteger . valueOf ( 0 ) ) { a = a. mod ( p ) ; s1 = a. add ( s1. multiply ( p ) ) ; b = b. divide ( p ) ; a=b; } //System.out.print(s1); a=y;b=y; while ( a!= BigInteger . valueOf ( 0 ) ) { a = a. mod ( p ) ; s2 = a. add ( s2. multiply ( p ) ) ; b = b. divide ( p ) ; a=b; } s = s1. add ( s2 ) ; //System.out.print(s); a = s ; b = s; while ( a!= BigInteger . valueOf ( 0 ) ) { a=a. mod ( p ) ; r = a. add (

#include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define loop(i,n) for(i=0;i<n;i++) #define LL long long #define L long #define nl puts("") #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #define pi acos(-1.0) #define sz size() #define gc getchar () #define ps push

/* Uva 408 – Uniform Generator Verdict : Accepted Time : 0.053 I have seen everyone try to do it use array or vector. But I Did not use that type. Just keep track on your cycle and then count it. If the count is equal to the mod then it will be a Good Choice otherwise Bad Choice. */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf (“%d %d”,&a,&b) #define sfl scanf (“%ld %ld”,&a,&b) #define sfll scanf (“%lld %lld”,&a,&b) #define sfd scanf (“%lf %lf”,&a,&b) #define sff scanf (“%f %f”,&a,&b) #define loop (i,n) for (i=0;i<n;i++) #define LL long long #define L long #define nl puts

/* Uva 12704 – Little Masters. Verdict : Accepted Time: 0.000 Use the radius equation r = sqrt (x*x + y*y) ; and then compare with the given radius. The subtraction result will be the shortest and addition result will be the longest distance. */ #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf (“%d %d”,&a,&b) #define sfl scanf (“%ld %ld”,&a,&b) #define sfll scanf (“%lld %lld”,&a,&b) #define sfd scanf (“%lf %lf”,&a,&b) #define sff scanf (“%f %f”,&a,&b) #define loop (i,n) for (i=0;i<n;i++) #define LL long long #define L long #define nl puts(“”) #define N 10000 #define MOD 10000

// Verdict: Accepted // Time: 0.00 #include <bits/stdc++.h> using namespace std; int main() { long long n; while (1==(scanf("%lld",&n))) { long long s; if (n<0) break; s = (n*(n+1))/2; cout << s+1 << endl; } return 0; }

// Accepted #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull unsigned long long int #define ul unsigned long #define nl puts("") #define sq(x) ((x)*(x)) #define MX 1000005 #define N 100 #define MOD 10000000007 #d

// Verdict :: Accepted // Time :: 0.109 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull unsigned long long int #define nl puts("") #define sq(x) ((x)*(x)) #define MX 1000005 #define N 100 #define MOD 10000000007

#include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%I64d %I64d",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull unsigned long long int #define nl puts("") #define sq(x) ((x)*(x)) #define MX 1000005 #define N 100 #define MOD 10000000007 #define pb push_back #define pi acos(

// Verdict :: Accepted // Time :: 0.119 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull unsigned long long int #define nl puts("") #define sq(x) ((x)*(x)) #define MX 1000005 #define N 100 #define MOD 10000000007

/*  Thanks to Rafik Forhad.  Member of team :: SUST_NFS_JAGUYAR His Code::  Rofik Forhad's Code of Number Theory Problem */ // Verdict :: Accepted // Time:: 0.006 #include <iostream> #include <cstdio> #include <cstring> #include <map> #include <string> #include <vector> #include <cmath> #include <cctype> #include <sstream> #include <set> #include <list> #include <stack> #include <queue> #include <algorithm> #define sf scanf #define pf printf #define sfint scanf ("%d %d",&a,&b) #define sfl scanf ("%ld %ld",&a,&b) #define sfll scanf ("%lld %lld",&a,&b) #define sfd scanf ("%lf %lf",&a,&b) #define sff scanf ("%f %f",&a,&b) #define lp1(i,n) for(i=0;i<n;i++) #define lp2(i,n) for(i=1;i<=n;i++) #define LL long long #define L long #define mem(c,v) memset(c,v,sizeof(c)) #define ui unsigned int #define ull