/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 344.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 1ms 488.0 KiB
#9 Accepted 1ms 320.0 KiB
#10 Accepted 1ms 532.0 KiB
#11 Accepted 1ms 532.0 KiB
#12 Accepted 1ms 328.0 KiB
#13 Accepted 1ms 764.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
//Speed
#define Code ios_base::sync_with_stdio(false);
#define By cin.tie(NULL);
#define Shoriful cout.tie(NULL);
template<typename T>  istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;   return is;}
template<typename T>  ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
#define ff first
#define ss second

#define pb push_back
#define mp make_pair
#define sz size()

#define all(v) v.begin(),v.end()
#define rall(v) v.end(),v.begin()

#define fl(i,n) for(int i=0;i<n;i++)
#define rl(i,m,n) for(int i=n;i>=m;i--)


#define py cout<<"YES\n";
#define pn cout<<"NO\n";

#define nl  '\n' ;

typedef long long ll ;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef pair<int,int> pi;
typedef map<int,int> mi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<set<int>> vset ;
typedef map<ll,ll> mll;

 
//code here 

void solve(){
         
         
         int a ,  b , c ; cin >> a >> b >> c ; 
         
         cout<<(120-a)<<' '<<(120-b)<<' '<<(120-c)<<nl;
   
}

int main()
{
        
        Code By Shoriful
      ll t=1 ;
     // ll t ;   cin >> t ; 
      
      fl(i,t){
              solve() ;
              
      }

    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:57:41
Judged At
2025-01-02 14:57:41
Judged By
Score
100
Total Time
1ms
Peak Memory
764.0 KiB