/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 1ms 488.0 KiB
#3 Accepted 1ms 432.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 1ms 332.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 540.0 KiB
#8 Accepted 2ms 480.0 KiB
#9 Accepted 1ms 540.0 KiB
#10 Accepted 2ms 536.0 KiB
#11 Accepted 2ms 520.0 KiB
#12 Accepted 1ms 396.0 KiB
#13 Accepted 1ms 512.0 KiB

Code

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

#define ll long long

int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1};
int dy2[] = {0, 0, 1, -1, 1, 1, -1, -1};
int knightX[] = {-2, -2, 2, 2, 1, 1, -1, -1};
int knightY[] = {-1, 1, -1, 1, -2, 2, -2, 2};

const ll INF = 0x3f3f3f3f;
const int N = 1e6 + 5, K = 105;
const ll MOD = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        int a , b , c;
        cin >> a >> b >> c;
        cout << 120 - a << " " << 120 - b << " " << 120 - c ; 
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1130 Angle Equalizer
Contest
Happy New Year 2025
Language
C++17 (G++ 13.2.0)
Submit At
2025-01-02 14:33:58
Judged At
2025-01-02 14:33:58
Judged By
Score
100
Total Time
2ms
Peak Memory
540.0 KiB