OJ
EUSIA
像好色一样好学
展开
-
算法之路四:codeforces 71A
#include<cstdio>#include<iostream>#include<cstring>using namespace std;const int maxn=105;int main(){ int n; cin>>n; while(n--) { char word[maxn]; scanf("%s",word);原创 2017-02-11 15:03:24 · 597 阅读 · 0 评论 -
算法之路四:codeforces 4A
#include<cstdio>#include<iostream>using namespace std;int main(){ long long n,m,a; cin>>n>>m>>a; long long k,t; if(n%a==0) k=n/a; else k=n/a+1; if(m%a==0) t=m/a; else t=m原创 2017-01-28 11:14:27 · 395 阅读 · 0 评论 -
算法之路四:codeforces 1A
#include<cstdio>#include<iostream>using namespace std;int main(){ long long n,m,a; cin>>n>>m>>a; long long k,t; if(n%a==0) k=n/a; else k=n/a+1; if(m%a==0) t=m/a; else t=m原创 2017-01-28 11:05:44 · 374 阅读 · 0 评论 -
算法之路三:HDU OJ:2017
#include<cstdio>#include<cctype>#include<iostream>using namespace std;int main(){ int n=0; cin>>n; char b=getchar(); while(n--) { char c; int count=0; whi原创 2017-01-26 13:46:48 · 315 阅读 · 0 评论 -
算法之路三:HDU OJ:2016
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int maxn=105;void swap(int *a,int *b);int main(){ int a[maxn]={0}; int b[maxn]={0}; int n=0; while(scan原创 2017-01-26 13:20:47 · 453 阅读 · 0 评论 -
算法之路三:HDU OJ:2015
“`includeincludeusing namespace std;const int maxn=105;int main() { int a[maxn]={0}; int m,n; for(int i=1;i原创 2017-01-26 12:59:04 · 266 阅读 · 0 评论 -
算法之路三:HDU OJ:2014
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int maxn=105;int main(){ int a[maxn]={0}; int n=0; while(scanf("%d",&n)!=EOF&&n) { for(int i=0原创 2017-01-26 11:41:27 · 276 阅读 · 0 评论 -
算法之路三:HDU OJ:2013
#include<cstdio>#include<iostream>using namespace std;const int maxn=40;int main(){ int a[maxn]={0}; int n; while(cin>>n&&n) { a[n]=1; for(int i=n;i>=1;i--) a原创 2017-01-26 11:31:24 · 296 阅读 · 0 评论 -
算法之路三:HDU OJ:2012
#include<cstdio>#include<cmath>const int maxn=105;int is_sushu(int x);int main(){ int a[maxn]={0}; int m, n; for(int i=-39;i<=50;i++) if(is_sushu(i*i+i+41)) a[i+39]=1; while(scanf原创 2017-01-26 11:22:09 · 433 阅读 · 0 评论 -
算法之路三:HDU OJ:2010
#include<stdio.h>#define maxn 1005int is_flower(int a);int main(){ int a[maxn]={0}; for(int i=100;i<1000;i++) { if(is_flower(i)) a[i]=i; } int m,n; while(scanf("%d%d",原创 2017-01-25 14:13:29 · 338 阅读 · 0 评论 -
算法之路三:HDU OJ:2009
#include<stdio.h>#include<math.h>#define maxn 1005int main(){ int m,n; double a[maxn]; while(scanf("%d%d",&n,&m)!=EOF) { a[0]=double(n); double ans=a[0]; for(原创 2017-01-25 13:54:34 · 335 阅读 · 0 评论 -
算法之路三:HDU OJ:2008
#include<stdio.h>#define maxn 105int main(){ double a[maxn]; int n; while(scanf("%d",&n)==1&&n>0) { int count1=0,count2=0,count3=0; for(int i=0;i<n;i++) {原创 2017-01-25 13:45:40 · 262 阅读 · 0 评论 -
算法之路三:HUD OJ:2007
#include<stdio.h>#define maxn 100000int square(int a);int cube(int a);void swap(int *a,int*b);int main(){ int m; int n; int a[maxn]; while(scanf("%d%d",&m,&n)!=EOF) { if原创 2017-01-25 13:23:46 · 592 阅读 · 0 评论 -
算法之路三:HDU OJ:2003
#include<stdio.h>int main(){ double a; while(scanf("%lf",&a)!=EOF) { if(a<0) a=-a; printf("%.2lf\n",a); } } //f….float lf….double原创 2017-01-24 14:48:51 · 353 阅读 · 0 评论 -
算法之路三:HDU OJ:2006
#include<stdio.h>#define maxn 100000int main(){ int a[maxn]; int n; while(scanf("%d",&n)!=EOF&&n) { int ans=1; for(int i=0;i<n;i++) { scanf("%d",&a原创 2017-01-25 13:03:46 · 402 阅读 · 0 评论 -
算法之路三:HDU OJ:2004
#include<stdio.h>#define PI 3.1415927int main(){ double R; while(scanf("%lf",&R)!=EOF) { printf("%.3lf\n",PI*R*R*R*4/3.0); } }原创 2017-01-24 14:53:31 · 307 阅读 · 0 评论 -
算法之路三:HDU OJ:2000
#include<stdio.h>void swap(char*a,char*b){ char t; t=*a; *a=*b; *b=t; }int main(){ char a,b,c,d; while(scanf("%c%c%c%c",&a,&b,&c,&d)!=EOF) { if(a>b) swap(&a原创 2017-01-23 20:12:06 · 308 阅读 · 0 评论 -
Hdu:2020 绝对值排序
#include <iostream>#include <algorithm>using namespace std;int input[105];int ab[105];int temp[105];int index[105];int cmp(int a,int b){ return (a>b);}int main(){ int n; while(cin>>原创 2017-09-04 20:53:04 · 528 阅读 · 0 评论