Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 0 KBi |
#2 |
Incorrecto
|
0.001 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Incorrecto
|
0.002 s | 0 KBi |
#6 |
Incorrecto
|
0.003 s | 0 KBi |
#7 |
Incorrecto
|
0.006 s | 0 KBi |
#8 |
Incorrecto
|
0.004 s | 0 KBi |
#9 |
Incorrecto
|
0.006 s | 0 KBi |
#10 |
Incorrecto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.004 s | 0 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#13 |
Incorrecto
|
0.002 s | 0 KBi |
#14 |
Correcto
|
0.002 s | 0 KBi |
#15 |
Correcto
|
0.005 s | 0 KBi |
#16 |
Correcto
|
0.002 s | 0 KBi |
#17 |
Correcto
|
0.002 s | 0 KBi |
#18 |
Correcto
|
0.007 s | 0 KBi |
#19 |
Correcto
|
0.001 s | 0 KBi |
#20 |
Correcto
|
0.001 s | 0 KBi |
#21 |
Correcto
|
0.003 s | 0 KBi |
#22 |
Correcto
|
0.006 s | 0 KBi |
#23 |
Correcto
|
0.002 s | 0 KBi |
#24 |
Incorrecto
|
0.002 s | 0 KBi |
#25 |
Incorrecto
|
0.003 s | 0 KBi |
#26 |
Incorrecto
|
0.002 s | 0 KBi |
#27 |
Incorrecto
|
0.002 s | 0 KBi |
#28 |
Incorrecto
|
0.002 s | 0 KBi |
#29 |
Incorrecto
|
0.003 s | 3 KBi |
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<n;i++) #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define lli unsigned long long int #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } const lli mod=(1e9)+7; const int N = 1e4+1; int main(){ fast_io; lli a,b; cin>>a; cin>>b; //cout<<a<<endl; //cout<<b<<endl; int steps = 0; int carry = 0; while(a>0 || b>0){ if((a&1)+(b&1)+carry >=2)carry = 1; a>>=1; b>>=1; steps++; } //cout<<steps<<endl; //cout<<carry<<endl; if(steps>64 && carry)cout<<"Overflow"<<endl; else cout<<"Safe"<<endl; return 0; }