Diagonal
include <bits/stdc++.h>
using namespace std; int main(){ long long n; long long k=4; long long a[100001]; long long f=0; while(cin >> n && n!=0){ while(1){ if((k*(k-3))/2>=n){ a[f]=k; f++; k=4; break; } k++; } } long long q=1; for(long long i=0 ;i<f ;i++){ cout << "Case " << q << ": "; cout << a[i] << endl; q++; } }
include <bits/stdc++.h>
using namespace std;
int main() { long n=10000000 , k; long x[n]; long i = 0 ; double a; long st; while(1){ cin>>x[i]; if(x[i]==0){ k = i ; for(i=0;i<k;i++){ a = ( 3 + sqrt(9 + 8 * x[i]) )/2; st = ceil(a); cout<<"Case "<<i+1<<": "<<st<<endl; } //cout<<k; break; } i++;
}
return 0;
}