|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 |
#include #include using namespace std; long long int findPrime(long long int temp) { while (temp % 2 == 0) temp /= 2; if (temp == 1) return 2; long long int i; for (i = 3;i <= sqrt(temp);i += 2) { if (temp%i == 0) { temp /= i; i = 1; } } if (temp > 2) { return temp; } else return i - 2; } int main() { int T; scanf("%d", &T); while (T--) { long long int N; scanf("%lld", &N); long long int biggest = findPrime(N); printf("%lld\n", biggest); } return 0; } |
[ProjectEuler+] #2: Even Fibonacci numbers
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
#include using namespace std; int main() { int T; scanf("%d", &T); while (T--) { long long N, a = 1, b = 2, next = 3, temp1 = 0, temp2 = 0, output=2; scanf("%lld", &N); while (true) { temp1 = next; temp2 = b; next += b; a = temp2; b = temp1; if (next > N) break; if (next % 2 == 0) output += next; } printf("%lld\n", output); } return 0; } |
[ProjectEuler+] #1: Multiples of 3 and 5
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
#include <iostream> using namespace std; int main() { long int T, i, N; unsigned long long p, sum; scanf("%ld", &T); for (i = 0; i < T; i++) { scanf("%ld\n", &N); sum = 0; p = (N - 1) / 3; sum = ((3 * p*(p + 1)) / 2); p = (N - 1) / 5; sum = sum + ((5 * p*(p + 1)) / 2); p = (N - 1) / 15; sum = sum - ((15 * p*(p + 1)) / 2); printf("%lld\n", sum); } return 0; } |
[Android] Spinner
|
1 2 3 4 5 6 7 8 9 |
// start ArrayAdapter<CharSequence> adapter; //body spinnerId = (Spinner) findViewById(R.id.spinnerId); adapter = ArrayAdapter.createFromResource(this, R.array.arrName, android.R.layout.simple_spinner_item); adapter.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item); spinnerId.setAdapter(adapter); spinnerId.setEnabled(true); |
[Android] Saving data – SharedPreferences
SharedPreferences is a pure String file stored in the application folder, it is used to…