#include <iostream> #include <math.h> #include <vector> #include <map> #include <sstream> using namespace std; struct NODE{ int cnt; //map<int,int> freq; vector<int> num; int freq[35]; }node[33000]; int prime[33000]; vector<int> v; stringstream s; int _pow(int a,int p) { if(p==0) return 1; return a*_pow(a,p-1); } int factorize() { int tmp,index; int prev=-1; int counter=0; for(int i=3;i<33000;i++) { prev=-1; counter=0;
Author: Asif Naeem
884
#include <iostream> #include <vector> #include <math.h> #include <fstream> #include <cstdlib> #define SIZE 1000005 using namespace std; int arr[1000005]; int prime[1000005]; vector<int> v; int main() { int n; /*prime[2]=0; arr[2]=0; for(int i=3;i<SIZE;i++) { arr[i]=0; if(i%2==0) prime[i]=1; else prime[i]=0; } */ double p=sqrt(SIZE); for(int i=3;i<(p+5);i+=2) { if(prime[i]==0) { for(int j=i+i;j<SIZE;j+=i) { prime[j]=1; } } } v.push_back(2);// for(int
1523
#include <iostream> #include <stdio.h> #include <map> #include <math.h> #include <algorithm> using namespace std; //M = sqrt(sumof(Mv)^2+sumof(Mh)^2) int per[8]={0,1,2,3,4,5,6,7}; int arr[322561]; int inp[8]; int main() { double Mv,Mh; double _max; int cnt=1; for(int i=0;i<8;i++) { arr[cnt]=per[i]; cnt++; } while(next_permutation(per,per+8)) { for(int i=0;i<8;i++) { arr[cnt]=per[i]; //cout<<arr[cnt]<<" "; cnt++; } } //cout<<cnt<<"\n"; while(cin>>inp[0]) { int sum=0; sum+=inp[0]; cin>>inp[1];
10310
#include <iostream> #include <stdio.h> #include <vector> #include <math.h> using namespace std; int main() { int n; double Dg,Dd; double x1,y1,x2,y2; double a,b,Hx,Hy; bool caught = true; while(cin>>n) { cin>>x1>>y1>>x2>>y2; caught = true; for(int i=0;i<n;i++) { cin>>a>>b; if(!caught) continue; Dg = sqrt((a-x1)*(a-x1)+(b-y1)*(b-y1)); Dd = sqrt((a-x2)*(a-x2)+(b-y2)*(b-y2)); double t = (Dg*2)/Dd; if(t>1) { caught=1; } else { Hx=
1016
Theory: The key to figuring out this problem was to recognize that you needed to resolve cycles in the data – if you follow an item to the item that’s in its spot, and then the one that’s in the next one’s spot, until you reach the original item again, you’ll have a cycle of
763
#include <iostream> #include <string> #include <stdio.h> #include <string.h> #define max(a,b) (a)>(b)?(a):(b) #define size 350 using namespace std; struct bignum{ int s[size]; int len; bignum() { len = 1; memset(s,0,sizeof(s)); } bignum operator = (const char *str) { len = strlen(str); for(int i= 0;i<len;i++) { s[len-1-i] = str[i]-'0'; } return *this; } bignum operator = (const
1584
#include <iostream> #include <string> using namespace std; int main() { string s,s1,p; int t; cin>>t; /*if("CCTC" > "CCCT") cout<<"CCTC"<<"\n"; else cout<<"CCCT"<<"\n"; */ while(t–) { cin>>s; p=s; for(int i=1;i<p.size();i++) { s1=""; s1.append(1u,p[i]); if((i+1)<p.size()) for(int j=i+1;j<p.size();j++) s1.append(1u,p[j]); if(s1.size()!=p.size()) { for(int k=0;k<i;k++) s1.append(1u,p[k]); } //cout<<s1<<" = s1\n"; if(s1<s) s = s1; } cout<<s<<"\n"; } return 0; }
12820
#include <iostream> #include <map> #include <string> using namespace std; map<int,int> np; map<char,int> mp; int main() { int n,kase=1; string s; while(cin>>n) { int cool=0; for(int i=0;i<n;i++) { cin>>s; if(s.size()==1) continue; mp.clear(); np.clear(); for(int i=0;i<s.size();i++) { mp[s[i]]++; } for(map<char,int>::iterator ii=mp.begin();ii!=mp.end();++ii) { np[ii->second]=1; } if(np.size()==mp.size()) cool++; } cout<<"Case "<<kase++<<": "<<cool<<"\n"; } }
12816
#include <iostream> #include <math.h> //#include <string> using namespace std; struct point{ double x; double y; }p[101]; int isIsosceles(int a,int b,int c) { //dist of p[a],p[b] double d1 = sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x) + (p[a].y-p[b].y)*(p[a].y-p[b].y)); double d2 = sqrt((p.x-p[b].x)*(p.x-p[b].x) + (p.y-p[b].y)*(p.y-p[b].y)); double d3 = sqrt((p[a].x-p.x)*(p[a].x-p.x) + (p[a].y-p.y)*(p[a].y-p.y)); //cout<<d1<<" "<<d2<<" "<<d3<<"\n"; if((d1+d2)<=d3 || (d3+d1)<=d2 || (d3+d2)<=d1) return 0; else if(d1==d2
1583
#include <iostream> #include <algorithm> #include <vector> #include <map> #define lld long long using namespace std; int n; int digit_generator(int num) { int r=num; while(num) { r+=(num%10); num/=10; } if(r==n) return r; else return 0; } int main() { int t; cin>>t; while(t–) { cin>>n; if(n==11) { cout<<10<<"\n"; continue; } if(n<10) { if(n%2==0) cout<<n/2<<"\n"; else cout<<0<<"\n";