Codeforces Round #567 (Div. 2) A.Chunga-Changa

原文链接：传送

 #include"algorithm"
 #include"iostream"
 #include"cmath"
 using namespace std;
 long long x,y,z,ans;
 int main(){
     while(cin>>x>>y>>z){
        ans=;
        long long s=,i=,j=;
        s=(x+y)/z;
        cout<<s<<" ";
        i=x%z;
        j=y%z;
     if((i+j)>=z){
         if(i>j) cout<<z-i<<endl;
         else cout<<z-j<<endl;
     }
     else {
         cout<<<<endl;
     }

     }
     return ;    

 }