Skip to content

Instantly share code, notes, and snippets.

@ititorit
Created September 30, 2016 15:48
Show Gist options
  • Save ititorit/7c8cd11634f3beed2612e232de7247c2 to your computer and use it in GitHub Desktop.
Save ititorit/7c8cd11634f3beed2612e232de7247c2 to your computer and use it in GitHub Desktop.
PTIT135J SPOJ
// contest: http://www.spoj.com/PTIT/problems/PTIT135J/
// author : Nguyen Minh Tuan (ititorit)
// lang : C/C++
#include <bits/stdc++.h>
#define _for(i,a,b) for(int i=(a),_b_=(b),_d_=(a<b?1:-1);i!=_b_;i+=_d_)
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define FORD(i,a,b) for(int i = a; i >= b; i--)
#define _it(i,v) for (typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define _all(v) v.begin(), v.end()
#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define sqr(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("INPUT.inp", "r", stdin);
#endif
// solution starts...
float N,L,M;
int test,ans;
cin >> test;
while(test--) {
cin >> N >> L >> M;
ans=0;
while(N<M) {
ans++;
N += (N*L)/100;
}
cout << ans << '\n';
}
// solution ends...
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment