https://blog.youkuaiyun.com/fackerbangzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/fackerbang/article/details/77165140https://blog.youkuaiyun.com/fackerbang/article/details/77165140fackerbangMon, 14 Aug 2017 18:44:12 +0800 #include using namespace std; int main() { double x1,x2,x3,x4,y1,y2,y3,y4,temp; while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4) {]]>https://blog.youkuaiyun.com/fackerbang/article/details/77151905https://blog.youkuaiyun.com/fackerbang/article/details/77151905fackerbangMon, 14 Aug 2017 00:59:47 +0800 #include using namespace std; int main() { char ch[100]; bool flag=0; char f; while(gets(ch)) { int len=strlen(ch); f=ch]]>https://blog.youkuaiyun.com/fackerbang/article/details/77151733https://blog.youkuaiyun.com/fackerbang/article/details/77151733fackerbangMon, 14 Aug 2017 00:06:09 +0800https://blog.youkuaiyun.com/fackerbang/article/details/77149585https://blog.youkuaiyun.com/fackerbang/article/details/77149585fackerbangSun, 13 Aug 2017 20:13:58 +0800 #include using namespace std; int main() { int a[50][50]; int i,j,n,m,t,x,y; while(cin>>n>>m) { if(n==0&&m==0) continue;]]>https://blog.youkuaiyun.com/fackerbang/article/details/77149080https://blog.youkuaiyun.com/fackerbang/article/details/77149080fackerbangSun, 13 Aug 2017 19:23:44 +0800 #include using namespace std; int main() { int a[100]; int i,j,n,t; while(cin>>n&&n!=0) { for(i=0;ihttps://blog.youkuaiyun.com/fackerbang/article/details/77145518https://blog.youkuaiyun.com/fackerbang/article/details/77145518fackerbangSun, 13 Aug 2017 15:44:35 +0800 #include using namespace std; char str[10]; int n, dot; int res[999999], a[999999], b[999999]; int len, lena, lenb; void mul() { int i, j;]]>https://blog.youkuaiyun.com/fackerbang/article/details/77132449https://blog.youkuaiyun.com/fackerbang/article/details/77132449fackerbangSun, 13 Aug 2017 02:01:52 +0800 using namespace std; int main() { int n,s[100],i,sum; while(cin>>n&&n!=0) { s[0]=s[1]=s[2]=0; s[3]=1; for(i=1;ihttps://blog.youkuaiyun.com/fackerbang/article/details/77132417https://blog.youkuaiyun.com/fackerbang/article/details/77132417fackerbangSun, 13 Aug 2017 01:38:37 +0800 #include using namespace std; int main() { int n,len; cin>>n; string str; while(n--) { int num=0; cin>>str; len=str.si]]>https://blog.youkuaiyun.com/fackerbang/article/details/77132185https://blog.youkuaiyun.com/fackerbang/article/details/77132185fackerbangSun, 13 Aug 2017 00:15:47 +0800 using namespace std; int cmd(int n) { for(int i=2;i*ihttps://blog.youkuaiyun.com/fackerbang/article/details/77127066https://blog.youkuaiyun.com/fackerbang/article/details/77127066fackerbangSat, 12 Aug 2017 19:08:44 +0800 using namespace std; int main() { char str1,str2,str3; while(cin>>str1>>str2>>str3) { if(str1>str2&&str2>str3) { cout<https://blog.youkuaiyun.com/fackerbang/article/details/77126946https://blog.youkuaiyun.com/fackerbang/article/details/77126946fackerbangSat, 12 Aug 2017 18:48:42 +0800 #include using namespace std; int main() { int u; double n,Q,e,f,g; double ans1,ans2; cin>>u; while (u--) {]]>https://blog.youkuaiyun.com/fackerbang/article/details/77113627https://blog.youkuaiyun.com/fackerbang/article/details/77113627fackerbangSat, 12 Aug 2017 12:20:47 +0800 using namespace std; int i=0; int ans[50]; int cmp(long long c,int m) { if(c!=0) { ans[i]=c%m; c/=m; i++; return cmp(c,m);]]>https://blog.youkuaiyun.com/fackerbang/article/details/77113213https://blog.youkuaiyun.com/fackerbang/article/details/77113213fackerbangSat, 12 Aug 2017 11:26:49 +0800 #include #include #include #define maxn 100005 using namespace std; st]]>https://blog.youkuaiyun.com/fackerbang/article/details/77112974https://blog.youkuaiyun.com/fackerbang/article/details/77112974fackerbangSat, 12 Aug 2017 11:05:12 +0800 #include using namespace std; int x[100000], y[100000]; int main() { int i=0; while((cin>>x[i]>>y[i])&&(x[i]||y[i])) { i++]]>https://blog.youkuaiyun.com/fackerbang/article/details/77103160https://blog.youkuaiyun.com/fackerbang/article/details/77103160fackerbangFri, 11 Aug 2017 20:59:31 +0800 #include using namespace std; const int N = 2000; const int MOD = 1007; int c[N+1][N+1]; void initc() { c[0][0] = 1; for(int i=1;]]>https://blog.youkuaiyun.com/fackerbang/article/details/77102783https://blog.youkuaiyun.com/fackerbang/article/details/77102783fackerbangFri, 11 Aug 2017 20:17:08 +0800 #include #include using namespace std; struct person { double x; double y; double angle; }per[101]]]>https://blog.youkuaiyun.com/fackerbang/article/details/77102015https://blog.youkuaiyun.com/fackerbang/article/details/77102015fackerbangFri, 11 Aug 2017 18:29:39 +0800>hex>>a>>b; cin>>oct>>a>>b; 输出与之类似 #include using namespace std; int main() { int a,b; while(cin>>]]>https://blog.youkuaiyun.com/fackerbang/article/details/77100982https://blog.youkuaiyun.com/fackerbang/article/details/77100982fackerbangFri, 11 Aug 2017 17:16:22 +0800 #include using namespace std; long long a,b,c,d; long long num[107]; int main ( ) { while (cin>>a) { memset( num,0,sizeof(nu]]>https://blog.youkuaiyun.com/fackerbang/article/details/77018874https://blog.youkuaiyun.com/fackerbang/article/details/77018874fackerbangThu, 10 Aug 2017 01:22:11 +0800 #include int main() { int n, k, f[51][27], i, j; char str1[31], str2[31]; scanf("%d", &n); while (n--) { scanf("%s%s%d", str1]]>https://blog.youkuaiyun.com/fackerbang/article/details/77012231https://blog.youkuaiyun.com/fackerbang/article/details/77012231fackerbangWed, 09 Aug 2017 19:33:43 +0800 #include using namespace std; int main() { int n,m;//n种花,m元钱 while(cin>>n>>m) { int a[n],b[n],i,sum=0; for(int]]>