刷題記錄
A | CodeForces 1506A | Strange Table |
#include<iostream>
using namespace std;
int main()
{
long long r, c,n,t;
cin >> t;
long long ans = 0;
while (t--)
{
cin>> r >> c >> n;
if ((n % r )!= 0)
{
ans = (n % r - 1) * c + (n / r + 1);
cout << ans <<endl;
}
else if ((n %r) == 0)
{
ans = (r - 1) * c + n / r;
cout << ans <<endl;
}
else
{
printf("error");
}
}
B | CodeForces 1538B | Friends and Candies |
#include <bits/stdc++.h>
using namespace std;
int t,n,a[200010],cnt;
int ans;
int main(){
cin>>t;
while(t--){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
ans+=a[i];
}
if(ans%n!=0){
cout<<-1<<endl;
}
else{
ans/=n;
for(int i=1;i<=n;i++){
if(ans<a[i]){
cnt++;
}
}
cout<<cnt<<endl;
}
cnt=0;
ans=0;
}
return 0;
}