Codeforces Round 929 (Div. 3) ( 4 / 7 )

A  Turtle Puzzle: Rearrange and Negate

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n,sum=0,x;
    cin>>n;
    for(int i=0;i<n;i++)cin>>x,sum+=abs(x);
    cout<<sum<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

B   Turtle Math: Fast Three Task

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n;
    cin>>n;
    vector<int>a(n);
    int sum=0;
    for(int i=0;i<n;i++)cin>>a[i],sum+=a[i];
    int k=sum%3;
    if(k==0)cout<<0<<endl;
    else if(k==2)cout<<1<<endl;
    else{
        for(int i=0;i<n;i++)
            if((sum-a[i])%3==0){cout<<1<<endl;return ;}
        cout<<2<<endl;
    }

}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

C  Turtle Fingers: Count the Values of k

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int a,b,l;
    cin>>a>>b>>l;
    set<int>s;
    for(int i=1;i<=l;i*=a){
        for(int j=1;j*i<=l;j*=b){
            if(l%(i*j)==0)s.insert(l/i/j);
        }
    }
    cout<<s.size()<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

D  Turtle Tenacity: Continual Mods

#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
void solve(){
    int n;
    cin>>n;
    int g,cnt=0;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i],g=i==0?a[0]:gcd(g,a[i]);
    for(int i=0;i<n;i++){
        a[i]/=g;
        if(a[i]==1)cnt++;
    }
    if(cnt>=2)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}