Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
silnia
#include <iostream> using namespace std; int sil(int x,int y) { if (0<=x && x<y) { return 1; } return x*sil(x-y,y); } int main() { int ile, a, b; cin>>ile; for(int i=0; i<ile; i++) { cin>>a>>b; cout<<sil(a,b)<<endl; } }
run
|
edit
|
history
|
help
0
char array in class
Calc
Sort an array of 0s, 1s and 2s
Using copy_n
prime factorization trial division
FindMissingLagrange
VecCrossProd
Top view of a Binary tree
VirtualRestoPoint
Proyecto 1