View Code of Problem 1085

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<deque>
#include<list>
using namespace std;
int main()
{
    int n,s=0,i,j,count=0;
    while(scanf("%d",&n)!=EOF)
    {
        s=0;
        if(n==0)
        break;
        else
        {
            int k=0,m=1;
            count=0;
            for(i=1;i<=n;i++)
            {
                k++;
                count+=k;
                if(count>n)
                k=n-count+k;
                for(j=1;j<=k;j++)
                {
                    s+=m;i++;
                }
                m++;i--;
            }
            printf("%d %d\n",n,s);
        }
    }
    return 0;
}

Double click to view unformatted code.


Back to problem 1085