8 solutions

  • 1
    @ 2025-3-25 18:05:53

    #include<bits/stdc++.h> using namespace std; int main() { int a,b,c,d,e,f,g,h; double i; cin>>a>>b>>c>>d; a=a60; c=c60; e=a+b; f=c+d; g=f-e; h=g/60; i=g%60; cout<<h<<" "<<i; return 0; }

    • 0
      @ 2026-6-26 19:39:52
      #include<bits/stdc++.h>
      using namespace std;
      int main(){
          int a,b,c,d;cin>>a>>b>>c>>d;
          int x=(c*60+d)-(a*60+b);
          cout<<x/60<<' '<<x%60;
      }
      • -1
        @ 2025-12-24 17:17:49

        #include <bits/stdc++.h> using namespace std; int a,b,c,d,e,f; int main() { cin>> a>> b>> c>> d; e = c - a; if(b<=d){ f = d - b; }else{ e--; f = 60 - (b - d); } cout<< e<< ' '<< f; return 0; }

        • -1
          @ 2025-12-23 17:45:50

          #include <bits/stdc++.h> #define int long long using namespace std; int n[100],n2,n3; signed main(){ for(int i=1;i<=4;i++){ cin>>n[i]; if(i%2!=0) n[i]*=60; } n2=n[1]+n[2],n3=n[3]+n[4]; n2=n3-n2,n3=n2/60,n2=n2%60; cout<<n3<<" "<<n2<<"\n"; return 0; }

          • -1
            @ 2025-12-2 17:24:09

            #include<bits/stdc++.h> using namespace std; int main(){ int a,b,c,d,e,f,g,h; double i; cin>>a>>b>>c>>d; a=a60; c=c60; e=a+b; f=c+d; g=f-e; h=g/60; i=g%60; cout<<h<<" "<<i; return 0; }

            • -3
              @ 2025-3-28 17:15:30
              #include <bits/stdc++.h>
              #define int long long 
              using namespace std;
              int n[100],n2,n3;
              signed main(){ 
              	for(int i=1;i<=4;i++){
              		cin>>n[i];
              		if(i%2!=0) n[i]*=60;
              	}
              	n2=n[1]+n[2],n3=n[3]+n[4];
              	n2=n3-n2,n3=n2/60,n2=n2%60;
              	cout<<n3<<" "<<n2<<"\n";
              	return 0;
              }
              
              
            • -4
              @ 2025-3-25 18:09:04

              #include<bits/stdc++.h> using namespace std; int main(){ int a,b,c,d,e,f,g,h; double i; cin>>a>>b>>c>>d; a=a60; c=c60; e=a+b; f=c+d; g=f-e; h=g/60; i=g%60; cout<<h<<" "<<i; return 0; }

              • -6
                @ 2025-4-29 18:12:54

                好样的!你已经做到这样的题了,相信我,你能自己做出来的!!!

                • 1

                Information

                ID
                1329
                Time
                1000ms
                Memory
                256MiB
                Difficulty
                4
                Tags
                # Submissions
                187
                Accepted
                80
                Uploaded By