A
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int sum=0;
for (int i = 1; i <= n; i++) {
if (i < n && a[i] == a[i + 1]) continue;
sum++;
}
cout<<sum<<endl;
for (int i = 1; i <= n; i++) {
if (i < n && a[i] == a[i + 1]) continue;
cout<<a[i]<<" ";
}
return 0;
}
B
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,sum=0,ans=0;
cin>>n;
for(int i=1;i<=n;i++){
int a,b;
cin>>a>>b;
sum+=a+b-8;
ans+=sum;
}
cout<<ans<<endl;
return 0;
}
C
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 1, sum = 0;
cin >> n;
while (n > k) {
sum += k * k;
n -= k;
k++;
}
sum += n * k;
cout << sum << endl;
return 0;
}
D
#include <bits/stdc++.h>
using namespace std;
int main()
{
int l,r ,sum=0;
cin>>l>>r;
for(int i=l;i<=r;i++){
int k=i;
while(k){
if(k%10==2) sum++;
k/=10;
}
}
cout<<sum<<endl;
return 0;
}
E
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[11];
bool book[11];
int tail;
void solve(){
if(tail==9){
int x = a[0] * 100 + a[1] * 10 + a[2];
int y = a[3] * 100 + a[4] * 10 + a[5];
int z = a[6] * 100 + a[7] * 10 + a[8];
if (x * 2 == y && x * 3 == z) {
cout << x << " " << y << " " << z << endl;
}
}
for(int i=1;i<10;i++){
if(!book[i]){
book[i]=true;
a[tail++]=i;
solve();
tail--;
book[i]=false;
}
}
}
int main() {
for(int i=0;i<9;i++){
a[i]=i+1;
}
solve();
return 0;
}
F
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[13];
int ans=0,sum=0;
for(int i=1;i<=12;i++){
cin>>a[i];
}
for(int i=1;i<=12;i++){
sum+=300;
sum-=a[i];
if(sum<0){
cout<<"-"<<i<<endl;
return 0;
}
ans+=sum/100;
sum%=100;
}
ans*=120;
ans+=sum;
cout<<ans<<endl;
return 0;
}