#include <iostream> #include <vector> class SendingCards{ public: int howMany(std::vector <std::string> f) { int cnt=0; for(int i=0; i<f.size(); i++) for(int j=0; j<f[i].length(); j++) if(f[i][j]=='Y' && f[j][i]=='N') cnt++; return cnt; } };
#include <iostream> #include <algorithm> #include <cstring> using namespace std; class CardsShuffle { public: string shuffle(string c, int f, int l, int t) { std::rotate(c.begin(), c.begin() + ((f-1)*t % l), c.begin() + l); return c; } };
#include <iostream> #include <cstring> class CardsShuffle{ public: std::string shuffle(std::string c, int f, int l, int t) { std::string s; while(t--) s=c.substr(f-1, l-(f-1)), s+=c.substr(0, f-1), s+=c.substr(l), c=s; return s; } };
#include <iostream> #include <vector> class Pawns{ public: int pawnsAttack(std::vector <std::string> p) { int a[8][8]={0}, b[8][8]={0}, cnt=0; for(int i=0; i<p.size(); i++) a[8-(p[i][1]-'0')][p[i][0]-'a']++; for(int i=1; i<8; i++) for(int j=0; j<8; j++) if(a[i][j]) { if(j==0) { if(!a[i-1][j+1] && !b[i-1][j+1]) cnt++, b[i-1][j+1]++; } else if(j==7) { if(!a[i-1][j-1] && !b[i-1][j-1]) cnt++, b[i-1][j-1]++; } else { if(!a[i-1][j-1] && !b[i-1][j-1]) cnt++, b[i-1][j-1]++; if(!a[i-1][j+1] && !b[i-1][j+1]) cnt++, b[i-1][j+1]++; } } return cnt; } };
#include <iostream> #include <climits> class SolvingEquation{ public: int solve(int a, int b, int c, int w) { int mi=INT_MAX, flag=0; for(int i=0; i<=100; ++i) for(int j=0; j<=100; ++j) for(int k=0; k<=100; ++k) { if(a*i + b*j + c*k == w && i+j+k<mi) mi=i+j+k, flag=1; } if(flag==1) return mi; else return -1; } };
#include <iostream> #include <vector> class YoungBrother{ public: std::vector <std::string> restoreWords(std::vector <std::string> l, int n, int k) { std::string s=""; std::vector <std::string> ans; for(int i=0; i<l.size(); i++) s+=l[i]; for(int i=0, j=0; i<n; i++, j+=k) ans.push_back(s.substr(j, k)); return ans; } };
#include <iostream> #include <cstdio> #include <cstring> using namespace std; int main() { int n, cnt=0, idx, b=0; char s[15], a[15][15]={"vaporeon","jolteon","flareon","espeon","umbreon","leafeon","glaceon","sylveon"}; scanf("%d", &n); scanf("%s", s); for(int i=0; i<n; i++) if(s[i]!='.') b++; for(int i=0; i<8; i++) if(strlen(a[i])==n) { for(int j=0; j<n; j++) if(a[i][j]==s[j] && s[j]!='.') cnt++; if(cnt==b) {idx=i; break;} cnt=0; } printf("%s", a[idx]); return 0; }
//http://ideone.com/vNEv5A //169445 #include <iostream> #include <cstdio> using namespace std; int n, adj[105][105]={0}, c[105], a; bool dfs(int v, int col) { if(c[v]!=-1 && c[v]==col) return true; else if(c[v]!=-1 && c[v]!=col) return false; c[v]=col; for(int i=0; i<n; i++) if(adj[v][i] && !dfs(i, 1-col)) return false; return true; } int main() { scanf("%d", &n); for(int i=0; i<n; i++) while(true) { scanf("%d", &a); if(a==0) break; adj[i][a-1]=adj[a-1][i]=1; } for(int i=0; i<105; i++) c[i]=-1; if(dfs(0, 0)==true) for(int i=0; i<n; i++) printf("%d", c[i]); else printf("-1"); return 0; }
#include <iostream> #include <cstdio> using namespace std; int main() { int adj[105][105]={0}, b[105]={0}, g[105]={0}, f, cnt, flag=0, n; scanf("%d", &n); for(int i=0; i<n; i++) { cnt=0; while(true) { scanf("%d", &f); if(f==0 && cnt==0) {flag=1; break;} else if(f==0) break; adj[i][f-1]=1, cnt++; } } cnt=0; for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { if(adj[i][j]==1 && b[j]==0) { b[i]=b[j]=1; if(g[i]==1) g[j]=2; else g[j]=1, cnt++; } } } if(flag==1) printf("0"); else { printf("%d\n", cnt); for(int i=0; i<n; i++) if(g[i]==1) printf("%d ", i+1); } return 0; }
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int gcd(int u, int v) { if(u==v) return u; if(v==0) return u; if(u==0) return v; if(~u&1) { if(v&1) return gcd(u>>1, v); return gcd(u>>1, v>>1)<<1; } if(~v&1) return gcd(u, v>>1); if(u>v) return gcd((u-v)>>1, v); return gcd((v-u)>>1, u); } int main() { int t, a, b, c; scanf("%d", &t); while(t--) { scanf("%d%d%d", &a, &b, &c); if(c%gcd(a, b)==0 && c<=max(a, b)) printf("YES\n"); else printf("NO\n"); } return 0; }
#include <iostream> #include <cstdio> using namespace std; int main() { int n, d, x[100005]; long long int ans=0; scanf("%d%d", &n, &d); for(int i=0; i<n; i++) scanf("%d", x+i); for(int i=0, j=0; i<n; i++) { while(x[i]-x[j]>d) j++; ans+=(long long)(i-j)*(i-j-1)/2; } printf("%I64d", ans); }
#include <iostream> #include <cstdio> #include <algorithm> #include <map> using namespace std; int main() { int n, d, x[100005], it; long long int cnt1, cnt2, tmp=-1, ans=0, ma=0, mi=0, dif=0; const int con=1e9+1; map <int, int> m; scanf("%d%d", &n, &d); for(int i=0; i<n; i++) scanf("%d", &x[i]); for(int i=1; i<n; i++) for(int j=x[i-1]; j<x[i]; j++) m[j]=i; m[x[n-1]]=n; for(int i=0; i<n; i++) { if(x[i]+d>=x[n-1]) it=x[n-1]; else it=x[i]+d; dif=m[it]-m[x[i]]+1; if(dif>=3) { if(m[it]==tmp) continue; cnt1=1, cnt2=1; for(int j=1; j<=dif; j++) cnt1*=j; for(int j=1; j<=dif-3; j++) cnt2*=j; ans+=cnt1/(cnt2*6); tmp=m[it]; } } printf("%I64d", ans); return 0; }note: if you give right AC approach similar to my WA approach, that would be appreciated
