LoginSignup
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 3 years have passed since last update.

@RubyLrving(ruby lrving)

AtCoder Beginner Contest 126~139 B問題埋め

Posted at

ラムダ式と複数要素のソートを勉強しているのは必須だと感じました。

B - Good Distance

解説の回答のが正しいと思います。

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n, d;
    cin >> n >> d;
    
    int x[10][10]={0};
    rep(i, n){
        rep(j, d){
            cin >> x[i][j];
        }
    }
    
    int res=0;
    for(int i=0; i<n-1; i++){
        for(int j=i+1; j<n; j++){
            double sum = 0.0f;
            rep(k, d){
                sum += pow(abs(x[i][k]-x[j][k]), 2);
            }
            
            sum = sqrt(sum);
            if(sum-(int)sum==0.0) res++;
        }
    }
    cout << res << endl;
     
    return 0;
}

B - Guidebook

AOJのITP2でtuple, get, ラムダ式を覚えていたので簡単にできました。

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n;
    cin >> n;
    
    vector<tuple<string, int, int>> vec(n);
    
    rep(i, n){
        string s;
        int p;
        cin >> s >> p;
        vec[i] = make_tuple(s, p, i+1);
    }
    sort(vec.begin(), vec.end(), []( const auto &x, const auto &y )
    {
        return get<0>( x ) == get<0>( y ) ? get<1>( x ) > get<1>( y ) : get<0>( x ) < get<0>( y );
    });
    
    rep(i, n){
        cout << get<2>(vec[i]) << endl;
    }
    
    return 0;
}

B - Power Socket

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fix(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int a, b;
    cin >> a >> b;
    
    int sum=1;
    int res=0;
    while(b>sum){
        sum += (a-1);
        res++;
    }
    cout << res << endl;

    return 0;
}

B - Resistors in Parallel

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>
 
# define rep(i,n) for(int i=0; i<(n); i++)
# define fix_setprec(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9
 
using namespace std;
using ll =long long;
using P = pair<int,int>;
 
int main() {
    int n;
    cin >> n;
    
    double sum=0.0f;
    rep(i, n){
        double a;
        cin >> a;
        sum += 1.0f/a;
    }
    cout << fix_setprec(10) << 1.0f/sum << endl;
 
    return 0;
}

B - One Clue

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int k, x;
    cin >> k >> x;
    
    for(int i=x-k+1; i<k+x; i++){
        cout << ' ' << i;
    }

    return 0;
}

B - 0 or 1 Swap

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n;
    cin >> n;
    int A[50]={0};
    int res=0;
    rep(i, n){
        cin >> A[i];
        if(A[i]!=i+1) res++;
    }
    
    if(res>2) cout << "NO" << endl;
    else cout << "YES" << endl;

    return 0;
}

B - Golden Apple

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n, d;
    cin >> n >> d;
    int res=0, pos=0;
    while(pos<n){
        pos=d+pos+1+d;
        res++;
    }
    cout << res << endl;
    return 0;
}

B - Ordinary Number

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n;
    cin >> n;
    int p[20]={0};
    rep(i, n){
        cin >> p[i];
    }
    int res=0;
    for(int i=1; i<n-1; i++){
        if(p[i-1]<p[i] && p[i]<p[i+1]) res++;
        if(p[i-1]>p[i] && p[i]>p[i+1]) res++;
    }
    cout << res << endl;
    return 0;
}

B - Bite Eating

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n, l;
    cin >> n >> l;
    
    int min_value=1e9+1;
    int value=0;
    for(int i=l; i<l+n; i++){
        if(abs(i)<abs(min_value)) min_value = i;
        value+=i;
    }
    cout << value-min_value << endl;
    
    return 0;
}

B - Bounding

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n, x;
    cin >> n >> x;
    
    int value=0;
    int res=1;
    for(int i=0; i<n; i++){
        int l;
        cin >> l;
        value+=l;
        if(value<=x) res++;
    }
    cout << res << endl;
    
    return 0;
}

B - Balance

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int n;
    cin >> n;
    
    int w[100]={0};
    int sum1_w=0;
    rep(i, n){
        cin >> w[i];
        sum1_w+=w[i];
    }
    
    int value=sum1_w;
    int sum2_w=0;
    for(int i=0; i<n-1; i++){
        sum1_w -= w[i];
        sum2_w += w[i];
        value = min(value, abs(sum1_w-sum2_w));
    }
    cout << value << endl;
    
    return 0;
}

B - Algae

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    int r, d, x2000;
    cin >> r >> d >> x2000;
    
    for(int i=1; i<=10; i++){
        x2000 = r * x2000 - d;
        cout << x2000 << endl;
    }
    
    return 0;
}

B - YYMM or MMYY

C++
# include<iostream>
# include<vector>
# include<algorithm>
# include<iomanip>
# include<utility>
# include<iomanip>
# include<map>
# include<queue>
# include<stack>
# include<cmath>
# include<cstdio>
# include<list>
# include<set>
# include<bitset>

# define rep(i,n) for(int i=0; i<(n); i++)
# define fixed_setprecision(n) fixed << setprecision((n))
# define pai 3.1415926535897932384
# define NUM_MAX 2e18
# define NUM_MIN -1e9

using namespace std;
using ll =long long;
using P = pair<int,int>;

int main() {
    string s;
    cin >> s;
    
    int front_value = atoi(s.substr(0, 2).c_str());
    int back_value = atoi(s.substr(2, 2).c_str());
    
    if(0<front_value && front_value<13){
        if(0<back_value && back_value<13){
            cout << "AMBIGUOUS" << endl;
        }else{
            cout << "MMYY" << endl;
        }
    }else{
        if(0<back_value && back_value<13){
            cout << "YYMM" << endl;
        }else{
            cout << "NA" << endl;
        }
    }
    
    return 0;
}
0
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
Sign upLogin
0
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?