Go ashore_17

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

#include<iostream>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    if(a>b)
    {
        if(a>c) cout<<a;
        else cout<<c;
    }
    else
    {
        if(b>c) cout<<b;
        else cout<<c;
    }
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int m,n,tmp,max,min;cin>>m>>n;
    m = abs(m);
    n = abs(n);
    if(m>n)
    {
        max = m;
        min = n;
    }
    else
    {
        max = n;
        min = m;
    }
    while(max%min!=0)
    {
        tmp = max%min;
        max = min;
        min = tmp;
    }
    max = m*n/min;
    cout<<min<<" "<<max;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

#include<iostream>
#include<cmath> 
using namespace std;
int main()
{
    int a,b,tmp,i,j;
    cin>>a>>b;
    if(a>b)
    {
        tmp = a;
        a = b;
        b = tmp;
    }
    if(a==1) a+=1;
    for(i = a;i <= b;i ++ )
    {
        for(j = 2;j <= sqrt(i);j++)
            if(i%j==0) break;
        if(j>sqrt(i)) cout<<i<<" ";
    }
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17

#include<iostream>
using namespace std;
int main()
{
    int n,tmp;cin>>n;
    double sum = 0,e = 1,q = 2;
    for(int i = 1;i <= n;i ++ )
    {
        sum+=q/e;
        cout<<q<<'/'<<e<<" ";
        tmp = q;
        q+=e;
        e = tmp;
    }
    cout<<sum;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19

#include<iostream>
using namespace std;
int MyStrlen(char *str)
{
    int sum = 0;
    for(int i = 0;*(str+i)!='\0';i++)
    {
        if(*(str+i)>='a'&&*(str+i)<='z'||*(str+i)>='A'&&*(str+i)<='Z')
            sum++;
    }
    return sum;
}
int main()
{
    string str;
    cin>>str;
    cout<<MyStrlen(&str[0]);
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

#include<iostream>
using namespace std;
void daoxv(char str[],int num)
{
    cout<<str[num-1]<<" ";
    num--;
    if(num!=0) daoxv(str,num);
}
int main()
{
    char str[100],ch;
    int n = 0;
    while((ch = getchar())!='.')
        str[n++] = ch;
    str[n] = '\0';
    daoxv(str,n);
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

#include<iostream>
using namespace std;
int days(int a,int b,int c)
{
    int day = 0;
    switch(b-1)
    {
        case 12:day += 31;   
        case 11:day += 30;
        case 10:day += 31;
        case 9:day += 30;
        case 8:day += 31;
        case 7:day += 31;
        case 6:day += 30;
        case 5:day += 31;
        case 4:day += 30;
        case 3:day += 31;
        case 2:day += 30;
        case 1:day += 31;break;
    }
    day+=c;
    if(a%400==0||a%4==0&&a%100!=0)
        if(b>2) day++;
    return day;
}
int main()
{
    int a,b,c,x,y,z,day1,day2,res;
    cin>>a>>b>>c;
    cin>>x>>y>>z;
    day1 = days(a,b,c);
    day2 = days(x,y,z);
    cout<<"day1 = "<<day1<<" day2 = "<<day2<<endl;
    if(a==x)
        res = day2-day1;
    else
    {
        res = (365-day1)+day2+365*(x-a-1);
        for(a;a<x;a++)
            if(a%400==0||a%4==0&&a%100!=0)
                res++;
    }
    res++;
    cout<<"共离开了："<<res;
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

#include<iostream>
using namespace std;
int main()
{
    int a[100],b[100],c[100],tmp;
    int an,bn;cin>>an>>bn;
    for(int i = 0;i < an;i ++ )
    {
        cin>>a[i];
        c[i] = a[i];
    }
    for(int i = 0;i < bn;i ++ )
    {
        cin>>b[i];
        c[an+i] = b[i];
    }
    for(int i = 0;i < an+bn;i ++ )
        for(int j = 0;j < an+bn-i-1;j ++ )
        {
            if(c[j]>c[j+1])
            {
                tmp = c[j];
                c[j] = c[j+1];
                c[j+1] = tmp;
            }
        }
    for(int i = 0;i < an+bn;i ++ )
        cout<<c[i]<<" ";
    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#include<iostream>
using namespace std;
int main()
{
    bool a[100] = {0};
    int n,i,k,s = 0,cnt = 0;
    cin>>n>>i>>k;
    do
    {
        if(i>n) i = 1;
        if(!a[i]) s++;
        if(s==k)
        {
            cout<<i<<" ";
            s = 0;
            a[i] = 1;
            cnt++;
        }
        i++;
    }
    while(cnt!=n);
    return 0;
}