codeforces 929 div3 A-C题

A:Problem - A - Codeforces

#include<iostream>
#include<cmath>
int a[10001];
using namespace std;
int main() {
	int n,sum=0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int n1;
		cin >> n1;
		while (n1--) {
			int t;
			cin >> t;
			sum += abs(t);
		}
		cout << sum << endl;
		sum = 0;
	}
}

B: Problem - B - Codeforces

#include <iostream>
using namespace std;
int main() {
   int n,n1,sum=0,flag[3]={0};
   cin>>n;
   for (int i=0;i<n;i++){
       cin>>n1;
       while(n1--){
           int t;
           scanf("%d",&t);
           sum+=t;
           if(t%3==2)flag[2]=1;
           if(t%3==1)flag[1]=1;
       }
       int d=0;
       if(sum%3==1&&flag[1]==1)d=1;
       if(sum%3==1&&flag[1]==0)d=2;
       if(sum%3==0)d=0;
       if(sum%3==2&&flag[2]==1)d=1;
       if(sum%3==2&&flag[2]==0)d=1;
       cout<<d<<endl;
       sum=0;flag[2]=0;flag[1]=0;
   }
    return 0;
}

 C:Problem - C - Codeforces

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

void solve() {
    int a, b, l;
    std::cin >> a >> b >> l;
    std::set<int> s;
    while (true) {
        int x = l;
        while (true) {
            s.insert(x);
            if (x % b != 0) {
                break;
            }
            x/= b;
        }
        if (l % a != 0) {
            break;
        }
        l /= a;
    }
    std::cout << s.size() << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    std::cin >> t;
    while (t--) {
        solve();

    }
    return 0;
}